| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
|
Bienkowski, Marcin
|
|
2012
|
68 |
2 |
p. 426-447
|
artikel
|
| 2 |
Approximation Algorithms for Intersection Graphs
|
Kammer, Frank
|
|
2012
|
68 |
2 |
p. 312-336
|
artikel
|
| 3 |
A Randomized O(log2k)-Competitive Algorithm for Metric Bipartite Matching
|
Bansal, Nikhil
|
|
2012
|
68 |
2 |
p. 390-403
|
artikel
|
| 4 |
Emergency Connectivity in Ad-hoc Networks with Selfish Nodes
|
Karakostas, George
|
|
2012
|
68 |
2 |
p. 358-389
|
artikel
|
| 5 |
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
|
Bilò, Davide
|
|
2012
|
68 |
2 |
p. 337-357
|
artikel
|
| 6 |
On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
|
He, Xin
|
|
2012
|
68 |
2 |
p. 531-544
|
artikel
|
| 7 |
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
|
Borradaile, Glencora
|
|
2012
|
68 |
2 |
p. 287-311
|
artikel
|
| 8 |
Relative Convex Hulls in Semi-Dynamic Arrangements
|
Ishaque, Mashhood
|
|
2012
|
68 |
2 |
p. 448-482
|
artikel
|
| 9 |
Speed Scaling on Parallel Processors
|
Albers, Susanne
|
|
2012
|
68 |
2 |
p. 404-425
|
artikel
|
| 10 |
The Complexity of the Empire Colouring Problem
|
McGrae, Andrew R. A.
|
|
2012
|
68 |
2 |
p. 483-503
|
artikel
|
| 11 |
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles
|
Misra, Neeldhara
|
|
2012
|
68 |
2 |
p. 504-530
|
artikel
|
Tijdschrift beschrijving