| Publication | Date of Publication | Type |
|---|
| The Chv\'atal-Sankoff problem: Understanding random string comparison through stochastic processes | 2022-12-03 | Paper |
| Bounded-length Smith-Waterman alignment | 2022-07-27 | Paper |
Fast distance multiplication of unit-Monge matrices
Algorithmica | 2015-06-25 | Paper |
Four-point conditions for the TSP: the complete complexity classification
Discrete Optimization | 2015-04-09 | Paper |
| Fast distance multiplication of unit-Monge matrices | 2014-05-22 | Paper |
Fast minimum-weight double-tree shortcutting for metric TSP, Is the best one good enough?
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Min-weight double-tree shortcutting for metric TSP: bounding the approximation ratio
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Boundary properties of graphs for algorithmic graph problems
Theoretical Computer Science | 2011-07-14 | Paper |
Towards approximate matching in compressed strings: local subsequence recognition
Computer Science – Theory and Applications | 2011-06-17 | Paper |
| String comparison by transposition networks | 2011-03-25 | Paper |
Hamiltonian cycles in subcubic graphs: what makes the problem difficult
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Faster subsequence recognition in compressed strings
Journal of Mathematical Sciences (New York) | 2010-01-15 | Paper |
Periodic String Comparison
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Semi-local longest common subsequences in subquadratic time
Journal of Discrete Algorithms | 2009-02-23 | Paper |
Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
Computational Science and Its Applications - ICCSA 2006 | 2009-02-12 | Paper |
One-Sided Monge TSP Is NP-Hard
Computational Science and Its Applications - ICCSA 2006 | 2009-02-10 | Paper |
| Efficient parallel string comparison | 2009-02-09 | Paper |
Semi-local string comparison: algorithmic techniques and applications
Mathematics in Computer Science | 2008-09-08 | Paper |
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
Experimental Algorithms | 2008-01-02 | Paper |
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Packing tripods: narrowing the density gap
Discrete Mathematics | 2007-06-26 | Paper |
All Semi-local Longest Common Subsequences in Subquadratic Time
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Communication lower bounds for distributed-memory matrix multiplication
Journal of Parallel and Distributed Computing | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2099204 (Why is no real title available?) | 2004-09-07 | Paper |
| scientific article; zbMATH DE number 2090610 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1760034 (Why is no real title available?) | 2002-11-06 | Paper |
| scientific article; zbMATH DE number 1696643 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1754593 (Why is no real title available?) | 2002-06-12 | Paper |
Bulk-synchronous parallel Gaussian elimination
Journal of Mathematical Sciences (New York) | 2002-04-14 | Paper |
Memory-efficient matrix multiplication in the BSP model
Algorithmica | 2000-09-13 | Paper |
| scientific article; zbMATH DE number 1405674 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1223727 (Why is no real title available?) | 1998-11-15 | Paper |
The bulk-synchronous parallel random access machine
Theoretical Computer Science | 1998-08-13 | Paper |
