| Publication | Date of Publication | Type |
|---|
| Algorithms and complexity of sandwich problems in graphs (extended abstract) | 2024-01-05 | Paper |
| Interval graphs with side (and size) constraints | 2023-05-08 | Paper |
| A polynomial algorithm for balancing acyclic data flow graphs | 2018-09-14 | Paper |
| Copy-number evolution problems: complexity and algorithms | 2018-03-23 | Paper |
| A Linear-Time Algorithm for the Copy Number Transformation Problem | 2017-10-17 | Paper |
| Sorting by Cuts, Joins and Whole Chromosome Duplications | 2015-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501812 | 2015-08-14 | Paper |
| Computational problems in noisy SNP and haplotype analysis: block scores, block identification, and population stratification | 2012-06-08 | Paper |
| An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations | 2012-01-04 | Paper |
| Matching with don't-cares and a small number of mismatches | 2010-06-16 | Paper |
| Increasing the power of association studies by imputation-based sparse tag SNP selection | 2010-04-15 | Paper |
| Faster pattern matching with character classes using prime number encoding | 2009-03-02 | Paper |
| Approximation algorithms for the median problem in the breakpoint model | 2008-04-14 | Paper |
| Some Computational Challenges in Today’s Bio-medicine | 2008-03-11 | Paper |
| Improved algorithms for the random cluster graph model | 2008-01-08 | Paper |
| An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations | 2007-09-14 | Paper |
| Reconstructing Chain Functions in Genetic Networks | 2007-09-06 | Paper |
| A simpler and faster 1.5-approximation algorithm for sorting by transpositions | 2006-04-28 | Paper |
| Research in Computational Molecular Biology | 2005-11-23 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024800 | 2005-07-04 | Paper |
| Incomplete Directed Perfect Phylogeny | 2005-02-21 | Paper |
| A note on tolerance graph recognition | 2004-11-23 | Paper |
| Cluster graph modification problems | 2004-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046495 | 2004-08-12 | Paper |
| On the Generality of Phylogenies from Incomplete Directed Characters | 2004-08-12 | Paper |
| A fully dynamic algorithm for modular decomposition and recognition of cographs. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414513 | 2003-07-25 | Paper |
| A Chemical-Distance-Based Test for Positive Darwinian Selection | 2003-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542518 | 2002-08-01 | Paper |
| A clustering algorithm based on graph connectivity | 2002-07-25 | Paper |
| A Fully dynamic algorithm for recognizing and representing proper interval graphs | 2002-04-23 | Paper |
| Complexity classification of some edge modification problems | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723947 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944968 | 2001-01-14 | Paper |
| A Polynomial Approximation Algorithm for the Minimum Fill-In Problem | 2000-10-18 | Paper |
| Bounded degree interval sandwich problems | 2000-04-03 | Paper |
| A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals | 2000-03-19 | Paper |
| Faster Subtree Isomorphism | 2000-03-19 | Paper |
| Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250206 | 1999-06-17 | Paper |
| Satisfiability problems on intervals and unit intervals | 1998-07-23 | Paper |
| Realizing Interval Graphs with Size and Distance Constraints | 1998-02-09 | Paper |
| Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques | 1996-12-11 | Paper |
| Graph Sandwich Problems | 1996-05-27 | Paper |
| On the complexity of DNA physical mapping | 1994-11-23 | Paper |
| Complexity and algorithms for reasoning about time | 1994-09-11 | Paper |
| Balancing problems in acyclic networks | 1994-06-15 | Paper |
| The domatic number problem on some perfect graph families | 1994-05-19 | Paper |
| Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs | 1994-04-17 | Paper |
| Monge and feasibility sequences in general flow problems | 1994-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138912 | 1994-01-02 | Paper |
| A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio | 1993-12-06 | Paper |
| A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035172 | 1993-05-18 | Paper |
| A polynomial algorithm for an integer quadratic non-separable transportation problem | 1993-01-16 | Paper |
| Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem | 1992-06-26 | Paper |
| Minimizing the number of tardy job units under release time constraints | 1990-01-01 | Paper |
| An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem | 1989-01-01 | Paper |
| An algorithm for the detection and construction of Monge sequences | 1989-01-01 | Paper |
| The Efficiency of the Simplex Method: A Survey | 1987-01-01 | Paper |
| A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps | 1987-01-01 | Paper |
| A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only | 1986-01-01 | Paper |
