| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
|
Babenko, Maxim A.
|
|
2009
|
61 |
4 |
p. 898-922
|
artikel
|
| 2 |
A New Algorithm for Finding Trees with Many Leaves
|
Kneis, Joachim
|
|
2010
|
61 |
4 |
p. 882-897
|
artikel
|
| 3 |
An Improved Approximation Algorithm for the Traveling Tournament Problem
|
Yamaguchi, Daisuke
|
|
2011
|
61 |
4 |
p. 1077-1091
|
artikel
|
| 4 |
Another Sub-exponential Algorithm for the Simple Stochastic Game
|
Dai, Decheng
|
|
2010
|
61 |
4 |
p. 1092-1104
|
artikel
|
| 5 |
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three
|
Al-Jubeh, Marwan
|
|
2011
|
61 |
4 |
p. 971-999
|
artikel
|
| 6 |
Editing Graphs into Disjoint Unions of Dense Clusters
|
Guo, Jiong
|
|
2011
|
61 |
4 |
p. 949-970
|
artikel
|
| 7 |
Editorial: ISAAC 2008 Special Issue
|
Hong, Seok-Hee
|
|
2011
|
61 |
4 |
p. 777-778
|
artikel
|
| 8 |
Editors’ Note: ISAAC 2009 Special Section
|
|
|
2011
|
61 |
4 |
p. 923
|
artikel
|
| 9 |
Exact Algorithms for the Bottleneck Steiner Tree Problem
|
Bae, Sang Won
|
|
2011
|
61 |
4 |
p. 924-948
|
artikel
|
| 10 |
Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
|
Hong, Seok-Hee
|
|
2011
|
61 |
4 |
p. 1022-1076
|
artikel
|
| 11 |
Faster Parameterized Algorithms for Minimum Fill-in
|
Bodlaender, Hans L.
|
|
2010
|
61 |
4 |
p. 817-838
|
artikel
|
| 12 |
How to Guard a Graph?
|
Fomin, Fedor V.
|
|
2010
|
61 |
4 |
p. 839-856
|
artikel
|
| 13 |
Signature Theory in Holographic Algorithms
|
Cai, Jin-Yi
|
|
2009
|
61 |
4 |
p. 779-816
|
artikel
|
| 14 |
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
|
Mishra, Sounaka
|
|
2010
|
61 |
4 |
p. 857-881
|
artikel
|
| 15 |
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs
|
Li, Minming
|
|
2011
|
61 |
4 |
p. 1000-1021
|
artikel
|
Tijdschrift beschrijving