Nicolai Hähnle

Affiliations:
  • University of Bonn, Research Institute for Discrete Mathematics
  • Ecole Polytechnique Fédérale de Lausanne (EPFL), Institute of Mathematics


According to our database1, Nicolai Hähnle authored at least 13 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Global routing on rhomboidal tiles.
Proceedings of the International Conference on Computer-Aided Design, 2019

2018
Provably Fast and Near-Optimum Gate Sizing.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018

2015
Largest Empty Square Queries in Rectilinear Polygons.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

On the Shadow Simplex Method for Curved Polyhedra.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2013
Stable Routing and Unique-Max Coloring on Trees.
SIAM J. Discret. Math., 2013

Minimizing the number of lattice points in a translated polygon.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Constructing subset partition graphs with strong adjacency and end-point count properties
CoRR, 2012

On sub-determinants and the diameter of polyhedra.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011
Covering cubes and the closest vector problem.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Testing Additive Integrality Gaps.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Diameter of Polyhedra: Limits of Abstraction.
Proceedings of the Flexible Network Design, 24.05. - 28.05.2010, 2010

Scheduling periodic tasks in a hard real-time environment.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

2009
Diameter of polyhedra: limits of abstraction.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009


  Loading...