| Publication | Date of Publication | Type |
|---|
Bond polytope under vertex- and edge-sums
Journal of Combinatorial Optimization | 2026-07-14 | Paper |
On permuting some coordinates of polytopes
Lecture Notes in Computer Science | 2023-08-03 | Paper |
On the complexity of some facet-defining inequalities of the QAP-polytope
(available as arXiv preprint) | 2023-03-21 | Paper |
scientific article; zbMATH DE number 7559421 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
On the extension complexity of scheduling polytopes
Operations Research Letters | 2021-04-07 | Paper |
| Extension complexity, MSO logic, and treewidth | 2021-01-05 | Paper |
Extension complexity of formal languages
Theory of Computing Systems | 2020-07-02 | Paper |
Polynomial size linear programs for problems in \textsc{P}
Discrete Applied Mathematics | 2019-07-17 | Paper |
Compact linear programs for 2SAT
European Journal of Combinatorics | 2019-07-10 | Paper |
Parameterized extension complexity of independent set and related problems
Discrete Applied Mathematics | 2018-09-17 | Paper |
Extension complexity, MSO logic, and treewidth
(available as arXiv preprint) | 2017-10-17 | Paper |
Extension complexities of Cartesian products involving a pyramid
Information Processing Letters | 2017-09-19 | Paper |
On the \({\mathcal {H}}\)-free extension complexity of the TSP
Optimization Letters | 2017-04-05 | Paper |
Exponential lower bounds for polytopes in combinatorial optimization
Journal of the ACM | 2016-03-24 | Paper |
Exponential lower bounds for polytopes in combinatorial optimization
Journal of the ACM | 2016-03-24 | Paper |
Extended formulations, nonnegative factorizations, and randomized communication protocols
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
On the extension complexity of combinatorial polytopes
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
A generalization of extension complexity that captures P
Information Processing Letters | 2015-05-21 | Paper |
Generalized probabilistic theories and conic extensions of polytopes
Journal of Physics A: Mathematical and Theoretical | 2015-02-06 | Paper |
Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Graphs and Combinatorics | 2014-06-16 | Paper |
A proof of the Oja depth conjecture in the plane
Computational Geometry | 2014-05-19 | Paper |
Linear vs. semidefinite extended formulations
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
On the largest convex subsets in Minkowski sums
Information Processing Letters | 2014-04-30 | Paper |
On the extension complexity of combinatorial polytopes
Lecture Notes in Computer Science | 2013-08-06 | 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 |
Largest inscribed rectangles in convex polygons
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Complexity of approximating the vertex centroid of a polyhedron
Theoretical Computer Science | 2012-03-13 | Paper |
| scientific article; zbMATH DE number 5999585 (Why is no real title available?) | 2012-01-23 | Paper |
The negative cycles polyhedron and hardness of checking some polyhedral properties
Annals of Operations Research | 2011-11-17 | Paper |
On a cone covering problem
Computational Geometry | 2011-01-21 | Paper |
Complexity of approximating the vertex centroid of a polyhedron
Algorithms and Computation | 2009-12-17 | Paper |
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
Lecture Notes in Computer Science | 2009-02-17 | Paper |
On the hardness of minkowski addition and related operations
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
On the hardness of computing intersection, union and Minkowski sum of polytopes
Discrete & Computational Geometry | 2008-12-02 | Paper |
