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