Skip to content

Ignaz Rutter

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

110

Venues

20

Active years

2008–2026

Best venue rank

A*

Where they publish

Papers

110 indexed papers, newest first.

YearVenueTitleAuthors
2026ESATowards the Recognition of Oriented Interval Graphs.Lukas P. Bachmann, Jir Fiala, Miriam Mnch, Ignaz Rutter, Peter Stumpf, Alexander Wolff
2026STACSCircle Graphs Can Be Recognized in Linear Time.Christophe Paul, Ignaz Rutter
2026WGUpward-Planar Drawings with Bounded Span.Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo, Fabrizio Frati, Philipp Kindermann, Ignaz Rutter, Johannes Zink
2025GDHeuristics for Exact 1-Planarity Testing.Simon D. Fink, Miriam Mnch, Matthias Pfretzschner, Ignaz Rutter
2025GDCrossing Number of Simple 3-Plane Drawings.Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt
2025GDReeb Lobsters Are 1-Planar (Poster Abstract).Maarten Lffler, Miriam Mnch, Ignaz Rutter
2025GECCOAnalysing the Effectiveness of Mutation Operators for One-Sided Bipartite Crossing Minimisation.Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2025ISAACStructural Parameterizations of Simultaneous Planarity.Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter
2024ALENEXConstrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm.Simon D. Fink, Ignaz Rutter
2024GDThe Price of Upwardness.Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff
2024GDEvolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract).Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2024GDWeakly Leveled Planarity with Bounded Span.Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis
2024GDConstrained Outer-String Representations.Therese Biedl, Sabine Cornelsen, Jan Kratochvl, Ignaz Rutter
2024GDLevel Planarity Is More Difficult Than We Thought (Poster Abstract).Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf
2024GDOn k-Plane Insertion into Plane Drawings.Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
2024GDParameterized Algorithms for Beyond-Planar Crossing Numbers.Miriam Mnch, Ignaz Rutter
2024GECCOEvolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings.Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2024ISAACSimple Realizability of Abstract Topological Graphs.Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Mnch, Maurizio Patrignani, Ignaz Rutter
2024WGExact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth.Miriam Mnch, Maximilian Pfister, Ignaz Rutter
2023AAAIThe Influence of Dimensions on the Complexity of Computing Decision Trees.Stephen G. Kobourov, Maarten Lffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2023CIACMaintaining Triconnected Components Under Node Expansion.Simon D. Fink, Ignaz Rutter
2023ESASimultaneous Representation of Interval Graphs in the Sunflower Case.Ignaz Rutter, Peter Stumpf
2023GDOn 3-Coloring Circle Graphs.Patricia Bachmann, Ignaz Rutter, Peter Stumpf
2023GDParameterized Complexity of Simultaneous Planarity.Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
2023WGParameterized Complexity of Vertex Splitting to Pathwidth at Most 1.Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
2022GDThe Rique-Number of Graphs.Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvl, Ignaz Rutter
2022GDMorphing Rectangular Duals.Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
2022GDColoring Mixed and Directional Interval Graphs.Grzegorz Gutowski, Florian Mittelstdt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
2022ISAACPartial and Simultaneous Transitive Orientations via Modular Decompositions.Miriam Mnch, Ignaz Rutter, Peter Stumpf
2022MFCSExtending Partial Representations of Circle Graphs in Near-Linear Time.Guido Brckner, Ignaz Rutter, Peter Stumpf
2022WGExtending Partial Representations of Circular-Arc Graphs.Jir Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman
2022WGParameterized Complexity of Graph Planarity with Restricted Cyclic Orders.Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
2021CIACExtending Partial Representations of Rectangular Duals with Given Contact Orientations.Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
2021ESASynchronized Planarity with Applications to Constrained Planarity Problems.Thomas Blsius, Simon D. Fink, Ignaz Rutter
2021ESAExperimental Comparison of PC-Trees and PQ-Trees.Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
2021ISAACUntangling Circular Drawings: Algorithms and Complexity.Sujoy Bhore, Guangping Li, Martin Nllenburg, Ignaz Rutter, Hsiang-Yun Wu
2020GDExtending Partial Orthogonal Drawings.Patrizio Angelini, Ignaz Rutter, Sandhya T. P.
2020GDOn Turn-Regular Orthogonal Representations.Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter
2020GDGraph Drawing Contest Report.Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter
2020GDAn Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings.Benjamin Niedermann, Ignaz Rutter
2020GDTowards a Characterization of Stretchable Aligned Graphs.Marcel Radermacher, Ignaz Rutter, Peter Stumpf
2020ISAACAn SPQR-Tree-Like Embedding Representation for Level Planarity.Guido Brckner, Ignaz Rutter
2020SOFSEMSimultaneous FPQ-Ordering and Hybrid Planarity Testing.Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
2019ESAGeometric Crossing-Minimization - A Scalable Randomized Approach.Marcel Radermacher, Ignaz Rutter
2019ESASimultaneous Representation of Proper and Unit Interval Graphs.Ignaz Rutter, Darren Strash, Peter Stumpf, Michael Vollmer
2019GDAn SPQR-Tree-Like Embedding Representation for Upward Planarity.Guido Brckner, Markus Himmel, Ignaz Rutter
2019GDGraph Drawing Contest Report.Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter
2019IWOCAReaching 3-Connectivity via Edge-Edge Additions.Giordano Da Lozzo, Ignaz Rutter
2019SSDBMMinimizing Bias in Estimation of Mutual Information from Data Streams.Vadim Arzamasov, Klemens Bhm, Ignaz Rutter
2019WALCOMDrawing Clustered Graphs on Disk Arrangements.Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel
2018ALENEXA Geometric Heuristic for Rectilinear Crossing Minimization.Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner
2018EDBTOn Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data.Michael Vollmer, Ignaz Rutter, Klemens Bhm
2018GDLevel Planarity: Transitivity vs. Even Crossings.Guido Brckner, Ignaz Rutter, Peter Stumpf
2018GDGraph Drawing Contest Report.William E. Devanny, Philipp Kindermann, Maarten Lffler, Ignaz Rutter
2018GDInserting an Edge into a Geometric Embedding.Marcel Radermacher, Ignaz Rutter
2018ISAACApproximation Algorithms for Facial Cycles in Planar Embeddings.Giordano Da Lozzo, Ignaz Rutter
2017GDGap-Planar Graphs.Sang Won Bae, Jean-Franois Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tth
2017GDGraph Drawing Contest Report.William E. Devanny, Philipp Kindermann, Maarten Lffler, Ignaz Rutter
2017GDAligned Drawings of Planar Graphs.Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter
2017SODAPartial and Constrained Level Planarity.Guido Brckner, Ignaz Rutter
2017SOFSEMHow to Draw a Planarization.Thomas Blsius, Marcel Radermacher, Ignaz Rutter
2017WGOn the Relationship Between k-Planar and k-Quasi-Planar Graphs.Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter
2016ESAScalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths.Moritz Baum, Thomas Blsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
2016GDSimultaneous Orthogonal Planarity.Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvl, Fabian Lipp, Ignaz Rutter
2016GDBeyond Level Planarity.Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2016GDGraph Drawing Contest Report.Philipp Kindermann, Maarten Lffler, Lev Nachmanson, Ignaz Rutter
2016SODAWindrose Planarity: Embedding Graphs with Direction-Constrained Edges.Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Gnter Rote, Ignaz Rutter
2015CIACOrthogonal Graph Drawing with Inflexible Edges.Thomas Blsius, Sebastian Lehmann, Ignaz Rutter
2015CIACPlanarity of Streamed Graphs.Giordano Da Lozzo, Ignaz Rutter
2015GDPixel and Voxel Representations of Graphs.Md. Jawaherul Alam, Thomas Blsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
2015GDIntersection-Link Representations of Graphs.Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015GDOn the Relationship Between Map Graphs and Clique Planar Graphs.Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2015GDGraph Drawing Contest Report.Philipp Kindermann, Maarten Lffler, Lev Nachmanson, Ignaz Rutter
2015ISAACPartitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.Martin Nllenburg, Roman Prutkin, Ignaz Rutter
2015WADSOptimal Shuffle Code with Permutation Instructions.Sebastian Buchwald, Manuel Mohr, Ignaz Rutter
2014ESAComplexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model.Thomas Blsius, Guido Brckner, Ignaz Rutter
2014GDA New Perspective on Clustered Planarity as a Combinatorial Embedding Problem.Thomas Blsius, Ignaz Rutter
2014GDDrawing Simultaneously Embedded Graphs with Few Bends.Luca Grilli, Seok-Hee Hong, Jan Kratochvl, Ignaz Rutter
2014GDGraph Drawing Contest Report.Carsten Gutwenger, Maarten Lffler, Lev Nachmanson, Ignaz Rutter
2014GDOn Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs.Martin Nllenburg, Roman Prutkin, Ignaz Rutter
2014ISAACPlanar Embeddings with Small and Uniform Faces.Giordano Da Lozzo, Vt Jelnek, Jan Kratochvl, Ignaz Rutter
2014STACSOnline Dynamic Power Management with Hard Real-Time Guarantees.Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2013GDMany-to-One Boundary Labeling with Backbones.Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nllenburg, Ignaz Rutter, Antonios Symvonis
2013GDUsing ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings.Therese Biedl, Thomas Blsius, Benjamin Niedermann, Martin Nllenburg, Roman Prutkin, Ignaz Rutter
2013GDSimultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices.Thomas Blsius, Annette Karrer, Ignaz Rutter
2013GDDrawing Planar Graphs with a Prescribed Inner Face.Tamara Mchedlidze, Martin Nllenburg, Ignaz Rutter
2013ICALPSearch-Space Size in Contraction Hierarchies.Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner
2013ICALPOptimal Orthogonal Graph Drawing with Convex Bend Costs.Thomas Blsius, Ignaz Rutter, Dorothea Wagner
2013ISAACTesting Mutual Duality of Planar Graphs.Patrizio Angelini, Thomas Blsius, Ignaz Rutter
2013SODASimultaneous PQ-Ordering with Applications to Constrained Embedding Problems.Thomas Blsius, Ignaz Rutter
2013WADSTwo-Sided Boundary Labeling with Adjacent Sides.Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, Andr Schulz, Alexander Wolff
2012ATMOSOn the Complexity of Partitioning Graphs for Arc-Flags.Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner
2012GDColumn-Based Graph Layouts.Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner
2012GDDisconnectivity and Relative Positions in Simultaneous Embeddings.Thomas Blsius, Ignaz Rutter
2012GDEdge-Weighted Contact Representations of Planar Graphs.Martin Nllenburg, Roman Prutkin, Ignaz Rutter
2012ISAACCubic Augmentation of Planar Graphs.Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
2012ISAACCompetitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
2011COCOONThe Density Maximization Problem in Graphs.Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2011GDGeneralizing Geometric Graphs.Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2011IWOCAHamiltonian Orthogeodesic Alternating Paths.Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter
2011SOFSEMOnAndreas Gemsa, Martin Nllenburg, Thomas Pajor, Ignaz Rutter
2011WADSConsistent Labeling of Rotating Maps.Andreas Gemsa, Martin Nllenburg, Ignaz Rutter
2010GDOrthogonal Graph Drawing with Flexibility Constraints.Thomas Blsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2010GDAutomatic Generation of Route Sketches.Andreas Gemsa, Martin Nllenburg, Thomas Pajor, Ignaz Rutter
2010IWOCATesting the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree.Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
2010SODATesting Planarity of Partially Embedded Graphs.Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vt Jelnek, Jan Kratochvl, Maurizio Patrignani, Ignaz Rutter
2009GDManhattan-Geodesic Embedding of Planar Graphs.Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff
2009ISAACComputing Large Matchings in Planar Graphs with Fixed Minimum Degree.Robert Franke, Ignaz Rutter, Dorothea Wagner
2009WGAn Algorithmic Study of Switch Graphs.Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger
2008SODAComputing large matchings fast.Ignaz Rutter, Alexander Wolff