default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Felsner
Person information
- affiliation: TU Berlin, Institute of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j98]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher
, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber:
Coloring circle arrangements: New 4-chromatic planar graphs. Eur. J. Comb. 121: 103839 (2024)- [c63]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher:
Plane Hamiltonian Cycles in Convex Drawings. SoCG 2024: 18:1-18:16 - [c62]Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher:
An Improved Lower Bound on the Number of Pseudoline Arrangements. SoCG 2024: 43:1-43:18 - [c61]Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber:
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. SODA 2024: 4849-4871 - [e1]Stefan Felsner, Karsten Klein:
32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria. LIPIcs 320, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-343-0 [contents] - [i41]Andrei Asinowski, Jean Cardinal, Stefan Felsner, Éric Fusy:
Combinatorics of rectangulations: Old and new bijections. CoRR abs/2402.01483 (2024) - [i40]Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher:
An Improved Lower Bound on the Number of Pseudoline Arrangements. CoRR abs/2402.13107 (2024) - [i39]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher:
Plane Hamiltonian Cycles in Convex Drawings. CoRR abs/2403.12898 (2024) - 2023
- [j97]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. Discret. Comput. Geom. 70(3): 1121-1143 (2023) - [j96]Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. J. Graph Algorithms Appl. 27(6): 433-457 (2023) - [c60]Helena Bergold, Stefan Felsner, Manfred Scheucher:
An Extension Theorem for Signotopes. SoCG 2023: 17:1-17:14 - [c59]Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, Raphael Steiner:
Linear Size Universal Point Sets for Classes of Planar Graphs. SoCG 2023: 31:1-31:16 - [c58]Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher, Birgit Vogtenhuber:
Bichromatic Perfect Matchings with Crossings. GD (1) 2023: 124-132 - [i38]Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, Raphael Steiner:
Linear Size Universal Point Sets for Classes of Planar Graphs. CoRR abs/2303.00109 (2023) - [i37]Helena Bergold, Stefan Felsner, Manfred Scheucher:
An extension theorem for signotopes. CoRR abs/2303.04079 (2023) - [i36]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Manfred Scheucher:
Using SAT to study plane Hamiltonian substructures in simple drawings. CoRR abs/2305.09432 (2023) - [i35]Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher, Birgit Vogtenhuber:
Bichromatic Perfect Matchings with Crossings. CoRR abs/2309.00546 (2023) - [i34]Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber:
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. CoRR abs/2310.19711 (2023) - 2022
- [j95]Stefan Felsner, Alexander Pilz, Patrick Schnider:
Arrangements of Approaching Pseudo-Lines. Discret. Comput. Geom. 67(2): 380-402 (2022) - [j94]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. J. Graph Algorithms Appl. 26(3): 381-399 (2022) - [j93]Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. Theor. Comput. Sci. 919: 66-74 (2022) - [c57]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. GD 2022: 371-386 - [c56]Stefan Felsner, Sandro Roch, Manfred Scheucher:
Arrangements of Pseudocircles: On Digons and Triangles. GD 2022: 441-455 - [c55]Stefan Felsner, Andrew Nathenson, Csaba D. Tóth:
Aspect Ratio Universal Rectangular Layouts. WALCOM 2022: 73-84 - [c54]Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. WALCOM 2022: 383-395 - [i33]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber:
Coloring circle arrangements: New 4-chromatic planar graphs. CoRR abs/2205.08181 (2022) - [i32]Stefan Felsner, Sandro Roch, Manfred Scheucher:
Arrangements of Pseudocircles: On Digons and Triangles. CoRR abs/2208.12110 (2022) - [i31]Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. CoRR abs/2209.00424 (2022) - 2021
- [j92]Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: Triangles and Drawings. Discret. Comput. Geom. 65(1): 261-278 (2021) - [j91]William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov:
On Area-Universal Quadrangulations. J. Graph Algorithms Appl. 25(1): 171-193 (2021) - [j90]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. SIAM J. Discret. Math. 35(2): 915-927 (2021) - [c53]Stefan Felsner, Torsten Ueckerdt, Kaja Wille:
On the Queue-Number of Partial Orders. GD 2021: 231-241 - [c52]Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr:
Linear Layouts of Complete Graphs. GD 2021: 257-270 - [c51]Marcin Brianski, Stefan Felsner, Jedrzej Hodor, Piotr Micek:
Reconfiguring Independent Sets on Interval Graphs. MFCS 2021: 23:1-23:14 - [i30]Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr:
Linear Layouts of Complete Graphs. CoRR abs/2108.05112 (2021) - [i29]Stefan Felsner, Torsten Ueckerdt, Kaja Wille:
On the Queue-Number of Partial Orders. CoRR abs/2108.09994 (2021) - [i28]Alan Arroyo, Stefan Felsner:
Approximating the Bundled Crossing Number. CoRR abs/2109.14892 (2021) - [i27]Stefan Felsner, Andrew Nathenson, Csaba D. Tóth:
Aspect Ratio Universal Rectangular Layouts. CoRR abs/2112.03242 (2021) - 2020
- [j89]Stefan Felsner, Tamás Mészáros, Piotr Micek:
Boolean Dimension and Tree-Width. Comb. 40(5): 655-677 (2020) - [j88]Stefan Felsner, Winfried Hochstättler, Kolja Knauer, Raphael Steiner:
Complete Acyclic Colorings. Electron. J. Comb. 27(2): 2 (2020) - [j87]Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: On Circularizability. Discret. Comput. Geom. 64(3): 776-813 (2020) - [j86]Stefan Felsner:
4-Connected triangulations on few lines. J. Comput. Geom. 11(1): 476-492 (2020) - [j85]Raphael Steiner, Manfred Scheucher, Stefan Felsner, Pavel Valtr, Man-Kwun Chiu, Patrick Schnider:
On the Average Complexity of the k-Level. J. Comput. Geom. 11(1): 493-506 (2020) - [j84]Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering:
Rainbow Cycles in Flip Graphs. SIAM J. Discret. Math. 34(1): 1-39 (2020) - [c50]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. GD 2020: 281-294 - [c49]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. GD 2020: 382-389 - [c48]Michal Debski, Stefan Felsner, Piotr Micek, Felix Schröder:
Improved bounds for centered colorings. SODA 2020: 2212-2226 - [c47]Stefan Felsner, Kolja Knauer, Torsten Ueckerdt:
Plattenbauten: Touching Rectangles in Space. WG 2020: 161-173 - [i26]Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. CoRR abs/2001.06367 (2020) - [i25]Stefan Felsner, Alexander Pilz, Patrick Schnider:
Arrangements of Approaching Pseudo-Lines. CoRR abs/2001.08419 (2020) - [i24]Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Pentagon contact representations. CoRR abs/2004.05942 (2020) - [i23]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings meet Classical Theorems from Convex Geometry. CoRR abs/2005.12568 (2020) - [i22]Stefan Felsner, Kolja Knauer, Torsten Ueckerdt:
Plattenbauten: Touching Rectangles in Space. CoRR abs/2007.07806 (2020) - [i21]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. CoRR abs/2008.11058 (2020)
2010 – 2019
- 2019
- [j83]Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter:
Separating tree-chromatic number from path-chromatic number. J. Comb. Theory B 138: 206-218 (2019) - [c46]Stefan Felsner:
4-Connected Triangulations on Few Lines. GD 2019: 395-408 - [c45]Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. GD 2019: 409-415 - [c44]Stefan Felsner, Günter Rote:
On Primal-Dual Circle Representations. SOSA 2019: 8:1-8:18 - [i20]Stefan Felsner, Torsten Ueckerdt:
A Note on Covering Young Diagrams with Applications to Local Dimension of Posets. CoRR abs/1902.08223 (2019) - [i19]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. CoRR abs/1904.06760 (2019) - [i18]Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. CoRR abs/1908.07647 (2019) - [i17]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, Pavel Valtr:
On the Average Complexity of the k-Level. CoRR abs/1911.02408 (2019) - 2018
- [j82]Stefan Felsner, Alexander Pilz:
Ham-Sandwich Cuts for Abstract Order Types. Algorithmica 80(1): 234-257 (2018) - [j81]Till Bruckdorfer, Stefan Felsner, Michael Kaufmann:
Planar Bus Graphs. Algorithmica 80(8): 2260-2285 (2018) - [j80]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions. Electron. J. Comb. 25(1): 1 (2018) - [j79]Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Pentagon Contact Representations. Electron. J. Comb. 25(3): 3 (2018) - [j78]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table cartogram. Comput. Geom. 68: 174-185 (2018) - [j77]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. J. Graph Algorithms Appl. 22(1): 67-87 (2018) - [j76]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. J. Graph Algorithms Appl. 22(2): 273-295 (2018) - [j75]Jean Cardinal, Stefan Felsner:
Topological drawings of complete bipartite graphs. J. Comput. Geom. 9(1): 213-246 (2018) - [j74]Steven Chaplick, Stefan Felsner, Udo Hoffmann, Veit Wiechert:
Grid Intersection Graphs and Order Dimension. Order 35(2): 363-391 (2018) - [c43]Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering:
Rainbow Cycles in Flip Graphs. SoCG 2018: 38:1-38:14 - [c42]Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: On Circularizability. GD 2018: 555-568 - [c41]Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Equiangular Polygon Contact Representations. WG 2018: 203-215 - 2017
- [j73]Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho:
Max point-tolerance graphs. Discret. Appl. Math. 216: 84-97 (2017) - [j72]Nieke Aerts, Stefan Felsner:
Straight Line Triangle Representations. Discret. Comput. Geom. 57(2): 257-280 (2017) - [j71]Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert:
Burling graphs, chromatic number, and orthogonal tree-decompositions. Electron. Notes Discret. Math. 61: 415-420 (2017) - [j70]Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Pentagon Contact Representations. Electron. Notes Discret. Math. 61: 421-427 (2017) - [j69]Stefan Felsner, Irina Mustata, Martin Pergel:
The Complexity of the Partial Order Dimension Problem: Closing the Gap. SIAM J. Discret. Math. 31(1): 172-189 (2017) - [c40]Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: Triangles and Drawings. GD 2017: 127-139 - [c39]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. IWOCA 2017: 61-74 - [c38]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. WG 2017: 153-166 - [i16]Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff:
On the Maximum Crossing Number. CoRR abs/1705.05176 (2017) - [i15]Stefan Felsner, Tamás Mészáros, Piotr Micek:
Boolean dimension and tree-width. CoRR abs/1707.06114 (2017) - [i14]Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: Triangles and Drawings. CoRR abs/1708.06449 (2017) - [i13]Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: On Circularizability. CoRR abs/1712.02149 (2017) - [i12]Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering:
Rainbow cycles in flip graphs. CoRR abs/1712.07421 (2017) - 2016
- [j68]Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt:
Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. 206: 48-55 (2016) - [j67]Stefan Felsner, Daniel Heldt:
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j66]Bartlomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki:
On the Duality of Semiantichains and Unichain Coverings. Order 33(1): 29-38 (2016) - [c37]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. SoCG 2016: 37:1-37:15 - [c36]Jean Cardinal, Stefan Felsner:
Topological Drawings of Complete Bipartite Graphs. GD 2016: 441-453 - [c35]Stefan Felsner, Daniel Heldt:
Mixing Times of Markov Chains of 2-Orientations. WALCOM 2016: 114-127 - [i11]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. CoRR abs/1601.01598 (2016) - [i10]Jean Cardinal, Stefan Felsner:
Topological Drawings of Complete Bipartite Graphs. CoRR abs/1608.08324 (2016) - [i9]Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. CoRR abs/1612.03638 (2016) - 2015
- [j65]Jean Cardinal, Stefan Felsner:
Covering Partial Cubes with Zones. Electron. J. Comb. 22(3): 3 (2015) - [j64]Stefan Felsner, William T. Trotter, Veit Wiechert:
The Dimension of Posets with Planar Cover Graphs. Graphs Comb. 31(4): 927-939 (2015) - [j63]Nieke Aerts, Stefan Felsner:
Straight-Line Triangle Representations via Schnyder Labelings. J. Graph Algorithms Appl. 19(1): 467-505 (2015) - [j62]Nieke Aerts, Stefan Felsner:
Vertex Contact Representations of Paths on a Grid. J. Graph Algorithms Appl. 19(3): 817-849 (2015) - [j61]Stefan Felsner, Daniel Heldt:
Lattice Path Enumeration and Toeplitz Matrices. J. Integer Seq. 18(1): 15.1.3 (2015) - [j60]Stefan Felsner, Thibault Manneville:
Linear Extensions of N-free Orders. Order 32(2): 147-155 (2015) - [c34]Stefan Felsner, Piotr Micek, Torsten Ueckerdt:
On-line Coloring between Two Lines. SoCG 2015: 630-641 - [p1]Stefan Felsner:
Shifting Segments to Optimality. Gems of Combinatorial Optimization and Graph Algorithms 2015: 1-12 - [i8]Stefan Felsner, Alexander Pilz:
Ham-Sandwich Cuts for Abstract Order Types. CoRR abs/1503.02970 (2015) - [i7]Nieke Aerts, Stefan Felsner:
Straight Line Triangle Representations. CoRR abs/1503.06970 (2015) - [i6]Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho:
Max Point-Tolerance Graphs. CoRR abs/1508.03810 (2015) - 2014
- [j59]Stefan Felsner, Michael Kaufmann, Pavel Valtr:
Bend-optimal orthogonal graph drawing in the general position model. Comput. Geom. 47(3): 460-468 (2014) - [j58]Stefan Felsner:
Exploiting Air-Pressure to Map Floorplans on Point Sets. J. Graph Algorithms Appl. 18(2): 233-252 (2014) - [j57]Stefan Felsner:
The Order Dimension of Planar Maps Revisited. SIAM J. Discret. Math. 28(3): 1093-1101 (2014) - [c33]Stefan Felsner, Alexander Pilz:
Ham-Sandwich Cuts for Abstract Order Types. ISAAC 2014: 726-737 - [c32]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. LATIN 2014: 156-167 - [c31]Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt:
Intersection Graphs of L-Shapes and Segments in the Plane. MFCS (2) 2014: 299-310 - [c30]Nieke Aerts, Stefan Felsner:
Vertex Contact Graphs of Paths on a Grid. WG 2014: 56-68 - [i5]Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki:
On the Duality of Semiantichains and Unichain Coverings. CoRR abs/1401.1225 (2014) - [i4]Stefan Felsner, Piotr Micek, Torsten Ueckerdt:
On-line coloring between two lines. CoRR abs/1411.0402 (2014) - 2013
- [j56]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov:
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. Algorithmica 67(1): 3-22 (2013) - [j55]Victor Chepoi, Stefan Felsner:
Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. Comput. Geom. 46(9): 1036-1041 (2013) - [j54]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. Discret. Comput. Geom. 50(3): 784-810 (2013) - [j53]Stefan Felsner, Tomasz Krawczyk, William T. Trotter:
On-Line Dimension for Posets Excluding Two Long Incomparable Chains. Order 30(1): 1-12 (2013) - [j52]Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek:
On-line Chain Partitions of Up-growing Semi-orders. Order 30(1): 85-101 (2013) - [c29]Till Bruckdorfer, Stefan Felsner, Michael Kaufmann:
On the Characterization of Plane Bus Graphs. CIAC 2013: 73-84 - [c28]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table Cartograms. ESA 2013: 421-432 - [c27]Nieke Aerts, Stefan Felsner:
Straight Line Triangle Representations. GD 2013: 119-130 - [c26]Stefan Felsner:
Exploiting Air-Pressure to Map Floorplans on Point Sets. GD 2013: 196-207 - [c25]Jean Cardinal, Stefan Felsner:
Covering Partial Cubes with Zones. JCDCGG 2013: 1-13 - [c24]Stefan Felsner, George B. Mertzios, Irina Mustata:
On the Recognition of Four-Directional Orthogonal Ray Graphs. MFCS 2013: 373-384 - [i3]Jean Cardinal, Stefan Felsner:
Covering Partial Cubes with Zones. CoRR abs/1312.2819 (2013) - 2012
- [j51]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov:
Proportional Contact Representations of Planar Graphs. J. Graph Algorithms Appl. 16(3): 701-728 (2012) - [j50]Bartlomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek:
On-Line Chain Partitions of Orders: A Survey. Order 29(1): 49-73 (2012) - [c23]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing cartograms with optimal complexity. SCG 2012: 21-30 - [c22]Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki:
News about Semiantichains and Unichain Coverings. CSR 2012: 43-51 - [i2]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. CoRR abs/1201.0066 (2012) - 2011
- [j49]Stefan Felsner, Pavel Valtr:
Coding and Counting Arrangements of Pseudolines. Discret. Comput. Geom. 46(3): 405-416 (2011) - [j48]Stefan Felsner, Kolja B. Knauer:
Distributive lattices, polyhedra, and generalized flows. Eur. J. Comb. 32(1): 45-59 (2011) - [j47]Stefan Felsner, Ricardo Gómez Aiza, Kolja B. Knauer, Juan José Montellano-Ballesteros, Ricardo Strausz:
Cubic time recognition of cocircuit graphs of uniform oriented matroids. Eur. J. Comb. 32(1): 60-66 (2011) - [j46]Stefan Felsner, Éric Fusy, Marc Noy, David Orden:
Bijections for Baxter families and related objects. J. Comb. Theory A 118(3): 993-1020 (2011) - [j45]Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv:
Points with Large Quadrant Depth. J. Comput. Geom. 2(1): 128-143 (2011) - [j44]Stefan Felsner, Johan Nilsson:
On the Order Dimension of Outerplanar Maps. Order 28(3): 415-435 (2011) - [j43]Stefan Felsner, Mareike Massow:
Linear Extension Diameter of Downset Lattices of Two-Dimensional Posets. SIAM J. Discret. Math. 25(1): 112-129 (2011) - [c21]Stefan Felsner, Mathew C. Francis:
Contact representations of planar graphs with cubes. SCG 2011: 315-320 - [c20]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov:
Proportional Contact Representations of Planar Graphs. GD 2011: 26-38 - [c19]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov:
Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations. ISAAC 2011: 281-291 - 2010
- [j42]Stefan Felsner, Ching Man Li, William T. Trotter:
Adjacency posets of planar graphs. Discret. Math. 310(5): 1097-1104 (2010) - [j41]Stefan Felsner, Éric Fusy, Marc Noy:
Asymptotic enumeration of orientations. Discret. Math. Theor. Comput. Sci. 12(2): 249-262 (2010) - [j40]Stefan Felsner, Clemens Huemer, Sarah Kappes, David Orden:
Binary Labelings for Plane Quadrangulations and their Relatives. Discret. Math. Theor. Comput. Sci. 12(3): 115-138 (2010) - [j39]Cornelia Dangelmayr, Stefan Felsner, William T. Trotter:
Intersection Graphs of Pseudosegments: Chordal Graphs. J. Graph Algorithms Appl. 14(2): 199-220 (2010) - [c18]Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow:
Points with large quadrant-depth. SCG 2010: 358-364
2000 – 2009
- 2009
- [j38]Stefan Felsner, Kolja B. Knauer:
ULD-Lattices and Delta-Bonds. Comb. Probab. Comput. 18(5): 707-724 (2009) - [j37]Stefan Felsner, Mareike Massow:
Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets. Electron. Notes Discret. Math. 34: 313-317 (2009) - 2008
- [j36]Stefan Felsner, Florian Zickfeld:
On the Number of Planar Orientations with Prescribed Degrees. Electron. J. Comb. 15(1) (2008) - [j35]Stefan Felsner, Florian Zickfeld:
Schnyder Woods and Orthogonal Surfaces. Discret. Comput. Geom. 40(1): 103-126 (2008) - [j34]Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril:
Preface. Discret. Math. 308(8): 1347-1349 (2008) - [j33]Stefan Felsner, Mareike Massow:
Parameters of Bar k-Visibility Graphs. J. Graph Algorithms Appl. 12(1): 5-27 (2008) - [j32]Stefan Felsner, Sarah Kappes:
Orthogonal Surfaces and Their CP-Orders. Order 25(1): 19-47 (2008) - [c17]Stefan Felsner, Martin Pergel:
The Complexity of Sorting with Networks of Stacks and Queues. ESA 2008: 417-429 - 2007
- [j31]Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs. Algorithmica 47(4): 399-420 (2007) - [j30]Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril:
Editorial. Eur. J. Comb. 28(8): 2053-2056 (2007) - [c16]Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta:
Homothetic Triangle Contact Representations of Planar Graphs. CCCG 2007: 233-236 - [c15]Stefan Felsner, Florian Zickfeld:
On the Number of alpha -Orientations. WG 2007: 190-201 - [i1]Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek:
On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders. CoRR abs/0704.1829 (2007) - 2006
- [j29]Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu:
Hamiltonicity and colorings of arrangement graphs. Discret. Appl. Math. 154(17): 2470-2483 (2006) - [c14]Cornelia Dangelmayr, Stefan Felsner:
Chordal Graphs as Intersection Graphs of Pseudosegments. GD 2006: 208-219 - [c13]Stefan Felsner, Mareike Massow:
Thickness of Bar 1-Visibility Graphs. GD 2006: 330-342 - [c12]Stefan Felsner, Florian Zickfeld:
Schnyder Woods and Orthogonal Surfaces. GD 2006: 417-429 - 2005
- [j28]Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz:
Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. Discret. Comput. Geom. 34(3): 411-437 (2005) - [j27]Stefan Felsner, William T. Trotter:
Posets and planar graphs. J. Graph Theory 49(4): 273-284 (2005) - 2004
- [b2]Stefan Felsner:
Geometric Graphs and Arrangements - Some Chapters from Combinatorial Geometry. Advanced lectures in mathematics, Vieweg+Teubner 2004, ISBN 978-3-528-06972-8, pp. I-X, 1-170 - [j26]Stefan Felsner:
Lattice Structures from Planar Graphs. Electron. J. Comb. 11(1) (2004) - [c11]Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs. GD 2004: 60-70 - 2003
- [j25]Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath:
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. J. Graph Algorithms Appl. 7(4): 363-398 (2003) - [j24]Stefan Felsner:
Geodesic Embeddings and Planar Graphs. Order 20(2): 135-150 (2003) - [j23]Stefan Felsner, Vijay Raghavan, Jeremy P. Spinrad:
Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. Order 20(4): 351-364 (2003) - 2001
- [j22]Stefan Felsner:
The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene. Electron. J. Comb. 8(1) (2001) - [j21]Stefan Felsner, Helmut Weil:
Sweeps, arrangements and signotopes. Discret. Appl. Math. 109(1-2): 67-94 (2001) - [j20]Stefan Felsner, Günter M. Ziegler:
Zonotopes associated with higher Bruhat orders. Discret. Math. 241(1-3): 301-312 (2001) - [j19]Stefan Felsner:
Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes. Order 18(1): 19-37 (2001) - [c10]Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath:
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. GD 2001: 328-342 - 2000
- [j18]Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl:
A class of point-sets with few k-sets. Comput. Geom. 16(2): 95-101 (2000) - [j17]Stefan Felsner, Helmut Weil:
A Theorem on Higher Bruhat Orders. Discret. Comput. Geom. 23(1): 121-127 (2000) - [j16]Stefan Felsner, William T. Trotter:
Dimension, Graph and Hypergraph Coloring. Order 17(2): 167-177 (2000) - [j15]Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner:
On the Complexity of Partial Order Properties. Order 17(2): 179-193 (2000) - [c9]Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu:
Hamiltonicity and colorings of arrangement graphs. SODA 2000: 155-164
1990 – 1999
- 1999
- [j14]Stefan Felsner, Klaus Kriegel:
Triangles in Euclidean Arrangements. Discret. Comput. Geom. 22(3): 429-438 (1999) - [j13]Geir Agnarsson, Stefan Felsner, William T. Trotter:
The maximum number of edges in a graph of bounded dimension, with applications to ring theory. Discret. Math. 201(1-3): 5-19 (1999) - [j12]Stefan Felsner, Peter C. Fishburn, William T. Trotter:
Finite three dimensional partial orders which are not sphere orders. Discret. Math. 201(1-3): 101-132 (1999) - [j11]Stefan Felsner, Klaus Reuter:
The Linear Extension Diameter of a Poset. SIAM J. Discret. Math. 12(3): 360-373 (1999) - 1998
- [j10]Stefan Felsner:
Tolerance graphs, and orders. J. Graph Theory 28(3): 129-140 (1998) - [j9]Stefan Felsner, Lorenz Wernisch:
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms. SIAM J. Comput. 28(1): 192-209 (1998) - [c8]Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy:
Point-Sets with few k-Sets. SCG 1998: 200-205 - [c7]Stefan Felsner, Klaus Kriegel:
Triangles in Euclidean Arrangements. WG 1998: 137-148 - 1997
- [j8]Stefan Felsner, Rudolf Müller, Lorenz Wernisch:
Trapezoid Graphs and Generalizations, Geometry and Algorithms. Discret. Appl. Math. 74(1): 13-32 (1997) - [j7]Stefan Felsner:
On the Number of Arrangements of Pseudolines. Discret. Comput. Geom. 18(3): 257-267 (1997) - [j6]Stefan Felsner:
On-Line Chain Partitions of Orders. Theor. Comput. Sci. 175(2): 283-292 (1997) - [c6]Stefan Felsner, Lorenz Wernisch:
Markov Chains for Linear Extensions, the Two-Dimensional Case. SODA 1997: 239-247 - 1996
- [c5]Stefan Felsner:
On the Number of Arrangements of Pseudolines. SCG 1996: 30-37 - 1995
- [j5]Stefan Felsner, William T. Trotter:
Colorings of diagrams of interval orders and alpha-sequences of sets. Discret. Math. 144(1-3): 23-31 (1995) - 1994
- [j4]Stefan Felsner, Jens Gustedt, Michel Morvan, Jean-Xavier Rampon:
Constructing Colorings for Diagrams. Discret. Appl. Math. 51(1-2): 85-93 (1994) - [j3]Stefan Felsner, William T. Trotter:
On the fractional dimension of partially ordered sets. Discret. Math. 136(1-3): 101-117 (1994) - [j2]Stefan Felsner, Michel Habib, Rolf H. Möhring:
On the Interplay Between Interval Dimension and Dimension. SIAM J. Discret. Math. 7(1): 32-40 (1994) - [c4]Stefan Felsner, Rudolf Müller, Lorenz Wernisch:
Trapezoid Graphs and Generalizations, Geometry and Algorithms. SWAT 1994: 143-154 - 1993
- [j1]Stefan Felsner:
Orthogonal Structures in Directed Graphs. J. Comb. Theory B 57(2): 309-321 (1993) - [c3]Stefan Felsner, Lorenz Wernisch:
Maximum k-chains in planar point sets: combinatorial structure and algorithms. STOC 1993: 146-153 - 1992
- [b1]Stefan Felsner:
Interval orders: combinatorial structure and algorithms. Technical University of Berlin, Germany, 1992 - [c2]Stefan Felsner:
Tolerance Graphs and Orders. WG 1992: 17-26 - [c1]Stefan Felsner, Dorothea Wagner:
On the Complexity of Partial Order Properties. WG 1992: 225-235
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
