Publications (56)
The Planar Tree Packing Theorem
Markus Geyer, Michael Hoffmann, Michael Kaufmann +2
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing…
Using Multi-Label Classification for Improved Question Answering
Ricardo Usbeck, Michael Hoffmann, Michael Röder +2
A plethora of diverse approaches for question answering over RDF data have been developed in recent years. While the accuracy of these systems has increased significantly over time…
Long Plane Trees
Sergio Cabello, Michael Hoffmann, Katharina Klost +2
In the longest plane spanning tree problem, we are given a finite planar point set , and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}…
Single-Player and Two-Player Buttons & Scissors Games
Kyle Burke, Erik D. Demaine, Harrison Gregg +12
We study the computational complexity of the Buttons \& Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-compl…
Nonparametric tests for detecting breaks in the jump behaviour of a time-continuous process
Axel Bücher, Michael Hoffmann, Mathias Vetter +1
This paper is concerned with tests for changes in the jump behaviour of a time-continuous process. Based on results on weak convergence of a sequential empirical tail integral proc…
Two-Planar Graphs Are Quasiplanar
Michael Hoffmann, Csaba D. Tóth
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a…