| 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
Computational Geometry | 2024-07-23 | Paper |
| On approximate colored path counting | 2024-05-31 | Paper |
| Dynamic compact planar embeddings | 2024-05-29 | Paper |
scientific article; zbMATH DE number 7765383 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7740901 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Internal masked prefix sums and its connection to fully internal measurement queries
String Processing and Information Retrieval | 2023-08-04 | Paper |
| Data structures for categorical path counting queries | 2023-06-14 | Paper |
scientific article; zbMATH DE number 7651193 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650278 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
On Approximate Range Mode and Range Selection
(available as arXiv preprint) | 2023-02-03 | Paper |
Data structures for categorical path counting queries
Theoretical Computer Science | 2022-10-24 | Paper |
scientific article; zbMATH DE number 7561422 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Improved time and space bounds for dynamic range mode
(available as arXiv preprint) | 2021-08-04 | Paper |
Fast and compact planar embeddings
Computational Geometry | 2020-10-23 | Paper |
Tree path majority data structures
Theoretical Computer Science | 2020-08-03 | Paper |
| Path queries on functions | 2020-05-25 | Paper |
Compressed dynamic range majority and minority data structures
Algorithmica | 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
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
| Succinct geometric indexes supporting point location queries | 2019-05-06 | Paper |
Path queries on functions
Theoretical Computer Science | 2019-05-02 | Paper |
Data structures for path queries
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Dynamic path queries in linear space
Algorithmica | 2018-10-18 | Paper |
| Deletion without rebalancing in non-blocking binary search trees | 2018-07-18 | Paper |
Parallel construction of succinct trees
Theoretical Computer Science | 2017-10-17 | Paper |
Fast and compact planar embeddings
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Succinct indices for path minimum, with applications
Algorithmica | 2017-07-07 | Paper |
I/O-efficient path traversal in succinct planar graphs
Algorithmica | 2017-04-12 | Paper |
Dynamic range majority data structures
Theoretical Computer Science | 2016-09-01 | Paper |
| scientific article; zbMATH DE number 6500674 (Why is no real title available?) | 2015-10-28 | Paper |
Dynamic path counting and reporting in linear space
Algorithms and Computation | 2015-09-11 | Paper |
Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
Algorithms and Computation | 2015-09-11 | Paper |
| scientific article; zbMATH DE number 6453789 (Why is no real title available?) | 2015-06-29 | Paper |
On minimum- and maximum-weight minimum spanning trees with neighborhoods
Theory of Computing Systems | 2015-05-12 | Paper |
A framework for succinct labeled ordinal trees over large alphabets
Algorithmica | 2015-01-19 | Paper |
| Succinct indexes for strings, binary relations and multi-labeled trees | 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
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Succinct ordinal trees based on tree covering
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Space efficient data structures for dynamic orthogonal range counting
Computational Geometry | 2014-01-22 | Paper |
The Distance 4-Sector of Two Points Is Unique
Algorithms and Computation | 2014-01-14 | Paper |
On minimum-and maximum-weight minimum spanning trees with neighborhoods
Approximation and Online Algorithms | 2013-09-13 | Paper |
Succinct and Implicit Data Structures for Computational Geometry
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Range majority in constant time and linear space
Information and Computation | 2013-06-06 | Paper |
On the advice complexity of buffer management
Algorithms and Computation | 2013-03-21 | Paper |
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
Algorithms and Computation | 2013-03-21 | Paper |
A space-efficient framework for dynamic point location
Algorithms and Computation | 2013-03-21 | Paper |
Succinct Data Structures for Path Queries
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Succinct representation of labeled graphs
Algorithmica | 2012-04-26 | Paper |
Succinct and I/O efficient data structures for traversal in trees
Algorithmica | 2012-04-26 | Paper |
Path queries in weighted trees
Algorithms and Computation | 2011-12-16 | Paper |
Dynamic range majority data structures
Algorithms and Computation | 2011-12-16 | Paper |
Dynamic range selection in linear space
Algorithms and Computation | 2011-12-16 | Paper |
Space Efficient Data Structures for Dynamic Orthogonal Range Counting
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Untangled monotonic chains and adaptive range search
Theoretical Computer Science | 2011-07-27 | Paper |
Range Majority in Constant Time and Linear Space
Automata, Languages and Programming | 2011-07-06 | Paper |
I/O and space-efficient path traversal in planar graphs
Algorithms and Computation | 2009-12-17 | Paper |
Untangled monotonic chains and adaptive range search
Algorithms and Computation | 2009-12-17 | Paper |
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Succinct and I/O Efficient Data Structures for Traversal in Trees
Algorithms and Computation | 2009-01-29 | Paper |
Succinct Representation of Labeled Graphs
Algorithms and Computation | 2008-05-27 | Paper |
Succinct Ordinal Trees Based on Tree Covering
Automata, Languages and Programming | 2007-11-28 | Paper |
