no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Accurate and precise aggregation counting
|
Preparata, Franco P. |
|
2012 |
78 |
1 |
p. 192-197 6 p. |
article |
2 |
A 2k kernel for the cluster editing problem
|
Chen, Jianer |
|
2012 |
78 |
1 |
p. 211-220 10 p. |
article |
3 |
An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
|
Armando, Alessandro |
|
2012 |
78 |
1 |
p. 119-141 23 p. |
article |
4 |
A new efficient indexing algorithm for one-dimensional real scaled patterns
|
Peng, Yung-Hsing |
|
2012 |
78 |
1 |
p. 273-278 6 p. |
article |
5 |
An improved two-party identity-based authenticated key agreement protocol using pairings
|
Hölbl, Marko |
|
2012 |
78 |
1 |
p. 142-150 9 p. |
article |
6 |
A three-string approach to the closest string problem
|
Chen, Zhi-Zhong |
|
2012 |
78 |
1 |
p. 164-178 15 p. |
article |
7 |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
|
Gaspers, Serge |
|
2012 |
78 |
1 |
p. 305-335 31 p. |
article |
8 |
Computing optimal outcomes under an expressive representation of settings with externalities
|
Conitzer, Vincent |
|
2012 |
78 |
1 |
p. 2-14 13 p. |
article |
9 |
Conjunctive query answering in the description logic SH using knots
|
Eiter, Thomas |
|
2012 |
78 |
1 |
p. 47-85 39 p. |
article |
10 |
Contents
|
|
|
2012 |
78 |
1 |
p. OBC- 1 p. |
article |
11 |
Editing graphs to satisfy degree constraints: A parameterized approach
|
Mathieson, Luke |
|
2012 |
78 |
1 |
p. 179-191 13 p. |
article |
12 |
Editorial Board
|
|
|
2012 |
78 |
1 |
p. IFC- 1 p. |
article |
13 |
Editorʼs foreword
|
Palopoli, Luigi |
|
2012 |
78 |
1 |
p. 1- 1 p. |
article |
14 |
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
|
Gutin, Gregory |
|
2012 |
78 |
1 |
p. 151-163 13 p. |
article |
15 |
Generic local computation
|
Kohlas, Jürg |
|
2012 |
78 |
1 |
p. 348-369 22 p. |
article |
16 |
Improved approximation algorithms for Directed Steiner Forest
|
Feldman, Moran |
|
2012 |
78 |
1 |
p. 279-292 14 p. |
article |
17 |
Learning finite cover automata from queries
|
Ipate, Florentin |
|
2012 |
78 |
1 |
p. 221-244 24 p. |
article |
18 |
Maintaining awareness using policies; Enabling agents to identify relevance of information
|
Talaei-Khoei, Amir |
|
2012 |
78 |
1 |
p. 370-391 22 p. |
article |
19 |
Markov network based ontology matching
|
Albagli, Sivan |
|
2012 |
78 |
1 |
p. 105-118 14 p. |
article |
20 |
On bounded block decomposition problems for under-specified systems of equations
|
Bomhoff, Matthijs |
|
2012 |
78 |
1 |
p. 336-347 12 p. |
article |
21 |
On restricted context-free grammars
|
Dassow, Jürgen |
|
2012 |
78 |
1 |
p. 293-304 12 p. |
article |
22 |
Optimal sampling from sliding windows
|
Braverman, Vladimir |
|
2012 |
78 |
1 |
p. 260-272 13 p. |
article |
23 |
Scheduling malleable tasks with precedence constraints
|
Jansen, Klaus |
|
2012 |
78 |
1 |
p. 245-259 15 p. |
article |
24 |
Synonymous theories and knowledge representations in answer set programming
|
Pearce, D. |
|
2012 |
78 |
1 |
p. 86-104 19 p. |
article |
25 |
The tractability frontier for NFA minimization
|
Björklund, Henrik |
|
2012 |
78 |
1 |
p. 198-210 13 p. |
article |
26 |
Truthful randomized mechanisms for combinatorial auctions
|
Dobzinski, Shahar |
|
2012 |
78 |
1 |
p. 15-25 11 p. |
article |
27 |
View-based query answering in Description Logics: Semantics and complexity
|
Calvanese, Diego |
|
2012 |
78 |
1 |
p. 26-46 21 p. |
article |