Publications

My DBLP page | Google Scholar page are likely more up-to-date.

Mapping Inundation from Sea-level Rise and Storm Surges: An Efficient Algorithm for Large Data. Alini C., Johnson E. and Toma L. ArXiv.
A Multi-resolution Approach for Viewsheds on 2D Terrains. Prescott A. and Toma L. In Proceedings of the 26th ACM SIGSPATIAL GIS International Conference on Advances in Geographic Information Systems (SIGSPATIAL 2018), pp. 63-72. doi: 10.1145/3274895.3274990
Self-Efficacy, Cognitive Load, and Emotional Reactions in Collaborative Algorithms Labs - A Case Study. Toma L, Vahrenhold J. In Proceedings of the 14th ACM International Computing Education Research Conference (ICER 2018), edited by Malmi L, McCartney R., pp.1-10. New York, NY. ACM Press. doi: 10.1145/3230977.3230980.

Reprint: An Instrument to Assess Self-Efficacy in Introductory Algorithms Courses. Danielsiek H, Toma L, Vahrenhold J. 2018. ACM Inroads 9, Nr. 1: 56-65. doi: 10.1145/3105726.3106171.

An instrument to assess self-efficacy in introductory algorithms courses. Danielsiek H, Toma L and Vahrenhold J. In Proceedings of the 13th ACM International Computing Education Research Conference (ICER 2017) (ICER 2017), edited by Tenenberg J, Chinn D, Malmi L, Korhonen A, Sheard J, pp.217-225. New York, NY. ACM Press. doi:10.1145/3105726.3106171. Best-paper award.

Viewshed Analysis: An algorithmic perspective. Toma L. In SAS Encyclopedia of Archeaological Sciences, edited by Sandra Lopez Varela, Wiley-Blackwell, 2016.

Quadtrees and Morton Indexing. Haverkort H, Toma L. In Encyclopedia of Algorithms, second edition, edited by Ming-Yang Kao, pages 1637-1642, Springer 2016. doi: 10.1007/978-1-4939-2864-4_585

External memory list ranking. Jacob R, Meyer U, Toma L. In Encyclopedia of Algorithms, second edition, edited by Ming-Yang Kao, pages 1117-1121, Springer 2016. doi: 10.1007/978-1-4939-2864-4_592

A comparison of I/O-efficient algorithms for viewsheds on grid terrains. Haverkort H.J., Toma L. doi: 10.48550/arXiv.1810.01946

Terrain Modeling for the Geosciences. Haverkort H.J., Toma L. In Computing Handbook, third edition, edited by Tucker A., Gonzales T., Topi H. and Diaz-Herrera J., chapter 31. Chapman and Hall/CRC Press, 2014. doi: 10.1201/b16812-36

On IO-efficient viewshed algorithms and their accuracy. Haverkort H., Toma L. and Wei B. In Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances of Geographic Information Systems(ACM SIGPATIAL GIS 2013), pp 24-33. ACM 2013. © ACM. doi: 10.1145/2525314.2525369

An edge quadtree for external memory. McGranaghan M., Haverkort H. and Toma L. In Bonifaci V., Demetrescu C., Marchetti-Spaccamela A. (eds), Proceedings of the 12th International Symposium of Experimental Algoriths (SEA 2013), pp 115-126. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. doi: 10.1007/978-3-642-38527-8_12

Viewsheds on Terrains in External Memory. Toma L. In ACM SIGSPATIAL GIS Newsletter, Volume 4, Number 2, pages 13-17, July 2012.

I/O-efficient algorithms on near-planar graphs. Haverkort H, Toma L. In Journal of Graph Algorithms and Applications (JGAA), Volume 15(4):503-532, 2011.

Star-quadtree and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. De Berg M., Haverkort H., Thite S. and Toma L. In Computational Geometry: Theory and Applications (CGTA), Volume 43(5):493-513, July 2010.

The complexity of flow on fat terrains and its I/O-efficient computation. De Berg M., Cheong O., Haverkort H., Lim J. and Toma L. In Computational Geometry: Theory and Applications (CGTA, Volume 43(4):331-356, May 2010.

Improved visibility computation on massive grid terrains. Fishman J., Haverkort H. and Toma L. In Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2009), pp 121-130. ACM 2009. © ACM. Best-paper award. [Slides]. doi:10.1145/1653771.1653791

Computing visibility on terrains in external memory. Haverkort H., Toma L., Zhuang Y. In ACM Journal of Experimental Algorithmics, Volume 13, Article 5, February 2009. doi:10.1145/1412228.1412233

TerraCost: Computing Least-Cost-Path Surfaces for Massive Grid Terrains. Thomas Hazel, Laura Toma, Jan Vahrenhold and Rajiv Wickremesinghe. In ACM Journal of Experimental Algorithmics, Volume 12, Article 1.9, June 2008. doi:10.1145/1227161.1370600

I/O-Efficient map overlay and point location in low-density subdivisions. de Berg M., Haverkort H., Thite S., Toma L. In Proceedings of the 18th Annual International Symposium on Algorithms and Computation (ISAAC 2007), edited by Tokuyama T., LNCS vol. 4835, pp. 500-511. Springer, Berlin, Heidelberg. doi: https://doi.org/10.1007/978-3-540-77120-3_44 A short version appeared in Proc. 23rd European Workshop on Computational Geometry (EuroCG 2007), Graz, 2007.

I/O-Efficient flow modeling on fat terrains. de Berg M., Cheong O., Haverkort H., Lim J.G., Toma L. In Proceedings of the 10th Symposium on Algorithms and Data Structures (WADS 2007), edited by Dehne F., Sack J.R., Zeh N., LNCS vol. 4619, pp. 239-250.Springer, Berlin, Heidelberg, 2007.

Computing visibility on terrains in external memory. Herman Haverkort, Laura Toma and Yi Zhuang. In Proceedings of the 9th SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2007), edited by Applegate D., Brodal G.S., pages 13-22, 2007.

Terracost: A versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains. Thomas Hazel, Laura Toma, Jan Vahrenhold and Rajiv Wickremesinghe. In Proceedings of the 21st ACM Symposium on Applied Computing (SAC 2006), 2006. ACM 2006. © ACM.

I/O-Efficient Algorithms on Near-Planar Graphs. Herman Haverkort and Laura Toma. In Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN 2006), edited by J. Correa, A. Hevia and M. Kiwi, LNCS volume 3887, pages 580-591. Springer, Berlin, March 2006. © Springer-Verlag. [pdf]

River networks and watershed maps of triangulated terrains revisited. Hee-Kap Ahn, Mark de Berg, Otfried Cheong, Herman Haverkort, Frank van der Stappen, and Laura Toma. In Proceedings of the 22nd European Workshop on Computational Geometry (EuroCG 2006), Delphi, 2006, p173-176.

Scalable Raster-to-TIN simplification. Jonathan Todd and Laura Toma. In Free and Open Source Software for Geoinformatics (FOSS4G 2006), Lausanne, 2006.

Terracost: computing least-cost path surfaces on massive raster terrains. Thomas Hazel, Laura Toma, Jan Vahrenhold and Rajiv Wickremesinghe. In Free and Open Source Software for Geoinformatics (FOSS4G 2006), Lausanne, 2006.

External Data Structures for Shortest Path Queries on Planar Digraphs. Lars Arge and Laura Toma. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), edited by X. Deng and D. Du, LNCS volume 3827, pages 328-338. Springer, Berlin, December 2005. © Springer-Verlag. [pdf]

GIS-based strea network analysis for the upper Rio Chagres basin, Panama. David Kinner, Helena Mitasova, Robert Stallard, Russell S. Harmon and Laura Toma. In The Rio Chagres, Panama, LNCS vol. 52, pp. 83-95. © Springer-Verlag.

On External-Memory MST, SSSP and Multi-way Planar Graph Separation. Lars Arge, Gerth Brodal and Laura Toma. In Journal of Algorithms, 53(2):186-206, November 2004. [pdf]

External Memory Algorithms for Diameter and All-Pairs Shortest Paths on Sparse Graphs. Lars Arge, Ulrich Meyer and Laura Toma. In Proceedings of the 31st International Colloquim on Automata, Languages and Programing (ICALP 2004), edited by Josep Diaz, Juhani Karhumaki, Arto Lepisto, Donald Sannella, LNCS volume 3142, pages 146-157. Springer, Berlin, July 2004. © Springer-Verlag. [pdf]

Simplified I/O-Efficient Algorithms for Planar DAGs. Lars Arge and Laura Toma. In Proceedings of the 9th Scandinavian Symposium on Algorithm Theory (SWAT 2004), edited by Torben Hagerup, Jyrki Katajainen, LNCS volume 3111, pages 493-503. Springer, Berlin, July 2004. © Springer-Verlag. [pdf]

I/O-Efficient Algorithms for Sparse Graphs.
Laura Toma and Norbert Zeh. In Ulrich Meyer, Peter Sanders, and Jop Sibeyn, editors, Algorithms for Memory Hierarchies, volume 2625 of Lecture Notes in Computer Science, pages 85-109. Springer, Berlin, 2003.

Flow Computation on Massive Grid Terrains. Lars Arge, Jeff Chase, Patrick Halpin, Laura Toma, Dean Urban, Jeffrey S. Vitter, and Rajiv Wickremesinghe. In GeoInformatica, International Journal on Advances of Computer Science for Geographic Information Systems, 7(4):283-313, December 2003. [ pdf]

On External-Memory Planar Depth First Search. Lars Arge, Ulrich Meyer, Laura Toma and Norbert Zeh. In JGAA, Journal of Graph Algorithms and Applications, 7(2):105-129, 2003.

I/O-Efficient Topological Sorting of Planar Digraphs. Lars Arge, Laura Toma and Norbert Zeh. In Proceedings of the Fifteenth annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2003), pages 85-93, 2003. ACM 2003. © ACM. [pdf]

I/O-Efficient Algorithms for Problems on Grid-based Terrains. Lars Arge, Laura Toma and Jeffrey S. Vitter. In JEA, Journal of Experimental Algorithmics, 6, 2001.

Flow Computation on Massive Grids. Laura Toma, Rajiv Wickremesinghe, Lars Arge, Jeff Chase, Jeffrey S. Vitter, Patrick Halpin, and Dean Urban. In Walid Aref, editor, Proceedings of the 9th ACM International Symposium on Advances in Geographic Information Systems (ACM GIS 2001), pages 82-87, 2001. ACM 2001. © ACM. [pdf]

On External-Memory Planar Depth First Search. Lars Arge, Ulrich Meyer, Laura Toma and Norbert Zeh. In F. Dehne, J.R. Sack, R. Tamassia, editors, Proceedings of the 7th Symposium on Algorithms and Data Structures (WADS 2001), LNCS volume 2125, pages 471-482. Springer, Berlin, July 2001. © Springer-Verlag. [pdf]

On External-Memory MST, SSSP and Multi-way Planar Graph Separation. Lars Arge, Gerth Brodal and Laura Toma. In M.M. Halldorsson, editor, Proceedings of the 7th Scandinavian Symposium on Algorithm Theory (SWAT 2000), LNCS volume 1851, pages 433-447. Springer, Berlin, July 2000. © Springer-Verlag. [pdf]

I/O-Efficient Algorithms for Problems on Grid-based Terrains. Lars Arge, Laura Toma and Jeffrey S. Vitter. In Proceedings of the 2nd Symposium on Algorithm Engineering and Experimentation (ALENEX 2000). [pdf]