Stefan Felsner
Orcid: 0000-0002-6150-1998Affiliations:
- TU Berlin, Institute of Mathematics, Germany
According to our database1,
Stefan Felsner
authored at least 140 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
Discret. Comput. Geom., October, 2023
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023
Proceedings of the 39th International Symposium on Computational Geometry, 2023
Proceedings of the 39th International Symposium on Computational Geometry, 2023
2022
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations.
Theor. Comput. Sci., 2022
On the Maximum Number of Crossings in Star-Simple Drawings of K<sub>n</sub> with No Empty Lens.
J. Graph Algorithms Appl., 2022
Proceedings of the WALCOM: Algorithms and Computation, 2022
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022
2021
SIAM J. Discret. Math., 2021
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021
2020
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
On the Maximum Number of Crossings in Star-Simple Drawings of K<sub>n</sub> with No Empty Lens.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020
2019
CoRR, 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019
2018
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
2017
SIAM J. Discret. Math., 2017
Electron. Notes Discret. Math., 2017
2016
Discret. Math. Theor. Comput. Sci., 2016
Discret. Appl. Math., 2016
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
J. Graph Algorithms Appl., 2015
Proceedings of the 31st International Symposium on Computational Geometry, 2015
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015
2014
J. Graph Algorithms Appl., 2014
Comput. Geom., 2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
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
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013
2012
J. Graph Algorithms Appl., 2012
Proceedings of the Computer Science - Theory and Applications, 2012
2011
SIAM J. Discret. Math., 2011
Eur. J. Comb., 2011
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011
2010
J. Graph Algorithms Appl., 2010
Discret. Math. Theor. Comput. Sci., 2010
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
2009
Electron. Notes Discret. Math., 2009
2008
Electron. J. Comb., 2008
Proceedings of the Algorithms, 2008
2007
On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders
CoRR, 2007
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2006
Proceedings of the Graph Drawing, 14th International Symposium, 2006
Proceedings of the Graph Drawing, 14th International Symposium, 2006
2005
Discret. Comput. Geom., 2005
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
J. Graph Algorithms Appl., 2003
2001
Electron. J. Comb., 2001
2000
1999
Discret. Math., 1999
The maximum number of edges in a graph of bounded dimension, with applications to ring theory.
Discret. Math., 1999
1998
SIAM J. Comput., 1998
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998
1997
Discret. Appl. Math., 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
1995
Discret. Math., 1995
1994
SIAM J. Discret. Math., 1994
1993
1992
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992