default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaman Sanyal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Georg Loho
, Raman Sanyal:
Tropical Carathéodory with Matroids. Discret. Comput. Geom. 69(1): 139-155 (2023)- [j18]Alexander E. Black, Jesús A. De Loera, Niklas Lütjeharms, Raman Sanyal:
The Polyhedral Geometry of Pivot Rules and Monotone Paths. SIAM J. Appl. Algebra Geom. 7(3): 623-650 (2023) - [i1]Raman Sanyal, Martin Winter:
Kalai's 3d-conjecture for unconditional and locally anti-blocking polytopes. CoRR abs/2308.02909 (2023) - 2020
- [j17]Sebastian Manecke, Raman Sanyal, Jeonghoon So:
$S$-Hypersimplices, Pulling Triangulations, and Monotone paths. Electron. J. Comb. 27(3): 3 (2020) - [j16]Florian Kohl, McCabe Olsen, Raman Sanyal:
Unconditional Reflexive Polytopes. Discret. Comput. Geom. 64(2): 427-452 (2020) - [j15]Kristin Fritsch, Janin Heuer, Raman Sanyal, Nicole Schulz:
The Martin Gardner Polytopes. Am. Math. Mon. 127(7): 594-601 (2020)
2010 – 2019
- 2018
- [j14]Francesco Grande, Arnau Padrol, Raman Sanyal:
Extension Complexity and Realization Spaces of Hypersimplices. Discret. Comput. Geom. 59(3): 621-642 (2018) - [j13]Raman Sanyal, Christian Stump:
Lipschitz polytopes of posets and permutation statistics. J. Comb. Theory A 158: 605-620 (2018) - 2017
- [j12]Christian Haase, Martina Juhnke-Kubitzke, Raman Sanyal, Thorsten Theobald:
Mixed Ehrhart polynomials. Electron. J. Comb. 24(1): 1 (2017) - [j11]Laura Gellert, Raman Sanyal:
On degree sequences of undirected, directed, and bidirected graphs. Eur. J. Comb. 64: 113-124 (2017) - [j10]Francesco Grande, Raman Sanyal:
Theta rank, levelness, and matroid minors. J. Comb. Theory B 123: 1-31 (2017) - [j9]Florian Frick, Raman Sanyal:
Minkowski complexes and convex threshold dimension. J. Comb. Theory A 151: 202-206 (2017) - [j8]Thomas Chappell, Tobias Friedl, Raman Sanyal:
Two Double Poset Polytopes. SIAM J. Discret. Math. 31(4): 2378-2413 (2017) - 2015
- [j7]Tim Netzer, Raman Sanyal:
Smooth hyperbolicity cones are spectrahedral shadows. Math. Program. 153(1): 213-221 (2015) - [j6]Avinash Bhardwaj, Philipp Rostalski, Raman Sanyal:
Deciding Polyhedrality of Spectrahedra. SIAM J. Optim. 25(3): 1873-1884 (2015) - 2014
- [j5]Katharina Jochemko, Raman Sanyal:
Arithmetic of Marked Order Polytopes, Monotone Triangle Reciprocity, and Partial Colorings. SIAM J. Discret. Math. 28(3): 1540-1558 (2014) - 2010
- [j4]Raman Sanyal, Günter M. Ziegler:
Construction and Analysis of Projected Deformed Products. Discret. Comput. Geom. 43(2): 412-435 (2010)
2000 – 2009
- 2009
- [j3]Raman Sanyal, Axel Werner, Günter M. Ziegler:
On Kalai's Conjectures Concerning Centrally Symmetric Polytopes. Discret. Comput. Geom. 41(2): 183-198 (2009) - [j2]Raman Sanyal:
Topological obstructions for vertex numbers of Minkowski sums. J. Comb. Theory A 116(1): 168-179 (2009) - [j1]Bernhard Hanke, Raman Sanyal, Carsten Schultz, Günter M. Ziegler:
Combinatorial Stokes formulas via minimal resolutions. J. Comb. Theory A 116(2): 404-420 (2009)
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-10-07 22:23 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:
