Tamara Mchedlidze

Alexandru C. Telea

Comput. Graph. Forum, 2024

On 1-Bend Upward Point-Set Embeddings of st-Digraphs.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Chrysanthi N. Raftopoulou

Anaïs Villedieu

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Upward Book Embeddability of st-Graphs: Complexity and Algorithms.

[BibT_eX]

[DOI]

Algorithmica, December, 2023

Recognizing DAGs with page-number 2 is NP-complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

Heuristic Algorithms for the Approximation of Mutual Coherence.

[BibT_eX]

[DOI]

Gregor Betz

Vera Chekan

CoRR, 2023

Editorial.

[BibT_eX]

[DOI]

Elena Arseneva

Comput. Geom., 2023

Identifying Cluttering Edges in Near-Planar Graphs.

[BibT_eX]

[DOI]

Simon van Wageningen

Alexandru C. Telea

Proceedings of the 25th Eurographics Conference on Visualization, 2023

Viewpoint-Based Quality for Analyzing and Exploring 3D Multidimensional Projections.

[BibT_eX]

[DOI]

Proceedings of the 18th International Joint Conference on Computer Vision, 2023

Removing Popular Faces in Curve Arrangements.

[BibT_eX]

[DOI]

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

2022

On mixed linear layouts of series-parallel graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Upward planar drawings with two slopes.

[BibT_eX]

[DOI]

Jonathan Klawitter

J. Graph Algorithms Appl., 2022

Can an NN model plainly learn planar layouts?

[BibT_eX]

[DOI]

Simon van Wageningen

CoRR, 2022

Level-Planar Drawings with Few Slopes.

[BibT_eX]

[DOI]

Guido Brückner

Nadine Davina Krisam

Algorithmica, 2022

Metaphoric Maps for Dynamic Vertex-weighted Graphs.

[BibT_eX]

[DOI]

Christian Schnorr

Proceedings of the 24th Eurographics Conference on Visualization, 2022

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

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

2021

ClusterSets: Optimizing Planar Clusters in Categorical Point Data.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2021

Upward Point Set Embeddings of Paths and Trees.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2021

Using the Metro-Map Metaphor for Drawing Hypergraphs.

[BibT_eX]

[DOI]

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

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Philipp Kindermann

Chrysanthi N. Raftopoulou

Wouter Meulemans

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Drawing Clustered Planar Graphs on Disk Arrangements.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Upward Point Set Embeddings of Paths and Trees.

[BibT_eX]

[DOI]

CoRR, 2020

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

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

2019

Planar drawings of fixed-mobile bigraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Greedy rectilinear drawings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Planar Graphs of Bounded Degree Have Bounded Queue Number.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Torsten Ueckerdt

SIAM J. Comput., 2019

Aesthetic Discrimination of Graph Layouts.

[BibT_eX]

[DOI]

Alexey Pak

Moritz Klammler

J. Graph Algorithms Appl., 2019

Applying argumentation to structure and visualize multi-dimensional opinion spaces.

[BibT_eX]

[DOI]

Argument Comput., 2019

Drawing Clustered Graphs on Disk Arrangements.

[BibT_eX]

[DOI]

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

Drawing Planar Graphs with Few Segments on a Polynomial Grid.

[BibT_eX]

[DOI]

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

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Philipp Kindermann

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

Upward Book Embeddings of st-Graphs.

[BibT_eX]

[DOI]

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

2018

Drawing planar graphs with many collinear vertices.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Aligned Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Marcel Radermacher

Chrysanthi N. Raftopoulou

J. Graph Algorithms Appl., 2018

Monotone Simultaneous Paths Embeddings in ℝd.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

Small Universal Point Sets for k-Outerplanar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Network Visualization in the Humanities (Dagstuhl Seminar 18482).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

Planar Graphs of Bounded Degree have Constant Queue Number.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Torsten Ueckerdt

CoRR, 2018

β-Stars or On Extending a Drawing of a Connected Subgraph.

[BibT_eX]

[DOI]

Jérôme Urhausen

CoRR, 2018

\beta -Stars or On Extending a Drawing of a Connected Subgraph.

[BibT_eX]

[DOI]

Jérôme Urhausen

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

A Greedy Heuristic for Crossing-Angle Maximization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

Experimental Evaluation of Book Drawing Algorithms.

[BibT_eX]

[DOI]

Jonathan Klawitter

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

2016

Lower and upper bounds for long induced paths in 3-connected planar graphs.

[BibT_eX]

[DOI]

Emilio Di Giacomo

Giuseppe Liotta

Theor. Comput. Sci., 2016

Monotone Simultaneous Embeddings of Paths in R^d.

[BibT_eX]

[DOI]

CoRR, 2016

Extending Convex Partial Drawings of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2016

Monotone Simultaneous Embeddings of Paths in d Dimensions.

[BibT_eX]

[DOI]

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

Strongly Monotone Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Stefan Felsner

Alexander Igamberdiev

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Fitting Planar Graphs on Planar Maps.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Embedding Four-directional Paths on Convex Point Sets.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Monotone Simultaneous Embeddings of Upward Planar Digraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Computing upward topological book embeddings of upward planar digraphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Simultaneous straight-line drawing of a planar graph and its rectangular dual.

[BibT_eX]

[DOI]

CoRR, 2015

Monotone Drawings of Graphs with Fixed Embedding.

[BibT_eX]

[DOI]

Algorithmica, 2015

Gestalt Principles in Graph Drawing.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Laura Vonessen

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

A Universal Point Set for 2-Outerplanar 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

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams.

[BibT_eX]

[DOI]

Boris Klemz

Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

Monotone Simultaneous Embedding of Directed Paths.

[BibT_eX]

[DOI]

CoRR, 2013

Upward planar embedding of an n-vertex oriented path on O(n2) points.

[BibT_eX]

[DOI]

Comput. Geom., 2013

On upward point set embeddability.

[BibT_eX]

[DOI]

Michael Kaufmann

Comput. Geom., 2013

Drawing Planar Graphs with a Prescribed Inner Face.

[BibT_eX]

[DOI]

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

Universal Point Sets for Planar Graph Drawings with Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

How many vertex locations can be arbitrarily chosen when drawing planar graphs?

[BibT_eX]

[DOI]

Emilio Di Giacomo

Giuseppe Liotta

CoRR, 2012

Universal Point Subsets for Planar Graphs.

[BibT_eX]

[DOI]

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

Point-Set Embeddability of 2-Colored Trees.

[BibT_eX]

[DOI]

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

2011

Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Upward Point-Set Embeddability.

[BibT_eX]

[DOI]

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

Upward Point Set Embeddability for Convex Point Sets Is in P.

[BibT_eX]

[DOI]

Michael Kaufmann

Proceedings of the Graph Drawing - 19th International Symposium, 2011

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

Small Point Sets for Simply-Nested Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Unilateral Orientation of Mixed Graphs.

[BibT_eX]

[DOI]

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

Upward Geometric Graph Embeddings into Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs

[BibT_eX]

[DOI]

CoRR, 2009

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

On rho-Constrained Upward Topological Book Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)

[BibT_eX]

[DOI]

CoRR, 2008

Spine Crossing Minimization in Upward Topological Book Embeddings.

[BibT_eX]

[DOI]