nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Additive Approximation of Generalized Turán Questions
|
Alon, Noga |
|
|
84 |
2 |
p. 464-481 |
artikel |
2 |
Approximation Schemes for the Generalized Extensible Bin Packing Problem
|
Levin, Asaf |
|
|
84 |
2 |
p. 325-343 |
artikel |
3 |
Contraction Bidimensionality of Geometric Intersection Graphs
|
Baste, Julien |
|
|
84 |
2 |
p. 510-531 |
artikel |
4 |
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness
|
Dörfler, Julian |
|
|
84 |
2 |
p. 379-404 |
artikel |
5 |
Fast Exact Algorithms Using Hadamard Product of Polynomials
|
Arvind, V. |
|
|
84 |
2 |
p. 436-463 |
artikel |
6 |
Matching Regular Expressions on uncertain data
|
Gil, José Arturo |
|
|
84 |
2 |
p. 532-564 |
artikel |
7 |
Mechanisms for (Mis)allocating Scientific Credit
|
Kleinberg, Jon |
|
|
84 |
2 |
p. 344-378 |
artikel |
8 |
On the Parameterized Complexity of Maximum Degree Contraction Problem
|
Saurabh, Saket |
|
|
84 |
2 |
p. 405-435 |
artikel |
9 |
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
|
Lokshtanov, Daniel |
|
|
84 |
2 |
p. 482-509 |
artikel |
10 |
Structural Parameterizations of Clique Coloring
|
Jaffke, Lars |
|
|
84 |
2 |
p. 273-303 |
artikel |
11 |
Tight Bounds for Online Weighted Tree Augmentation
|
Naor, Joseph (Seffi) |
|
|
84 |
2 |
p. 304-324 |
artikel |