| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6059161 | 2023-11-02 | Paper |
| External-memory algorithms for processing line segments in geographic information systems | 2023-05-08 | Paper |
| A general lower bound on the I/O-complexity of comparison-based algorithms | 2023-01-18 | Paper |
| The buffer tree: A new technique for optimal I/O-algorithms | 2022-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115770 | 2020-08-18 | Paper |
| Simplifying massive planar subdivisions | 2019-09-12 | Paper |
| I/O-Efficient Event Based Depression Flood Risk | 2019-09-12 | Paper |
| Computing Floods Caused by Non-Uniform Sea-Level Rise | 2019-09-12 | Paper |
| Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs | 2019-05-15 | Paper |
| The priority R-tree | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643861 | 2018-05-29 | Paper |
| Cache-oblivious planar orthogonal range searching and counting | 2017-10-20 | Paper |
| Cache-oblivious R-trees | 2017-10-20 | Paper |
| I/O-efficient dynamic planar point location (extended abstract) | 2017-09-29 | Paper |
| Cache-oblivious data structures for orthogonal range searching | 2017-09-29 | Paper |
| RAM-Efficient External Memory Sorting | 2016-02-19 | Paper |
| Skip-webs | 2015-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921744 | 2014-10-13 | Paper |
| I/O-efficient batched union-find and its applications to terrain analysis | 2014-09-09 | Paper |
| Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model | 2014-08-07 | Paper |
| Orthogonal Range Reporting in Three and Higher Dimensions | 2014-07-25 | Paper |
| Orthogonal range reporting | 2014-04-03 | Paper |
| I/O-efficient computation of water flow across a terrain | 2014-04-03 | Paper |
| RAM-Efficient External Memory Sorting | 2014-01-14 | Paper |
| An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters | 2013-09-17 | Paper |
| (Approximate) uncertain skylines | 2013-08-23 | Paper |
| On (Dynamic) Range Minimum Queries in External Memory | 2013-08-12 | Paper |
| Efficient external memory structures for range-aggregate queries | 2013-01-25 | Paper |
| Simplifying Massive Contour Maps | 2012-09-25 | Paper |
| An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries | 2012-05-30 | Paper |
| External memory planar point location with logarithmic updates | 2012-04-26 | Paper |
| Cache-oblivious priority queue and graph algorithm applications | 2010-08-05 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| I/O-Efficient Contour Tree Simplification | 2009-12-17 | Paper |
| Optimal external memory planar point enclosure | 2009-08-27 | Paper |
| Cache-oblivious R-trees | 2009-05-13 | Paper |
| The ComBack Method – Extending Hash Compaction with Backtracking | 2009-03-11 | Paper |
| External memory planar point location with logarithmic updates | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601535 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601536 | 2009-02-10 | Paper |
| Cache-Oblivious Red-Blue Line Segment Intersection | 2008-11-25 | Paper |
| An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms | 2008-01-03 | Paper |
| External-memory algorithms for processing line segments in geographic information systems | 2007-03-05 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| I/O-Efficient Algorithms for Problems on Grid-Based Terrains | 2005-08-04 | Paper |
| Efficient sorting using registers and caches | 2005-08-04 | Paper |
| I/O-efficient point location using persistent B-trees | 2005-08-04 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| On external-memory MST, SSSP and multi-way planar graph separation | 2005-02-16 | Paper |
| I/O-efficient dynamic planar point location | 2004-10-01 | Paper |
| The buffer tree: A technique for designing batched external data structures | 2004-03-11 | Paper |
| On External-Memory Planar Depth First Search | 2003-11-30 | Paper |
| Optimal External Memory Interval Management | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414531 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411348 | 2003-07-08 | Paper |
| Indexing moving points | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796163 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778542 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778580 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552048 | 2002-08-28 | Paper |
| Efficient bulk operations on dynamic \(R\)-trees | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535014 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722001 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722002 | 2001-07-11 | Paper |
| Efficient searching with linear constraints | 2001-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527021 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945529 | 2000-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4490352 | 2000-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250238 | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250172 | 2000-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252266 | 1999-06-17 | Paper |
