| Publication | Date of Publication | Type |
|---|
Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
International Journal of Foundations of Computer Science | 2024-09-24 | Paper |
| Succinct representations of graphs (invited talk) | 2024-09-11 | Paper |
| Space-efficient data structure for posets with applications | 2024-05-27 | Paper |
| Bi-directional \(r\)-indexes | 2024-05-06 | Paper |
Succinct data structures for bounded clique-width graphs
Discrete Applied Mathematics | 2024-05-06 | Paper |
Succinct data structure for path graphs
Information and Computation | 2024-01-18 | Paper |
Output-size sensitiveness of OBDD construction through maximal independent set problem
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Enumerating Range Modes
(available as arXiv preprint) | 2023-11-14 | Paper |
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries
International Journal of Computational Geometry & Applications | 2023-07-21 | Paper |
Special issue on algorithms and computation (ISAAC 2021)
Algorithmica | 2023-06-05 | Paper |
| Storing set families more compactly with top ZDDs | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7651114 (Why is no real title available?) | 2023-02-07 | Paper |
Succinct representation for (non)deterministic finite automata
Journal of Computer and System Sciences | 2022-10-13 | Paper |
Optimal In-place Algorithms for Basic Graph Problems
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Succinct navigational oracles for families of intersection graphs on a circle
Theoretical Computer Science | 2022-10-07 | Paper |
Indexing graph search trees and applications
(available as arXiv preprint) | 2022-07-21 | Paper |
Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs
(available as arXiv preprint) | 2022-06-29 | Paper |
Approximating dynamic weighted vertex cover with soft capacities
Algorithmica | 2022-02-01 | Paper |
Succinct representations for (non)deterministic finite automata
(available as arXiv preprint) | 2021-10-04 | Paper |
| Succinct representations for (non)deterministic finite automata | 2021-10-04 | Paper |
An \(o(1)\)-approximation algorithm for dynamic weighted vertex cover with soft capacity
(available as arXiv preprint) | 2021-08-04 | Paper |
Approximating the Canadian traveller problem with online randomization
Algorithmica | 2021-04-19 | Paper |
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
Theoretical Computer Science | 2021-01-25 | Paper |
Compact and succinct data structures for multidimensional orthogonal range searching
Information and Computation | 2020-07-13 | Paper |
A linear-space data structure for range-LCP queries in poly-logarithmic time
Theoretical Computer Science | 2020-05-23 | Paper |
DenseZDD: a compact and fast index for families of sets
Algorithms | 2019-10-30 | Paper |
Faster algorithms for shortest path and network flow based on graph decomposition
Journal of Graph Algorithms and Applications | 2019-10-25 | Paper |
Succinct Trees in Practice
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Practical entropy-compressed rank/select dictionary
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Space-efficient fully dynamic DFS in undirected graphs
Algorithms | 2019-07-08 | Paper |
A linear-space data structure for range-LCP queries in poly-logarithmic time
Lecture Notes in Computer Science | 2018-10-04 | Paper |
| An efficient representation of partitions of integers | 2018-09-06 | Paper |
Compression with the tudocomp framework
(available as arXiv preprint) | 2018-08-13 | Paper |
Lempel-Ziv factorization powered by space efficient suffix trees
Algorithmica | 2018-07-25 | Paper |
| Faster network algorithms based on graph decomposition | 2018-06-15 | Paper |
| Space-efficient dictionaries for parameterized and order-preserving pattern matching | 2017-10-17 | Paper |
| Random access to grammar-compressed strings | 2017-09-29 | Paper |
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Space-time trade-offs for stack-based algorithms
(available as arXiv preprint) | 2017-01-30 | Paper |
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Fully functional static and dynamic succinct trees
ACM Transactions on Algorithms | 2016-04-11 | Paper |
Compressed indexes for dynamic text collections
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Space-time trade-offs for stack-based algorithms
Algorithmica | 2015-09-02 | Paper |
Linked dynamic tries with applications to LZ-compression in sublinear time and space
Algorithmica | 2015-06-25 | Paper |
Random access to grammar-compressed strings and trees
SIAM Journal on Computing | 2015-06-11 | Paper |
| Ultra-succinct representation of ordered trees | 2014-12-18 | Paper |
| Dynamic dictionary matching and compressed suffix trees | 2014-10-13 | Paper |
Canadians should travel randomly
Automata, Languages, and Programming | 2014-07-01 | Paper |
| Fully-functional succinct trees | 2014-05-22 | Paper |
Fast relative Lempel-Ziv self-index for similar sequences
Theoretical Computer Science | 2014-04-15 | Paper |
Fully-Online Grammar Compression
1524.68127 | 2013-10-29 | Paper |
| Computing the maximum agreement of phylogenetic networks | 2013-08-30 | Paper |
CRAM: compressed random access memory
Automata, Languages, and Programming | 2013-08-12 | Paper |
Compressed persistent index for efficient rank/select queries
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Succinct de Bruijn graphs
Lecture Notes in Computer Science | 2013-04-26 | Paper |
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Information Sciences | 2012-10-02 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Fast relative Lempel-Ziv self-index for similar sequences
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Inferring a graph from path frequency
Discrete Applied Mathematics | 2012-06-18 | Paper |
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Stronger Lempel-Ziv based compressed text indexing
Algorithmica | 2012-04-26 | Paper |
Succinct data structures for searchable partial sums with optimal worst-case performance
Theoretical Computer Science | 2011-10-10 | Paper |
Squeezing succinct data structures into entropy bounds
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Combinatorial Pattern Matching | 2010-07-26 | Paper |
The space complexity of leader election in anonymous networks
International Journal of Foundations of Computer Science | 2010-06-18 | Paper |
The hitting and cover times of Metropolis walks
Theoretical Computer Science | 2010-04-15 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Efficient algorithms for constructing a pyramid from a terrain
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Breaking a time-and-space barrier in constructing full-text indices
SIAM Journal on Computing | 2010-01-06 | Paper |
How to Design a Linear Cover Time Random Walk on a Finite Graph
Stochastic Algorithms: Foundations and Applications | 2009-11-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
Lecture Notes in Computer Science | 2009-06-03 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
The Balanced Edge Cover Problem
Algorithms and Computation | 2009-01-29 | Paper |
An Online Algorithm for Finding the Longest Previous Factors
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
DNA Sequence Design by Dynamic Neighborhood Searches
DNA Computing | 2008-04-04 | Paper |
A Probabilistic Model of the DNA Conformational Change
DNA Computing | 2008-04-04 | Paper |
Compressed suffix trees with full functionality
Theory of Computing Systems | 2007-12-19 | Paper |
Faster suffix sorting
Theoretical Computer Science | 2007-12-19 | Paper |
Reducing the Space Requirement of LZ-Index
Combinatorial Pattern Matching | 2007-09-14 | Paper |
A space and time efficient algorithm for constructing compressed suffix arrays
Algorithmica | 2007-07-19 | Paper |
Linear time algorithm for approximating a curve by a single-peaked curve
Algorithmica | 2006-06-14 | Paper |
Rooted maximum agreement supertrees
Algorithmica | 2006-03-21 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
A fast, accurate, and simple method for pricing European-Asian and saving-Asian options
Algorithmica | 2005-08-02 | Paper |
Computing the maximum agreement of phylogenetic networks
Theoretical Computer Science | 2005-06-10 | Paper |
Combinatorics and algorithms for low-discrepancy roundings of a real sequence
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2119665 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2089995 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087050 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086336 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080264 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080987 (Why is no real title available?) | 2004-08-04 | Paper |
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1979483 (Why is no real title available?) | 2003-09-14 | Paper |
On-line scheduling with tight deadlines.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1958114 (Why is no real title available?) | 2003-07-31 | Paper |
| scientific article; zbMATH DE number 1947439 (Why is no real title available?) | 2003-07-08 | Paper |
Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization
Interdisciplinary Information Sciences | 2003-04-02 | Paper |
| scientific article; zbMATH DE number 1754592 (Why is no real title available?) | 2002-06-12 | Paper |
Quantum Computation in Computational Geometry
Interdisciplinary Information Sciences | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1511712 (Why is no real title available?) | 2000-09-27 | Paper |
