| 2008 |
|---|
| 19 | EE | Thomas Hazel,
Laura Toma,
Jan Vahrenhold,
Rajiv Wickremesinghe:
Terracost: Computing least-cost-path surfaces for massive grid terrains.
ACM Journal of Experimental Algorithmics 12: (2008) |
| 18 | EE | Herman J. Haverkort,
Laura Toma,
Yi Zhuang:
Computing visibility on terrains in external memory.
ACM Journal of Experimental Algorithmics 13: (2008) |
| 2007 |
|---|
| 17 | EE | Herman J. Haverkort,
Laura Toma,
Yi Zhuang:
Computing Visibility on Terrains in External Memory.
ALENEX 2007 |
| 16 | EE | Mark de Berg,
Herman J. Haverkort,
Shripad Thite,
Laura Toma:
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.
ISAAC 2007: 500-511 |
| 15 | EE | Mark de Berg,
Otfried Cheong,
Herman J. Haverkort,
Jung Gun Lim,
Laura Toma:
I/O-Efficient Flow Modeling on Fat Terrains.
WADS 2007: 239-250 |
| 2006 |
|---|
| 14 | EE | Herman J. Haverkort,
Laura Toma:
I/O-Efficient Algorithms on Near-Planar Graphs.
LATIN 2006: 580-591 |
| 13 | EE | Thomas Hazel,
Laura Toma,
Jan Vahrenhold,
Rajiv Wickremesinghe:
TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains.
SAC 2006: 52-57 |
| 2005 |
|---|
| 12 | EE | Lars Arge,
Laura Toma:
External Data Structures for Shortest Path Queries on Planar Digraphs.
ISAAC 2005: 328-338 |
| 2004 |
|---|
| 11 | EE | Lars Arge,
Ulrich Meyer,
Laura Toma:
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs.
ICALP 2004: 146-157 |
| 10 | EE | Lars Arge,
Laura Toma:
Simplified External Memory Algorithms for Planar DAGs.
SWAT 2004: 493-503 |
| 9 | EE | Lars Arge,
Gerth Stølting Brodal,
Laura Toma:
On external-memory MST, SSSP and multi-way planar graph separation.
J. Algorithms 53(2): 186-206 (2004) |
| 2003 |
|---|
| 8 | EE | Lars Arge,
Laura Toma,
Norbert Zeh:
I/O-efficient topological sorting of planar DAGs.
SPAA 2003: 85-93 |
| 7 | | Lars Arge,
Jeffrey S. Chase,
Patrick N. Halpin,
Laura Toma,
Jeffrey Scott Vitter,
Dean Urban,
Rajiv Wickremesinghe:
Efficient Flow Computation on Massive Grid Terrain Datasets.
GeoInformatica 7(4): 283-313 (2003) |
| 6 | EE | Lars Arge,
Ulrich Meyer,
Laura Toma,
Norbert Zeh:
On External-Memory Planar Depth First Search.
J. Graph Algorithms Appl. 7(2): 105-129 (2003) |
| 2002 |
|---|
| 5 | EE | Laura Toma,
Norbert Zeh:
I/O-Efficient Algorithms for Sparse Graphs.
Algorithms for Memory Hierarchies 2002: 85-109 |
| 2001 |
|---|
| 4 | | Laura Toma,
Rajiv Wickremesinghe,
Lars Arge,
Jeffrey S. Chase,
Jeffrey Scott Vitter,
Patrick N. Halpin,
Dean Urban:
Flow Computation on Massive Grids.
ACM-GIS 2001: 82-87 |
| 3 | EE | Lars Arge,
Ulrich Meyer,
Laura Toma,
Norbert Zeh:
On External-Memory Planar Depth First Search.
WADS 2001: 471-482 |
| 2 | | Lars Arge,
Laura Toma,
Jeffrey Scott Vitter:
I/O-Efficient Algorithms for Problems on Grid-Based Terrains.
ACM Journal of Experimental Algorithmics 6: 1 (2001) |
| 2000 |
|---|
| 1 | EE | Lars Arge,
Gerth Stølting Brodal,
Laura Toma:
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation.
SWAT 2000: 433-447 |
