default search action
Hans Raj Tiwary
Person information
- affiliation: Charles University, Praha, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c13]Hans Raj Tiwary:
On Permuting Some Coordinates of Polytopes. ISCO 2022: 102-114 - 2021
- [i20]Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals, Hans Raj Tiwary:
Terrain prickliness: theoretical grounds for low complexity viewsheds. CoRR abs/2103.06696 (2021) - 2020
- [j21]Petr Kolman
, Martin Koutecký
Extension Complexity, MSO Logic, and Treewidth. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j20]Hans Raj Tiwary
Extension Complexity of Formal Languages. Theory Comput. Syst. 64(5): 735-753 (2020) - [j19]Hans Raj Tiwary
On the extension complexity of scheduling polytopes. Oper. Res. Lett. 48(4): 472-479 (2020) - [c12]Pawan Aurora
On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope. COCOA 2020: 334-349 - [c11]Lars Jaffke
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. MFCS 2020: 50:1-50:15 - [i19]Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary:
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. CoRR abs/2001.05583 (2020) - [i18]Pawan Aurora, Hans Raj Tiwary:
On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope. CoRR abs/2010.06401 (2020)
2010 – 2019
- 2019
- [j18]David Avis, David Bremner, Hans Raj Tiwary
Polynomial size linear programs for problems in P. Discret. Appl. Math. 265: 22-39 (2019) - [j17]David Avis, Hans Raj Tiwary
Compact linear programs for 2SAT. Eur. J. Comb. 80: 17-22 (2019) - [i17]Hans Raj Tiwary, Victor Verdugo, Andreas Wiese:
On the extension complexity of scheduling. CoRR abs/1902.10271 (2019) - 2018
- [j16]Jakub Gajarský, Petr Hlinený
Parameterized extension complexity of independent set and related problems. Discret. Appl. Math. 248: 56-67 (2018) - 2017
- [j15]Hans Raj Tiwary
Extension complexities of Cartesian products involving a pyramid. Inf. Process. Lett. 128: 11-13 (2017) - [j14]David Avis, Hans Raj Tiwary
On the ℋ-free extension complexity of the TSP. Optim. Lett. 11(3): 445-455 (2017) - [i16]Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen:
Extension complexities of Cartesian products involving a pyramid. CoRR abs/1702.01959 (2017) - [i15]David Avis, Hans Raj Tiwary:
Compact linear programs for 2SAT. CoRR abs/1702.06723 (2017) - 2016
- [c10]Petr Kolman
Extension Complexity, MSO Logic, and Treewidth . SWAT 2016: 18:1-18:14 - [i14]Hans Raj Tiwary:
Extension Complexity and Formal Languages. CoRR abs/1603.07786 (2016) - 2015
- [j13]David Avis, Hans Raj Tiwary
A generalization of extension complexity that captures P. Inf. Process. Lett. 115(6-8): 588-593 (2015) - [j12]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary
Exponential Lower Bounds for Polytopes in Combinatorial Optimization. J. ACM 62(2): 17:1-17:23 (2015) - [j11]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153(1): 75-94 (2015) - [j10]David Avis, Hans Raj Tiwary
On the extension complexity of combinatorial polytopes. Math. Program. 153(1): 95-115 (2015) - [i13]David Avis, Hans Raj Tiwary:
On the H-Free Extension Complexity of the TSP. CoRR abs/1506.08311 (2015) - [i12]Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth. CoRR abs/1507.04907 (2015) - [i11]Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary:
Parameterized Extension Complexity of Independent Set and Related Problems. CoRR abs/1511.08841 (2015) - 2014
- [j9]Nabil H. Mustafa
A proof of the Oja depth conjecture in the plane. Comput. Geom. 47(6): 668-674 (2014) - [j8]Hans Raj Tiwary
Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism. Graphs Comb. 30(3): 729-742 (2014) - [j7]Hans Raj Tiwary
On the largest convex subsets in Minkowski sums. Inf. Process. Lett. 114(8): 405-407 (2014) - [i10]David Avis, Hans Raj Tiwary:
A generalization of extension complexity that captures $P$. CoRR abs/1402.5950 (2014) - [i9]David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe:
Polynomial size linear programs for non-bipartite matching problems and other problems in P. CoRR abs/1408.0807 (2014) - 2013
- [c9]David Avis, Hans Raj Tiwary
On the Extension Complexity of Combinatorial Polytopes. ICALP (1) 2013: 57-68 - [i8]David Avis, Hans Raj Tiwary:
On the extension complexity of combinatorial polytopes. CoRR abs/1302.2340 (2013) - [i7]Samuel Fiorini, Serge Massar, Manas K. Patra, Hans Raj Tiwary:
Generalised probabilistic theories and conic extensions of polytopes. CoRR abs/1310.4125 (2013) - 2012
- [j6]Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary
Extended Formulations for Polygons. Discret. Comput. Geom. 48(3): 658-668 (2012) - [j5]Christian Knauer, Lena Schlipf, Jens M. Schmidt
Largest inscribed rectangles in convex polygons. J. Discrete Algorithms 13: 78-85 (2012) - [j4]Khaled M. Elbassioni
Complexity of approximating the vertex centroid of a polyhedron. Theor. Comput. Sci. 421: 56-61 (2012) - [c8]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols. ISCO 2012: 129-140 - [c7]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. STOC 2012: 95-106 - 2011
- [j3]Endre Boros
The negative cycles polyhedron and hardness of checking some polyhedral properties. Ann. Oper. Res. 188(1): 63-76 (2011) - [j2]Khaled M. Elbassioni
On a cone covering problem. Comput. Geom. 44(3): 129-134 (2011) - [c6]Christian Knauer, Hans Raj Tiwary
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. STACS 2011: 649-660 - [i6]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended formulations, non-negative factorizations and randomized communication protocols. CoRR abs/1105.4127 (2011) - [i5]Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary:
Extended formulations for polygons. CoRR abs/1107.0371 (2011) - [i4]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. CoRR abs/1111.0837 (2011)
2000 – 2009
- 2009
- [c5]Khaled M. Elbassioni
Complexity of Approximating the Vertex Centroid of a Polyhedron. ISAAC 2009: 413-422 - 2008
- [b1]Hans Raj Tiwary:
Complexity of some polyhedral enumeration problems. Saarland University, Germany, 2008 - [j1]Hans Raj Tiwary
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes. Discret. Comput. Geom. 40(3): 469-479 (2008) - [c4]Khaled M. Elbassioni, Hans Raj Tiwary:
On a Cone Covering Problem. CCCG 2008 - [c3]Hans Raj Tiwary
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. SCG 2008: 192-198 - [i3]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary:
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra. CoRR abs/0801.3790 (2008) - [i2]Hans Raj Tiwary:
On Computing the Shadows and Slices of Polytopes. CoRR abs/0804.4150 (2008) - [i1]Khaled M. Elbassioni, Hans Raj Tiwary:
On Computing the Vertex Centroid of a Polyhedron. CoRR abs/0806.3456 (2008) - 2007
- [c2]Hans Raj Tiwary
On the hardness of minkowski addition and related operations. SCG 2007: 306-309 - [c1]Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
On Computing the Centroid of the Vertices of an Arrangement and Related Problems. WADS 2007: 519-528
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: