| Publication | Date of Publication | Type |
|---|
| Succinct data structure for path graphs | 2024-01-18 | Paper |
| Output-size sensitiveness of OBDD construction through maximal independent set problem | 2023-12-12 | Paper |
| Enumerating Range Modes | 2023-11-14 | Paper |
| Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries | 2023-07-21 | Paper |
| Special issue on algorithms and computation (ISAAC 2021) | 2023-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874453 | 2023-02-07 | Paper |
| Succinct representation for (non)deterministic finite automata | 2022-10-13 | Paper |
| Optimal In-place Algorithms for Basic Graph Problems | 2022-10-13 | Paper |
| Succinct navigational oracles for families of intersection graphs on a circle | 2022-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092430 | 2022-07-21 | Paper |
| Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs | 2022-06-29 | Paper |
| Approximating dynamic weighted vertex cover with soft capacities | 2022-02-01 | Paper |
| Succinct representations for (non)deterministic finite automata | 2021-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009521 | 2021-08-04 | Paper |
| Approximating the Canadian traveller problem with online randomization | 2021-04-19 | Paper |
| A framework for designing space-efficient dictionaries for parameterized and order-preserving matching | 2021-01-25 | Paper |
| Compact and succinct data structures for multidimensional orthogonal range searching | 2020-07-13 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2020-05-23 | Paper |
| DenseZDD: a compact and fast index for families of sets | 2019-10-30 | Paper |
| Faster algorithms for shortest path and network flow based on graph decomposition | 2019-10-25 | Paper |
| Practical Entropy-Compressed Rank/Select Dictionary | 2019-09-11 | Paper |
| Succinct Trees in Practice | 2019-09-11 | Paper |
| Space-efficient fully dynamic DFS in undirected graphs | 2019-07-08 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2018-10-04 | Paper |
| An efficient representation of partitions of integers | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580160 | 2018-08-13 | Paper |
| Lempel-Ziv factorization powered by space efficient suffix trees | 2018-07-25 | Paper |
| Faster network algorithms based on graph decomposition | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369534 | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365049 | 2017-09-29 | Paper |
| A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs | 2017-05-05 | Paper |
| Space-Time Trade-offs for Stack-Based Algorithms | 2017-01-30 | Paper |
| Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing | 2016-09-29 | Paper |
| Fully Functional Static and Dynamic Succinct Trees | 2016-04-11 | Paper |
| Space-time trade-offs for stack-based algorithms | 2015-09-02 | Paper |
| Compressed indexes for dynamic text collections | 2015-09-02 | Paper |
| Linked dynamic tries with applications to LZ-compression in sublinear time and space | 2015-06-25 | Paper |
| Random Access to Grammar-Compressed Strings and Trees | 2015-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934640 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921649 | 2014-10-13 | Paper |
| Canadians Should Travel Randomly | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417613 | 2014-05-22 | Paper |
| Fast relative Lempel-Ziv self-index for similar sequences | 2014-04-15 | Paper |
| Fully-Online Grammar Compression | 2013-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2845521 | 2013-08-30 | Paper |
| Compressed Persistent Index for Efficient Rank/Select Queries | 2013-08-12 | Paper |
| CRAM: Compressed Random Access Memory | 2013-08-12 | Paper |
| Succinct de Bruijn Graphs | 2013-04-26 | Paper |
| Faster computation of the Robinson-Foulds distance between phylogenetic networks | 2012-10-02 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| Fast Relative Lempel-Ziv Self-index for Similar Sequences | 2012-07-16 | Paper |
| Inferring a graph from path frequency | 2012-06-18 | Paper |
| Ultra-succinct representation of ordered trees with applications | 2012-05-11 | Paper |
| Stronger Lempel-Ziv based compressed text indexing | 2012-04-26 | Paper |
| Succinct data structures for searchable partial sums with optimal worst-case performance | 2011-10-10 | Paper |
| Squeezing succinct data structures into entropy bounds | 2010-08-16 | Paper |
| Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks | 2010-07-26 | Paper |
| THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKS | 2010-06-18 | Paper |
| The hitting and cover times of Metropolis walks | 2010-04-15 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Breaking a Time-and-Space Barrier in Constructing Full-Text Indices | 2010-01-06 | Paper |
| How to Design a Linear Cover Time Random Walk on a Finite Graph | 2009-11-19 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG | 2009-06-03 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| The Balanced Edge Cover Problem | 2009-01-29 | Paper |
| An Online Algorithm for Finding the Longest Previous Factors | 2008-11-25 | Paper |
| Succinct data structures for flexible text retrieval systems | 2008-05-16 | Paper |
| Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space | 2008-04-24 | Paper |
| DNA Sequence Design by Dynamic Neighborhood Searches | 2008-04-04 | Paper |
| A Probabilistic Model of the DNA Conformational Change | 2008-04-04 | Paper |
| Compressed suffix trees with full functionality | 2007-12-19 | Paper |
| Faster suffix sorting | 2007-12-19 | Paper |
| Reducing the Space Requirement of LZ-Index | 2007-09-14 | Paper |
| A space and time efficient algorithm for constructing compressed suffix arrays | 2007-07-19 | Paper |
| Linear time algorithm for approximating a curve by a single-peaked curve | 2006-06-14 | Paper |
| Rooted maximum agreement supertrees | 2006-03-21 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| A fast, accurate, and simple method for pricing European-Asian and saving-Asian options | 2005-08-02 | Paper |
| Computing the maximum agreement of phylogenetic networks | 2005-06-10 | Paper |
| Combinatorics and algorithms for low-discrepancy roundings of a real sequence | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828936 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808661 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044507 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737696 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472515 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474085 | 2004-08-04 | Paper |
| New text indexing functionalities of the compressed suffix arrays | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425936 | 2003-09-14 | Paper |
| On-line scheduling with tight deadlines. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4419004 | 2003-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411409 | 2003-07-08 | Paper |
| Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization | 2003-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535017 | 2002-06-12 | Paper |
| Quantum Computation in Computational Geometry | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505400 | 2000-09-27 | Paper |
