| Publication | Date of Publication | Type |
|---|
String factorization via prefix free families
| 2024-10-21 | Paper |
scientific article; zbMATH DE number 7650240 (Why is no real title available?)
| 2023-02-03 | Paper |
Pattern matching in hypertext
Lecture Notes in Computer Science | 2022-08-19 | Paper |
scientific article; zbMATH DE number 7378707 (Why is no real title available?)
| 2021-08-04 | Paper |
Orthogonal vectors indexing
| 2020-11-25 | Paper |
scientific article; zbMATH DE number 7203330 (Why is no real title available?)
| 2020-05-25 | Paper |
Can we recover the cover?
Algorithmica | 2019-05-21 | Paper |
Two-dimensional parameterized matching
ACM Transactions on Algorithms | 2018-10-30 | Paper |
How hard is it to find (honest) witnesses?
| 2018-03-02 | Paper |
On the succinct representation of equivalence classes
Algorithmica | 2017-10-09 | Paper |
Fast, precise and dynamic distance queries
| 2017-09-29 | Paper |
Conditional lower bounds for space/time tradeoffs
| 2017-09-22 | Paper |
Space-efficient string indexing for wildcard pattern matching
| 2017-03-03 | Paper |
Less space: indexing for queries with wildcards
Theoretical Computer Science | 2016-06-27 | Paper |
Two dimensional range minimum queries and Fibonacci lattices
Theoretical Computer Science | 2016-06-16 | Paper |
Efficient special cases of pattern matching with swaps
Information Processing Letters | 2016-06-09 | Paper |
Document retrieval with one wildcard
Theoretical Computer Science | 2016-05-26 | Paper |
Dynamic text and static pattern matching
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Clustered Integer 3SUM via Additive Combinatorics
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Longest common extensions in sublinear space
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Range minimum query indexes in higher dimensions
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Fast string dictionary lookup with one error
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Suffix trays and suffix trists: structures for faster text indexing
Algorithmica | 2015-07-10 | Paper |
Hypertext searching -- a survey
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Dynamic weighted ancestors
| 2014-12-18 | Paper |
Optimization problems in multiple-interval graphs
| 2014-12-18 | Paper |
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
SIAM Journal on Computing | 2014-11-14 | Paper |
Document retrieval with one wildcard
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Dotted interval graphs and high throughput genotyping
| 2014-10-13 | Paper |
Weighted ancestors in suffix trees
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Improved explicit data structures in the bitprobe model
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Dotted interval graphs
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Finding witnesses by peeling
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On hardness of jumbled indexing
Automata, Languages, and Programming | 2014-07-01 | Paper |
Quick greedy computation for minimum common string partition
Theoretical Computer Science | 2014-06-23 | Paper |
Range LCP
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Generalized substring compression
Theoretical Computer Science | 2014-03-13 | Paper |
Less space: indexing for queries with wildcards
Algorithms and Computation | 2014-01-14 | Paper |
Succinct data structures for representing equivalence classes
Algorithms and Computation | 2014-01-14 | Paper |
Orthogonal range searching for text indexing
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Finding the Minimum-Weight k-Path
Lecture Notes in Computer Science | 2013-08-12 | Paper |
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters | 2012-10-23 | Paper |
Two Dimensional Range Minimum Queries and Fibonacci Lattices
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Forbidden patterns
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
On demand string sorting over unbounded alphabets
Theoretical Computer Science | 2012-05-30 | Paper |
Range LCP
Algorithms and Computation | 2011-12-16 | Paper |
Quick greedy computation for minimum common string partitions
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Restricted common superstring and restricted common supersequence
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Dictionary matching and indexing with errors and don't cares
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Approximate parameterized matching
ACM Transactions on Algorithms | 2010-08-14 | Paper |
Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
Information Processing Letters | 2010-06-16 | Paper |
Real two dimensional scaled matching.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Dynamic text and static pattern matching.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On the longest common rigid subsequence problem
Algorithmica | 2010-02-23 | Paper |
On the longest common parameterized subsequence
Theoretical Computer Science | 2009-11-18 | Paper |
Real two dimensional scaled matching
Algorithmica | 2009-06-17 | Paper |
Suffix trays and suffix trists: structures for faster text indexing
Lecture Notes in Computer Science | 2009-03-12 | Paper |
Range Non-overlapping Indexing and Successive List Indexing
Lecture Notes in Computer Science | 2009-02-17 | Paper |
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
Approximation and Online Algorithms | 2009-02-12 | Paper |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM | 2008-12-21 | Paper |
Two-Dimensional Range Minimum Queries
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Constrained LCS: Hardness and Approximation
Combinatorial Pattern Matching | 2008-06-17 | Paper |
On the Longest Common Parameterized Subsequence
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Finding Witnesses by Peeling
Combinatorial Pattern Matching | 2008-06-17 | Paper |
On Demand String Sorting over Unbounded Alphabets
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Parameterized matching with mismatches
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Efficient one-dimensional real scaled matching
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Function Matching
SIAM Journal on Computing | 2006-06-01 | Paper |
Constructive Bounds on Ordered Factorizations
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Operations Research Letters | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
scientific article; zbMATH DE number 2185612 (Why is no real title available?)
| 2005-07-04 | Paper |
Faster algorithms for string matching with k mismatches
Journal of Algorithms | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2080211 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2079422 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2079395 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2038765 (Why is no real title available?)
| 2004-02-08 | Paper |
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Overlap matching.
Information and Computation | 2003-08-19 | Paper |
Approximate swapped matching.
Information Processing Letters | 2003-01-21 | Paper |
A faster implementation of the Goemans-Williamson clustering algorithm
| 2003-01-20 | Paper |
Alternation and bounded concurrency are reverse equivalent.
Information and Computation | 2003-01-14 | Paper |
Real scaled matching
Information Processing Letters | 2002-07-25 | Paper |
Overlap matching
| 2002-06-18 | Paper |
Approximate subset matching with don't cares
| 2002-01-30 | Paper |
Uniquely restricted matchings
Algorithmica | 2001-10-14 | Paper |
Text Indexing and Dictionary Matching with One Error
Journal of Algorithms | 2001-04-02 | Paper |
Pattern Matching with Swaps
Journal of Algorithms | 2000-12-19 | Paper |
New results on induced matchings
Discrete Applied Mathematics | 2000-12-11 | Paper |
Pattern Matching in Hypertext
Journal of Algorithms | 2000-10-04 | Paper |
scientific article; zbMATH DE number 1445379 (Why is no real title available?)
| 2000-05-10 | Paper |
scientific article; zbMATH DE number 1445381 (Why is no real title available?)
| 2000-05-10 | Paper |
Inverse Pattern Matching
Journal of Algorithms | 1997-10-20 | Paper |
