| Publication | Date of Publication | Type |
|---|
| A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams | 2023-06-15 | Paper |
| A tight approximation algorithm for the cluster vertex deletion problem | 2023-03-14 | Paper |
| Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles | 2022-10-14 | Paper |
| Regular Matroids Have Polynomial Extension Complexity | 2022-05-17 | Paper |
| Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond | 2022-04-04 | Paper |
| Extended formulations for stable set polytopes of graphs without two disjoint odd cycles | 2022-03-22 | Paper |
| A tight approximation algorithm for the cluster vertex deletion problem | 2021-12-21 | Paper |
| Recognizing Cartesian products of matrices and polytopes | 2021-12-08 | Paper |
| Strengthening convex relaxations of 0/1-sets using Boolean formulas | 2021-10-20 | Paper |
| Unavoidable minors for graphs with large \(\ell_p\)-dimension | 2021-07-02 | Paper |
| Bounds on the number of 2-level polytopes, cones, and configurations | 2021-04-20 | Paper |
| The stable set problem in graphs with bounded genus and bounded odd cycle packing number | 2021-02-02 | Paper |
| Improved approximation algorithms for hitting 3-vertex paths | 2020-06-26 | Paper |
| Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank | 2020-03-12 | Paper |
| No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ | 2020-03-12 | Paper |
| Extension complexity of the correlation polytope | 2020-02-10 | Paper |
| Enumeration of 2-level polytopes | 2019-05-03 | Paper |
| Extended formulations for order polytopes through network flows | 2019-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4612478 | 2019-01-31 | Paper |
| A Tight Erdös--Pósa Function for Wheel Minors | 2018-09-14 | Paper |
| Approximability of clique transversal in perfect graphs | 2018-07-25 | Paper |
| Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607935 | 2018-03-15 | Paper |
| Extension complexity of stable set polytopes of bipartite graphs | 2018-01-04 | Paper |
| Smaller extended formulations for the spanning tree polytope of bounded-genus graphs | 2017-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969642 | 2017-03-22 | Paper |
| The Excluded Minors for Isometric Realizability in the Plane | 2017-03-16 | Paper |
| The linear extension polytope of a poset | 2017-02-14 | Paper |
| Two-Level Polytopes with a Prescribed Facet | 2016-11-30 | Paper |
| Average case polyhedral complexity of the maximum stable set problem | 2016-11-25 | Paper |
| Cut Dominants and Forbidden Minors | 2016-09-06 | Paper |
| Improved approximation algorithms for hitting 3-vertex paths | 2016-08-10 | Paper |
| Exponential Lower Bounds for Polytopes in Combinatorial Optimization | 2016-03-24 | Paper |
| Poset entropy versus number of linear extensions: the width-2 case. | 2016-03-02 | Paper |
| Enumeration of 2-level polytopes | 2015-11-19 | Paper |
| Approximation Limits of Linear Programs (Beyond Hierarchies) | 2015-11-04 | Paper |
| Extended formulations, nonnegative factorizations, and randomized communication protocols | 2015-10-14 | Paper |
| Uncapacitated flow-based extended formulations | 2015-10-14 | Paper |
| Small extended formulations for cyclic polytopes | 2015-06-26 | Paper |
| Generalized probabilistic theories and conic extensions of polytopes | 2015-02-06 | Paper |
| An efficient algorithm for partial order production | 2015-02-04 | Paper |
| A Tighter Erdős-Pósa Function for Long Cycles | 2014-10-09 | Paper |
| LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs | 2014-10-08 | Paper |
| Sorting under partial information (without the ellipsoid algorithm). | 2014-08-13 | Paper |
| Linear vs. semidefinite extended formulations | 2014-05-13 | Paper |
| The Price of Connectivity for Vertex Cover | 2014-05-02 | Paper |
| A note on the cops and robber game on graphs embedded in non-orientable surfaces | 2014-03-24 | Paper |
| Sorting under partial information (without the ellipsoid algorithm). | 2014-03-17 | Paper |
| Excluded Forest Minors and the Erdős–Pósa Property | 2014-02-24 | Paper |
| On Generalized Comparison-Based Sorting Problems | 2013-09-13 | Paper |
| The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs | 2013-04-08 | Paper |
| The representation polyhedron of a semiorder. | 2013-03-20 | Paper |
| Faster optimal algorithms for segment minimization with small maximal value | 2013-01-18 | Paper |
| Minimum entropy combinatorial optimization problems | 2012-12-07 | Paper |
| Combinatorial bounds on nonnegative rank and extended formulations | 2012-11-22 | Paper |
| Extended formulations, nonnegative factorizations, and randomized communication protocols | 2012-11-02 | Paper |
| Extended formulations for polygons | 2012-10-15 | Paper |
| Approximating the balanced minimum evolution problem | 2012-07-06 | Paper |
| Small minors in dense graphs | 2012-06-18 | Paper |
| A closest vector problem arising in radiation therapy planning | 2012-04-04 | Paper |
| Faster Optimal Algorithms for Segment Minimization with Small Maximal Value | 2011-08-12 | Paper |
| The VPN Problem with Concave Costs | 2011-06-17 | Paper |
| An Efficient Algorithm for Partial Order Production | 2011-04-04 | Paper |
| The Stackelberg minimum spanning tree game | 2011-03-02 | Paper |
| Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy | 2010-11-24 | Paper |
| Minimum Entropy Combinatorial Optimization Problems | 2010-07-28 | Paper |
| Hitting Diamonds and Growing Cacti | 2010-06-22 | Paper |
| On the feedback vertex set polytope of a series-parallel graph | 2009-08-19 | Paper |
| Minimum entropy coloring | 2009-05-04 | Paper |
| Weighted graphs defining facets: A connection between stable set and linear ordering polytopes | 2009-04-17 | Paper |
| On a theorem of Sewell and Trotter | 2009-03-04 | Paper |
| The Stackelberg Minimum Spanning Tree Game | 2009-02-17 | Paper |
| Minimum entropy orientations | 2009-01-09 | Paper |
| The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract) | 2008-12-12 | Paper |
| Tight results on minimum entropy set cover | 2008-05-27 | Paper |
| Planar graph bipartization in linear time | 2008-04-16 | Paper |
| 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets | 2007-11-16 | Paper |
| The VPN Tree Routing Conjecture for Outerplanar Networks | 2007-11-16 | Paper |
| Approximate Min-max Relations for Odd Cycles in Planar Graphs | 2007-08-30 | Paper |
| Tight Results on Minimum Entropy Set Cover | 2007-08-28 | Paper |
| On a weighted generalization of α-critical graphs | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439692 | 2007-05-29 | Paper |
| Approximate min-max relations for odd cycles in planar graphs | 2007-04-19 | Paper |
| A note on the precedence-constrained class sequencing problem | 2007-03-02 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| How to recycle your facets | 2006-10-10 | Paper |
| Facets of the linear ordering polytope: a unification for the fence family through weighted graphs | 2006-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3023981 | 2005-07-11 | Paper |
| The biorder polytope | 2005-02-25 | Paper |
| The facets and the symmetries of the approval-voting polytope | 2004-10-01 | Paper |
| Extendability of cyclic orders | 2004-03-15 | Paper |
| Weak order polytopes. | 2004-02-02 | Paper |
| Facets of linear signed order polytopes. | 2003-11-20 | Paper |
| A combinatorial study of partial order polytopes | 2003-04-02 | Paper |
| Determining the automorphism group of the linear ordering polytope | 2002-07-30 | Paper |
| Facets of the Weak Order Polytope Derived from the Induced Partition Projection | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741302 | 2001-09-23 | Paper |
