The SCEAS System
Navigation Menu

Search the dblp DataBase


Laura Toma: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  17. Improved visibility computation on massive grid terrains. [Citation Graph (, )][DBLP]

  18. I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. [Citation Graph (, )][DBLP]

  19. Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. [Citation Graph (, )][DBLP]

  20. The complexity of flow on fat terrains and its i/o-efficient computation. [Citation Graph (, )][DBLP]

Search in 0.005secs, Finished in 0.007secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002