Laura Toma

Jan Vahrenhold

Inroads, 2018

A Comparison of I/O-Efficient Algorithms for Visibility Computation on Massive Grid Terrains.

[BibT_eX]

[DOI]

CoRR, 2018

Self-Efficacy, Cognitive Load, and Emotional Reactions in Collaborative Algorithms Labs - A Case Study.

[BibT_eX]

[DOI]

Jan Vahrenhold

Proceedings of the 2018 ACM Conference on International Computing Education Research, 2018

A multiresolution approach for viewsheds on 2D terrains.

[BibT_eX]

[DOI]

Andrew Prescott

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

2016

List Ranking.

[BibT_eX]

[DOI]

Riko Jacob

Ulrich Meyer

Encyclopedia of Algorithms, 2016

Quadtrees and Morton Indexing.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

2014

Terrain Modeling for the Geosciences.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

2013

An Edge Quadtree for External Memory.

[BibT_eX]

[DOI]

Mark McGranaghan

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On IO-efficient viewshed algorithms and their accuracy.

[BibT_eX]

[DOI]

Bob PoFang Wei

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012

Viewsheds on terrains in external memory.

[BibT_eX]

[DOI]

ACM SIGSPATIAL Special, 2012

2011

I/O-Efficient Algorithms on Near-Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

2010

Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions.

[BibT_eX]

[DOI]

Comput. Geom., 2010

The complexity of flow on fat terrains and its i/o-efficient computation.

[BibT_eX]

[DOI]

Comput. Geom., 2010

2009

Improved visibility computation on massive grid terrains.

[BibT_eX]

[DOI]

Jeremy Fishman

Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

2008

Terracost: Computing least-cost-path surfaces for massive grid terrains.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Computing visibility on terrains in external memory.

[BibT_eX]

[DOI]

Yi Zhuang

ACM J. Exp. Algorithmics, 2008

2007

I/O-Efficient Flow Modeling on Fat Terrains.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains.

[BibT_eX]

[DOI]

Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

2005

External Data Structures for Shortest Path Queries on Planar Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

On external-memory MST, SSSP and multi-way planar graph separation.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

J. Algorithms, 2004

Simplified External Memory Algorithms for Planar DAGs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs.

[BibT_eX]

[DOI]

Ulrich Meyer

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

On External-Memory Planar Depth First Search.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2003

Efficient Flow Computation on Massive Grid Terrain Datasets.

[BibT_eX]

[DOI]

GeoInformatica, 2003

I/O-efficient topological sorting of planar DAGs.

[BibT_eX]

[DOI]

Norbert Zeh

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

I/O-Efficient Algorithms for Sparse Graphs.

[BibT_eX]

[DOI]

Norbert Zeh

Proceedings of the Algorithms for Memory Hierarchies, 2002

2001

I/O-Efficient Algorithms for Problems on Grid-Based Terrains.

[BibT_eX]

[DOI]