Stefan Felsner

According to our database1, Stefan Felsner authored at least 116 papers between 1992 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Arrangements of Approaching Pseudo-Lines.
CoRR, 2020

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

Improved bounds for centered colorings.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Separating tree-chromatic number from path-chromatic number.
J. Comb. Theory, Ser. B, 2019

On the Average Complexity of the k-Level.
CoRR, 2019

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

On Primal-Dual Circle Representations.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

4-Connected Triangulations on Few Lines.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Line and Plane Cover Numbers Revisited.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
Grid Intersection Graphs and Order Dimension.
Order, 2018

Topological drawings of complete bipartite graphs.
JoCG, 2018

On the Maximum Crossing Number.
J. Graph Algorithms Appl., 2018

Intersection Graphs of Rays and Grounded Segments.
J. Graph Algorithms Appl., 2018

Table cartogram.
Comput. Geom., 2018

Ham-Sandwich Cuts for Abstract Order Types.
Algorithmica, 2018

Planar Bus Graphs.
Algorithmica, 2018

Equiangular Polygon Contact Representations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Arrangements of Pseudocircles: On Circularizability.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Rainbow Cycles in Flip Graphs.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
The Complexity of the Partial Order Dimension Problem: Closing the Gap.
SIAM J. Discrete Math., 2017

Pentagon Contact Representations.
Electronic Notes in Discrete Mathematics, 2017

Burling graphs, chromatic number, and orthogonal tree-decompositions.
Electronic Notes in Discrete Mathematics, 2017

Straight Line Triangle Representations.
Discrete & Computational Geometry, 2017

Max point-tolerance graphs.
Discrete Applied Mathematics, 2017

Boolean dimension and tree-width.
CoRR, 2017

Arrangements of Pseudocircles: Triangles and Drawings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
On the Duality of Semiantichains and Unichain Coverings.
Order, 2016

Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs.
Discrete Mathematics & Theoretical Computer Science, 2016

Intersection graphs of L-shapes and segments in the plane.
Discrete Applied Mathematics, 2016

Mixing Times of Markov Chains of 2-Orientations.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Strongly Monotone Drawings of Planar Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Linear Extensions of N-free Orders.
Order, 2015

Vertex Contact Representations of Paths on a Grid.
J. Graph Algorithms Appl., 2015

Straight-Line Triangle Representations via Schnyder Labelings.
J. Graph Algorithms Appl., 2015

The Dimension of Posets with Planar Cover Graphs.
Graphs and Combinatorics, 2015

Covering Partial Cubes with Zones.
Electr. J. Comb., 2015

On-line Coloring between Two Lines.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Shifting Segments to Optimality.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
The Order Dimension of Planar Maps Revisited.
SIAM J. Discrete Math., 2014

Exploiting Air-Pressure to Map Floorplans on Point Sets.
J. Graph Algorithms Appl., 2014

Bend-optimal orthogonal graph drawing in the general position model.
Comput. Geom., 2014

Vertex Contact Graphs of Paths on a Grid.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Drawing HV-Restricted Planar Graphs.
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.
Order, 2013

On-line Chain Partitions of Up-growing Semi-orders.
Order, 2013

Computing Cartograms with Optimal Complexity.
Discrete & Computational Geometry, 2013

Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve.
Comput. Geom., 2013

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

On the Recognition of Four-Directional Orthogonal Ray Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Table Cartograms.
Proceedings of the Algorithms - ESA 2013, 2013

On the Characterization of Plane Bus Graphs.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
On-Line Chain Partitions of Orders: A Survey.
Order, 2012

Proportional Contact Representations of Planar Graphs.
J. Graph Algorithms Appl., 2012

News about Semiantichains and Unichain Coverings.
Proceedings of the Computer Science - Theory and Applications, 2012

2011
Linear Extension Diameter of Downset Lattices of Two-Dimensional Posets.
SIAM J. Discrete Math., 2011

On the Order Dimension of Outerplanar Maps.
Order, 2011

Points with Large Quadrant Depth.
JoCG, 2011

Bijections for Baxter families and related objects.
J. Comb. Theory, Ser. A, 2011

Distributive lattices, polyhedra, and generalized flows.
Eur. J. Comb., 2011

Cubic time recognition of cocircuit graphs of uniform oriented matroids.
Eur. J. Comb., 2011

Coding and Counting Arrangements of Pseudolines.
Discrete & Computational Geometry, 2011

Contact representations of planar graphs with cubes.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Intersection Graphs of Pseudosegments: Chordal Graphs.
J. Graph Algorithms Appl., 2010

Binary Labelings for Plane Quadrangulations and their Relatives.
Discrete Mathematics & Theoretical Computer Science, 2010

Asymptotic enumeration of orientations.
Discrete Mathematics & Theoretical Computer Science, 2010

Adjacency posets of planar graphs.
Discrete Mathematics, 2010

Points with large quadrant-depth.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets.
Electronic Notes in Discrete Mathematics, 2009

ULD-Lattices and Delta-Bonds.
Combinatorics, Probability & Computing, 2009

2008
Orthogonal Surfaces and Their CP-Orders.
Order, 2008

Parameters of Bar k-Visibility Graphs.
J. Graph Algorithms Appl., 2008

Preface.
Discrete Mathematics, 2008

Schnyder Woods and Orthogonal Surfaces.
Discrete & Computational Geometry, 2008

On the Number of Planar Orientations with Prescribed Degrees.
Electr. J. Comb., 2008

The Complexity of Sorting with Networks of Stacks and Queues.
Proceedings of the Algorithms, 2008

2007
Editorial.
Eur. J. Comb., 2007

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

Convex Drawings of 3-Connected Plane Graphs.
Algorithmica, 2007

On the Number of alpha -Orientations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Homothetic Triangle Contact Representations of Planar Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Hamiltonicity and colorings of arrangement graphs.
Discrete Applied Mathematics, 2006

Thickness of Bar 1-Visibility Graphs.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

Chordal Graphs as Intersection Graphs of Pseudosegments.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

2005
Posets and planar graphs.
Journal of Graph Theory, 2005

Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines.
Discrete & Computational Geometry, 2005

2004
Lattice Structures from Planar Graphs.
Electr. J. Comb., 2004

Geometric Graphs and Arrangements - Some Chapters from Combinatorial Geometry.
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.
Order, 2003

Geodesic Embeddings and Planar Graphs.
Order, 2003

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions.
J. Graph Algorithms Appl., 2003

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

Zonotopes associated with higher Bruhat orders.
Discrete Mathematics, 2001

Sweeps, arrangements and signotopes.
Discrete Applied Mathematics, 2001

The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene.
Electr. J. Comb., 2001

2000
Dimension, Graph and Hypergraph Coloring.
Order, 2000

On the Complexity of Partial Order Properties.
Order, 2000

A Theorem on Higher Bruhat Orders.
Discrete & Computational Geometry, 2000

A class of point-sets with few k-sets.
Comput. Geom., 2000

1999
The Linear Extension Diameter of a Poset.
SIAM J. Discrete Math., 1999

Finite three dimensional partial orders which are not sphere orders.
Discrete Mathematics, 1999

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

Triangles in Euclidean Arrangements.
Discrete & Computational Geometry, 1999

1998
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms.
SIAM J. Comput., 1998

Tolerance graphs, and orders.
Journal of Graph Theory, 1998

Point-Sets with few k-Sets.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
On-Line Chain Partitions of Orders.
Theor. Comput. Sci., 1997

On the Number of Arrangements of Pseudolines.
Discrete & Computational Geometry, 1997

Trapezoid Graphs and Generalizations, Geometry and Algorithms.
Discrete Applied Mathematics, 1997

Markov Chains for Linear Extensions, the Two-Dimensional Case.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1995
Colorings of diagrams of interval orders and alpha-sequences of sets.
Discrete Mathematics, 1995

1994
On the Interplay Between Interval Dimension and Dimension.
SIAM J. Discrete Math., 1994

On the fractional dimension of partially ordered sets.
Discrete Mathematics, 1994

Constructing Colorings for Diagrams.
Discrete Applied Mathematics, 1994

1993
Orthogonal Structures in Directed Graphs.
J. Comb. Theory, Ser. B, 1993

1992
Interval orders: combinatorial structure and algorithms.
PhD thesis, 1992

On the Complexity of Partial Order Properties.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992


  Loading...