Michael Hoffmann

According to our database1, Michael Hoffmann authored at least 53 papers between 1999 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Convex Hulls in Polygonal Domains.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017
Column planarity and partially-simultaneous geometric embedding.
J. Graph Algorithms Appl., 2017

Obedient Plane Drawings for Disk Intersection Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Two-Planar Graphs Are Quasiplanar.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Computing Nonsimple Polygons of Minimum Perimeter.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

The Planar Tree Packing Theorem.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Simultaneous Embeddings with Few Bends and Crossings.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Vertex-Colored Encompassing Graphs.
Graphs and Combinatorics, 2014

Editorial.
Comput. Geom., 2014

Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations.
Proceedings of the Geographic Information Science - 8th International Conference, 2014

Halving Balls in Deterministic Linear Time.
Proceedings of the Algorithms - ESA 2014, 2014

Quality Ratios of Measures for Graph Drawing Styles.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Graph Drawings with Relative Edge Length Specifications.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Interference Minimization in Asymmetric Sensor Networks.
Proceedings of the Algorithms for Sensor Systems, 2014

2013
Planar Packing of Binary Trees.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Convex hull alignment through translation.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Covering Folded Shapes.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Minimum and maximum against k lies.
Chicago J. Theor. Comput. Sci., 2012

On Universal Point Sets for Planar Graphs.
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

2011
The t-Pebbling Number is Eventually Linear in t.
Electr. J. Comb., 2011

Counting Plane Graphs: Flippability and Its Applications.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Wireless Localization within Orthogonal Polyhedra.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Pointed binary encompassing trees: Simple and optimal.
Comput. Geom., 2010

Minimum and Maximum against k Lies.
Proceedings of the Algorithm Theory, 2010

2009
Plane Graphs with Parity Constraints.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

The Euclidean degree-4 minimum spanning tree problem is NP-hard.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Convex Partitions with 2-Edge Connected Dual Graphs.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

Wireless Localization with Vertex Guards is NP-hard.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Improved Bounds for Wireless Localization.
Proceedings of the Algorithm Theory, 2008

2007
Maximizing Maximal Angles for Plane Straight-Line Graphs.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Spanning trees across axis-parallel segments.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
A simple linear algorithm for computing rectilinear 3-centers.
Comput. Geom., 2005

Pointed binary encompassing trees: Simple and optimal.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Pointed and colored binary encompassing trees.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Pointed Binary Encompassing Trees.
Proceedings of the Algorithm Theory, 2004

The Minimum Weight Triangulation Problem with Few Inner Points.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Chordless Paths Through Three Vertices.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

The Traveling Salesman Problem with Few Inner Points.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

Coloring Octrees.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Alternating paths through disjoint line segments.
Inf. Process. Lett., 2003

Pushing blocks is hard.
Comput. Geom., 2003

Degree Bounds for Constrained Pseudo-Triangulations.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Connecting points in the presence of obstacles in the plane.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Push-2-f is pspace-complete.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
An Adaptable and Extensible Geometry Kernel.
Proceedings of the Algorithm Engineering, 2001

Segment endpoint visibility graphs are hamiltonian.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Pushing blocks is np-complete for noncrossing solution paths.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Push-* is NP-hard.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
A simple linear algorithm for computing rectangle 3-centers.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999


  Loading...