Hans Raj Tiwary

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021

Terrain prickliness: theoretical grounds for low complexity viewsheds.

[BibT_eX]

[DOI]

CoRR, 2021

2020

On the extension complexity of scheduling polytopes.

[BibT_eX]

[DOI]

Victor Verdugo

Andreas Wiese

Oper. Res. Lett., 2020

Extension Complexity of Formal Languages.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Extension Complexity, MSO Logic, and Treewidth.

[BibT_eX]

[DOI]

Petr Kolman

Martin Koutecký

Mateus de Oliveira Oliveira

Discret. Math. Theor. Comput. Sci., 2020

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach.

[BibT_eX]

[DOI]

Lars Jaffke

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope.

[BibT_eX]

[DOI]

Pawan Aurora

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

Compact linear programs for 2SAT.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Polynomial size linear programs for problems in P.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On the extension complexity of scheduling.

[BibT_eX]

[DOI]

Victor Verdugo

Andreas Wiese

CoRR, 2019

2018

Parameterized extension complexity of independent set and related problems.

[BibT_eX]

[DOI]

Jakub Gajarský

Petr Hlinený

Discret. Appl. Math., 2018

2017

On the ℋ-free extension complexity of the TSP.

[BibT_eX]

[DOI]

Optim. Lett., 2017

Extension complexities of Cartesian products involving a pyramid.

[BibT_eX]

[DOI]

Stefan Weltge

Rico Zenklusen

Inf. Process. Lett., 2017

2016

Extension Complexity and Formal Languages.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Extended formulations, nonnegative factorizations, and randomized communication protocols.

[BibT_eX]

[DOI]

Math. Program., 2015

On the extension complexity of combinatorial polytopes.

[BibT_eX]

[DOI]

Math. Program., 2015

Exponential Lower Bounds for Polytopes in Combinatorial Optimization.

[BibT_eX]

[DOI]

J. ACM, 2015

A generalization of extension complexity that captures P.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

2014

On the largest convex subsets in Minkowski sums.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Polynomial size linear programs for non-bipartite matching problems and other problems in P.

[BibT_eX]

[DOI]

CoRR, 2014

A proof of the Oja depth conjecture in the plane.

[BibT_eX]

[DOI]

Nabil H. Mustafa

Daniel Werner

Comput. Geom., 2014

2013

Generalised probabilistic theories and conic extensions of polytopes.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Complexity of approximating the vertex centroid of a polyhedron.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Largest inscribed rectangles in convex polygons.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Extended Formulations for Polygons.

[BibT_eX]

[DOI]

Samuel Fiorini

Thomas Rothvoß

Discret. Comput. Geom., 2012

Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Extended formulations, non-negative factorizations and randomized communication protocols

[BibT_eX]

[DOI]

CoRR, 2011

On a cone covering problem.

[BibT_eX]

[DOI]

Comput. Geom., 2011

The negative cycles polyhedron and hardness of checking some polyhedral properties.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems.

[BibT_eX]

[DOI]

Christian Knauer

Daniel Werner

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2008

Complexity of some polyhedral enumeration problems.

[BibT_eX]

[DOI]

PhD thesis, 2008

On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

On Computing the Vertex Centroid of a Polyhedron

[BibT_eX]

[DOI]

CoRR, 2008

On Computing the Shadows and Slices of Polytopes

[BibT_eX]

[DOI]

CoRR, 2008

Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra

[BibT_eX]

[DOI]

CoRR, 2008

On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

On Computing the Centroid of the Vertices of an Arrangement and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

On the hardness of minkowski addition and related operations.

[BibT_eX]

[DOI]