| Publication | Date of Publication | Type |
|---|
| Implicit B-trees: new results for the dictionary problem | 2026-05-29 | Paper |
On strings having the same length-k substrings
Theory of Computing Systems | 2026-04-27 | Paper |
| McDag: indexing maximal common subsequences in practice | 2026-02-13 | Paper |
| A unifying taxonomy of pattern matching in degenerate strings and founder graphs | 2026-02-13 | Paper |
Finding the cyclic covers of a string
Information Processing Letters | 2025-10-23 | Paper |
Listing maximal H-free subgraphs
Discrete Applied Mathematics | 2025-09-17 | Paper |
Enumerating graphlets with amortized time complexity independent of graph size
Algorithmica | 2025-08-29 | Paper |
| A compact DAG for storing and searching maximal common subsequences | 2025-07-24 | Paper |
Output-sensitive enumeration of maximal cliques in temporal graphs
Discrete Applied Mathematics | 2025-04-17 | Paper |
| PhyBWT: alignment-free phylogeny via eBWT positional clustering | 2024-08-13 | Paper |
| CAGE: cache-aware graphlet enumeration | 2024-05-29 | Paper |
| On strings having the same length-\(k\) substrings | 2024-05-06 | Paper |
| Polynomial-delay enumeration of maximal common subsequences | 2024-04-19 | Paper |
Refined bounds on the number of Eulerian tours in undirected graphs
Algorithmica | 2024-01-09 | Paper |
Finding the cyclic covers of a string
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
On the Complexity of String Matching for Graphs
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Longest property-preserved common factor
String Processing and Information Retrieval | 2023-07-28 | Paper |
Compressed communication complexity of longest common prefixes
String Processing and Information Retrieval | 2023-07-28 | Paper |
| Finding the Anticover of a String | 2023-02-07 | Paper |
| Finding structurally and temporally similar trajectories in graphs | 2023-02-07 | Paper |
Optimal deterministic protocols for mobile robots on a grid
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Proximity Search for Maximal Subgraph Enumeration
SIAM Journal on Computing | 2022-11-15 | Paper |
Succinct representation for (non)deterministic finite automata
Journal of Computer and System Sciences | 2022-10-13 | Paper |
| On the complexity of string matching for graphs | 2022-07-21 | Paper |
| Listing induced Steiner subgraphs as a compact way to discover Steiner trees in graphs | 2022-07-21 | Paper |
| Degenerate string comparison and applications | 2022-07-18 | Paper |
| Beyond the BEST theorem: fast assessment of Eulerian trails | 2022-05-20 | Paper |
Enumeration of maximal common subsequences between two strings
Algorithmica | 2022-03-22 | Paper |
K-plex cover pooling for graph neural networks
Data Mining and Knowledge Discovery | 2021-11-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 |
| Listing subgraphs by Cartesian decomposition | 2021-08-04 | Paper |
Round-hashing for data storage: distributed servers and external-memory tables
(available as arXiv preprint) | 2021-08-04 | Paper |
Comparing Degenerate Strings
Fundamenta Informaticae | 2021-05-20 | Paper |
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
String Processing and Information Retrieval | 2021-02-16 | Paper |
| On-line pattern matching on similar texts | 2020-05-25 | Paper |
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
Algorithmica | 2020-04-14 | Paper |
Longest property-preserved common factor: a new string-processing framework
Theoretical Computer Science | 2020-02-20 | Paper |
Longest property-preserved common factor: a new string-processing framework
Theoretical Computer Science | 2020-02-20 | Paper |
| Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs | 2020-02-12 | Paper |
Large-scale clique cover of real-world networks
Information and Computation | 2020-01-17 | Paper |
A fast discovery algorithm for large common connected induced subgraphs
Discrete Applied Mathematics | 2019-09-19 | Paper |
Nearly tight bounds on the encoding length of the Burrows-Wheeler transform
2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Fast Compressed Tries through Path Decompositions
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Optimal listing of cycles and st-paths in undirected graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
SIAM Journal on Discrete Mathematics | 2019-04-24 | Paper |
On the construction of classes of suffix trees for square matrices: algorithms and applications
Automata, Languages and Programming | 2019-01-10 | Paper |
| Tight lower bounds for the number of inclusion-minimal \(st\)-cuts | 2018-11-22 | Paper |
Asymptotically optimal encodings of range data structures for selection and top-k queries
ACM Transactions on Algorithms | 2018-11-05 | Paper |
No sorting? Better searching!
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Finding maximal common subgraphs via time-space efficient reverse search | 2018-10-04 | Paper |
New bounds for approximating extremal distances in undirected graphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Efficient splitting and merging algorithms for order decomposable problems
Automata, Languages and Programming | 2018-07-04 | Paper |
Efficient enumeration of graph orientations with sources
Discrete Applied Mathematics | 2018-06-27 | Paper |
Motif trie: an efficient text index for pattern discovery with don't cares
Theoretical Computer Science | 2018-02-16 | Paper |
On bubble generators in directed graphs
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
| Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques | 2017-12-19 | Paper |
Circular sequence comparison with q-grams
Lecture Notes in Computer Science | 2017-07-25 | Paper |
| Output-sensitive pattern extraction in sequences | 2017-04-25 | Paper |
Fast compressed tries through path decompositions
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
Directing Road Networks by Listing Strong Orientations
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Linear-size suffix tries
Theoretical Computer Science | 2016-06-16 | Paper |
Listing Acyclic Orientations of Graphs with Single and Multiple Sources
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Enumerating cyclic orientations of a graph
Lecture Notes in Computer Science | 2016-04-04 | Paper |
When indexing equals compression, experiments with compressing suffix arrays and applications
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6469201 (Why is no real title available?) | 2015-08-03 | Paper |
Computing the Burrows-Wheeler transform in place and in small space
Journal of Discrete Algorithms | 2015-05-04 | Paper |
Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
SIAM Journal on Computing | 2014-11-14 | Paper |
Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Colored Range Searching in Linear Space
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Towards optimal packed string matching
Theoretical Computer Science | 2014-03-13 | Paper |
Simple real-time constant-space string matching
Theoretical Computer Science | 2014-01-09 | Paper |
On computing the diameter of real-world undirected graphs
Theoretical Computer Science | 2013-12-11 | Paper |
Encodings for range selection and top-\(k\) queries
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Random access to high-order entropy compressed text
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Dynamic Compressed Strings with Random Access
Automata, Languages, and Programming | 2013-08-06 | Paper |
A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
Information and Computation | 2012-11-27 | Paper |
| Optimal packed string matching | 2012-08-31 | Paper |
Constant-time word-size string matching
Combinatorial Pattern Matching | 2012-08-14 | Paper |
| More haste, less waste: lowering the redundancy in fully indexable dictionaries | 2012-04-24 | Paper |
Output-sensitive listing of bounded-size trees in undirected graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Counting the orderings for multisets in consecutive ones property and PQ-trees
Developments in Language Theory | 2011-07-29 | Paper |
Simple real-time constant-space string matching
Combinatorial Pattern Matching | 2011-06-29 | Paper |
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science | 2011-06-16 | Paper |
A comparison of three algorithms for approximating the distance distribution in real-world graphs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Optimal trade-offs for succinct string indexes
Automata, Languages and Programming | 2010-09-07 | Paper |
Finding the diameter in real-world graphs. Experimentally turning a lower bound into an upper bound
Algorithms – ESA 2010 | 2010-09-06 | 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 |
Optimal worst-case operations for implicit cache-oblivious search trees.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Masking patterns in sequences: A new class of motif discovery with don't cares
Theoretical Computer Science | 2009-10-09 | Paper |
On the Size of Succinct Indices
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Amortized Rigidness in Dynamic Cartesian Trees
STACS 2006 | 2008-03-19 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Optimal implicit dictionaries over unbounded universes
Theory of Computing Systems | 2006-10-25 | Paper |
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing | 2006-06-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
The string B-tree
Journal of the ACM | 2005-01-25 | Paper |
