An 8/13-approximation algorithm for the asymmetric maximum TSP
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating asymmetric maximum TSP
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Border correlation of binary words
Journal of Combinatorial Theory Series A
The greedy algorithm for shortest superstrings
Information Processing Letters
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
A multidimensional critical factorization theorem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Periodicity and unbordered words: A proof of the extended duval conjecture
Journal of the ACM (JACM)
Partial words and the critical factorization theorem revisited
Theoretical Computer Science
Why Greed Works for Shortest Common Superstring Problem
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Discrete Applied Mathematics
Why greed works for shortest common superstring problem
Theoretical Computer Science
The greedy algorithm for shortest superstrings
Information Processing Letters
Algorithms for three versions of the shortest common superstring problem
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Simple real-time constant-space string matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
DNA'06 Proceedings of the 12th international conference on DNA Computing
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Operations Research Letters
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
Theoretical Computer Science
Simple real-time constant-space string matching
Theoretical Computer Science
A probabilistic PTAS for shortest common superstring
Theoretical Computer Science
Linear computation of unbordered conjugate on unordered alphabet
Theoretical Computer Science
| Hi-index | 0.01 |