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