Alexander Wolff
Julius-Maximilians-Universität Würzburg
H-index: 32
Europe-Germany
Top articles of Alexander Wolff
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Eliminating Crossings in Ordered Graphs | arXiv preprint arXiv:2404.09771 | Akanksha Agrawal Sergio Cabello Michael Kaufmann Saket Saurabh Roohani Sharma | 2024/4/15 |
Constrained and ordered level planarity parameterized by the number of levels | arXiv preprint arXiv:2403.13702 | Václav Blažej Boris Klemz Felix Klesen Marie Diana Sieper Alexander Wolff | 2024/3/20 |
Morphing Graph Drawings in the Presence of Point Obstacles | Oksana Firman Tim Hegemann Boris Klemz Felix Klesen Marie Diana Sieper | 2024/2/7 | |
Outerplanar and Forest Storyplans | Jiří Fiala Oksana Firman Giuseppe Liotta Alexander Wolff Johannes Zink | 2024/2/7 | |
Deciding the Feasibility and Minimizing the Height of Tangles | arXiv preprint arXiv:2312.16213 | Oksana Firman Philipp Kindermann Boris Klemz Alexander Ravsky Alexander Wolff | 2023/12/23 |
Morphing planar graph drawings through 3D | Kevin Buchin Will Evans Fabrizio Frati Irina Kostitsyna Maarten Löffler | 2023/1/1 | |
Check for updates Coloring Mixed and Directional Interval Graphs | Graph Drawing and Network Visualization: 30th International Symposium, GD 2022, Tokyo, Japan, September 13–16, 2022, Revised Selected Papers | Grzegorz Gutowski¹ Florian Mittelstädt Ignaz Rutter Joachim Spoerhase¹ Alexander Wolff | 2023/1/18 |
Planar L-Drawings of Directed Graphs | Computing in Geometry and Topology | Steven Chaplick Markus Chimani Sabine Cornelsen Giordano Da Lozzo Martin Nöllenburg | 2023/11/12 |
The complexity of finding tangles | Oksana Firman Philipp Kindermann Boris Klemz Alexander Ravsky Alexander Wolff | 2023/1/1 | |
Coloring and Recognizing Mixed Interval Graphs | Grzegorz Gutowski Konstanty Junosza-Szaniawski Felix Klesen Paweł Rzążewski Alexander Wolff | 2023 | |
Adjacency graphs of polyhedral surfaces | Discrete & Computational Geometry | Elena Arseneva Linda Kleist Boris Klemz Maarten Löffler André Schulz | 2023/10/18 |
The computational complexity of the ChordLink model | Journal of Graph Algorithms and Applications | Philipp Kindermann Jan Sauer Alexander Wolff | 2023 |
A Simple Pipeline for Orthogonal Graph Drawing | Tim Hegemann Alexander Wolff | 2023/9/20 | |
Visualizing multispecies coalescent trees: drawing gene trees inside species trees | Jonathan Klawitter Felix Klesen Moritz Niederer Alexander Wolff | 2023/1/1 | |
The parametrized complexity of the segment number | Sabine Cornelsen Giordano Da Lozzo Luca Grilli Siddharth Gupta Jan Kratochvíl | 2023/9/20 | |
Parameterized approaches to orthogonal compaction | Walter Didimo Siddharth Gupta Philipp Kindermann Giuseppe Liotta Alexander Wolff | 2023/1/1 | |
The complexity of drawing graphs on few lines and few planes | J. Graph Algorithms Appl | Steven Chaplick Krzysztof Fleszar Fabian Lipp Alexander Ravsky Oleg Verbitsky | 2023/7 |
Layered drawing of undirected graphs with generalized port constraints | Computational Geometry | Johannes Zink Julian Walter Joachim Baumeister Alexander Wolff | 2022/8/1 |
Bounding and computing obstacle numbers of graphs | arXiv preprint arXiv:2206.15414 | Martin Balko Steven Chaplick Robert Ganian Siddharth Gupta Michael Hoffmann | 2022/6/30 |
The segment number: algorithms and universal lower bounds for some classes of planar graphs | Ina Goeßmann Jonathan Klawitter Boris Klemz Felix Klesen Stephen Kobourov | 2022/6/22 |
Co-Authors
