nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Building a Nest by an Automaton
|
Czyzowicz, Jurek |
|
|
83 |
1 |
p. 144-176 |
artikel |
2 |
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
|
Fekete, Sándor P. |
|
|
83 |
1 |
p. 387-412 |
artikel |
3 |
Distance and Routing Labeling Schemes for Cube-Free Median Graphs
|
Chepoi, Victor |
|
|
83 |
1 |
p. 252-296 |
artikel |
4 |
Flip Distances Between Graph Orientations
|
Aichholzer, Oswin |
|
|
83 |
1 |
p. 116-143 |
artikel |
5 |
Iterative Partial Rounding for Vertex Cover with Hard Capacities
|
Kao, Mong-Jen |
|
|
83 |
1 |
p. 45-71 |
artikel |
6 |
Learning Privately with Labeled and Unlabeled Examples
|
Beimel, Amos |
|
|
83 |
1 |
p. 177-215 |
artikel |
7 |
List 3-Coloring Graphs with No Induced P6+rP3
|
Chudnovsky, Maria |
|
|
83 |
1 |
p. 216-251 |
artikel |
8 |
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
|
Ganian, Robert |
|
|
83 |
1 |
p. 297-336 |
artikel |
9 |
Parameterized Dynamic Cluster Editing
|
Luo, Junjie |
|
|
83 |
1 |
p. 1-44 |
artikel |
10 |
Polynomial Treedepth Bounds in Linear Colorings
|
Kun, Jeremy |
|
|
83 |
1 |
p. 361-386 |
artikel |
11 |
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
|
Chevalier, Céline |
|
|
83 |
1 |
p. 72-115 |
artikel |
12 |
Tight Bounds for Online Coloring of Basic Graph Classes
|
Albers, Susanne |
|
|
83 |
1 |
p. 337-360 |
artikel |