On the Complexity of Partial Order Properties. - Stefan Felsner; Dorothea Wagner (WG, 1992)

Interval orders: combinatorial structure and algorithms. - Stefan Felsner (1992)

Orthogonal Structures in Directed Graphs. - Stefan Felsner (J. Comb. Theory B, 1993)

Constructing Colorings for Diagrams. - Stefan Felsner; Jens Gustedt; Michel Morvan; Jean-Xavier Rampon (Discret. Appl. Math., 1994)

On the fractional dimension of partially ordered sets. - Stefan Felsner; William T. Trotter (Discret. Math., 1994)

On the Interplay Between Interval Dimension and Dimension. - Stefan Felsner; Michel Habib; Rolf H. Möhring (SIAM J. Discret. Math., 1994)

Colorings of diagrams of interval orders and alpha-sequences of sets. - Stefan Felsner; William T. Trotter (Discret. Math., 1995)

Markov Chains for Linear Extensions, the Two-Dimensional Case. - Stefan Felsner; Lorenz Wernisch (SODA, 1997)

Trapezoid Graphs and Generalizations, Geometry and Algorithms. - Stefan Felsner; Rudolf Müller; Lorenz Wernisch (Discret. Appl. Math., 1997)

On the Number of Arrangements of Pseudolines. - Stefan Felsner (Discret. Comput. Geom., 1997)

On-Line Chain Partitions of Orders. - Stefan Felsner (Theor. Comput. Sci., 1997)

Point-Sets with few k-Sets. - Helmut Alt; Stefan Felsner; Ferran Hurtado; Marc Noy (SCG, 1998)

Tolerance graphs, and orders. - Stefan Felsner (J. Graph Theory, 1998)

Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms. - Stefan Felsner; Lorenz Wernisch (SIAM J. Comput., 1998)

Triangles in Euclidean Arrangements. - Stefan Felsner; Klaus Kriegel (Discret. Comput. Geom., 1999)

The maximum number of edges in a graph of bounded dimension, with applications to ring theory. - Geir Agnarsson; Stefan Felsner; William T. Trotter (Discret. Math., 1999)

Finite three dimensional partial orders which are not sphere orders. - Stefan Felsner; Peter C. Fishburn; William T. Trotter (Discret. Math., 1999)

The Linear Extension Diameter of a Poset. - Stefan Felsner; Klaus Reuter (SIAM J. Discret. Math., 1999)

A class of point-sets with few k-sets. - Helmut Alt; Stefan Felsner; Ferran Hurtado; Marc Noy; Emo Welzl (Comput. Geom., 2000)

A Theorem on Higher Bruhat Orders. - Stefan Felsner; Helmut Weil (Discret. Comput. Geom., 2000)

On the Complexity of Partial Order Properties. - Stefan Felsner; Ravi Kant; C. Pandu Rangan; Dorothea Wagner (Order, 2000)

Dimension, Graph and Hypergraph Coloring. - Stefan Felsner; William T. Trotter (Order, 2000)

The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene. - Stefan Felsner (Electron. J. Comb., 2001)

Sweeps, arrangements and signotopes. - Stefan Felsner; Helmut Weil (Discret. Appl. Math., 2001)

Zonotopes associated with higher Bruhat orders. - Stefan Felsner; Günter M. Ziegler (Discret. Math., 2001)

Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes. - Stefan Felsner (Order, 2001)

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. - Stefan Felsner; Giuseppe Liotta; Stephen K. Wismath (J. Graph Algorithms Appl., 2003)

Geodesic Embeddings and Planar Graphs. - Stefan Felsner (Order, 2003)

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. - Stefan Felsner; Vijay Raghavan 002; Jeremy P. Spinrad (Order, 2003)

Geometric Graphs and Arrangements - Some Chapters from Combinatorial Geometry. - Stefan Felsner (Vieweg+Teubner, 2004)

Lattice Structures from Planar Graphs. - Stefan Felsner (Electron. J. Comb., 2004)

Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. - Stefan Felsner; Bernd Gärtner; Falk Tschirschnitz (Discret. Comput. Geom., 2005)

Posets and planar graphs. - Stefan Felsner; William T. Trotter (J. Graph Theory, 2005)

Chordal Graphs as Intersection Graphs of Pseudosegments. - Cornelia Dangelmayr; Stefan Felsner (GD, 2006)

Thickness of Bar 1-Visibility Graphs. - Stefan Felsner; Mareike Massow (GD, 2006)

Hamiltonicity and colorings of arrangement graphs. - Stefan Felsner; Ferran Hurtado; Marc Noy; Ileana Streinu (Discret. Appl. Math., 2006)

Homothetic Triangle Contact Representations of Planar Graphs. - Melanie Badent; Carla Binucci; Emilio Di Giacomo; Walter Didimo; Stefan Felsner; Francesco Giordano; Jan Kratochvíl; Pietro Palladino; Maurizio Patrignani; Francesco Trotta (CCCG, 2007)

On the Number of alpha -Orientations. - Stefan Felsner; Florian Zickfeld (WG, 2007)

Convex Drawings of 3-Connected Plane Graphs. - Nicolas Bonichon; Stefan Felsner; Mohamed Mosbah 001 (Algorithmica, 2007)

On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders - Stefan Felsner; Kamil Kloch; Grzegorz Matecki; Piotr Micek (CoRR, 2007)

Editorial. - Stefan Felsner; Marco E. Lübbecke; Jarik Nesetril (Eur. J. Comb., 2007)

The Complexity of Sorting with Networks of Stacks and Queues. - Stefan Felsner; Martin Pergel (ESA, 2008)

On the Number of Planar Orientations with Prescribed Degrees. - Stefan Felsner; Florian Zickfeld (Electron. J. Comb., 2008)

Schnyder Woods and Orthogonal Surfaces. - Stefan Felsner; Florian Zickfeld (Discret. Comput. Geom., 2008)

Preface. - Stefan Felsner; Marco E. Lübbecke; Jarik Nesetril (Discret. Math., 2008)

Parameters of Bar k-Visibility Graphs. - Stefan Felsner; Mareike Massow (J. Graph Algorithms Appl., 2008)

Orthogonal Surfaces and Their CP-Orders. - Stefan Felsner; Sarah Kappes (Order, 2008)

ULD-Lattices and Delta-Bonds. - Stefan Felsner; Kolja B. Knauer (Comb. Probab. Comput., 2009)

Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets. - Stefan Felsner; Mareike Massow (Electron. Notes Discret. Math., 2009)

Points with large quadrant-depth. - Roel Apfelbaum; Itay Ben-Dan; Stefan Felsner; Rom Pinchasi; Tillmann Miltzow (SCG, 2010)

Adjacency posets of planar graphs. - Stefan Felsner; Ching Man Li; William T. Trotter (Discret. Math., 2010)

Asymptotic enumeration of orientations. - Stefan Felsner; Éric Fusy; Marc Noy (Discret. Math. Theor. Comput. Sci., 2010)

Binary Labelings for Plane Quadrangulations and their Relatives. - Stefan Felsner; Clemens Huemer; Sarah Kappes; David Orden (Discret. Math. Theor. Comput. Sci., 2010)

Intersection Graphs of Pseudosegments: Chordal Graphs. - Cornelia Dangelmayr; Stefan Felsner; William T. Trotter (J. Graph Algorithms Appl., 2010)

Contact representations of planar graphs with cubes. - Stefan Felsner; Mathew C. Francis (SCG, 2011)

Coding and Counting Arrangements of Pseudolines. - Stefan Felsner; Pavel Valtr 001 (Discret. Comput. Geom., 2011)

Cubic time recognition of cocircuit graphs of uniform oriented matroids. - Stefan Felsner; Ricardo Gómez Aiza; Kolja B. Knauer; Juan José Montellano-Ballesteros; Ricardo Strausz (Eur. J. Comb., 2011)

Distributive lattices, polyhedra, and generalized flows. - Stefan Felsner; Kolja B. Knauer (Eur. J. Comb., 2011)

Bijections for Baxter families and related objects. - Stefan Felsner; Éric Fusy; Marc Noy; David Orden (J. Comb. Theory A, 2011)

Points with Large Quadrant Depth. - Roel Apfelbaum; Itay Ben-Dan; Stefan Felsner; Tillmann Miltzow; Rom Pinchasi; Torsten Ueckerdt; Ran Ziv (J. Comput. Geom., 2011)

On the Order Dimension of Outerplanar Maps. - Stefan Felsner; Johan Nilsson (Order, 2011)

Linear Extension Diameter of Downset Lattices of Two-Dimensional Posets. - Stefan Felsner; Mareike Massow (SIAM J. Discret. Math., 2011)

News about Semiantichains and Unichain Coverings. - Bartlomiej Bosek; Stefan Felsner; Kolja B. Knauer; Grzegorz Matecki (CSR, 2012)

Proportional Contact Representations of Planar Graphs. - Md. Jawaherul Alam; Therese Biedl; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov (J. Graph Algorithms Appl., 2012)

On-Line Chain Partitions of Orders: A Survey. - Bartlomiej Bosek; Stefan Felsner; Kamil Kloch; Tomasz Krawczyk; Grzegorz Matecki; Piotr Micek (Order, 2012)

On the Characterization of Plane Bus Graphs. - Till Bruckdorfer; Stefan Felsner; Michael Kaufmann 001 (CIAC, 2013)

Table Cartograms. - William S. Evans; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov; Debajyoti Mondal; Rahnuma Islam Nishat; Kevin Verbeek (ESA, 2013)

On the Recognition of Four-Directional Orthogonal Ray Graphs. - Stefan Felsner; George B. Mertzios; Irina Mustata (MFCS, 2013)

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. - Muhammad Jawaherul Alam; Therese Biedl; Stefan Felsner; Andreas Gerasch; Michael Kaufmann 001; Stephen G. Kobourov (Algorithmica, 2013)

Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. - Victor Chepoi; Stefan Felsner (Comput. Geom., 2013)

Computing Cartograms with Optimal Complexity. - Md. Jawaherul Alam; Therese Biedl; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov; Torsten Ueckerdt (Discret. Comput. Geom., 2013)

On-line Chain Partitions of Up-growing Semi-orders. - Stefan Felsner; Kamil Kloch; Grzegorz Matecki; Piotr Micek (Order, 2013)

On-Line Dimension for Posets Excluding Two Long Incomparable Chains. - Stefan Felsner; Tomasz Krawczyk; William T. Trotter (Order, 2013)

Drawing HV-Restricted Planar Graphs. - Stephane Durocher; Stefan Felsner; Saeed Mehrabi 001; Debajyoti Mondal (LATIN, 2014)

Vertex Contact Graphs of Paths on a Grid. - Nieke Aerts; Stefan Felsner (WG, 2014)

Bend-optimal orthogonal graph drawing in the general position model. - Stefan Felsner; Michael Kaufmann 001; Pavel Valtr 001 (Comput. Geom., 2014)

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

The Order Dimension of Planar Maps Revisited. - Stefan Felsner (SIAM J. Discret. Math., 2014)

Shifting Segments to Optimality. - Stefan Felsner (Gems of Combinatorial Optimization and Graph Algorithms, 2015)

On-line Coloring between Two Lines. - Stefan Felsner; Piotr Micek; Torsten Ueckerdt (SoCG, 2015)

Covering Partial Cubes with Zones. - Jean Cardinal; Stefan Felsner (Electron. J. Comb., 2015)

The Dimension of Posets with Planar Cover Graphs. - Stefan Felsner; William T. Trotter; Veit Wiechert (Graphs Comb., 2015)

Straight-Line Triangle Representations via Schnyder Labelings. - Nieke Aerts; Stefan Felsner (J. Graph Algorithms Appl., 2015)

Vertex Contact Representations of Paths on a Grid. - Nieke Aerts; Stefan Felsner (J. Graph Algorithms Appl., 2015)

Lattice Path Enumeration and Toeplitz Matrices. - Stefan Felsner; Daniel Heldt (J. Integer Seq., 2015)

Linear Extensions of N-free Orders. - Stefan Felsner; Thibault Manneville (Order, 2015)

Strongly Monotone Drawings of Planar Graphs. - Stefan Felsner; Alexander Igamberdiev; Philipp Kindermann; Boris Klemz; Tamara Mchedlidze; Manfred Scheucher (SoCG, 2016)

Mixing Times of Markov Chains of 2-Orientations. - Stefan Felsner; Daniel Heldt (WALCOM, 2016)

Intersection graphs of L-shapes and segments in the plane. - Stefan Felsner; Kolja B. Knauer; George B. Mertzios; Torsten Ueckerdt (Discret. Appl. Math., 2016)

Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs. - Stefan Felsner; Daniel Heldt (Discret. Math. Theor. Comput. Sci., 2016)

On the Duality of Semiantichains and Unichain Coverings. - Bartlomiej Bosek; Stefan Felsner; Kolja Knauer; Grzegorz Matecki (Order, 2016)

Max point-tolerance graphs. - Daniele Catanzaro; Steven Chaplick; Stefan Felsner; Bjarni V. Halldórsson; Magnús M. Halldórsson; Thomas Hixon; Juraj Stacho (Discret. Appl. Math., 2017)

Straight Line Triangle Representations. - Nieke Aerts; Stefan Felsner (Discret. Comput. Geom., 2017)

Burling graphs, chromatic number, and orthogonal tree-decompositions. - Stefan Felsner; Gwenaël Joret; Piotr Micek; William T. Trotter; Veit Wiechert (Electron. Notes Discret. Math., 2017)

Pentagon Contact Representations. - Stefan Felsner; Hendrik Schrezenmaier; Raphael Steiner (Electron. Notes Discret. Math., 2017)

The Complexity of the Partial Order Dimension Problem: Closing the Gap. - Stefan Felsner; Irina Mustata; Martin Pergel (SIAM J. Discret. Math., 2017)

Equiangular Polygon Contact Representations. - Stefan Felsner; Hendrik Schrezenmaier; Raphael Steiner (WG, 2018)

Planar Bus Graphs. - Till Bruckdorfer; Stefan Felsner; Michael Kaufmann 001 (Algorithmica, 2018)

Ham-Sandwich Cuts for Abstract Order Types. - Stefan Felsner; Alexander Pilz (Algorithmica, 2018)

Table cartogram. - William S. Evans; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov; Debajyoti Mondal; Rahnuma Islam Nishat; Kevin Verbeek (Comput. Geom., 2018)

Intersection Graphs of Rays and Grounded Segments. - Jean Cardinal; Stefan Felsner; Tillmann Miltzow; Casey Tompkins; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2018)

On the Maximum Crossing Number. - Markus Chimani; Stefan Felsner; Stephen G. Kobourov; Torsten Ueckerdt; Pavel Valtr 001; Alexander Wolff 001 (J. Graph Algorithms Appl., 2018)

Topological drawings of complete bipartite graphs. - Jean Cardinal; Stefan Felsner (J. Comput. Geom., 2018)

Grid Intersection Graphs and Order Dimension. - Steven Chaplick; Stefan Felsner; Udo Hoffmann; Veit Wiechert (Order, 2018)

Line and Plane Cover Numbers Revisited. - Therese Biedl; Stefan Felsner; Henk Meijer; Alexander Wolff 001 (GD, 2019)

On Primal-Dual Circle Representations. - Stefan Felsner; Günter Rote (SOSA, 2019)

A Note on Covering Young Diagrams with Applications to Local Dimension of Posets. - Stefan Felsner; Torsten Ueckerdt (CoRR, 2019)

Separating tree-chromatic number from path-chromatic number. - Fidel Barrera-Cruz; Stefan Felsner; Tamás Mészáros 001; Piotr Micek; Heather C. Smith; Libby Taylor; William T. Trotter (J. Comb. Theory B, 2019)

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. - Stefan Felsner; Michael Hoffmann 001; Kristin Knorr; Irene Parada (GD, 2020)

Improved bounds for centered colorings. - Michal Debski; Stefan Felsner; Piotr Micek; Felix Schröder (SODA, 2020)

Boolean Dimension and Tree-Width. - Stefan Felsner; Tamás Mészáros 001; Piotr Micek (Comb., 2020)

Complete Acyclic Colorings. - Stefan Felsner; Winfried Hochstättler; Kolja Knauer; Raphael Steiner (Electron. J. Comb., 2020)

Arrangements of Pseudocircles: On Circularizability. - Stefan Felsner; Manfred Scheucher (Discret. Comput. Geom., 2020)

4-Connected triangulations on few lines. - Stefan Felsner (J. Comput. Geom., 2020)

On the Average Complexity of the k-Level. - Raphael Steiner; Manfred Scheucher; Stefan Felsner; Pavel Valtr 001; Man-Kwun Chiu; Patrick Schnider (J. Comput. Geom., 2020)

Rainbow Cycles in Flip Graphs. - Stefan Felsner; Linda Kleist; Torsten Mütze; Leon Sering (SIAM J. Discret. Math., 2020)

Linear Layouts of Complete Graphs. - Stefan Felsner; Laura Merker; Torsten Ueckerdt; Pavel Valtr 001 (GD, 2021)

On the Queue-Number of Partial Orders. - Stefan Felsner; Torsten Ueckerdt; Kaja Wille (GD, 2021)

Reconfiguring Independent Sets on Interval Graphs. - Marcin Brianski; Stefan Felsner; Jedrzej Hodor; Piotr Micek (MFCS, 2021)

Arrangements of Pseudocircles: Triangles and Drawings. - Stefan Felsner; Manfred Scheucher (Discret. Comput. Geom., 2021)

On Area-Universal Quadrangulations. - William S. Evans; Stefan Felsner; Linda Kleist; Stephen G. Kobourov (J. Graph Algorithms Appl., 2021)

On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. - Gábor Damásdi; Stefan Felsner; António Girão; Balázs Keszegh; David Lewis; Dániel T. Nagy; Torsten Ueckerdt (SIAM J. Discret. Math., 2021)

The Rique-Number of Graphs. - Michael A. Bekos; Stefan Felsner; Philipp Kindermann; Stephen G. Kobourov; Jan Kratochvíl; Ignaz Rutter (GD, 2022)

Arrangements of Pseudocircles: On Digons and Triangles. - Stefan Felsner; Sandro Roch; Manfred Scheucher (GD, 2022)

Aspect Ratio Universal Rectangular Layouts. - Stefan Felsner; Andrew Nathenson; Csaba D. Tóth (WALCOM, 2022)

Arrangements of Approaching Pseudo-Lines. - Stefan Felsner; Alexander Pilz; Patrick Schnider (Discret. Comput. Geom., 2022)

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. - Stefan Felsner; Michael Hoffmann 001; Kristin Knorr; Jan Kyncl; Irene Parada (J. Graph Algorithms Appl., 2022)

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. - Steven Chaplick; Stefan Felsner; Philipp Kindermann; Jonathan Klawitter; Ignaz Rutter; Alexander Wolff 001 (Theor. Comput. Sci., 2022)

An Extension Theorem for Signotopes. - Helena Bergold; Stefan Felsner; Manfred Scheucher (SoCG, 2023)

Linear Size Universal Point Sets for Classes of Planar Graphs. - Stefan Felsner; Hendrik Schrezenmaier; Felix Schröder; Raphael Steiner (SoCG, 2023)

Bichromatic Perfect Matchings with Crossings. - Oswin Aichholzer; Stefan Felsner; Rosna Paul; Manfred Scheucher; Birgit Vogtenhuber (GD (1), 2023)

Using SAT to study plane Hamiltonian substructures in simple drawings. - Helena Bergold; Stefan Felsner; Meghana M. Reddy; Manfred Scheucher (CoRR, 2023)

Approximating the Bundled Crossing Number. - Alan Arroyo; Stefan Felsner (J. Graph Algorithms Appl., 2023)

Topological Drawings Meet Classical Theorems from Convex Geometry. - Helena Bergold; Stefan Felsner; Manfred Scheucher; Felix Schröder; Raphael Steiner (Discret. Comput. Geom., 2023)

Plane Hamiltonian Cycles in Convex Drawings. - Helena Bergold; Stefan Felsner; Meghana M. Reddy; Joachim Orthaber; Manfred Scheucher (SoCG, 2024)

An Improved Lower Bound on the Number of Pseudoline Arrangements. - Fernando Cortés Kühnast; Justin Dallant; Stefan Felsner; Manfred Scheucher (SoCG, 2024)

Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. - Yan Alves Radtke; Stefan Felsner; Johannes Obenaus; Sandro Roch; Manfred Scheucher; Birgit Vogtenhuber (SODA, 2024)

Block coupling and rapidly mixing k-heights. - Stefan Felsner; Daniel Heldt; Sandro Roch; Peter Winkler (CoRR, 2024)

Coloring circle arrangements: New 4-chromatic planar graphs. - Man-Kwun Chiu; Stefan Felsner; Manfred Scheucher; Felix Schröder; Raphael Steiner; Birgit Vogtenhuber (Eur. J. Comb., 2024)

Facet-Hamiltonicity. - Hugo A. Akitaya; Jean Cardinal; Stefan Felsner; Linda Kleist; Robert Lauff (SODA, 2025)

Combinatorics of rectangulations: old and new bijections. - Andrei Asinowski; Jean Cardinal; Stefan Felsner; Éric Fusy (Comb. Theory, 2025)

Plattenbauten: Touching Rectangles in Space. - Stefan Felsner; Kolja Knauer; Torsten Ueckerdt (SIAM J. Discret. Math., 2025)