default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Raj Tiwary
- > Home > Persons > Hans Raj Tiwary
Publications
- 2020
[j21]Petr Kolman
, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth. Discret. Math. Theor. Comput. Sci. 22(4) (2020)- [c11]Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary:
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) - 2018
- [j16]Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary:
Parameterized extension complexity of independent set and related problems. Discret. Appl. Math. 248: 56-67 (2018) - 2017
- [j15]Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen:
Extension complexities of Cartesian products involving a pyramid. Inf. Process. Lett. 128: 11-13 (2017) - [i16]Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen:
Extension complexities of Cartesian products involving a pyramid. CoRR abs/1702.01959 (2017) - 2016
- [c10]Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth . SWAT 2016: 18:1-18:14 - 2015
- [j12]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
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) - [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) - 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) - [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, Ronald de Wolf:
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. STOC 2012: 95-106 - 2011
- [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)
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:47 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:
