Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter: Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected or a Connected Graph,
Journal of Discrete Algorithms. 14:150–172. 2012.
WP: 04, 05, IP: AP1, AP3
Vít Jelínek, Jan Kratochvíl, Ignaz Rutter: A Kuratowski-type theorem for planarity of partially embedded graphs,
Symposium on Computational Geometry 2011: 107–116. Also in CoRR abs/1204.2915 (2012).
WP: 04, IP: IP1, AP3
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter: Edge-weighted Contact Representations of Planar Graphs,
Proceedings of the 20th International Symposium on Graph Drawing (GD'12), Lecture Notes in Computer Science. 2012.
WP: 10 , IP: AP3
Thomas Bläsius, Ignaz Rutter: Disconnectivity and Relative Positions in Simultaneous Embeddings,
Proceedings of the 20th International Symposium on Graph Drawing (GD'12), Lecture Notes in Computer Science. 2012.
WP: 03, IP: AP3
Thomas Bläsius, Ignaz Rutter: Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems,
Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13). SIAM, 2013.
WP: 04, IP: AP3
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomáš Vyskočil: Extending partial representations of proper and unit interval graphs,
In preparation (2012).
WP: 10, IP: IP1, AP3
Thomas Bläsius, Stephen G. Kobourov, Ignaz Rutter: Simultaneous Embedding of Planar Graphs,
Arxiv report (2012) 1204.5853, http://arxiv.org/abs/1204.5853.
WP: 03, IP: IP2, AP3
Thomas Blasius, Ignaz Rutter: A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem,
Proceedings of the 22nd International Symposium on Graph Drawing (GD'14), Lecture Notes in Computer Science, 2014.
WP: 05, IP: AP3
Luca Grilli, Seok-Hee Hong, Jan Kratochvil, Ignaz Rutter: Drawing Simultaneously Embedded Graphs with Few Bends,
Proceedings of the 22nd International Symposium on Graph Drawing (GD'14), Lecture Notes in Computer Science, 2014.
WP: 04, IP: IP1, AP3
Martin Nollenburg, Roman Prutkin, Ignaz Rutter: Edge-weighted Contact Representations of Planar Graphs,
Journal of Graph Algorithms and Applications 17(4): 441-473, 2013.
WP: 10, IP: AP3
Pavel Klavik, Jan Kratochvil, Yota Otachi, Ignaz Rutter, Toshiki Saito, Maria Saumell, Tomas Vyskocil: Extending Partial Representations of Proper and Unit Interval Graphs,
Proceedings of the 14th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'14), Lecture Notes in Computer Science 8503: 253-264, 2014.
WP: 04, IP: IP1, AP3, ComPoSe
Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner: Generalizing Geometric Graphs,
Proceedings of the 19th International Symposium on Graph Drawing (GD'11), Lecture Notes in Computer Science, 2012.
WP: 10, IP: AP3
Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nollenburg, Ignaz Rutter, Antonis Symvonis: Many-To-One Boundary Labeling with Backbones,
Proceedings of the 21st International Symposium on Graph Drawing (GD'13), Lecture Notes in Computer Science 8242, 2013.
WP: ??, IP: AP3
Patrizio Angelini, Thomas Blasius, Ignaz Rutter: Testing Mutual Duality of Planar Graphs,
Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC'13), Lecture Notes in Computer Science 8283: 2013.
WP: ??, IP: AP3
Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, Andre Schulz, Alexander Wolff: Two-Sided Boundary Labeling with Adjacent Sides,
Proceedings of the 13th International Symposium on Algorithms and Data Structures (WADS'13), Lecture Notes in Computer Science 8037, 2013.
WP: ??, IP: AP3
Thomas Blasius, Ignaz Rutter: Disconnectivity and Relative Positions in Simultaneous Embeddings,
Proceedings of the 20th International Symposium on Graph Drawing (GD'12), Lecture Notes in Computer Science 7704: 31-42, 2013.
WP: 03, IP: AP3
Thomas Blasius, Annette Karrer, Ignaz Rutter: Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices,
Proceedings of the 21st International Symposium on Graph Drawing (GD'13), Lecture Notes in Computer Science, 8242: 220-231, 2013.
WP: 03, IP: AP3
Thomas Blasius, Ignaz Rutter: Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems,
Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13), 1030-1043, 2013.
WP: 04, IP: AP3
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vit Jelinek, Jan Kratochvil, Maurizio Patrignani, Ignaz Rutter: Testing Planarity of Partially Embedded Graphs,
Accepted to Transactions on Algorithms, 2014.
WP: 03, 04, 05, IP: IP1, AP1, AP3
Daniel Delling, Andreas Gemsa, Martin Nollenburg, Thomas Pajor, Ignaz Rutter: On d-regular Schematization of Embedded Paths,
Computational Geometry: Theory and Applications 47(3A): 381-406, 2014.
WP: ??, IP: AP3
Vit Jelínek, Jan Kratochvil, Ignaz Rutter: A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs,
Computational Geometry: Theory & Applications 46(4): 466-492, 2013.
WP: ??, IP: IP1, AP3
Tamara Mchedlidze, Martin Nollenburg, Ignaz Rutter: Drawing Planar Graphs with a Prescribed Inner Face,
Proceedings of the 21st International Symposium on Graph Drawing (GD'13), Lecture Notes in Computer Science 8242: 316-327, 2013.
WP: 04, IP: AP3
Thomas Blasius, Ignaz Rutter, Dorothea Wagner: Optimal Orthogonal Graph Drawing with Convex Bend Costs,
Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 7965: 184-195, 2013.
WP: 04, IP: AP3
Thomas Blasius, Guido Bruckner, Ignaz Rutter: Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model,
Proceedings of the 22nd European Symposium on Algorithms, Lecture Notes in Computer Science, 2014.
WP: 04, IP: AP3
Thomas Blasius, Sebastian Lehmann, Ignaz Rutter: Orthogonal Graph Drawing with Inflexible Edges,
Submitted, 2014, http://arxiv.org/abs/1404.2943.
WP: 04, IP: AP3
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph,
Journal of Discrete Algorithms 14: 150-172, 2012.
WP: 04, IP: AP3
Patrizio Angelini, Thomas Blasius, Ignaz Rutter: Testing Mutual Duality of Planar Graphs,
In 24th International Symposium on Algorithms and Computation (ISAAC'13), Lecture Notes in Computer Science 8283, pp. 350-360, 2013.
WP: 04, IP: AP1, AP3
Giordano Da Lozzo, Vět Jelěnek, Jan Kratochvěl, Ignaz Rutter: Planar Embeddings with Small and Uniform Faces,
In 25th International Symposium on Algorithms and Computation (ISAAC'14), Lecture Notes in Computer Science 8889, pp. 633-645, 2014.
WP: 04, IP: AP1, AP3