| Publication | Date of Publication | Type |
|---|
| Proving hamiltonian properties in connected 4-regular graphs: an ILP-based approach | 2021-12-09 | Paper |
| Using integer programming to search for counterexamples: a case study | 2021-04-19 | Paper |
| Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood | 2020-12-15 | Paper |
| \texttt{FASTSET}: a fast data structure for the representation of sets of integers | 2020-10-07 | Paper |
| Finding the largest triangle in a graph in expected quadratic time | 2020-05-27 | Paper |
| Ramsey theory and integrality gap for the independent set problem | 2018-08-27 | Paper |
| Mathematical programming in computational biology: an annotated bibliography | 2018-08-20 | Paper |
| Local search inequalities | 2018-05-24 | Paper |
| Compact extended linear programming models | 2018-01-31 | Paper |
| Separating sets of strings by finding matching patterns is almost always hard | 2017-02-06 | Paper |
| Deriving compact extended formulations via LP-based separation techniques | 2016-07-22 | Paper |
| Estimating the strength of poker hands by integer linear programming techniques | 2016-07-04 | Paper |
| Algorithmic approaches for the single individual haplotyping problem | 2016-05-11 | Paper |
| Mathematical Models and Solutions for the Analysis of Human Genotypes | 2015-10-07 | Paper |
| Deriving compact extended formulations via LP-based separation techniques | 2014-12-17 | Paper |
| An effective compact formulation of the max cut problem on sparse graphs | 2013-07-23 | Paper |
| A Set-Covering Approach with Column Generation for Parsimony Haplotyping | 2012-07-28 | Paper |
| Opportunities for Combinatorial Optimization in Computational Biology | 2012-06-08 | Paper |
| Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms | 2012-06-08 | Paper |
| Sorting Permutations by Reversals Through Branch-and-Price | 2012-05-30 | Paper |
| A time-indexed LP-based approach for min-sum job-shop problems | 2011-11-17 | Paper |
| FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING | 2008-11-03 | Paper |
| The phasing of heterozygous traits: Algorithms and complexity | 2008-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457089 | 2008-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494225 | 2006-10-17 | Paper |
| A polynomial case of the parsimony haplotyping problem | 2006-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024801 | 2005-07-04 | Paper |
| Polynomial and APX-hard cases of the individual haplotyping problem | 2005-06-10 | Paper |
| Compact optimization can outperform separation: a case study in structural proteomics | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3158109 | 2005-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432402 | 2003-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408101 | 2003-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796705 | 2003-03-20 | Paper |
| Compact vs. exponential-size LP relaxations | 2002-08-28 | Paper |
| Exact algorithms for minimum routing cost trees | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246787 | 2002-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952629 | 2001-07-04 | Paper |
| Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan | 2001-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952593 | 2000-05-10 | Paper |
| A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250159 | 2000-02-09 | Paper |
| Genotyping of pooled microsatellite markers by combinatorial optimization techniques | 1999-11-03 | Paper |
| Job shop scheduling with deadlines | 1998-04-13 | Paper |
