| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Approximation Algorithms for the Interval Constrained Coloring Problem
|
Althaus, Ernst
|
|
2010
|
61 |
2 |
p. 342-361
|
artikel
|
| 2 |
A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs
|
Kao, Kuo-Hua
|
|
2010
|
61 |
2 |
p. 402-418
|
artikel
|
| 3 |
Branch and Recharge: Exact Algorithms for Generalized Domination
|
Fomin, Fedor V.
|
|
2010
|
61 |
2 |
p. 252-273
|
artikel
|
| 4 |
Energy-Efficient Paths in Radio Networks
|
Beier, Rene
|
|
2010
|
61 |
2 |
p. 298-319
|
artikel
|
| 5 |
Graphical Congestion Games
|
Bilò, Vittorio
|
|
2010
|
61 |
2 |
p. 274-297
|
artikel
|
| 6 |
On Dynamic Shortest Paths Problems
|
Roditty, Liam
|
|
2010
|
61 |
2 |
p. 389-401
|
artikel
|
| 7 |
On Incentive Compatible Competitive Selection Protocols
|
Chen, Xi
|
|
2010
|
61 |
2 |
p. 447-462
|
artikel
|
| 8 |
Quadratic Kernelization for Convex Recoloring of Trees
|
Bodlaender, Hans L.
|
|
2010
|
61 |
2 |
p. 362-388
|
artikel
|
| 9 |
Reoptimization of the Shortest Common Superstring Problem
|
Bilò, Davide
|
|
2010
|
61 |
2 |
p. 227-251
|
artikel
|
| 10 |
The Cost of Cache-Oblivious Searching
|
Bender, Michael A.
|
|
2010
|
61 |
2 |
p. 463-505
|
artikel
|
| 11 |
The Longest Path Problem has a Polynomial Solution on Interval Graphs
|
Ioannidou, Kyriaki
|
|
2010
|
61 |
2 |
p. 320-341
|
artikel
|
| 12 |
Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks
|
Moscibroda, Thomas
|
|
2010
|
61 |
2 |
p. 419-446
|
artikel
|
Tijdschrift beschrijving