![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Benjamin Nill
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j14]Sandra Di Rocco
, Christian Haase, Benjamin Nill:
A note on discrete mixed volume and Hodge-Deligne numbers. Adv. Appl. Math. 104: 1-13 (2019) - 2018
- [j13]Johannes Hofscheier, Benjamin Nill, Dennis Öberg:
On Ehrhart Polynomials of Lattice Triangles. Electron. J. Comb. 25(1): 1 (2018) - [j12]Federico Castillo, Fu Liu, Benjamin Nill, Andreas Paffenholz
:
Smooth polytopes with negative Ehrhart coefficients. J. Comb. Theory A 160: 316-331 (2018) - 2015
- [j11]Benjamin Nill, Arnau Padrol
:
The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes. Eur. J. Comb. 50: 159-179 (2015) - 2014
- [j10]Barbara Baumeister, Christian Haase, Benjamin Nill, Andreas Paffenholz
:
Polytopes associated to dihedral groups. Ars Math. Contemp. 7(1): 30-38 (2014) - 2012
- [j9]Alexander M. Kasprzyk
, Benjamin Nill:
Reflexive Polytopes of Higher Index and the Number 12. Electron. J. Comb. 19(3): 9 (2012) - [j8]Jan Draisma, Tyrrell B. McAllister, Benjamin Nill:
Lattice-Width Directions and Minkowski's 3d-Theorem. SIAM J. Discret. Math. 26(3): 1104-1107 (2012) - 2011
- [j7]Benjamin Nill, Günter M. Ziegler
:
Projecting Lattice Polytopes Without Interior Lattice Points. Math. Oper. Res. 36(3): 462-467 (2011) - 2010
- [j6]Alexander M. Kasprzyk
, Maximilian Kreuzer, Benjamin Nill:
On the combinatorial classification of toric log del Pezzo surfaces. LMS J. Comput. Math. 13: 33-46 (2010)
2000 – 2009
- 2009
- [j5]Klaus Altmann, Benjamin Nill, Sabine Schwentner, Izolda Wiercinska:
Flow polytopes and the graph of reflexive polytopes. Discret. Math. 309(16): 4992-4999 (2009) - 2008
- [j4]Christian Haase, Benjamin Nill, Andreas Paffenholz, Francisco Santos:
Lattice Points in Minkowski Sums. Electron. J. Comb. 15(1) (2008) - [j3]Benjamin Nill:
Lattice polytopes having h*-polynomials with given degree and linear coefficient. Eur. J. Comb. 29(7): 1596-1602 (2008) - [j2]Christian Haase, Benjamin Nill:
Lattices generated by skeletons of reflexive polytopes. J. Comb. Theory A 115(2): 340-344 (2008) - 2007
- [j1]Benjamin Nill:
Volume and Lattice Points of Reflexive Simplices. Discret. Comput. Geom. 37(2): 301-320 (2007)
1990 – 1999
- 1999
- [c1]Bernd Eberhardt, Hasmet Gürçay, Frank Hanisch, Tobias Hüttner, Oliver Licht, Benjamin Nill:
Books and Devices from the Old -Their Renaissance in Computer Graphics. Eurographics (Short Presentations) 1999
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint