Torsten Ueckerdt

CoRR, 2024

Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs.

[BibT_eX]

[DOI]

Miriam Goetze

CoRR, 2024

Primal-Dual Cops and Robber.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2024

2023

A Sublinear Bound on the Page Number of Upward Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Colouring bottomless rectangles and arborescences.

[BibT_eX]

[DOI]

Comput. Geom., December, 2023

The Density Formula: One Lemma to Bound Them All.

[BibT_eX]

[DOI]

CoRR, 2023

Polychromatic Colorings of Geometric Hypergraphs via Shallow Hitting Sets.

[BibT_eX]

[DOI]

Tim Planken

CoRR, 2023

Shallow Hitting Edge Sets in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Tim Planken

CoRR, 2023

On the complexity of embedding in graph products.

[BibT_eX]

[DOI]

Therese Biedl

David Eppstein

CoRR, 2023

Clustered independence and bounded treewidth.

[BibT_eX]

[DOI]

CoRR, 2023

Primal-Dual Cops and Robber.

[BibT_eX]

[DOI]

Minh Tuan Ha

CoRR, 2023

Cops and Robber - When Capturing Is Not Surrounding.

[BibT_eX]

[DOI]

Samuel Schneider

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

Directed Acyclic Outerplanar Graphs Have Constant Stack Number.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Axis-Parallel Right Angle Crossing Graphs.

[BibT_eX]

[DOI]

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

2022

An Improved Planar Graph Product Structure Theorem.

[BibT_eX]

[DOI]

David R. Wood

Wendy Yi

Electron. J. Comb., 2022

The Density of Fan-Planar Graphs.

[BibT_eX]

[DOI]

Michael Kaufmann

Electron. J. Comb., 2022

Polychromatic Colorings of Unions of Geometric Hypergraphs.

[BibT_eX]

[DOI]

Vera Chekan

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

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs.

[BibT_eX]

[DOI]

Miriam Goetze

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Weak Coloring Numbers of Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

On Comparable Box Dimension.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

On Covering Numbers, Young Diagrams, and the Local Dimension of Posets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

The number of crossings in multigraphs with no empty lens.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

The interval number of a planar graph is at most three.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2021

Using the Metro-Map Metaphor for Drawing Hypergraphs.

[BibT_eX]

[DOI]

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

On the Queue-Number of Partial Orders.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Kaja Wille

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

Linear Layouts of Complete Graphs.

[BibT_eX]

[DOI]

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

Edge-Minimum Saturated k-Planar Drawings.

[BibT_eX]

[DOI]

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

2020

Four Pages Are Indeed Necessary for Planar Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Planar Graphs Have Bounded Queue-Number.

[BibT_eX]

[DOI]

J. ACM, 2020

Edge-Minimum Saturated k-Planar Drawings.

[BibT_eX]

[DOI]

Steven Chaplick

CoRR, 2020

Guarding Quadrangulations and Stacked Triangulations with Edges.

[BibT_eX]

[DOI]

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

Plattenbauten: Touching Rectangles in Space.

[BibT_eX]

[DOI]

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

The Local Queue Number of Graphs with Bounded Treewidth.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

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

2019

Planar Graphs of Bounded Degree Have Bounded Queue Number.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

SIAM J. Comput., 2019

Decomposing 4-connected planar triangulations into two trees and one path.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2019

Induced and weak induced arboricities.

[BibT_eX]

[DOI]

Discret. Math., 2019

A Note on Covering Young Diagrams with Applications to Local Dimension of Posets.

[BibT_eX]

[DOI]

CoRR, 2019

Planar Ramsey Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Local and Union Page Numbers.

[BibT_eX]

[DOI]

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

Engineering Negative Cycle Canceling for Wind Farm Cabling.

[BibT_eX]

[DOI]

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

2018

On the Maximum Crossing Number.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Towards negative cycle canceling in wind farm cable layout optimization.

[BibT_eX]

[DOI]

Energy Inform., 2018

Publisher Correction: Towards negative cycle canceling in wind farm cable layout optimization.

[BibT_eX]

[DOI]

Energy Inform., 2018

The k-strong induced arboricity of a graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Local and union boxicity.

[BibT_eX]

[DOI]

Thomas Bläsius

Peter Stumpf

Chrysanthi N. Raftopoulou

Discret. Math., 2018

Planar Graphs of Bounded Degree have Constant Queue Number.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

CoRR, 2018

The queue-number of planar posets.

[BibT_eX]

[DOI]

CoRR, 2018

Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs.

[BibT_eX]

[DOI]

Comb., 2018

Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs.

[BibT_eX]

[DOI]

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

The Queue-Number of Posets of Bounded Width or Height.

[BibT_eX]

[DOI]

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

2017

Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths.

[BibT_eX]

[DOI]

Pascal Weiner

J. Graph Theory, 2017

Conditions on Ramsey Nonequivalence.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Beyond-Planarity: Density Results for Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

The chromatic number of ordered graphs with constrained conflict graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2017

2016

Density of range capturing hypergraphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

A Note on Concurrent Graph Sharing Games.

[BibT_eX]

[DOI]

Integers, 2016

Spectrum of Mixed Bi-uniform Hypergraphs.

[BibT_eX]

[DOI]

Enrica Cherubini

Graphs Comb., 2016

Three ways to cover a graph.

[BibT_eX]

[DOI]

Discret. Math., 2016

Intersection graphs of L-shapes and segments in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Convex-Arc Drawings of Pseudolines.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Playing weighted Tron on trees.

[BibT_eX]

[DOI]

Discret. Math., 2015

Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs.

[BibT_eX]

[DOI]

Jackson Toeniskoetter

CoRR, 2015

Contact Representations of Sparse Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Contact Representations of Graphs in 3D.

[BibT_eX]

[DOI]

Jackson Toeniskoetter

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

Contact Graphs of Circular Arcs.

[BibT_eX]

[DOI]

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

Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem.

[BibT_eX]

[DOI]

Jonathan Klawitter

Martin Nöllenburg

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

On-line Coloring between Two Lines.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Making Octants Colorful and Related Covering Decomposition Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Twins in graphs.

[BibT_eX]

[DOI]

Ryan R. Martin

Eur. J. Comb., 2014

On the bend-number of planar and outerplanar graphs.

[BibT_eX]

[DOI]

Daniel Heldt

Discret. Appl. Math., 2014

Edge-intersection graphs of grid paths: The bend-number.

[BibT_eX]

[DOI]

Daniel Heldt

Discret. Appl. Math., 2014

Packing polyominoes clumsily.

[BibT_eX]

[DOI]

Stefan Walzer

Comput. Geom., 2014

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Making Triangles Colorful.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

Planar Graphs as VPG-Graphs.

[BibT_eX]

[DOI]

Steven Chaplick

J. Graph Algorithms Appl., 2013

Computing Cartograms with Optimal Complexity.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

On Semantic Word Cloud Representation

[BibT_eX]

[DOI]

CoRR, 2013

Equilateral L-Contact Graphs.

[BibT_eX]

[DOI]

Steven Chaplick

Stephen G. Kobourov

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

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.

[BibT_eX]

[DOI]

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

Non-crossing Connectors in the Plane.

[BibT_eX]

[DOI]

Jan Kratochvíl

Proceedings of the Theory and Applications of Models of Computation, 2013

Combinatorial and Geometric Properties of Planar Laman Graphs.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Kevin Verbeek

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2011

Points with Large Quadrant Depth.

[BibT_eX]

[DOI]

J. Comput. Geom., 2011

How to eat 4/9 of a pizza.

[BibT_eX]

[DOI]