Hans Raj Tiwary
Hans Raj Tiwary
Dirección de correo verificada de kam.mff.cuni.cz - Página principal
Citado por
Citado por
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
S Fiorini, S Massar, S Pokutta, HR Tiwary, R De Wolf
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
Exponential lower bounds for polytopes in combinatorial optimization
S Fiorini, S Massar, S Pokutta, HR Tiwary, RD Wolf
Journal of the ACM (JACM) 62 (2), 17, 2015
On the hardness of computing intersection, union and Minkowski sum of polytopes
HR Tiwary
Discrete & Computational Geometry 40 (3), 469-479, 2008
Extended formulations for polygons
S Fiorini, T Rothvoß, HR Tiwary
Discrete & computational geometry 48 (3), 658-668, 2012
On the extension complexity of combinatorial polytopes
D Avis, HR Tiwary
Mathematical programming 153 (1), 95-115, 2015
Extended formulations, nonnegative factorizations, and randomized communication protocols
Y Faenza, S Fiorini, R Grappe, HR Tiwary
Mathematical Programming 153 (1), 75-94, 2015
Largest inscribed rectangles in convex polygons
C Knauer, L Schlipf, JM Schmidt, HR Tiwary
Journal of discrete algorithms 13, 78-85, 2012
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems
C Knauer, HR Tiwary, D Werner
The negative cycles polyhedron and hardness of checking some polyhedral properties
E Boros, K Elbassioni, V Gurvich, HR Tiwary
Annals of Operations Research 188 (1), 63-76, 2011
Generalized probabilistic theories and conic extensions of polytopes
S Fiorini, S Massar, MK Patra, HR Tiwary
Journal of Physics A: Mathematical and Theoretical 48 (2), 025302, 2014
Linear vs. semidefinite extended formulations: exponential separation and strong bounds
S Fiorini, S Massar, S Pokutta, HR Tiwary, R de Wolf
Unpublished (Available at: http://arxiv. org/pdf/1111.0837. pdf), 2011
Extension Complexity, MSO Logic, and Treewidth
P Kolman, M Koutecký, HR Tiwary
arXiv preprint arXiv:1507.04907, 2015
On computing the shadows and slices of polytopes
HR Tiwary
Arxiv preprint arXiv:0804.4150, 2008
On the hardness of minkowski addition and related operations
HR Tiwary
Proceedings of the twenty-third annual symposium on Computational geometry …, 2007
A generalization of extension complexity that captures P
D Avis, HR Tiwary
Information Processing Letters 115 (6-8), 588-593, 2015
Complexity of some polyhedral enumeration problems
HR Tiwary
On computing the centroid of the vertices of an arrangement and related problems
D Ajwani, S Ray, R Seidel, HR Tiwary
Algorithms and Data Structures, 519-528, 2007
Parameterized extension complexity of independent set and related problems
J Gajarský, P Hliněný, HR Tiwary
Discrete Applied Mathematics 248, 56-67, 2018
On the largest convex subsets in Minkowski sums
HR Tiwary
Information Processing Letters 114 (8), 405-407, 2014
Complexity of approximating the vertex centroid of a polyhedron
K Elbassioni, HR Tiwary
Theoretical Computer Science 421, 56-61, 2012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20