Publikationen

Buchkapitel:

2.	Thomas Bläsius, Stephen G. Kobourov und Ignaz Rutter Simultaneous Embedding of Planar Graphs In Roberto Tamassia, Editor, Handbook of Graph Drawing and Visualization Pages 349--381. Herausgeber: CRC Press, 2013
1.	Ignaz Rutter The Many Faces of Planarity -- Matching, Augmentation, and Embedding Algorithms for Planar Graphs -- In Ausgezeichnete Informatikdissertationen 2011 Band D-12 aus Lecture Notes in Informatics Pages 161--170. 2012

Artikel in Zeitschriften:

43.	Giuseppe Liotta, Ignaz Rutter und Alessandra Tappini Graph Planarity Testing with Hierarchical Embedding Constraints CoRR, abs/1904.12596 2019
42.	Thomas Bläsius, Annette Karrer und Ignaz Rutter Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices Algorithmica, 80(4):1214--1277 April 2018 DOI: 10.1007/s00453-017-0301-9
41.	Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter und Franziska Wegner Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths Journal of Computational Geometry, 9(1):24--70 2018
40.	Tamara Mchedlidze, Marcel Radermacher und Ignaz Rutter Aligned Drawings of Planar Graphs JGAA (Journal of Graph Algorithms and Applications), 22(4):401-429 2018 DOI: 10.7155/jgaa.00475
39.	Sang Won Bae, Jean-Francois Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter und Csaba D. Tóth Gap-planar graphs Theoretical Computer Science, 745:36-52 2018 DOI: 10.1016/j.tcs.2018.05.029
38.	Matthias Mnich, Ignaz Rutter und Jens M. Schmidt Linear-time recognition of map graphs with outerplanar witness Discrete Optimization, 28:63--77 2018 DOI: 10.1016/j.disopt.2017.12.002
37.	Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider und André Schulz The Partition Spanning Forest Problem CoRR, abs/1809.02710 2018
36.	Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote und Ignaz Rutter Windrose Planarity: Embedding Graphs with Direction-Constrained Edges ACM Transactions on Algorithms, 14(4):1-24 2018 DOI: 10.1145/3239561
35.	Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell und Tomás Vyskocil Extending Partial Representations of Proper and Unit Interval Graphs Algorithmica, 77(4):1071--1104 2017
34.	Martin Nöllenburg, Roman Prutkin und Ignaz Rutter Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. International Journal of Computational Geometry and Applications, 27(1--2):121--158 2017
33.	Thomas Bläsius und Ignaz Rutter A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem Theoretical Computer Science, 609:306--315 2016
32.	Andreas Gemsa, Martin Nöllenburg und Ignaz Rutter Consistent labeling of rotating maps Journal of Computational Geometry, 7(1):308--331 2016
31.	Andreas Gemsa, Martin Nöllenburg und Ignaz Rutter Evaluation of Labeling Strategies for Rotating Maps ACM Journal of Experimental Algorithmics, 21(1):1.4:1--1.4:21 2016 DOI: 10.1145/2851493
30.	Tamara Mchedlidze, Martin Nöllenburg und Ignaz Rutter Extending Convex Partial Drawings of Graphs Algorithmica, 76(1):47--67 2016 DOI: 10.1007/s00453-015-0018-6
29.	Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz und Alexander Wolff Multi-Sided Boundary Labeling Algorithmica, 76(1):225--258 2016
28.	Martin Nöllenburg, Roman Prutkin und Ignaz Rutter On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. Journal of Computational Geometry, 7(1):47--69 2016
27.	Thomas Bläsius, Ignaz Rutter und Dorothea Wagner Optimal Orthogonal Graph Drawing with Convex Bend Costs ACM Transactions on Algorithms, 12(3):33:1--33:30 2016
26.	Thomas Bläsius, Sebastian Lehmann und Ignaz Rutter Orthogonal Graph Drawing with Inflexible Edges Computational Geometry: Theory and Applications, 55:26--40 2016 DOI: 10.1016/j.comgeo.2016.03.001
25.	Reinhard Bauer, Tobias Columbus, Ignaz Rutter und Dorothea Wagner Search-space size in contraction hierarchies Theoretical Computer Science, 645:112--127 2016
24.	Thomas Bläsius und Ignaz Rutter Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems ACM Transactions on Algorithms, 12(2):16 2016
23.	Thomas Bläsius und Ignaz Rutter Disconnectivity and relative positions in simultaneous embeddings Computational Geometry: Theory and Applications, 48(6):459--478 2015
22.	Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter und Antonios Symvonis Many-to-One Boundary Labeling with Backbones Journal of Graph Algorithms and Applications, 19(3):761--778 2015
21.	Jian-Jia Chen, Mong-Jen Kao, D.T. Lee, Ignaz Rutter und Dorothea Wagner Online Dynamic Power Management with Hard Real-Time Guarantees Theoretical Computer Science, 595:46--64 2015
20.	Tanja Hartmann, Jonathan Rollin und Ignaz Rutter Regular Augmentation of Planar Graphs Algorithmica, 73(2):306--370 2015
19.	Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani und Ignaz Rutter Testing Planarity of Partially Embedded Graphs ACM Transactions on Algorithms, 11(4):32 2015
18.	Gregor Betz, Andreas Gemsa, Christof Mathies, Ignaz Rutter und Dorothea Wagner Column-Based Graph Layouts Journal of Graph Algorithms and Applications, 18(5):677--708 2014
17.	Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter und Dorothea Wagner Generalizing Geometric Graphs Journal of Graph Algorithms and Applications, 18(1):35--76 2014
16.	Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor und Ignaz Rutter On d-regular Schematization of Embedded Paths Computational Geometry: Theory and Applications, 47(3A):381--406 2014
15.	Thomas Bläsius, Marcus Krug, Ignaz Rutter und Dorothea Wagner Orthogonal Graph Drawing with Flexibility Constraints Algorithmica, 68(4):859--885 2014
14.	Patrizio Angelini, Thomas Bläsius und Ignaz Rutter Testing Mutual Duality of Planar Graphs International Journal of Computational Geometry and Applications, 24(4):325--346 2014
13.	Vít Jelínek, Jan Kratochvíl und Ignaz Rutter A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs Computational Geometry: Theory and Applications, 46(4):466--492 2013
12.	Michel Boyer, Sif El Harti, Amal El Ouarari, Robert Ganian, Tomas Gavenciak, Gena Hahn, Carsten Moldenauer, Ignaz Rutter, Benoit Theriault und Martin Vatshelle Cops-and-robbers: remarks and problems Journal of Combinatorial Mathematics and Combinatorial Computing, 85:141--159 2013
11.	Martin Nöllenburg, Roman Prutkin und Ignaz Rutter Edge-weighted contact representations of planar graphs Journal of Graph Algorithms and Applications, 17(4):441--473 2013
10.	Maria Axenovich, Marcus Krug, Georg Osang und Ignaz Rutter Fork-forests in bi-colored complete bipartite graphs Discrete Applied Mathematics, 161(10--11):1363--1366 2013
9.	Reinhard Bauer, Moritz Baum, Ignaz Rutter und Dorothea Wagner On the Complexity of Partitioning Graphs for Arc-Flags Journal of Graph Algorithms and Applications, 17(3):265--299 2013
8.	Mong-Jen Kao, Bastian Katz, Marcus Krug, D.T. Lee, Ignaz Rutter und Dorothea Wagner The Density Maximization Problem in Graphs Journal of Combinatorial Optimization, 26(4):723--754 2013
7.	Bastian Katz, Ignaz Rutter und Gerhard J. Woeginger An algorithmic study of switch graphs Acta Informatica, 49(5):295--312 2012
6.	Ignaz Rutter und Alexander Wolff Augmenting the Connectivity of Planar and Geometric Graphs Journal of Graph Algorithms and Applications, 16(2):599--628 2012
5.	Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta und Ignaz Rutter Hamiltonian orthogeodesic alternating paths Journal of Discrete Algorithms, 16:34--52 2012
4.	Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani und 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
3.	Ignaz Rutter und Alexander Wolff Computing Large Matchings Fast ACM Transactions on Algorithms, 7(1) 2010
2.	Robert Franke, Ignaz Rutter und Dorothea Wagner Computing Large Matchings in Planar Graphs with Fixed Minimum Degree Theoretical Computer Science, 412(32):4092--4099 2010
1.	Ignaz Rutter und Alexander Wolff Augmenting the Connectivity of Planar and Geometric Graphs Electronic Notes in Discrete Mathematics, 31:53--56 2008

Artikel in Tagungsbänden:

79.	Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter und Nina Zimbel Drawing Clustered Graphs on Disk Arrangements In Partha Sarathi Mandal Gautam K. Das, Editor, WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 Band 11355 aus Lecture Notes in Computer Science , Seite 160-171. Herausgeber: Springer Verlag, 2019 ISBN: ISBN 978-3-030-10563-1
78.	Banjamin Niedermann, Ignaz Rutter und Matthias Wolf Efficient Algorithms for Ortho-Radial Graph Drawing 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA. LIPIcs 129, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2019 Band 53 aus SoCG 2019 , Seite 53:1-53:14. 2019 ISBN: ISBN 978-3-95977-104-7
77.	Marcel Radermacher, Klara Reichard, Ignaz Rutter und Dorothea Wagner A Geometric Heuristic for Rectilinear Crossing Minimization Proceedings of the 20th Meeting on Algorithm Engineering and Experiments (ALENEX'18) , Seite 129--138. Herausgeber: SIAM, 2018
76.	Marcel Radermacher und Ignaz Rutter Inserting an Edge into a Geometric Embedding In Therese C. Biedl und Andreas Kerren, Editor, Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings Band Lecture Notes in Computer Science aus 11282 , Seite 402--415. Herausgeber: Springer, 2018 DOI: 10.1007/978-3-030-04414-5\_29 ISBN: 978-3-030-04413-8
75.	Guido Brückner, Ignaz Rutter und Peter Stumpf Level Planarity: Transitivity vs. Even Crossings In Therese C. Biedl und Andreas Kerren, Editor, Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings Band 11282 aus Lecture Notes in Computer Science , Seite 39--52. Herausgeber: Springer, 2018 DOI: 10.1007/978-3-030-04414-5\_3 ISBN: 978-3-030-04413-8
74.	Michael Vollmer, Ignaz Rutter und Klemens Böhm On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data In Reinhard Pichler Michael H. Böhlen und Katja Hose, Editor, Proceedings of the 21th International Conference on Extending Database Technology, EDBT 2018, Vienna, Austria, March 26-29, 2018. Band EDBT , Seite 49--60. Herausgeber: OpenProceedings.org, 2018 DOI: 10.5441/002/edbt.2018.06
73.	Alban Grastien, Ignaz Rutter, Dorothea Wagner, Franziska Wegner und Matthias Wolf The Maximum Transmission Switching Flow Problem Proceeding: e-Energy '18 Proceedings of the Ninth International Conference on Future Energy Systems , Seite 340-360. 2018 DOI: 10.1145/3208903.3208910
72.	Giordano Da Lozzo und Ignaz Rutter Approximation Algorithms for Facial Cycles in Planar Embeddings In Wen-Lian Hsu und Chung-Shou Liao, Editor, Proceedings of the 29th International Symposium on Algorithms and Computation Band 123 aus LIPIcs , Seite 41:1--41:13. Herausgeber: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018 ISBN: 978-3-95977-094-1 akzeptiert http://www.dagstuhl.de/dagpub/978-3-95977-094-1
71.	Guido Brückner, Ignaz Rutter und Peter Stumpf Level Planarity: Transitivity vs. Even Crossings In Andreas Kerren Therese Biedl, Editor, Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD'18) aus Lecture Notes in Computer Science Herausgeber: Springer, 2018 akzeptiert
70.	Sebastian Lehmann, Ignaz Rutter, Dorothea Wagner und Franziska Wegner A Simulated-Annealing-Based Approach for Wind Farm Cabling Proceedings of the 8th ACM e-Energy International Conference on Future Energy Systems (ACM eEnergy'17) , Seite 203--215. Herausgeber: ACM Press, 2017
69.	Tamara Mchedlidze, Marcel Radermacher und Ignaz Rutter Aligned Drawings of Planar Graphs Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG'17) 2017
68.	Tamara Mchedlidze, Marcel Radermacher und Ignaz Rutter Aligned Drawings of Planar Graphs In Fabrizio Frati und Kwan-Liu Ma, Editor, Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17) aus Lecture Notes in Computer Science , Seite 3--16. Herausgeber: Springer, 2017
67.	Thomas Bläsius, Marcel Radermacher und Ignaz Rutter How to Draw a Planarization In Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey und Tiziana Margaria, Editor, Proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'17) aus Lecture Notes in Computer Science , Seite 295--308. Herausgeber: Springer, 2017
66.	Guido Brückner und Ignaz Rutter Partial and Constrained Level Planarity Proceedings of the 28th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'17) , Seite 2000--2011. Herausgeber: SIAM, 2017
65.	Benjamin Niedermann, Martin Nöllenburg und Ignaz Rutter Radial Contour Labeling with Straight Leaders Proceedings of IEEE Pacific Visualization Symposium (PacificVis'17) , Seite 295--304. Herausgeber: IEEE Computer Society, 2017 DOI: 10.1109/PACIFICVIS.2017.8031608
64.	Benjamin Niedermann, Martin Nöllenburg und Ignaz Rutter Radial Contour Labeling with Straight Leaders Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG'17) 2017
63.	Lukas Barth, Benjamin Niedermann, Ignaz Rutter und Matthias Wolf Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings Proceedings of the 33rd Annual ACM Symposium on Computational Geometry (SoCG'17) Band 77 aus Leibniz International Proceedings in Informatics , Seite 14:1--14:16. 2017 DOI: 10.4230/LIPIcs.SoCG.2017.14 ISBN: 978-3-95977-038-5
62.	Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani und Ignaz Rutter Beyond Level Planarity Proceedings of the 24th International Symposium on Graph Drawing (GD'16) aus Lecture Notes in Computer Science , Seite 482--495. Herausgeber: Springer, 2016
61.	Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter und Franziska Wegner Computing Minimum-Link Separating Polygons in Practice Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG'16) 2016
60.	Matthias Mnich, Ignaz Rutter und Jens M. Schmidt Linear-Time Recognition of Map Graphs with Outerplanar Witness In Rasmus Pagh, Editor, Proceedings of the 15th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'16) Band 53 aus Leibniz International Proceedings in Informatics (LIPIcs) Herausgeber: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016 DOI: 10.4230/LIPIcs.SWAT.2016.5
59.	Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter und Franziska Wegner Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths Proceedings of the 24th Annual European Symposium on Algorithms (ESA'16) Band 57 aus Leibniz International Proceedings in Informatics , Seite 7:1--7:18. Herausgeber: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016 DOI: 10.4230/LIPIcs.ESA.2016.7
58.	Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp und Ignaz Rutter Simultaneous Orthogonal Planarity Proceedings of the 24th International Symposium on Graph Drawing (GD'16) aus Lecture Notes in Computer Science , Seite 532--545. Herausgeber: Springer, 2016
57.	Martin Nöllenburg, Ignaz Rutter und Alfred Schuhmacher Software Visualization via Hierarchic Micro/Macro Layouts Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP '16) -- Volume 2: IVAPP , Seite 155--162. 2016
56.	Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote und Ignaz Rutter Windrose Planarity: Embedding Graphs with Direction-Constrained Edges Proceedings of the 27th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'16) , Seite 306--315. Herausgeber: SIAM, 2016 DOI: 10.1137/1.9781611974331.ch70
55.	Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani und Ignaz Rutter Intersection-Link Representations of Graphs In Emilio Di Giacomo und Anna Lubiw, Editor, Proceedings of the 23rd International Symposium on Graph Drawing (GD'15) aus Lecture Notes in Computer Science , Seite 217--230. Herausgeber: Springer, 2015
54.	Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner und Franziska Wegner Operating Power Grids with few Flow Control Buses Proceedings of the 6th ACM e-Energy International Conference on Future Energy Systems , Seite 289--294. Herausgeber: ACM Press, 2015
53.	Sebastian Buchwald, Manuel Mohr und Ignaz Rutter Optimal Shuffle Code with Permutation Instructions In Frank Dehne, Jörg-Rüdiger Sack und Ulrike Stege, Editor, Algorithms and Data Structures, 14th International Symposium (WADS'15) aus Lecture Notes in Computer Science , Seite 528--541. Herausgeber: Springer, 2015 DOI: 10.1007/978-3-319-21840-3_44
52.	Thomas Bläsius, Sebastian Lehmann und Ignaz Rutter Orthogonal Graph Drawing with Inflexible Edges In Peter Widmayer, Editor, Proceedings of the 9th Conference on Algorithms and Complexity (CIAC'15) Band 9079 aus Lecture Notes in Computer Science , Seite 61--73. Herausgeber: Springer, 2015 DOI: 10.1007/978-3-319-18173-8_4
51.	Martin Nöllenburg, Roman Prutkin und Ignaz Rutter Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC'15) aus Lecture Notes in Computer Science , Seite 637--649. Herausgeber: Springer, 2015
50.	Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt und Alexander Wolff Pixel and Voxel Representations of Graphs In Emilio Di Giacomo und Anna Lubiw, Editor, Proceedings of the 23rd International Symposium on Graph Drawing (GD'15) aus Lecture Notes in Computer Science , Seite 472--486. Herausgeber: Springer, 2015
49.	Giordano Da Lozzo und Ignaz Rutter Planarity of Streamed Graphs In Peter Widmayer, Editor, Proceedings of the 9th Conference on Algorithms and Complexity (CIAC'15) Band 9079 aus Lecture Notes in Computer Science , Seite 153--166. Herausgeber: Springer, 2015 DOI: 10.1007/978-3-319-18173-8_11
48.	Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner und Franziska Wegner Towards Realistic Flow Control in Power Grid Operation Energy Informatics Band 9424 aus Lecture Notes in Computer Science , Seite 192--199. Herausgeber: Springer, 2015
47.	Thomas Bläsius und Ignaz Rutter A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem In Christian A. Duncan und Antonios Symvonis, Editor, Proceedings of the 22nd International Symposium on Graph Drawing (GD'14) Band 8871 aus Lecture Notes in Computer Science , Seite 440--451. Herausgeber: Springer, 2014
46.	Thomas Bläsius, Guido Brückner und Ignaz Rutter Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model In Andreas S. Schulz und Dorothea Wagner, Editor, Proceedings of the 22nd Annual European Symposium on Algorithms (ESA'14) Band 8737 aus Lecture Notes in Computer Science , Seite 161--172. Herausgeber: Springer, 2014
45.	Luca Grilli, Seok-Hee Hong, Jan Kratochvíl und Ignaz Rutter Drawing Simultaneously Embedded Graphs with Few Bends In Christian A. Duncan und Antonios Symvonis, Editor, Proceedings of the 22nd International Symposium on Graph Drawing (GD'14) Band 8871 aus Lecture Notes in Computer Science , Seite 40--51. Herausgeber: Springer, 2014
44.	Andreas Gemsa, Martin Nöllenburg und Ignaz Rutter Evaluation of Labeling Strategies for Rotating Maps In Joachim Gudmundsson und Jyrki Katajainen, Editor, Proceedings of the 13th International Symposium on Experimental Algorithms (SEA'14) Band 8504 aus Lecture Notes in Computer Science , Seite 235--246. Herausgeber: Springer, 2014
43.	Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell und Tomás Vyskocil Extending Partial Representations of Proper and Unit Interval Graphs In R. Ravi und Inge Li Gørtz, Editor, Proceedings of the 14th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'14) Band 8503 aus Lecture Notes in Computer Science , Seite 253--264. Herausgeber: Springer, 2014 DOI: 10.1007/978-3-319-08404-6_22
42.	Martin Nöllenburg, Roman Prutkin und Ignaz Rutter On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs In Christian A. Duncan und Antonios Symvonis, Editor, Proceedings of the 22nd International Symposium on Graph Drawing (GD'14) Band 8871 aus Lecture Notes in Computer Science , Seite 476--487. Herausgeber: Springer, 2014
41.	Jian-Jia Chen, Mong-Jen Kao, D.T. Lee, Ignaz Rutter und Dorothea Wagner Online Dynamic Power Management with Hard Real-Time Guarantees Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS'14) aus Leibniz International Proceedings in Informatics , Seite 226--238. 2014
40.	Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl und Ignaz Rutter Planar Embeddings with Small and Uniform Faces Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC'14) Band 8889 aus Lecture Notes in Computer Science , Seite 633--645. Herausgeber: Springer, 2014
39.	Gregor Betz, Christof Doll, Andreas Gemsa, Ignaz Rutter und Dorothea Wagner Column-based Graph Layouts In Walter Didimo und Maurizio Patrignani, Editor, Proceedings of the 20th International Symposium on Graph Drawing (GD'12) Band 7704 aus Lecture Notes in Computer Science , Seite 236--247. Herausgeber: Springer, 2013
38.	Thomas Bläsius und Ignaz Rutter Disconnectivity and Relative Positions in Simultaneous Embeddings In Walter Didimo und Maurizio Patrignani, Editor, Proceedings of the 20th International Symposium on Graph Drawing (GD'12) Band 7704 aus Lecture Notes in Computer Science , Seite 31--42. Herausgeber: Springer, 2013
37.	Tamara Mchedlidze, Martin Nöllenburg und Ignaz Rutter Drawing Planar Graphs with a Prescribed Cycle In Stephen K. Wismath und Alexander Wolff, Editor, Proceedings of the 21st International Symposium on Graph Drawing (GD'13) Band 8242 aus Lecture Notes in Computer Science , Seite 316--327. Herausgeber: Springer, 2013
36.	Martin Nöllenburg, Roman Prutkin und Ignaz Rutter Edge-weighted Contact Representations of Planar Graphs In Walter Didimo und Maurizio Patrignani, Editor, Proceedings of the 20th International Symposium on Graph Drawing (GD'12) Band 7704 aus Lecture Notes in Computer Science , Seite 224--235. Herausgeber: Springer, 2013
35.	Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell und Tomás Vyskocil Extending partial representations of proper and unit interval graphs Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13) 2013
34.	Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter und Antonios Symvonis Many-to-One Boundary Labeling with Backbones In Stephen K. Wismath und Alexander Wolff, Editor, Proceedings of the 21st International Symposium on Graph Drawing (GD'13) Band 8242 aus Lecture Notes in Computer Science , Seite 244--255. Herausgeber: Springer, 2013
33.	Thomas Bläsius, Ignaz Rutter und Dorothea Wagner Optimal Orthogonal Graph Drawing with Convex Bend Costs Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13) Band 7965 aus Lecture Notes in Computer Science , Seite 184--195. Herausgeber: Springer, 2013
32.	Reinhard Bauer, Tobias Columbus, Ignaz Rutter und Dorothea Wagner Search-Space Size in Contraction Hierarchies Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13) Band 7965 aus Lecture Notes in Computer Science , Seite 93--104. Herausgeber: Springer, 2013
31.	Thomas Bläsius, Annette Karrer und Ignaz Rutter Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices In Stephen K. Wismath und Alexander Wolff, Editor, Proceedings of the 21st International Symposium on Graph Drawing (GD'13) Band 8242 aus Lecture Notes in Computer Science , Seite 220--231. Herausgeber: Springer, 2013
30.	Thomas Bläsius und Ignaz Rutter Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems Proceedings of the 24th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'13) , Seite 1030--1043. Herausgeber: SIAM, 2013
29.	Patrizio Angelini, Thomas Bläsius und Ignaz Rutter Testing Mutual Duality of Planar Graphs Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC'13) Band 8283 aus Lecture Notes in Computer Science , Seite 350--360. Herausgeber: Springer, 2013
28.	Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz und Alexander Wolff Two-Sided Boundary Labeling with Adjacent Sides Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13) 2013
27.	Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz und Alexander Wolff Two-Sided Boundary Labeling with Adjacent Sides Algorithms and Data Structures, 13th International Symposium (WADS'13) Band 8037 aus Lecture Notes in Computer Science , Seite 463--474. Herausgeber: Springer, 2013
26.	Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin und Ignaz Rutter Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings In Stephen K. Wismath und Alexander Wolff, Editor, Proceedings of the 21st International Symposium on Graph Drawing (GD'13) Band 8242 aus Lecture Notes in Computer Science , Seite 460--471. Herausgeber: Springer, 2013
25.	Mong-Jen Kao, Jian-Jia Chen, D.T. Lee, Ignaz Rutter und Dorothea Wagner Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12) Band 7676 aus Lecture Notes in Computer Science , Seite 75--84. Herausgeber: Springer, 2012
24.	Tanja Hartmann, Jonathan Rollin und Ignaz Rutter Cubic Augmentation of Planar Graphs Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12) Band 7676 aus Lecture Notes in Computer Science , Seite 402--412. Herausgeber: Springer, 2012
23.	Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter und Dorothea Wagner Generalizing Geometric Graphs Proceedings of the 19th International Symposium on Graph Drawing (GD'11) aus Lecture Notes in Computer Science , Seite 179--190. Herausgeber: Springer, 2012
22.	Reinhard Bauer, Moritz Baum, Ignaz Rutter und Dorothea Wagner On the Complexity of Partitioning Graphs for Arc-Flags Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'12) Band 25 aus OpenAccess Series in Informatics (OASIcs) , Seite 71--82. Herausgeber: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012
21.	Vít Jelínek, Jan Kratochvíl und Ignaz Rutter A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs In Ferran Hurtado und Marc van Kreveld, Editor, Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG'11) , Seite 107--116. Herausgeber: ACM Press, 2011
20.	Andreas Gemsa, Martin Nöllenburg, Thomas Pajor und Ignaz Rutter Automatic Generation of Route Sketches In Ulrik Brandes und Sabine Cornelsen, Editor, Proceedings of the 18th International Symposium on Graph Drawing (GD'10) Band 6502 aus Lecture Notes in Computer Science , Seite 391--392. Herausgeber: Springer, 2011
19.	Mong-Jen Kao, Bastian Katz, Marcus Krug, D.T. Lee, Martin Nöllenburg, Ignaz Rutter und Dorothea Wagner Connecting Two Trees with Optimal Routing Cost Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11) , Seite 43--47. Herausgeber: University of Toronto Press, 2011
18.	Andreas Gemsa, Martin Nöllenburg und Ignaz Rutter Consistent Labeling of Rotating Maps Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11) , Seite 171--174. 2011
17.	Andreas Gemsa, Martin Nöllenburg und Ignaz Rutter Consistent Labeling of Rotating Maps In Frank Dehne, John Iacono und Jörg-Rüdiger Sack, Editor, Algorithms and Data Structures, 12th International Symposium (WADS'11) Band 6844 aus Lecture Notes in Computer Science , Seite 451--462. Herausgeber: Springer, 2011 DOI: 10.1007/978-3-642-22300-6_38 ISBN: 978-3-642-22300-6
16.	Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta und Ignaz Rutter Hamiltonian Orthogeodesic Alternating Paths Proceedings of the 22nd International Workshop on Combinatorial Algorithms (IWOCA'11) aus Lecture Notes in Computer Science , Seite 170--181. Herausgeber: Springer, 2011
15.	Andreas Gemsa, Martin Nöllenburg, Thomas Pajor und Ignaz Rutter On d-regular Schematization of Embedded Paths Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11) Band 6543 aus Lecture Notes in Computer Science , Seite 260--271. Herausgeber: Springer, 2011
14.	Thomas Bläsius, Marcus Krug, Ignaz Rutter und Dorothea Wagner Orthogonal Graph Drawing with Flexibility Constraints In Ulrik Brandes und Sabine Cornelsen, Editor, Proceedings of the 18th International Symposium on Graph Drawing (GD'10) Band 6502 aus Lecture Notes in Computer Science , Seite 92--104. Herausgeber: Springer, 2011
13.	Andreas Gemsa, Martin Nöllenburg und Ignaz Rutter Sliding Labels for Dynamic Point Labeling Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11) , Seite 205--210. Herausgeber: University of Toronto Press, 2011
12.	Bastian Katz, Ignaz Rutter, Ben Strasser und Dorothea Wagner Speed Dating: An Algorithmic Case Study Involving Matching and Scheduling In Panos M. Pardalos und Steffen Rebennack, Editor, Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11) Band 6630 aus Lecture Notes in Computer Science , Seite 292--303. Herausgeber: Springer, 2011
11.	Mong-Jen Kao, Bastian Katz, Marcus Krug, D.T. Lee, Ignaz Rutter und Dorothea Wagner The Density Maximization Problem in Graphs In Ding-Zhu Du und Bin Fu, Editor, Proceedings of the 17th Annual International Conference on Computing Combinatorics (COCOON'11) Band 6842 aus Lecture Notes in Computer Science , Seite 25--36. Herausgeber: Springer, 2011
10.	Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting und Dorothea Wagner Gateway Decompositions for Constrained Reachability Problems In Paola Festa, Editor, Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10) Band 6049 aus Lecture Notes in Computer Science , Seite 449--461. Herausgeber: Springer, 2010
9.	Mark de Berg, Dirk Gerrits, Amirali Khosravi, Ignaz Rutter, Constantinos Tsirogiannis und Alexander Wolff How Alexander the Great Brought the Greeks Together While Inflicting Minimal Damage to the Barbarians Proceedings of the 26th European Workshop on Computational Geometry (EuroCG'10) , Seite 73--76. 2010
8.	Bastian Katz, Marcus Krug, Ignaz Rutter und Alexander Wolff Manhattan-Geodesic Embedding of Planar Graphs In David Eppstein und Emden R. Gansner, Editor, Proceedings of the 17th International Symposium on Graph Drawing (GD'09) Band 5849 aus Lecture Notes in Computer Science , Seite 207--218. Herausgeber: Springer, 2010
7.	Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani und Ignaz Rutter Testing Planarity of Partially Embedded Graphs In Moses Charikar, Editor, Proceedings of the 21st Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'10) , Seite 202--221. Herausgeber: SIAM, 2010
6.	Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani und Ignaz Rutter Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA'10) Band 6460 aus Lecture Notes in Computer Science , Seite 212--225. Herausgeber: Springer, 2010
5.	Bastian Katz, Ignaz Rutter und Gerhard J. Woeginger An Algorithmic Study of Switch Graphs In Michel Habib und Christophe Paul, Editor, Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'09) Band 5911 aus Lecture Notes in Computer Science , Seite 226--237. Herausgeber: Springer, 2009
4.	Robert Franke, Ignaz Rutter und Dorothea Wagner Computing Large Matchings in Planar Graphs with Fixed Minimum Degree In Yingfei Dong, Ding-Zhu Du und Oscar H. Ibarra, Editor, Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09) Band 5878 aus Lecture Notes in Computer Science , Seite 872--881. Herausgeber: Springer, 2009
3.	Ignaz Rutter und Alexander Wolff Augmenting the connectivity of planar and geometric graphs Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08) , Seite 71--74. 2008
2.	Ignaz Rutter und Alexander Wolff Augmenting the connectivity of planar and geometric graphs Topological & Geometric Graph Theory (TGGT'08) , Seite 55--58. 2008
1.	Ignaz Rutter und Alexander Wolff Computing Large Matchings Fast Proceedings of the 19th Annual ACM--SIAM Symposium on Discrete Algorithms (SODA'08) , Seite 183--192. 2008

Abschlussarbeiten

2.	Ignaz Rutter The Many Faces of Planarity -- Matching, Augmentation, and Embedding Algorithms for Planar Graphs -- Fakultät für Informatik, Karlsruher Institut für Technologie (KIT), 2011
1.	Ignaz Rutter Schnelle Berechnung von großen Matchings Fakultät für Informatik, Universität Karlsruhe, 2007