| Publication | Date of Publication | Type |
|---|
A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion
European Journal of Combinatorics | 2024-09-30 | Paper |
Slack matrices, \(k\)-products, and 2-level polytopes
Discrete Applied Mathematics | 2024-06-20 | Paper |
A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams
Discrete Applied Mathematics | 2023-06-15 | Paper |
A tight approximation algorithm for the cluster vertex deletion problem
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Regular matroids have polynomial extension complexity
Mathematics of Operations Research | 2022-05-17 | Paper |
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
A tight approximation algorithm for the cluster vertex deletion problem
Integer Programming and Combinatorial Optimization | 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
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
Unavoidable minors for graphs with large \(\ell_p\)-dimension
Discrete & Computational Geometry | 2021-07-02 | Paper |
Bounds on the number of 2-level polytopes, cones, and configurations
Discrete & Computational Geometry | 2021-04-20 | Paper |
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A simple $(2+\epsilon)$-approximation algorithm for Split Vertex Deletion
| 2020-09-23 | Paper |
A simple 7/3-approximation algorithm for feedback vertex set in tournaments
| 2020-08-20 | Paper |
Improved approximation algorithms for hitting 3-vertex paths
Mathematical Programming. Series A. Series B | 2020-06-26 | Paper |
No small linear program approximates vertex cover within a factor \(2 -\varepsilon\)
Mathematics of Operations Research | 2020-03-12 | Paper |
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Mathematics of Operations Research | 2020-03-12 | Paper |
Extension complexity of the correlation polytope
Operations Research Letters | 2020-02-10 | Paper |
Enumeration of 2-level polytopes
Mathematical Programming Computation | 2019-05-03 | Paper |
Extended formulations for order polytopes through network flows
Journal of Mathematical Psychology | 2019-03-29 | Paper |
Small extended formulation for knapsack cover inequalities from monotone circuits
Theory of Computing | 2019-01-31 | Paper |
A tight Erdős-Pósa function for wheel minors
SIAM Journal on Discrete Mathematics | 2018-09-14 | Paper |
Approximability of clique transversal in perfect graphs
Algorithmica | 2018-07-25 | Paper |
Small extended formulation for knapsack cover inequalities from monotone circuits
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6850362 (Why is no real title available?)
| 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
Discrete & Computational Geometry | 2017-05-11 | Paper |
Average case polyhedral complexity of the maximum stable set problem
| 2017-03-22 | Paper |
The excluded minors for isometric realizability in the plane
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
The linear extension polytope of a poset
| 2017-02-14 | Paper |
Two-level polytopes with a prescribed facet
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Average case polyhedral complexity of the maximum stable set problem
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
Cut dominants and forbidden minors
SIAM Journal on Discrete Mathematics | 2016-09-06 | Paper |
Improved approximation algorithms for hitting 3-vertex paths
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Exponential lower bounds for polytopes in combinatorial optimization
Journal of the ACM | 2016-03-24 | Paper |
Poset entropy versus number of linear extensions: the width-2 case.
Order | 2016-03-02 | Paper |
Enumeration of 2-level polytopes
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Approximation Limits of Linear Programs (Beyond Hierarchies)
Mathematics of Operations Research | 2015-11-04 | Paper |
Uncapacitated flow-based extended formulations
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
Extended formulations, nonnegative factorizations, and randomized communication protocols
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
Small extended formulations for cyclic polytopes
Discrete & Computational Geometry | 2015-06-26 | Paper |
Generalized probabilistic theories and conic extensions of polytopes
Journal of Physics A: Mathematical and Theoretical | 2015-02-06 | Paper |
An efficient algorithm for partial order production
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
A tighter Erdős-Pósa function for long cycles
Journal of Graph Theory | 2014-10-09 | Paper |
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Sorting under partial information (without the ellipsoid algorithm)
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Linear vs. semidefinite extended formulations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 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
Graphs and Combinatorics | 2014-03-24 | Paper |
Sorting under partial information (without the ellipsoid algorithm).
Combinatorica | 2014-03-17 | Paper |
Excluded Forest Minors and the Erdős–Pósa Property
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
On generalized comparison-based sorting problems
Lecture Notes in Computer Science | 2013-09-13 | Paper |
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Journal of Combinatorial Optimization | 2013-04-08 | Paper |
The representation polyhedron of a semiorder.
Order | 2013-03-20 | Paper |
Faster optimal algorithms for segment minimization with small maximal value
Discrete Applied Mathematics | 2013-01-18 | Paper |
Minimum entropy combinatorial optimization problems
Theory of Computing Systems | 2012-12-07 | Paper |
Combinatorial bounds on nonnegative rank and extended formulations
Discrete Mathematics | 2012-11-22 | Paper |
Extended formulations, nonnegative factorizations, and randomized communication protocols
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Extended formulations for polygons
Discrete & Computational Geometry | 2012-10-15 | Paper |
Approximating the balanced minimum evolution problem
Operations Research Letters | 2012-07-06 | Paper |
Small minors in dense graphs
European Journal of Combinatorics | 2012-06-18 | Paper |
A closest vector problem arising in radiation therapy planning
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
Faster optimal algorithms for segment minimization with small maximal value
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The VPN Problem with Concave Costs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
An efficient algorithm for partial order production
SIAM Journal on Computing | 2011-04-04 | Paper |
The Stackelberg minimum spanning tree game
Algorithmica | 2011-03-02 | Paper |
Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
Networks | 2010-11-24 | Paper |
Minimum entropy combinatorial optimization problems
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Hitting diamonds and growing cacti
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
On the feedback vertex set polytope of a series-parallel graph
Discrete Optimization | 2009-08-19 | Paper |
Minimum entropy coloring
Journal of Combinatorial Optimization | 2009-05-04 | Paper |
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
Discrete Optimization | 2009-04-17 | Paper |
On a theorem of Sewell and Trotter
European Journal of Combinatorics | 2009-03-04 | Paper |
The Stackelberg Minimum Spanning Tree Game
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Minimum entropy orientations
Operations Research Letters | 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
Algorithmica | 2008-05-27 | Paper |
Planar graph bipartization in linear time
Discrete Applied Mathematics | 2008-04-16 | Paper |
0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
SIAM Journal on Discrete Mathematics | 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
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Tight Results on Minimum Entropy Set Cover
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
scientific article; zbMATH DE number 5158512 (Why is no real title available?)
| 2007-05-29 | Paper |
On a weighted generalization of α-critical graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Approximate min-max relations for odd cycles in planar graphs
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
A note on the precedence-constrained class sequencing problem
Discrete Applied Mathematics | 2007-03-02 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
How to recycle your facets
Discrete Optimization | 2006-10-10 | Paper |
Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
Journal of Mathematical Psychology | 2006-08-04 | Paper |
scientific article; zbMATH DE number 2186863 (Why is no real title available?)
| 2005-07-11 | Paper |
The biorder polytope
Order | 2005-02-25 | Paper |
The facets and the symmetries of the approval-voting polytope
Journal of Combinatorial Theory. Series B | 2004-10-01 | Paper |
Extendability of cyclic orders
Order | 2004-03-15 | Paper |
Weak order polytopes.
Discrete Mathematics | 2004-02-02 | Paper |
Facets of linear signed order polytopes.
Discrete Applied Mathematics | 2003-11-20 | Paper |
A combinatorial study of partial order polytopes
European Journal of Combinatorics | 2003-04-02 | Paper |
Determining the automorphism group of the linear ordering polytope
Discrete Applied Mathematics | 2002-07-30 | Paper |
Facets of the weak order polytope derived from the induced partition projection
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
Polyhedral aspects of partial orders and comparability graphs
| 2001-09-23 | Paper |
