| On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
|
2023 |
Giacomo, Emilio Di |
| Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs
|
2023 |
Aichholzer, Oswin |
| The Parametrized Complexity of the Segment Number
|
2023 |
Cornelsen, Sabine |
| Computing Hive Plots: A Combinatorial Framework
|
2023 |
Nollenburg, Martin |
| One-Bend Drawing of K, in 3D, Revisited
|
2023 |
Devillers, Olivier |
| What Happens at Dagstuhl? Uncovering Patterns Through Visualization
|
2023 |
Klesen, Felix |
| Removing Popular Faces in Curve Arrangements
|
2023 |
Nooijer, Phoebe de |
| Parameterized Complexity of Simultaneous Planarity
|
2023 |
Fink, Simon D. |
| Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs
|
2023 |
Chiu, Alvin |
| Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
|
2023 |
Didimo, Walter |
| A Simple Pipeline for Orthogonal Graph Drawing
|
2023 |
Hegemann, Tim |
| A Collection of Benchmark Datasets for Evaluating Graph Layout Algorithms
|
2023 |
Bartolomeo, Sara Di |
| Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
|
2023 |
Brand, Cornelius |
| A Schnyder-Type Drawing Algorithm for 5-Connected Triangulations
|
2023 |
Bernardi, Olivier |
| Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
|
2023 |
Jansen, Bart M. P. |
| On Minimizing the Energy of a Spherical Graph Representation
|
2023 |
DeVos, Matt |
| Accurate and Simple Metaphoric Maps
|
2023 |
Mchedlidze, Tamara |
| Quantum Tutte Embeddings
|
2023 |
Fukuzawa, Shion |
| On Layered Area-Proportional Rectangle Contact Representations
|
2023 |
Haase, Carolina |
| Convex-Geometric k-Planar Graphs Are Convex-Geometric (k+1)-Quasiplanar
|
2023 |
Antic, Todor |
Tag hinzufügen