default search action
Nicolai Hähnle
Person information
- affiliation: University of Bonn, Research Institute for Discrete Mathematics
- affiliation: Ecole Polytechnique Fédérale de Lausanne (EPFL), Institute of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c9]Nicolai Hähnle, Pietro Saccardi:
Global routing on rhomboidal tiles. ICCAD 2019: 1-8 - 2018
- [j6]Siad Daboul
, Nicolai Hähnle, Stephan Held, Ulrike Schorr:
Provably Fast and Near-Optimum Gate Sizing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(12): 3163-3176 (2018) - 2016
- [j5]Daniel Dadush, Nicolai Hähnle:
On the Shadow Simplex Method for Curved Polyhedra. Discret. Comput. Geom. 56(4): 882-909 (2016) - 2015
- [c8]Daniel Dadush, Nicolai Hähnle:
On the Shadow Simplex Method for Curved Polyhedra. SoCG 2015: 345-359 - [c7]Michael Gester, Nicolai Hähnle, Jan Schneider:
Largest Empty Square Queries in Rectilinear Polygons. ICCSA (1) 2015: 267-282 - 2014
- [j4]Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On Sub-determinants and the Diameter of Polyhedra. Discret. Comput. Geom. 52(1): 102-115 (2014) - [i7]Daniel Dadush, Nicolai Hähnle:
On the Shadow Simplex Method for Curved Polyhedra. CoRR abs/1412.6705 (2014) - 2013
- [j3]Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi
Testing additive integrality gaps. Math. Program. 141(1-2): 257-271 (2013) - [j2]Nicolai Hähnle, Laura Sanità, Rico Zenklusen:
Stable Routing and Unique-Max Coloring on Trees. SIAM J. Discret. Math. 27(1): 109-125 (2013) - [c6]Friedrich Eisenbrand, Nicolai Hähnle:
Minimizing the number of lattice points in a translated polygon. SODA 2013: 1123-1130 - 2012
- [c5]Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On sub-determinants and the diameter of polyhedra. SCG 2012: 357-362 - [i6]Nicolai Hähnle:
Constructing subset partition graphs with strong adjacency and end-point count properties. CoRR abs/1203.1525 (2012) - [i5]Friedrich Eisenbrand, Nicolai Hähnle:
Minimizing the number of lattice points in a translated polygon. CoRR abs/1207.0979 (2012) - 2011
- [c4]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
Covering cubes and the closest vector problem. SCG 2011: 417-423 - [i4]Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On sub-determinants and the diameter of polyhedra. CoRR abs/1108.4272 (2011) - 2010
- [j1]Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß:
Diameter of Polyhedra: Limits of Abstraction. Math. Oper. Res. 35(4): 786-794 (2010) - [c3]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling Periodic Tasks in a Hard Real-Time Environment. ICALP (1) 2010: 299-311 - [c2]Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin:
Testing Additive Integrality Gaps. SODA 2010: 1227-1234 - [i3]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling periodic tasks in a hard real-time environment. Scheduling 2010 - [i2]Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß:
Diameter of Polyhedra: Limits of Abstraction. Flexible Network Design 2010 - [i1]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
Covering Cubes and the Closest Vector Problem. CoRR abs/1012.2289 (2010)
2000 – 2009
- 2009
- [c1]Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß:
Diameter of polyhedra: limits of abstraction. SCG 2009: 386-392
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-04-25 05:53 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: