Generalizing Geometric Graphs.
In:
Proceedings of the 19th International Symposium on Graph Drawing (GD'11), Lecture Notes in Computer Science, pages 179-190. Springer, 2012.
Joint work with Edith Brunel, Andreas Gemsa, Marcus Krug, and Dorothea Wagner.
[
html ]
Hamiltonian Orthogeodesic Alternating Paths.
In: Proceedings of the 22nd International Workshop on Combinatorial Algorithms, Lecture Notes in Computer Science. Springer, 2012.
to appear.
Joint work with Emilio Di Giacomo, Luca Grilli, Marcus Krug, and Giuseppe Liotta.
Consistent Labeling of Rotating Maps.
In:
Algorithms and Data Structures, 12th International Symposium (WADS'11), volume 6844 of
Lecture Notes in Computer Science, pages 451-462. Springer, August 2011.
Full version available at
http://arxiv.org/abs/1104.5634.
Joint work with Andreas Gemsa and Martin Nöllenburg.
Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree.
In: Proceedings of the 21st International Workshop on Combinatorial Algorithms, volume 6460 of Lecture Notes in Computer Science, pages 212-225. Springer, 2011.
Joint work with Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, and Maurizio Patrignani.
Orthogonal Graph Drawing with Flexibility Constraints.
In:
Proceedings of the 18th International Symposium on Graph Drawing (GD'10), volume 6502 of
Lecture Notes in Computer Science, pages 92-104. Springer, 2011.
Joint work with Thomas Bläsius, Marcus Krug, and Dorothea Wagner.
[
html ]
Automatic Generation of Route Sketches.
In:
Proceedings of the 18th International Symposium on Graph Drawing (GD'10), volume 6502 of
Lecture Notes in Computer Science, pages 391-392. Springer, 2011.
Poster abstract.
Joint work with Andreas Gemsa, Martin Nöllenburg, and Thomas Pajor.
[
html |
pdf ]
On d-regular Schematization of Embedded Paths.
In:
Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of
Lecture Notes in Computer Science, pages 260-271. Springer, January 2011.
Joint work with Andreas Gemsa, Martin Nöllenburg, and Thomas Pajor.
[
html |
pdf ]
Consistent Labeling of Rotating Maps.
In:
Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11), pages 171-174, 2011.
Joint work with Andreas Gemsa and Martin Nöllenburg.
[
pdf ]
Sliding Labels for Dynamic Point Labeling.
In:
Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11). University of Toronto Press, 2011.
Joint work with Andreas Gemsa and Martin Nöllenburg.
[
pdf ]
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs .
In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG'11), pages 107-116. ACM Press, 2011.
Joint work with Vít Jelínek and Jan Kratochvíl.
Connecting Two Trees with Optimal Routing Cost.
In: Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11), pages 43-47. University of Toronto Press, 2011.
Joint work with Mong-Jen Kao, Bastian Katz, Marcus Krug, D.T. Lee, Martin Nöllenburg, and Dorothea Wagner.
The Density Maximization Problem in Graphs.
In: Proceedings of the 17th Annual International Conference on Computing Combinatorics (COCOON'11), volume 6842 of Lecture Notes in Computer Science, pages 25-36. Springer, 2011.
Joint work with Mong-Jen Kao, Bastian Katz, Marcus Krug, D.T. Lee, and Dorothea Wagner.
Speed Dating: An Algorithmic Case Study Involving Matching and Scheduling.
In: Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11), volume 6630 of Lecture Notes in Computer Science, pages 292-303. Springer, 2011.
Joint work with Bastian Katz, Ben Strasser, and Dorothea Wagner.
Gateway Decompositions for Constrained Reachability Problems.
In: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of Lecture Notes in Computer Science, pages 449-461. Springer, May 2010.
Joint work with Bastian Katz, Marcus Krug, Andreas Lochbihler, Gregor Snelting, and Dorothea Wagner.
Testing Planarity of Partially Embedded Graphs.
In:
Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10), pages 202-221. SIAM, 2010.
Joint work with Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, and Maurizio Patrignani.
[
html ]
How Alexander the Great Brought the Greeks Together While Inflicting Minimal Damage to the Barbarians.
In: Proceedings of the 26th European Workshop on Computational Geometry (EuroCG'10), pages 73-76, 2010.
Joint work with Mark de Berg, Dirk Gerrits, Amirali Khosravi, Constantinos Tsirogiannis, and Alexander Wolff.
Manhattan-Geodesic Embedding of Planar Graphs.
In:
Proceedings of the 17th International Symposium on Graph Drawing (GD'09), volume 5849 of
Lecture Notes in Computer Science, pages 207-218. Springer, 2010.
Joint work with Bastian Katz, Marcus Krug, and Alexander Wolff.
[
html ]
An Algorithmic Study of Switch Graphs.
In:
Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'09), volume 5911 of
Lecture Notes in Computer Science, pages 226-237. Springer, June 2009.
Joint work with Bastian Katz and Gerhard J. Woeginger.
[
html ]
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.
In: Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09), volume 5878 of Lecture Notes in Computer Science, pages 872-881. Springer, 2009.
Joint work with Robert Franke and Dorothea Wagner.
Augmenting the connectivity of planar and geometric graphs.
In:
Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08), pages 71-74, 2008.
Joint work with Alexander Wolff.
[
pdf ]
Augmenting the connectivity of planar and geometric graphs.
In:
Topological & Geometric Graph Theory (TGGT'08), pages 55-58, 2008.
Joint work with Alexander Wolff.
[
pdf ]
Computing Large Matchings Fast.
In:
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), pages 183-192, 2008.
Joint work with Alexander Wolff.
[
pdf ]
