| Publication | Date of Publication | Type |
|---|
| Proven Impossible | 2023-10-30 | Paper |
| Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology | 2022-10-13 | Paper |
| Efficient solution of the matroid product problem | 2019-07-22 | Paper |
| Integer Linear Programming in Computational and Systems Biology | 2019-05-08 | Paper |
| A Sparsified Four-Russian Algorithm for RNA Folding | 2017-07-25 | Paper |
| Minimum Average Distance Clique Trees | 2015-09-23 | Paper |
| G\"odel for Goldilocks: A Rigorous, Streamlined Proof of (a variant of) G\"odel's First Incompleteness Theorem | 2014-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5169884 | 2014-07-14 | Paper |
| Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method | 2012-11-02 | Paper |
| The Fine Structure of Galls in Phylogenetic Networks | 2012-06-08 | Paper |
| Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters | 2012-03-15 | Paper |
| Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers | 2011-03-18 | Paper |
| The three-state perfect phylogeny problem reduces to 2-SAT | 2010-04-23 | Paper |
| A new recombination lower bound and the minimum perfect phylogenetic forest problem | 2009-07-13 | Paper |
| A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem | 2009-03-06 | Paper |
| Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data | 2009-03-06 | Paper |
| Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants | 2008-06-17 | Paper |
| ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations | 2008-06-17 | Paper |
| Computational Methods for SNPs and Haplotype Inference | 2007-11-28 | Paper |
| Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations | 2007-08-30 | Paper |
| An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study | 2007-04-18 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024791 | 2005-07-04 | Paper |
| Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination | 2005-05-04 | Paper |
| Linear time algorithms for finding and representing all the tandem repeats in a string | 2005-02-23 | Paper |
| Partition-distance: A problem and class of perfect graphs arising in clustering | 2002-07-14 | Paper |
| Simple and flexible detection of contiguous repeats using a suffix tree | 2002-03-03 | Paper |
| The structure and complexity of sports elimination numbers | 2002-02-28 | Paper |
| A More Efficient Approximation Scheme for Tree Alignment | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246778 | 2000-02-20 | Paper |
| Graph traversals, genes and matroids: An efficient case of the travelling salesman problem | 1999-03-22 | Paper |
| Algorithms on Strings, Trees and Sequences | 1999-02-28 | Paper |
| Improved Approximation Algorithms for Tree Alignment | 1998-09-08 | Paper |
| A Fast Algorithm for Optimally Increasing the Edge Connectivity | 1998-02-10 | Paper |
| Reconstructing a history of recombinations from a set of sequences | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128908 | 1997-04-23 | Paper |
| Faster implementation of a shortest superstring approximation | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858442 | 1995-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763431 | 1995-04-11 | Paper |
| Parametric optimization of sequence alignment | 1994-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138920 | 1994-09-20 | Paper |
| A faster parametric minimum-cut algorithm | 1994-09-11 | Paper |
| Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test | 1993-10-14 | Paper |
| Extracting maximal information about sets of minimum cuts | 1993-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694139 | 1993-06-29 | Paper |
| Efficient methods for multiple sequence alignment with guaranteed error bounds | 1993-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995616 | 1993-01-23 | Paper |
| A bounded approximation for the minimum cost 2-sat problem | 1992-09-27 | Paper |
| An efficient algorithm for the all pairs suffix-prefix problem | 1992-09-26 | Paper |
| A fast algorithm for the generalized parametric minimum cut problem and applications | 1992-06-28 | Paper |
| Computing the Strength of a Graph | 1992-06-25 | Paper |
| Efficient algorithms for generalized cut‐trees | 1992-06-25 | Paper |
| Efficient algorithms for inferring evolutionary trees | 1991-01-01 | Paper |
| Very Simple Methods for All Pairs Network Flow Analysis | 1990-01-01 | Paper |
| Parametric stable marriage and minimum cuts | 1989-01-01 | Paper |
| A Graph Theoretic Approach to Statistical Data Security | 1988-01-01 | Paper |
| The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments | 1988-01-01 | Paper |
| Every finite distributive lattice is a set of stable matchings for a small stable marriage instance | 1987-01-01 | Paper |
| Fast Algorithms for Bipartite Network Flow | 1987-01-01 | Paper |
| Optimal Mixed Graph Augmentation | 1987-01-01 | Paper |
| Three Fast Algorithms for Four Problems in Stable Marriage | 1987-01-01 | Paper |
| Equivalent approximation algorithms for node cover | 1986-01-01 | Paper |
| Matroid optimization with the interleaving of two ordered sets | 1984-01-01 | Paper |
| Bounds for naive multiple machine scheduling with release times and deadlines | 1984-01-01 | Paper |
| Connectivity and edge-disjoint spanning trees | 1983-01-01 | Paper |
| A note on Arc tolerances in sparse shortest-path and network flow problems | 1983-01-01 | Paper |
| Parametric Combinatorial Computing and a Problem of Program Module Distribution | 1983-01-01 | Paper |
| Simple Constructions for Multiterminal Network Flow Synthesis | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3895490 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907584 | 1980-01-01 | Paper |
