| Publication | Date of Publication | Type |
|---|
Average case subquadratic exact and heuristic procedures for the traveling salesman 2-OPT neighborhood
INFORMS Journal on Computing | 2025-11-21 | Paper |
| 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
Algorithms | 2020-10-07 | Paper |
Finding the largest triangle in a graph in expected quadratic time
European Journal of Operational Research | 2020-05-27 | Paper |
Ramsey theory and integrality gap for the independent set problem
Operations Research Letters | 2018-08-27 | Paper |
Mathematical programming in computational biology: an annotated bibliography
Algorithms | 2018-08-20 | Paper |
Local search inequalities
Discrete Optimization | 2018-05-24 | Paper |
Compact extended linear programming models
EURO Advanced Tutorials on Operational Research | 2018-01-31 | Paper |
Separating sets of strings by finding matching patterns is almost always hard
Theoretical Computer Science | 2017-02-06 | Paper |
Deriving compact extended formulations via LP-based separation techniques
Annals of Operations Research | 2016-07-22 | Paper |
Estimating the strength of poker hands by integer linear programming techniques
CEJOR. Central European Journal of Operations Research | 2016-07-04 | Paper |
Algorithmic approaches for the single individual haplotyping problem
RAIRO. Operations Research | 2016-05-11 | Paper |
Mathematical models and solutions for the analysis of human genotypes
Trends in Contemporary Mathematics | 2015-10-07 | Paper |
Deriving compact extended formulations via LP-based separation techniques
4OR | 2014-12-17 | Paper |
An effective compact formulation of the max cut problem on sparse graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A set-covering approach with column generation for parsimony haplotyping
INFORMS Journal on Computing | 2012-07-28 | Paper |
Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
INFORMS Journal on Computing | 2012-06-08 | Paper |
Opportunities for combinatorial optimization in computational biology
INFORMS Journal on Computing | 2012-06-08 | Paper |
Sorting permutations by reversals through branch-and-price
INFORMS Journal on Computing | 2012-05-30 | Paper |
A time-indexed LP-based approach for min-sum job-shop problems
Annals of Operations Research | 2011-11-17 | Paper |
FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
The phasing of heterozygous traits: Algorithms and complexity
Computers & Mathematics with Applications | 2008-06-12 | Paper |
| Experimental and statistical analysis of sorting by reversals | 2008-04-14 | Paper |
| Computational molecular biology | 2006-10-17 | Paper |
A polynomial case of the parsimony haplotyping problem
Operations Research Letters | 2006-06-30 | Paper |
| scientific article; zbMATH DE number 2185635 (Why is no real title available?) | 2005-07-04 | Paper |
Polynomial and APX-hard cases of the individual haplotyping problem
Theoretical Computer Science | 2005-06-10 | Paper |
Compact optimization can outperform separation: a case study in structural proteomics
4OR | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2130513 (Why is no real title available?) | 2005-01-20 | Paper |
| scientific article; zbMATH DE number 1996453 (Why is no real title available?) | 2003-10-22 | Paper |
| scientific article; zbMATH DE number 1945152 (Why is no real title available?) | 2003-07-02 | Paper |
| scientific article; zbMATH DE number 1877046 (Why is no real title available?) | 2003-03-20 | Paper |
Compact vs. exponential-size LP relaxations
Operations Research Letters | 2002-08-28 | Paper |
Exact algorithms for minimum routing cost trees
Networks | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1301598 (Why is no real title available?) | 2002-01-03 | Paper |
| scientific article; zbMATH DE number 1445315 (Why is no real title available?) | 2001-07-04 | Paper |
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
European Journal of Operational Research | 2001-01-30 | Paper |
| scientific article; zbMATH DE number 1445280 (Why is no real title available?) | 2000-05-10 | Paper |
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1303537 (Why is no real title available?) | 2000-02-09 | Paper |
Genotyping of pooled microsatellite markers by combinatorial optimization techniques
Discrete Applied Mathematics | 1999-11-03 | Paper |
Job shop scheduling with deadlines
Journal of Combinatorial Optimization | 1998-04-13 | Paper |
