Stefan Felsner

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Plane Hamiltonian Cycles in Convex Drawings.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Topological Drawings Meet Classical Theorems from Convex Geometry.

[BibT_eX]

[DOI]

Discret. Comput. Geom., October, 2023

Approximating the Bundled Crossing Number.

[BibT_eX]

[DOI]

Alan Arroyo

J. Graph Algorithms Appl., 2023

Using SAT to study plane Hamiltonian substructures in simple drawings.

[BibT_eX]

[DOI]

CoRR, 2023

Bichromatic Perfect Matchings with Crossings.

[BibT_eX]

[DOI]

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

Linear Size Universal Point Sets for Classes of Planar Graphs.

[BibT_eX]

[DOI]

Hendrik Schrezenmaier

Felix Schröder

Proceedings of the 39th International Symposium on Computational Geometry, 2023

An Extension Theorem for Signotopes.

[BibT_eX]

[DOI]

Helena Bergold

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Arrangements of Approaching Pseudo-Lines.

[BibT_eX]

[DOI]

Alexander Pilz

Patrick Schnider

Discret. Comput. Geom., 2022

Aspect Ratio Universal Rectangular Layouts.

[BibT_eX]

[DOI]

Andrew Nathenson

Csaba D. Tóth

Proceedings of the WALCOM: Algorithms and Computation, 2022

Arrangements of Pseudocircles: On Digons and Triangles.

[BibT_eX]

[DOI]

Sandro Roch

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

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

On Area-Universal Quadrangulations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

Arrangements of Pseudocircles: Triangles and Drawings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Reconfiguring Independent Sets on Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On the Queue-Number of Partial Orders.

[BibT_eX]

[DOI]

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

2020

Rainbow Cycles in Flip Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

On the Average Complexity of the k-Level.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

4-Connected triangulations on few lines.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Arrangements of Pseudocircles: On Circularizability.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Complete Acyclic Colorings.

[BibT_eX]

[DOI]

Winfried Hochstättler

Kolja Knauer

Electron. J. Comb., 2020

Boolean Dimension and Tree-Width.

[BibT_eX]

[DOI]

Tamás Mészáros

Piotr Micek

Comb., 2020

Plattenbauten: Touching Rectangles in Space.

[BibT_eX]

[DOI]

Kolja Knauer

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

Improved bounds for centered colorings.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens.

[BibT_eX]

[DOI]

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

2019

Separating tree-chromatic number from path-chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

On Primal-Dual Circle Representations.

[BibT_eX]

[DOI]

Günter Rote

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Line and Plane Cover Numbers Revisited.

[BibT_eX]

[DOI]

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

2018

Grid Intersection Graphs and Order Dimension.

[BibT_eX]

[DOI]

Order, 2018

Topological drawings of complete bipartite graphs.

[BibT_eX]

[DOI]

Jean Cardinal

J. Comput. Geom., 2018

On the Maximum Crossing Number.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Intersection Graphs of Rays and Grounded Segments.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Table cartogram.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Ham-Sandwich Cuts for Abstract Order Types.

[BibT_eX]

[DOI]

Alexander Pilz

Algorithmica, 2018

Planar Bus Graphs.

[BibT_eX]

[DOI]

Till Bruckdorfer

Michael Kaufmann

Algorithmica, 2018

Equiangular Polygon Contact Representations.

[BibT_eX]

[DOI]

Hendrik Schrezenmaier

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

2017

The Complexity of the Partial Order Dimension Problem: Closing the Gap.

[BibT_eX]

[DOI]

Irina Mustata

Martin Pergel

SIAM J. Discret. Math., 2017

Pentagon Contact Representations.

[BibT_eX]

[DOI]

Hendrik Schrezenmaier

Electron. Notes Discret. Math., 2017

Burling graphs, chromatic number, and orthogonal tree-decompositions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Straight Line Triangle Representations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Max point-tolerance graphs.

[BibT_eX]

[DOI]

Daniele Catanzaro

Steven Chaplick

Bjarni V. Halldórsson

Magnús M. Halldórsson

Thomas Hixon

Juraj Stacho

Discret. Appl. Math., 2017

2016

On the Duality of Semiantichains and Unichain Coverings.

[BibT_eX]

[DOI]

Order, 2016

Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs.

[BibT_eX]

[DOI]

Daniel Heldt

Discret. Math. Theor. Comput. Sci., 2016

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Mixing Times of Markov Chains of 2-Orientations.

[BibT_eX]

[DOI]

Daniel Heldt

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Strongly Monotone Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Alexander Igamberdiev

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

2015

Linear Extensions of N-free Orders.

[BibT_eX]

[DOI]

Thibault Manneville

Order, 2015

Lattice Path Enumeration and Toeplitz Matrices.

[BibT_eX]

[DOI]

Daniel Heldt

J. Integer Seq., 2015

Vertex Contact Representations of Paths on a Grid.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Straight-Line Triangle Representations via Schnyder Labelings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

The Dimension of Posets with Planar Cover Graphs.

[BibT_eX]

[DOI]

Veit Wiechert

Graphs Comb., 2015

Covering Partial Cubes with Zones.

[BibT_eX]

[DOI]

Jean Cardinal

Electron. J. Comb., 2015

On-line Coloring between Two Lines.

[BibT_eX]

[DOI]

Piotr Micek

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

Shifting Segments to Optimality.

[BibT_eX]

[DOI]

Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014

The Order Dimension of Planar Maps Revisited.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Exploiting Air-Pressure to Map Floorplans on Point Sets.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Bend-optimal orthogonal graph drawing in the general position model.

[BibT_eX]

[DOI]

Michael Kaufmann

Pavel Valtr

Comput. Geom., 2014

Vertex Contact Graphs of Paths on a Grid.

[BibT_eX]

[DOI]

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

Drawing HV-Restricted Planar Graphs.

[BibT_eX]

[DOI]

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

2013

On-Line Dimension for Posets Excluding Two Long Incomparable Chains.

[BibT_eX]

[DOI]

Tomasz Krawczyk

Order, 2013

On-line Chain Partitions of Up-growing Semi-orders.

[BibT_eX]

[DOI]

Order, 2013

Computing Cartograms with Optimal Complexity.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve.

[BibT_eX]

[DOI]

Victor Chepoi

Comput. Geom., 2013

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

Algorithmica, 2013

On the Recognition of Four-Directional Orthogonal Ray Graphs.

[BibT_eX]

[DOI]

George B. Mertzios

Irina Mustata

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Table Cartograms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

On the Characterization of Plane Bus Graphs.

[BibT_eX]

[DOI]

Till Bruckdorfer

Michael Kaufmann

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

On-Line Chain Partitions of Orders: A Survey.

[BibT_eX]

[DOI]

Order, 2012

Proportional Contact Representations of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

News about Semiantichains and Unichain Coverings.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2012

2011

Linear Extension Diameter of Downset Lattices of Two-Dimensional Posets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

On the Order Dimension of Outerplanar Maps.

[BibT_eX]

[DOI]

Johan Nilsson

Order, 2011

Points with Large Quadrant Depth.

[BibT_eX]

[DOI]

J. Comput. Geom., 2011

Bijections for Baxter families and related objects.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

Distributive lattices, polyhedra, and generalized flows.

[BibT_eX]

[DOI]

Kolja B. Knauer

Eur. J. Comb., 2011

Cubic time recognition of cocircuit graphs of uniform oriented matroids.

[BibT_eX]

[DOI]

Juan José Montellano-Ballesteros

Ricardo Gómez Aiza

Kolja B. Knauer

Ricardo Strausz

Eur. J. Comb., 2011

Coding and Counting Arrangements of Pseudolines.

[BibT_eX]

[DOI]

Pavel Valtr

Discret. Comput. Geom., 2011

Contact representations of planar graphs with cubes.

[BibT_eX]

[DOI]

Mathew C. Francis

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Intersection Graphs of Pseudosegments: Chordal Graphs.

[BibT_eX]

[DOI]

Cornelia Dangelmayr

J. Graph Algorithms Appl., 2010

Binary Labelings for Plane Quadrangulations and their Relatives.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

Asymptotic enumeration of orientations.

[BibT_eX]

[DOI]

Éric Fusy

Marc Noy

Discret. Math. Theor. Comput. Sci., 2010

Adjacency posets of planar graphs.

[BibT_eX]

[DOI]

Ching Man Li

Discret. Math., 2010

Points with large quadrant-depth.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

ULD-Lattices and Delta-Bonds.

[BibT_eX]

[DOI]

Kolja B. Knauer

Comb. Probab. Comput., 2009

2008

Orthogonal Surfaces and Their CP-Orders.

[BibT_eX]

[DOI]

Sarah Kappes

Order, 2008

Parameters of Bar k-Visibility Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

Preface.

[BibT_eX]

[DOI]

Marco E. Lübbecke

Jarik Nesetril

Discret. Math., 2008

Schnyder Woods and Orthogonal Surfaces.

[BibT_eX]

[DOI]

Florian Zickfeld

Discret. Comput. Geom., 2008

On the Number of Planar Orientations with Prescribed Degrees.

[BibT_eX]

[DOI]

Florian Zickfeld

Electron. J. Comb., 2008

The Complexity of Sorting with Networks of Stacks and Queues.

[BibT_eX]

[DOI]

Martin Pergel

Proceedings of the Algorithms, 2008

2007

Editorial.

[BibT_eX]

[DOI]

Marco E. Lübbecke

Jarik Nesetril

Eur. J. Comb., 2007

On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders

[BibT_eX]

[DOI]

CoRR, 2007

Convex Drawings of 3-Connected Plane Graphs.

[BibT_eX]

[DOI]

Nicolas Bonichon

Mohamed Mosbah

Algorithmica, 2007

On the Number of alpha -Orientations.

[BibT_eX]

[DOI]

Florian Zickfeld

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

Homothetic Triangle Contact Representations of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Hamiltonicity and colorings of arrangement graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Thickness of Bar 1-Visibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Chordal Graphs as Intersection Graphs of Pseudosegments.

[BibT_eX]

[DOI]

Cornelia Dangelmayr

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

Posets and planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines.

[BibT_eX]

[DOI]

Bernd Gärtner

Falk Tschirschnitz

Discret. Comput. Geom., 2005

2004

Lattice Structures from Planar Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

Geometric Graphs and Arrangements - Some Chapters from Combinatorial Geometry.

[BibT_eX]

Advanced lectures in mathematics, Vieweg+Teubner, ISBN: 978-3-528-06972-8, 2004

2003

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number.

[BibT_eX]

[DOI]

Vijay Raghavan

Jeremy P. Spinrad

Order, 2003

Geodesic Embeddings and Planar Graphs.

[BibT_eX]

[DOI]

Order, 2003

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions.

[BibT_eX]

[DOI]

Giuseppe Liotta

Stephen K. Wismath

J. Graph Algorithms Appl., 2003

2001

Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes.

[BibT_eX]

[DOI]

Order, 2001

Zonotopes associated with higher Bruhat orders.

[BibT_eX]

[DOI]

Günter M. Ziegler

Discret. Math., 2001

Sweeps, arrangements and signotopes.

[BibT_eX]

[DOI]

Helmut Weil

Discret. Appl. Math., 2001

The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

2000

Dimension, Graph and Hypergraph Coloring.

[BibT_eX]

[DOI]

Order, 2000

On the Complexity of Partial Order Properties.

[BibT_eX]

[DOI]

Order, 2000

A Theorem on Higher Bruhat Orders.

[BibT_eX]

[DOI]

Helmut Weil

Discret. Comput. Geom., 2000

A class of point-sets with few k-sets.

[BibT_eX]

[DOI]

Comput. Geom., 2000

1999

The Linear Extension Diameter of a Poset.

[BibT_eX]

[DOI]

Klaus Reuter

SIAM J. Discret. Math., 1999

Finite three dimensional partial orders which are not sphere orders.

[BibT_eX]

[DOI]

Peter C. Fishburn

Discret. Math., 1999

The maximum number of edges in a graph of bounded dimension, with applications to ring theory.

[BibT_eX]

[DOI]

Geir Agnarsson

Discret. Math., 1999

Triangles in Euclidean Arrangements.

[BibT_eX]

[DOI]

Klaus Kriegel

Discret. Comput. Geom., 1999

1998

Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms.

[BibT_eX]

[DOI]

Lorenz Wernisch

SIAM J. Comput., 1998

Tolerance graphs, and orders.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Point-Sets with few k-Sets.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

On-Line Chain Partitions of Orders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

On the Number of Arrangements of Pseudolines.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1997

Trapezoid Graphs and Generalizations, Geometry and Algorithms.

[BibT_eX]

[DOI]

Rudolf Müller

Lorenz Wernisch

Discret. Appl. Math., 1997

Markov Chains for Linear Extensions, the Two-Dimensional Case.

[BibT_eX]

[DOI]

Lorenz Wernisch

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

1995

Colorings of diagrams of interval orders and alpha-sequences of sets.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

On the Interplay Between Interval Dimension and Dimension.

[BibT_eX]

[DOI]

Michel Habib

Rolf H. Möhring

SIAM J. Discret. Math., 1994

On the fractional dimension of partially ordered sets.

[BibT_eX]

[DOI]

Discret. Math., 1994

Constructing Colorings for Diagrams.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Orthogonal Structures in Directed Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

1992

Interval orders: combinatorial structure and algorithms.

[BibT_eX]

[DOI]

PhD thesis, 1992

On the Complexity of Partial Order Properties.

[BibT_eX]

[DOI]