| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6168426 | 2023-08-08 | Paper |
| On the generation of metric TSP instances with a large integrality gap by branch-and-cut | 2023-07-24 | Paper |
| Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089174 | 2022-07-18 | Paper |
| On inequalities with bounded coefficients and pitch for the min knapsack polytope | 2022-06-09 | Paper |
| The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain | 2022-02-22 | Paper |
| High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts | 2021-03-11 | Paper |
| Ideal Membership Problem for Boolean Minority | 2020-06-29 | Paper |
| Sum-of-squares hierarchy lower bounds for symmetric formulations | 2020-06-26 | Paper |
| The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain | 2019-10-15 | Paper |
| How to Sell Hyperedges: The Hypermatching Assignment Problem | 2019-05-15 | Paper |
| Sum-of-squares rank upper bounds for matching problems | 2018-12-06 | Paper |
| Semidefinite and linear programming integrality gaps for scheduling identical machines | 2018-10-26 | Paper |
| On bounded pitch inequalities for the MIN-knapsack polytope | 2018-08-17 | Paper |
| Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. | 2017-12-19 | Paper |
| An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem | 2017-12-01 | Paper |
| High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts | 2017-08-31 | Paper |
| On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy | 2017-04-13 | Paper |
| Sum-of-Squares Rank Upper Bounds for Matching Problems | 2016-11-30 | Paper |
| Sum-of-squares hierarchy lower bounds for symmetric formulations | 2016-08-10 | Paper |
| Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines | 2016-08-10 | Paper |
| A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem | 2015-11-19 | Paper |
| On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy | 2015-10-27 | Paper |
| Hybridizations of Metaheuristics With Branch & Bound Derivates | 2015-10-09 | Paper |
| Improved Approximation for the Maximum Duo-Preservation String Mapping Problem | 2015-07-22 | Paper |
| The feedback arc set problem with triangle inequality is a vertex cover problem | 2015-01-19 | Paper |
| Bi-criteria and approximation algorithms for restricted matchings | 2014-06-06 | Paper |
| Hardness of Approximating Flow and Job Shop Scheduling Problems | 2014-02-17 | Paper |
| Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems | 2013-09-13 | Paper |
| Vertex cover in graphs with locally few colors | 2013-06-06 | Paper |
| Single machine scheduling with scenarios | 2013-04-17 | Paper |
| On the approximation of minimum cost homomorphism to bipartite graphs | 2013-03-12 | Paper |
| Constrained Matching Problems in Bipartite Graphs | 2012-11-02 | Paper |
| Approximation of Minimum Cost Homomorphisms | 2012-09-25 | Paper |
| Restricted Max-Min Fair Allocations with Inclusion-Free Intervals | 2012-09-25 | Paper |
| The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem | 2012-06-29 | Paper |
| On the approximability of single-machine scheduling with precedence constraints | 2012-05-24 | Paper |
| Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut | 2011-07-29 | Paper |
| Vertex Cover in Graphs with Locally Few Colors | 2011-07-06 | Paper |
| Minimizing the sum of weighted completion times in a concurrent open shop | 2010-12-20 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396634 | 2009-09-19 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Improved Bounds for Flow Shop Scheduling | 2009-07-14 | Paper |
| Single machine precedence constrained scheduling is a Vertex cover problem | 2009-05-06 | Paper |
| Approximating Single Machine Scheduling with Scenarios | 2008-11-27 | Paper |
| Grouping techniques for scheduling problems: simpler and faster | 2008-07-01 | Paper |
| Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem | 2008-03-11 | Paper |
| Efficient approximation schemes for scheduling problems with release dates and delivery times | 2007-12-20 | Paper |
| Scheduling with Precedence Constraints of Low Fractional Dimension | 2007-11-29 | Paper |
| Approximating Precedence-Constrained Single Machine Scheduling by Coloring | 2007-08-28 | Paper |
| A linear time approximation scheme for the single machine scheduling problem with controllable processing times | 2006-10-05 | Paper |
| Hybrid metaheuristics for the vehicle routing problem with stochastic demands | 2006-09-28 | Paper |
| Hybrid rounding techniques for knapsack problems | 2006-04-28 | Paper |
| On-line scheduling to minimize Max flow time: an optimal preemptive algorithm | 2006-02-02 | Paper |
| APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS | 2005-09-12 | Paper |
| Approximation schemes for job shop scheduling problems with controllable processing times | 2005-08-04 | Paper |
| SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS | 2005-06-22 | Paper |
| Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? | 2005-06-01 | Paper |
| Core instances for testing: a case study | 2005-06-01 | Paper |
| Approximation schemes for parallel machine scheduling problems with controllable processing times | 2004-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046477 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474225 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448360 | 2004-02-18 | Paper |
| Notes on max flow time minimization with controllable processing times | 2004-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426357 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796706 | 2003-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782747 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508364 | 2000-10-03 | Paper |
| Effective neighbourhood functions for the flexible job shop problem | 2000-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424570 | 2000-01-01 | Paper |
