2023

Maximilian Ettelt,
Models and Analysis for post-quantum-secure Verifiable Delay Functions

Julian Beckenbauer,
A Uniform Hanani-Tutte Theorem for projective and radial planarity

2022

Ismail Mounjid,
Recognizing Simultaneous Trapeoid Graphs via Vertex Splitting

Noah Zuch,
Bend-Optimization for Ortho-Radial Drawings

Marcel Posch,
SPQR-tree Construction via Ear Decompositions – Theory and Experiments

Matthias Pfretzschner
Parameterized Complexity of Simultaneous Planarity

Patricia Bachmann,
3-Coloring Circle Graphs in Theory and Practice

Li Voon Loke,
Crossing-free Orthogonal Graph Drawing on the Torus

2021

Bakhodir Akhmedov,
Enriched Weisfeiler-Lehman Kernel for Disconnected Graphs

Miriam Münch,
Partial and Simultaneous Representations of Circular Permutation Graphs

Mekala Sai Karthik Yadav,
Minimizing the Maximum Number of Crossings per Edge in Straight-line Drawings

Yulia Ivanova,
Augmenting PC-Trees for Testing Planarity of Partially Embedded Graphs

2024

Johannes Kiermeier,
The Linear Bundled Crossing Number

Philipp Schober,
Minor Embedding into Hardware graphs of Quantum Computers

Martin Gruber,
Exploring Debate Dynamics: A Data Visualization Tool for Inference Anchoring theory

2023

Julian Huber,
Evaluation and Comparison of Planarity Algorithms

Luis Göppel,
Efficient Implementation of Modular Graph Decomposition

Tim-Florian Feulner,
Deriving Embeddings and Triconnectivity from the Haeupler-Tarjan Planarity Test

Simon Höfer,
The Min-Cost Flow Algorithm by Chen et al.

Christoph König,
Heuristische Berechnung von Feedback-Arc-Sets mittels Zentralitätsmaßen

Kassian Köck,
Visualization of Bipartite Graphs in Limited Window Size

Michaela Schuhmann,
Das Färbekontaktenationsspiel auf Graphen

2022

Veronika Böhm,
A Unified Hanani-Tutte Theorem for Level-Graphs

Mathieu Schanz,
Algorithmen zur Berechnung optimaler Teameinteilungen unter Fairnessbedingungen

Andreas Strobl,
A Generic Widget Library for Rapid-Prototyping of Graph Algorithms in Jupyter Notebooks

Valentin Frey,
Planarity Testing and Embedding based on the Haeupler-Tarjan algorithm: Implemention and Experiments

2021

Niklas Bayer, 
Isomorphy of Embedded Planar Graphs

Maximilian Strohmeier, 
Testing 1-Gap Planarity of 2-Layer Graphs

Julian Beckenbauer,
3-Reguläres Planares Editieren von Graphen

Alexander Puff,
Berechnung von Orthogonalen Planaren Zeichnungen ohne Kitty Corners

Anna-Maria Bauer,
Gap-Planarität bei 2-lagigen Graphenzeichnungen

Maximilian Kreuthner,
Isomorphie von Planaren Graphen

2020

Jakob Ludwig Baumann,
Höhenoptimierung einfacher Tangles

Patricia Bachmann,
Kreuzungsminimierung in Nachbarschaftsgraphen

Manuel Binder,
Heuristiken zur Optimierung des Backtrackingverfahrens für 1-Planarität

Matthias Pfretzschner,
A Linear-Time Implementation of PC-trees

2019

Marcel Posch,
Cutting Problem and Box Problem

Lisa Duschl,
Edge Casing bei 2lagigen planaren Graphzeichnungen

Pascal Reichinger,
Shuffle Code for Small Permutation Sizes

Daniel Berreiter,
Außen 1-Gap Planare Graphen

2018

Katharina Götz,
Implementation of an Orthoradial Graph Drawing Algorithm