| Publication | Date of Publication | Type |
|---|
| Shortest beer path queries in interval graphs | 2024-09-11 | Paper |
| Sum-of-local-effects data structures for separable graphs | 2024-08-22 | Paper |
| Distance queries over dynamic interval graphs | 2024-07-23 | Paper |
| On approximate colored path counting | 2024-05-31 | Paper |
| Dynamic compact planar embeddings | 2024-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065424 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075936 | 2023-09-20 | Paper |
| Internal masked prefix sums and its connection to fully internal measurement queries | 2023-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098786 | 2023-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874525 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875608 | 2023-02-03 | Paper |
| On Approximate Range Mode and Range Selection | 2023-02-03 | Paper |
| Data structures for categorical path counting queries | 2022-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091063 | 2022-07-21 | Paper |
| Improved Time and Space Bounds for Dynamic Range Mode | 2021-08-04 | Paper |
| Fast and compact planar embeddings | 2020-10-23 | Paper |
| Tree path majority data structures | 2020-08-03 | Paper |
| Path queries on functions | 2020-05-25 | Paper |
| Compressed dynamic range majority and minority data structures | 2020-05-21 | Paper |
| Maximal and convex layers of random point sets | 2020-02-12 | Paper |
| Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts | 2019-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633875 | 2019-05-06 | Paper |
| Path queries on functions | 2019-05-02 | Paper |
| Data Structures for Path Queries | 2018-11-05 | Paper |
| Dynamic path queries in linear space | 2018-10-18 | Paper |
| Deletion without Rebalancing in Non-Blocking Binary Search Trees | 2018-07-18 | Paper |
| Parallel construction of succinct trees | 2017-10-17 | Paper |
| Fast and compact planar embeddings | 2017-09-22 | Paper |
| Succinct indices for path minimum, with applications | 2017-07-07 | Paper |
| I/O-efficient path traversal in succinct planar graphs | 2017-04-12 | Paper |
| Dynamic range majority data structures | 2016-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3193847 | 2015-10-28 | Paper |
| Dynamic Path Counting and Reporting in Linear Space | 2015-09-11 | Paper |
| Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5260418 | 2015-06-29 | Paper |
| On minimum- and maximum-weight minimum spanning trees with neighborhoods | 2015-05-12 | Paper |
| A framework for succinct labeled ordinal trees over large alphabets | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934653 | 2014-12-18 | Paper |
| A categorization theorem on suffix arrays with applications to space efficient text indexes | 2014-10-13 | Paper |
| Succinct Indices for Path Minimum, with Applications to Path Reporting | 2014-10-08 | Paper |
| Succinct indexes for strings, binary relations and multilabeled trees | 2014-09-09 | Paper |
| Succinct ordinal trees based on tree covering | 2014-09-09 | Paper |
| Succinct geometric indexes supporting point location queries | 2014-09-09 | Paper |
| Space efficient data structures for dynamic orthogonal range counting | 2014-01-22 | Paper |
| The Distance 4-Sector of Two Points Is Unique | 2014-01-14 | Paper |
| On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods | 2013-09-13 | Paper |
| Succinct and Implicit Data Structures for Computational Geometry | 2013-09-13 | Paper |
| Range majority in constant time and linear space | 2013-06-06 | Paper |
| On the Advice Complexity of Buffer Management | 2013-03-21 | Paper |
| A Framework for Succinct Labeled Ordinal Trees over Large Alphabets | 2013-03-21 | Paper |
| A Space-Efficient Framework for Dynamic Point Location | 2013-03-21 | Paper |
| Succinct Data Structures for Path Queries | 2012-09-25 | Paper |
| Succinct representation of labeled graphs | 2012-04-26 | Paper |
| Succinct and I/O efficient data structures for traversal in trees | 2012-04-26 | Paper |
| Path Queries in Weighted Trees | 2011-12-16 | Paper |
| Dynamic Range Majority Data Structures | 2011-12-16 | Paper |
| Dynamic Range Selection in Linear Space | 2011-12-16 | Paper |
| Space Efficient Data Structures for Dynamic Orthogonal Range Counting | 2011-08-12 | Paper |
| Untangled monotonic chains and adaptive range search | 2011-07-27 | Paper |
| Range Majority in Constant Time and Linear Space | 2011-07-06 | Paper |
| I/O and Space-Efficient Path Traversal in Planar Graphs | 2009-12-17 | Paper |
| Untangled Monotonic Chains and Adaptive Range Search | 2009-12-17 | Paper |
| Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing | 2009-10-20 | Paper |
| Succinct and I/O Efficient Data Structures for Traversal in Trees | 2009-01-29 | Paper |
| Succinct Representation of Labeled Graphs | 2008-05-27 | Paper |
| Succinct Ordinal Trees Based on Tree Covering | 2007-11-28 | Paper |
