| Publication | Date of Publication | Type |
|---|
| Sum-of-local-effects data structures for separable graphs | 2024-08-22 | Paper |
| Computing maximum agreement forests without cluster partitioning is folly | 2020-05-27 | Paper |
| Maximal and convex layers of random point sets | 2020-02-12 | Paper |
Engineering a Topological Sorting Algorithm for Massive Graphs
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
(available as arXiv preprint) | 2019-07-19 | Paper |
Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
A general approach for cache-oblivious range reporting and approximate range counting
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Cache-oblivious range reporting with optimal queries requires superlinear space
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Parallel construction of succinct trees
Theoretical Computer Science | 2017-10-17 | Paper |
| Improved space bounds for cache-oblivious range reporting | 2017-09-29 | Paper |
| Ordered and unordered top-\(K\) range reporting in large data sets | 2017-09-29 | Paper |
I/O-efficient path traversal in succinct planar graphs
Algorithmica | 2017-04-12 | Paper |
Hybridization number on three rooted binary trees is EPT
SIAM Journal on Discrete Mathematics | 2016-09-06 | Paper |
Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
Algorithmica | 2016-04-06 | Paper |
Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
Algorithms and Computation | 2015-09-11 | Paper |
| A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths | 2014-12-18 | Paper |
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms | 2014-09-09 | Paper |
I/O-efficient computation of water flow across a terrain
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
A topological sorting algorithm for large graphs
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Fixed-parameter algorithms for maximum agreement forests
SIAM Journal on Computing | 2013-11-14 | Paper |
Low-interference networks in metric spaces of bounded doubling dimension
Information Processing Letters | 2013-04-04 | Paper |
On the advice complexity of buffer management
Algorithms and Computation | 2013-03-21 | Paper |
A space-efficient framework for dynamic point location
Algorithms and Computation | 2013-03-21 | Paper |
Lower bounds for sorted geometric queries in the I/O model
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Cache-oblivious range reporting with optimal queries requires superlinear space
Discrete & Computational Geometry | 2011-06-03 | Paper |
Geometric algorithms for private-cache chip multiprocessors (extended abstract)
Algorithms – ESA 2010 | 2010-09-06 | Paper |
A general approach for cache-oblivious range reporting and approximate range counting
Computational Geometry | 2010-09-02 | Paper |
I/O-efficient undirected shortest paths
Lecture Notes in Computer Science | 2010-03-03 | Paper |
I/O and space-efficient path traversal in planar graphs
Algorithms and Computation | 2009-12-17 | Paper |
I/O-efficient algorithms for graphs of bounded treewidth
Algorithmica | 2009-08-27 | Paper |
I/O-Efficient Planar Separators
SIAM Journal on Computing | 2009-06-22 | Paper |
| scientific article; zbMATH DE number 5506205 (Why is no real title available?) | 2009-02-10 | Paper |
Cache-Oblivious Red-Blue Line Segment Intersection
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Geometric spanners with small chromatic number
Computational Geometry | 2008-11-19 | Paper |
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry | 2008-06-18 | Paper |
Politician’s Firefighting
Algorithms and Computation | 2008-04-24 | Paper |
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Geometric Spanners with Small Chromatic Number
Approximation and Online Algorithms | 2008-02-20 | Paper |
I/O-efficient well-separated pair decomposition and applications
Algorithmica | 2006-09-26 | Paper |
BOUNDARY-OPTIMAL TRIANGULATION FLOODING
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
I/O-Optimal Algorithms for Outerplanar Graphs
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
| scientific article; zbMATH DE number 2119685 (Why is no real title available?) | 2004-11-29 | Paper |
Approximating geometric bottleneck shortest paths
Computational Geometry | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2081109 (Why is no real title available?) | 2004-08-04 | Paper |
On External-Memory Planar Depth First Search
Journal of Graph Algorithms and Applications | 2003-11-30 | Paper |
| scientific article; zbMATH DE number 1984682 (Why is no real title available?) | 2003-09-22 | Paper |
| scientific article; zbMATH DE number 1984680 (Why is no real title available?) | 2003-09-22 | Paper |
| scientific article; zbMATH DE number 1962800 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1830742 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1830757 (Why is no real title available?) | 2002-11-18 | Paper |
| I/O-efficient algorithms for graphs of bounded treewidth | 2002-03-24 | Paper |
| scientific article; zbMATH DE number 1670661 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1522938 (Why is no real title available?) | 2001-07-08 | Paper |
