Ignaz Rutter

Algorithmica, July, 2024

Partial and Simultaneous Transitive Orientations via Modular Decompositions.

[BibT_eX]

[DOI]

Algorithmica, April, 2024

Simple Realizability of Abstract Topological Graphs.

[BibT_eX]

[DOI]

Walter Didimo

Maurizio Patrignani

CoRR, 2024

Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation.

[BibT_eX]

[DOI]

Dirk Sudholt

CoRR, 2024

Level Planarity Is More Difficult Than We Thought.

[BibT_eX]

[DOI]

CoRR, 2024

Clustered Planarity Variants for Level Graphs.

[BibT_eX]

[DOI]

Marie Diana Sieper

CoRR, 2024

Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings.

[BibT_eX]

[DOI]

Dirk Sudholt

Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Parameterized Algorithms for Beyond-Planar Crossing Numbers.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

On k-Plane Insertion into Plane Drawings.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Level Planarity Is More Difficult Than We Thought (Poster Abstract).

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Constrained Outer-String Representations.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Weakly Leveled Planarity with Bounded Span.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract).

[BibT_eX]

[DOI]

Dirk Sudholt

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

The Price of Upwardness.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023

Experimental Comparison of PC-Trees and PQ-Trees.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, December, 2023

A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing.

[BibT_eX]

[DOI]

Discret. Comput. Geom., December, 2023

Drawing Simultaneously Embedded Graphs with Few Bends.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., November, 2023

Synchronized Planarity with Applications to Constrained Planarity Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, October, 2023

Parameterized complexity of graph planarity with restricted cyclic orders.

[BibT_eX]

[DOI]

Giuseppe Liotta

Alessandra Tappini

J. Comput. Syst. Sci., August, 2023

Untangling circular drawings: Algorithms and complexity.

[BibT_eX]

[DOI]

Comput. Geom., April, 2023

An SPQR-tree-like embedding representation for level planarity.

[BibT_eX]

[DOI]

J. Comput. Geom., 2023

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Helen C. Purchase

J. Graph Algorithms Appl., 2023

Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Parameterized Complexity of Simultaneous Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

On 3-Coloring Circle Graphs.

[BibT_eX]

[DOI]

Patricia Bachmann

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Simultaneous Representation of Interval Graphs in the Sunflower Case.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Maintaining Triconnected Components Under Node Expansion.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

The Influence of Dimensions on the Complexity of Computing Decision Trees.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Maarten Löffler

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On Turn-Regular Orthogonal Representations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Partial and Simultaneous Transitive Orientations via Modular Decomposition.

[BibT_eX]

[DOI]

CoRR, 2022

Inserting an edge into a geometric embedding.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Level-Planarity: Transitivity vs. Even Crossings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Extending Partial Representations of Circular-Arc Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Coloring Mixed and Directional Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Morphing Rectangular Duals.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

The Rique-Number of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

Simultaneous FPQ-ordering and hybrid planarity testing.

[BibT_eX]

[DOI]

Giuseppe Liotta

Alessandra Tappini

Theor. Comput. Sci., 2021

Radial Level Planarity with Fixed Embedding.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

Extending Partial Orthogonal Drawings.

[BibT_eX]

[DOI]

Patrizio Angelini

T. P. Sandhya

J. Graph Algorithms Appl., 2021

Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021).

[BibT_eX]

[DOI]

Helen C. Purchase

CoRR, 2021

Polygon-Universal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Beyond level planarity: Cyclic, torus, and simultaneous level planarity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171).

[BibT_eX]

[DOI]

NII Shonan Meet. Rep., 2020

Drawing Clustered Planar Graphs on Disk Arrangements.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Simple k-planar graphs are simple (k + 1)-quasiplanar.

[BibT_eX]

[DOI]

Csaba D. Tóth

J. Comb. Theory B, 2020

Towards a Characterization of Stretchable Aligned Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings.

[BibT_eX]

[DOI]

Benjamin Niedermann

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Simultaneous Embedding.

[BibT_eX]

[DOI]

Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019

Planarity of streamed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

How to Draw a Planarization.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Geometric Heuristics for Rectilinear Crossing Minimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.

[BibT_eX]

[DOI]

Csaba D. Tóth

CoRR, 2019

Graph Planarity Testing with Hierarchical Embedding Constraints.

[BibT_eX]

[DOI]

Giuseppe Liotta

Alessandra Tappini

CoRR, 2019

NodeTrix Planarity Testing with Small Clusters.

[BibT_eX]

[DOI]

Algorithmica, 2019

Drawing Clustered Graphs on Disk Arrangements.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Minimizing Bias in Estimation of Mutual Information from Data Streams.

[BibT_eX]

[DOI]

Vadim Arzamasov

Klemens Böhm

Proceedings of the 31st International Conference on Scientific and Statistical Database Management, 2019

Reaching 3-Connectivity via Edge-Edge Additions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Philipp Kindermann

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

An SPQR-Tree-Like Embedding Representation for Upward Planarity.

[BibT_eX]

[DOI]

Markus Himmel

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Simultaneous Representation of Proper and Unit Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Geometric Crossing-Minimization - A Scalable Randomized Approach.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Efficient Algorithms for Ortho-Radial Graph Drawing.

[BibT_eX]

[DOI]

Benjamin Niedermann

Matthias Wolf

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Gap-planar graphs.

[BibT_eX]

[DOI]

Sang Won Bae

Jean-François Baffier

Csaba D. Tóth

Theor. Comput. Sci., 2018

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Scalable exact visualization of isocontours in road networks via minimum-link paths.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Aligned Drawings of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Linear-time recognition of map graphs with outerplanar witness.

[BibT_eX]

[DOI]

Matthias Mnich

Jens M. Schmidt

Discret. Optim., 2018

The Partition Spanning Forest Problem.

[BibT_eX]

[DOI]

CoRR, 2018

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices.

[BibT_eX]

[DOI]

Annette Karrer

Algorithmica, 2018

Approximation Algorithms for Facial Cycles in Planar Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

The Maximum Transmission Switching Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Future Energy Systems, 2018

On Complexity and Efficiency of Mutual Information Estimation on Static and Dynamic Data.

[BibT_eX]

[DOI]

Michael Vollmer

Klemens Böhm

Proceedings of the 21st International Conference on Extending Database Technology, 2018

Social Network-Epistemology.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE International Conference on e-Science, 2018

A Geometric Heuristic for Rectilinear Crossing Minimization.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Intersection-Link Representations of Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.

[BibT_eX]

[DOI]

Roman Prutkin

Int. J. Comput. Geom. Appl., 2017

Extending Partial Representations of Proper and Unit Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

On the Relationship Between k-Planar and k-Quasi-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Partial and Constrained Level Planarity.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

A Simulated-Annealing-Based Approach for Wind Farm Cabling.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Future Energy Systems, 2017

Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Radial contour labeling with straight leaders.

[BibT_eX]

[DOI]

Benjamin Niedermann

Proceedings of the 2017 IEEE Pacific Visualization Symposium, 2017

2016

A new perspective on clustered planarity as a combinatorial embedding problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Search-space size in contraction hierarchies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Optimal Orthogonal Graph Drawing with Convex Bend Costs.

[BibT_eX]

[DOI]

Dorothea Wagner

ACM Trans. Algorithms, 2016

Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

On self-approaching and increasing-chord drawings of 3-connected planar graphs.

[BibT_eX]

[DOI]

Roman Prutkin

J. Comput. Geom., 2016

Consistent labeling of rotating maps.

[BibT_eX]

[DOI]

Andreas Gemsa

J. Comput. Geom., 2016

Evaluation of Labeling Strategies for Rotating Maps.

[BibT_eX]

[DOI]

Andreas Gemsa

ACM J. Exp. Algorithmics, 2016

On the Complexity of Realizing Facial Cycles.

[BibT_eX]

[DOI]

CoRR, 2016

Strengthening Hardness Results to 3-Connected Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths.

[BibT_eX]

[DOI]

CoRR, 2016

Orthogonal graph drawing with inflexible edges.

[BibT_eX]

[DOI]

Sebastian Lehmann

Comput. Geom., 2016

Extending Convex Partial Drawings of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2016

Multi-sided Boundary Labeling.

[BibT_eX]

[DOI]

Algorithmica, 2016

Software Visualization via Hierarchic Micro/Macro Layouts.

[BibT_eX]

[DOI]

Alfred Schuhmacher

Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2016), 2016

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Beyond Level Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Simultaneous Orthogonal Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Online dynamic power management with hard real-time guarantees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Testing Planarity of Partially Embedded Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Many-to-One Boundary Labeling with Backbones.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Testing Cyclic Level and Simultaneous Level Planarity.

[BibT_eX]

[DOI]

CoRR, 2015

Disconnectivity and relative positions in simultaneous embeddings.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Regular Augmentation of Planar Graphs.

[BibT_eX]

[DOI]

Tanja Hartmann

Jonathan Rollin

Algorithmica, 2015

Optimal Shuffle Code with Permutation Instructions.

[BibT_eX]

[DOI]

Sebastian Buchwald

Manuel Mohr

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

On the Relationship Between Map Graphs and Clique Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Pixel and Voxel Representations of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Towards Realistic Flow Control in Power Grid Operation.

[BibT_eX]

[DOI]

Proceedings of the Energy Informatics, 2015

Operating Power Grids with Few Flow Control Buses.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, 2015

2014

Generalizing Geometric Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Column-Based Graph Layouts.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Testing Mutual duality of Planar graphs.

[BibT_eX]

[DOI]

Patrizio Angelini

Int. J. Comput. Geom. Appl., 2014

On d-regular schematization of embedded paths.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Orthogonal Graph Drawing with Flexibility Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2014

Planar Embeddings with Small and Uniform Faces.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Simultaneous Embedding of Planar Graphs.

[BibT_eX]

Stephen G. Kobourov

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Edge-weighted contact representations of planar graphs.

[BibT_eX]

[DOI]

Roman Prutkin

J. Graph Algorithms Appl., 2013

On the Complexity of Partitioning Graphs for Arc-Flags.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

The density maximization problem in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Fork-forests in bi-colored complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Online Power-Managing Strategy with Hard Real-Time Guarantees

[BibT_eX]

[DOI]

CoRR, 2013

Graphs with Plane Outside-Obstacle Representations.

[BibT_eX]

[DOI]

Alexander Koch

Marcus Krug

CoRR, 2013

A Kuratowski-type theorem for planarity of partially embedded graphs.

[BibT_eX]

[DOI]

Vít Jelínek

Jan Kratochvíl

Comput. Geom., 2013

Two-Sided Boundary Labeling with Adjacent Sides.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Drawing Planar Graphs with a Prescribed Inner Face.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Augmenting the Connectivity of Planar and Geometric Graphs.

[BibT_eX]

[DOI]

Alexander Wolff

J. Graph Algorithms Appl., 2012

Hamiltonian orthogeodesic alternating paths.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Simultaneous Embedding of Planar Graphs

[BibT_eX]

[DOI]

Stephen G. Kobourov

CoRR, 2012

An algorithmic study of switch graphs.

[BibT_eX]

[DOI]

Bastian Katz

Gerhard J. Woeginger

Acta Informatica, 2012

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Cubic Augmentation of Planar Graphs.

[BibT_eX]

[DOI]

Tanja Hartmann

Jonathan Rollin

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Column-Based Graph Layouts.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

The many faces of planarity: matching, augmentation, and embedding algorithms for planar graphs.

[BibT_eX]

[DOI]

PhD thesis, 2011

Computing large matchings in planar graphs with fixed minimum degree.

[BibT_eX]

[DOI]

Robert Franke

Dorothea Wagner

Theor. Comput. Sci., 2011

Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

On d-Regular Schematization of Embedded Paths.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

The Many Faces of Planarity - Matching, Augmentation, and Embedding Algorithms for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

Connecting Two Trees with Optimal Routing Cost.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Sliding labels for dynamic point labeling.

[BibT_eX]

[DOI]

Andreas Gemsa

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Computing large matchings fast.

[BibT_eX]

[DOI]