| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location
|
Ferraioli, Diodato
|
|
|
83 |
2 |
p. 695-725
|
artikel
|
| 2 |
Constrained Minimum Passage Time in Random Geometric Graphs
|
Ganesan, Ghurumuruhan
|
|
|
83 |
2 |
p. 576-588
|
artikel
|
| 3 |
Covert Computation in Self-Assembled Circuits
|
Cantu, Angel A.
|
|
|
83 |
2 |
p. 531-552
|
artikel
|
| 4 |
Fault-Tolerant Covering Problems in Metric Spaces
|
Bhowmick, Santanu
|
|
|
83 |
2 |
p. 413-446
|
artikel
|
| 5 |
High Entropy Random Selection Protocols
|
Buhrman, Harry
|
|
|
83 |
2 |
p. 667-694
|
artikel
|
| 6 |
Non-Greedy Online Steiner Trees on Outerplanar Graphs
|
Matsubayashi, Akira
|
|
|
83 |
2 |
p. 613-640
|
artikel
|
| 7 |
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth
|
Biedl, Therese
|
|
|
83 |
2 |
p. 641-666
|
artikel
|
| 8 |
On the Complexity of Colouring Antiprismatic Graphs
|
Preissmann, Myriam
|
|
|
83 |
2 |
p. 589-612
|
artikel
|
| 9 |
On the Tree Augmentation Problem
|
Nutov, Zeev
|
|
|
83 |
2 |
p. 553-575
|
artikel
|
| 10 |
Simultaneous Feedback Edge Set: A Parameterized Perspective
|
Agrawal, Akanksha
|
|
|
83 |
2 |
p. 753-774
|
artikel
|
| 11 |
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games
|
Bilò, Vittorio
|
|
|
83 |
2 |
p. 447-530
|
artikel
|
| 12 |
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
|
Ganian, Robert
|
|
|
83 |
2 |
p. 726-752
|
artikel
|
Tijdschrift beschrijving