| Publication | Date of Publication | Type |
|---|
| On some open problems concerning the complexity of cellular arrays | 2024-01-29 | Paper |
| Approximating shortest superstrings with constraints | 2023-01-18 | Paper |
| OMGS: optical map-based genome scaffolding | 2019-05-21 | Paper |
| On the approximation of shortest common supersequences and longest common subsequences | 2019-04-29 | Paper |
| Inclusion is undecidable for pattern languages | 2019-03-29 | Paper |
| New decidability results concerning two-way counter machines and applications | 2019-03-29 | Paper |
| On the minimum common integer partition problem | 2018-11-05 | Paper |
| Improved approximation algorithms for the maximum happy vertices and edges problems | 2018-05-18 | Paper |
| Lower bounds on learning decision lists and trees | 2017-12-04 | Paper |
| Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints | 2017-09-08 | Paper |
| Two heads are better than two tapes | 2016-09-01 | Paper |
| Aligning sequences via an evolutionary tree | 2016-09-01 | Paper |
| Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems | 2015-10-29 | Paper |
| A lower bound on the average-case complexity of shellsort | 2015-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501818 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501820 | 2015-08-14 | Paper |
| Uniformly asymptotic behavior of ruin probabilities in a time-dependent renewal risk model with stochastic return | 2015-06-02 | Paper |
| k one-way heads cannot do string-matching | 2015-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934651 | 2014-12-18 | Paper |
| An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants | 2012-04-26 | Paper |
| Beyond evolutionary trees | 2010-09-16 | Paper |
| A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops | 2010-04-26 | Paper |
| Average-case analysis of quicksort and binary insertion tree height using incompressibility | 2010-03-24 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations | 2010-01-06 | Paper |
| An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract) | 2009-10-29 | Paper |
| Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract) | 2009-07-07 | Paper |
| On the approximation of correlation clustering and consensus clustering | 2008-06-26 | Paper |
| Finding Additive Biclusters with Random Background | 2008-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457044 | 2008-04-14 | Paper |
| Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem | 2007-12-20 | Paper |
| A Parsimony Approach to Genome-Wide Ortholog Assignment | 2007-08-30 | Paper |
| Complexity and approximation of the minimum recombinant haplotype configuration problem | 2007-07-09 | Paper |
| DNA sequencing and string learning | 2007-06-11 | Paper |
| On the Minimum Common Integer Partition Problem | 2007-05-02 | Paper |
| The longest common subsequence problem for arc-annotated sequences | 2007-04-26 | Paper |
| A network flow approach to the minimum common integer partition problem | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| A further improved approximation algorithm for breakpoint graph decomposition | 2005-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829027 | 2004-11-29 | Paper |
| Selecting the branches for an evolutionary tree. | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472526 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471962 | 2004-08-03 | Paper |
| A heuristic algorithm for multiple sequence alignment based on blocks | 2004-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408109 | 2003-07-02 | Paper |
| Computing Phylogenetic Roots with Bounded Degrees and Errors | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708595 | 2003-06-18 | Paper |
| Approximation algorithms for NMR spectral peak assignment. | 2003-05-25 | Paper |
| The longest common subsequence problem for sequences with nested arc annotations. | 2003-05-14 | Paper |
| Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778572 | 2002-11-18 | Paper |
| The average‐case area of Heilbronn‐type triangles* | 2002-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766831 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535038 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941165 | 2002-01-24 | Paper |
| Aligning DNA sequences to minimize the change in protein | 2001-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723948 | 2001-07-08 | Paper |
| A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525729 | 2001-01-24 | Paper |
| On the linear-cost subtree-transfer distance between phylogenetic trees | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945794 | 2000-11-06 | Paper |
| A More Efficient Approximation Scheme for Tree Alignment | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938781 | 2000-09-10 | Paper |
| Pattern languages with and without erasing | 2000-07-04 | Paper |
| New applications of the incompressibility method. II | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952631 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938627 | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247446 | 2000-04-17 | Paper |
| Optimal Information Gathering on the Internet with Time and Cost Constraints | 2000-03-19 | Paper |
| New Applications of the Incompressibility Method | 2000-01-17 | Paper |
| Average-case analysis of algorithms using Kolmogorov complexity | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252331 | 1999-11-01 | Paper |
| On the complexity and approximation of syntenic distance | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246722 | 1999-06-16 | Paper |
| Mapping clones with a given ordering or interleaving | 1998-11-01 | Paper |
| Two heads are better than two tapes | 1998-02-17 | Paper |
| On the complexity of comparing evolutionary trees | 1997-11-25 | Paper |
| \(k\) one-way heads cannot do string-matching | 1997-11-18 | Paper |
| Rotations of Periodic Strings and Short Superstrings | 1997-10-20 | Paper |
| An approximation scheme for some Steiner tree problems in the plane | 1997-07-15 | Paper |
| Approximation algorithms for tree alignment with a given phylogeny | 1997-05-25 | Paper |
| Alignment of trees -- an alternative to tree edit | 1997-02-28 | Paper |
| On the Approximation of Shortest Common Supersequences and Longest Common Subsequences | 1997-01-02 | Paper |
| Lower bounds on learning decision lists and trees | 1996-07-03 | Paper |
| Approximating shortest superstrings with constraints | 1996-04-01 | Paper |
| New Decidability Results Concerning Two-Way Counter Machines | 1996-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840106 | 1995-09-27 | Paper |
| Decision problems for patterns | 1995-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281537 | 1994-11-13 | Paper |
| Linear approximation of shortest superstrings | 1994-11-03 | Paper |
| ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES | 1994-04-27 | Paper |
| Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata | 1994-04-05 | Paper |
| Some MAX SNP-hard results concerning unordered labeled trees | 1994-04-05 | Paper |
| Minimal NFA Problems are Hard | 1994-02-07 | Paper |
| On the complexity of learning strings and sequences | 1993-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035243 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036599 | 1993-05-18 | Paper |
| A note on shortest superstrings with flipping | 1993-05-16 | Paper |
| On Efficient Parallel Algorithms for Solving Set Recurrence Equations | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016519 | 1993-01-16 | Paper |
| A hierarchy result for 2-dimensional TM's operating in small space | 1992-09-27 | Paper |
| A characterization of exponential-time languages by alternating context- free grammars | 1992-09-27 | Paper |
| A note on the space complexity of some decision problems for finite automata | 1992-06-28 | Paper |
| Parallel parsing on a one-way linear array of finite-state machines | 1992-06-28 | Paper |
| The synchronization of nonuniform networks of finite automata | 1992-06-28 | Paper |
| THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET | 1992-06-28 | Paper |
| Learning regular languages from counterexamples | 1992-06-25 | Paper |
| Some classes of languages in \(NC^ 1\) | 1991-01-01 | Paper |
| The Power of Alternating One-Reversal Counters and Stacks | 1991-01-01 | Paper |
| Systolic algorithms for some scheduling and graph problems | 1990-01-01 | Paper |
| On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals | 1990-01-01 | Paper |
| Optimal simulation of tree arrays by linear arrays | 1989-01-01 | Paper |
| On iterative and cellular tree arrays | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355242 | 1989-01-01 | Paper |
| Relating the power of cellular arrays to their closure properties | 1988-01-01 | Paper |
| Some subclasses of context-free languages in \(NC^ 1\) | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3811706 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3769969 | 1987-01-01 | Paper |
| On One-Way Cellular Arrays | 1987-01-01 | Paper |
