| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Aligning Two Convex Figures to Minimize Area or Perimeter
|
Ahn, Hee-Kap
|
|
2010
|
62 |
1-2 |
p. 464-479
|
artikel
|
| 2 |
A Linear Algorithm for the Random Sampling from Regular Languages
|
Bernardi, Olivier
|
|
2010
|
62 |
1-2 |
p. 130-145
|
artikel
|
| 3 |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups
|
Ivanyos, Gábor
|
|
2010
|
62 |
1-2 |
p. 480-498
|
artikel
|
| 4 |
Approximability of the Firefighter Problem
|
Anshelevich, Elliot
|
|
2010
|
62 |
1-2 |
p. 520-536
|
artikel
|
| 5 |
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
|
Epstein, Leah
|
|
2010
|
62 |
1-2 |
p. 102-129
|
artikel
|
| 6 |
A Scheme for Computing Minimum Covers within Simple Regions
|
Katz, Matthew J.
|
|
2010
|
62 |
1-2 |
p. 349-360
|
artikel
|
| 7 |
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
|
Chepoi, Victor
|
|
2010
|
62 |
1-2 |
p. 146-168
|
artikel
|
| 8 |
Biased Range Trees
|
Dujmović, Vida
|
|
2010
|
62 |
1-2 |
p. 21-37
|
artikel
|
| 9 |
Competitive Weighted Matching in Transversal Matroids
|
Dimitrov, Nedialko B.
|
|
2010
|
62 |
1-2 |
p. 333-348
|
artikel
|
| 10 |
Complexity of Finding Graph Roots with Girth Conditions
|
Farzad, Babak
|
|
2010
|
62 |
1-2 |
p. 38-53
|
artikel
|
| 11 |
Construction Sequences and Certifying 3-connectivity
|
Schmidt, Jens M.
|
|
2010
|
62 |
1-2 |
p. 192-208
|
artikel
|
| 12 |
Drawing (Complete) Binary Tanglegrams
|
Buchin, Kevin
|
|
2010
|
62 |
1-2 |
p. 309-332
|
artikel
|
| 13 |
Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems
|
Berger, André
|
|
2011
|
62 |
1-2 |
p. 633-634
|
artikel
|
| 14 |
Fast Algorithms for max independent set
|
Bourgeois, Nicolas
|
|
2010
|
62 |
1-2 |
p. 382-415
|
artikel
|
| 15 |
Fast Arc-Annotated Subsequence Matching in Linear Space
|
Bille, Philip
|
|
2010
|
62 |
1-2 |
p. 209-223
|
artikel
|
| 16 |
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
|
Gfeller, Beat
|
|
2010
|
62 |
1-2 |
p. 169-191
|
artikel
|
| 17 |
Finding Induced Paths of Given Parity in Claw-Free Graphs
|
’t Hof, Pim van
|
|
2010
|
62 |
1-2 |
p. 537-563
|
artikel
|
| 18 |
Many Distances in Planar Graphs
|
Cabello, Sergio
|
|
2010
|
62 |
1-2 |
p. 361-381
|
artikel
|
| 19 |
Mapping Filtering Streaming Applications
|
Agrawal, Kunal
|
|
2010
|
62 |
1-2 |
p. 258-308
|
artikel
|
| 20 |
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
|
Alistarh, Dan
|
|
2011
|
62 |
1-2 |
p. 595-629
|
artikel
|
| 21 |
Philippe Flajolet, the Father of Analytic Combinatorics
|
|
|
2011
|
62 |
1-2 |
p. 635-636
|
artikel
|
| 22 |
Philippe Flajolet, the Father of Analytic Combinatorics
|
|
|
|
62 |
1-2 |
p. 635-636
|
artikel
|
| 23 |
Pruning 2-Connected Graphs
|
Chekuri, Chandra
|
|
2010
|
62 |
1-2 |
p. 436-463
|
artikel
|
| 24 |
Shortest Paths in Time-Dependent FIFO Networks
|
Dehne, Frank
|
|
2010
|
62 |
1-2 |
p. 416-435
|
artikel
|
| 25 |
Stronger Lempel-Ziv Based Compressed Text Indexing
|
Arroyuelo, Diego
|
|
2010
|
62 |
1-2 |
p. 54-101
|
artikel
|
| 26 |
Succinct Representation of Labeled Graphs
|
Barbay, Jérémy
|
|
2010
|
62 |
1-2 |
p. 224-257
|
artikel
|
| 27 |
The k-in-a-Path Problem for Claw-free Graphs
|
Fiala, Jiří
|
|
2010
|
62 |
1-2 |
p. 499-519
|
artikel
|
| 28 |
The Parameterized Complexity of Stabbing Rectangles
|
Dom, Michael
|
|
2010
|
62 |
1-2 |
p. 564-594
|
artikel
|
| 29 |
The Steiner Ratio Gilbert–Pollak Conjecture Is Still Open
|
Ivanov, A. O.
|
|
2011
|
62 |
1-2 |
p. 630-632
|
artikel
|
| 30 |
Weighted Matching in the Semi-Streaming Model
|
Zelke, Mariano
|
|
2010
|
62 |
1-2 |
p. 1-20
|
artikel
|
Tijdschrift beschrijving