Simultaneous Embedding of Planar Graphs - Thomas Bläsius; Stephen G. Kobourov; Ignaz Rutter (CoRR, 2012)

Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. - Therese Biedl; Thomas Bläsius; Benjamin Niedermann; Martin Nöllenburg; Roman Prutkin; Ignaz Rutter (GD, 2013)

Simultaneous Embedding of Planar Graphs. - Thomas Bläsius; Stephen G. Kobourov; Ignaz Rutter (Handbook of Graph Drawing and Visualization, 2013)

Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. - Thomas Bläsius; Guido Brückner; Ignaz Rutter (ESA, 2014)

Orthogonal Graph Drawing with Flexibility Constraints. - Thomas Bläsius; Marcus Krug; Ignaz Rutter; Dorothea Wagner (Algorithmica, 2014)

Testing Mutual duality of Planar graphs. - Patrizio Angelini; Thomas Bläsius; Ignaz Rutter (Int. J. Comput. Geom. Appl., 2014)

Pixel and Voxel Representations of Graphs. - Md. Jawaherul Alam; Thomas Bläsius; Ignaz Rutter; Torsten Ueckerdt; Alexander Wolff 001 (GD, 2015)

Neue Methoden für klassische Grapheinbettungsprobleme - Orthogonale Zeichnungen & bedingte Planarität. - Thomas Bläsius (Ausgezeichnete Informatikdissertationen, 2015)

Disconnectivity and relative positions in simultaneous embeddings. - Thomas Bläsius; Ignaz Rutter (Comput. Geom., 2015)

New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity. - Thomas Bläsius (2015)

Hyperbolic Random Graphs: Separators and Treewidth. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer (ESA, 2016)

The Parameterized Complexity of Dependency Detection in Relational Databases. - Thomas Bläsius; Tobias Friedrich 001; Martin Schirneck (IPEC, 2016)

Orthogonal graph drawing with inflexible edges. - Thomas Bläsius; Sebastian Lehmann; Ignaz Rutter (Comput. Geom., 2016)

Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths. - Moritz Baum; Thomas Bläsius; Andreas Gemsa; Ignaz Rutter; Franziska Wegner (CoRR, 2016)

Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. - Thomas Bläsius; Ignaz Rutter (ACM Trans. Algorithms, 2016)

Optimal Orthogonal Graph Drawing with Convex Bend Costs. - Thomas Bläsius; Ignaz Rutter; Dorothea Wagner (ACM Trans. Algorithms, 2016)

A new perspective on clustered planarity as a combinatorial embedding problem. - Thomas Bläsius; Ignaz Rutter (Theor. Comput. Sci., 2016)

TrussFab: Fabricating Sturdy Large-Scale Structures on Desktop 3D Printers. - Robert Kovacs; Anna Seufert; Ludwig Wall; Hsiang-Ting Chen; Florian Meinel; Willi Müller; Sijing You; Maximilian Brehm; Jonathan Striebel; Yannis Kommana; Alexander Popiak; Thomas Bläsius; et al. (CHI, 2017)

Demonstrating TrussFab's Editor: Designing Sturdy Large-Scale Structures. - Robert Kovacs; Ludwig Wall; Anna Seufert; Hsiang-Ting Chen; Willi Müller; Florian Meinel; Yannis Kommana; Thomas Bläsius; Oliver S. Schneider; Thijs Roumen; Patrick Baudisch (UIST (Adjunct Volume), 2017)

Memory-Restricted Routing with Tiled Map Data. - Thomas Bläsius; Jan Eube; Thomas Feldtkeller; Tobias Friedrich 001; Martin S. Krejca; J. A. Gregor Lagodzinski; Ralf Rothenberger; Julius Severin; Fabian Sommer; Justin Trautmann (SMC, 2018)

Towards a Systematic Evaluation of Generative Network Models. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer; Jonathan Striebel (WAW, 2018)

Cliques in Hyperbolic Random Graphs. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer (Algorithmica, 2018)

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. - Thomas Bläsius; Annette Karrer; Ignaz Rutter (Algorithmica, 2018)

On the Enumeration of Minimal Hitting Sets in Lexicographical Order. - Thomas Bläsius; Tobias Friedrich 001; Kitty Meeks; Martin Schirneck (CoRR, 2018)

Local and union boxicity. - Thomas Bläsius; Peter Stumpf; Torsten Ueckerdt (Discret. Math., 2018)

Scalable exact visualization of isocontours in road networks via minimum-link paths. - Moritz Baum; Thomas Bläsius; Andreas Gemsa; Ignaz Rutter; Franziska Wegner (J. Comput. Geom., 2018)

Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer; Sören Laue (IEEE/ACM Trans. Netw., 2018)

On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. - Thomas Bläsius; Tobias Friedrich 001; Andrew M. Sutton (TACAS (1), 2019)

Understanding the Effectiveness of Data Reduction in Public Transportation Networks. - Thomas Bläsius; Philipp Fischbeck; Tobias Friedrich 001; Martin Schirneck (WAW, 2019)

How to Draw a Planarization. - Thomas Bläsius; Marcel Radermacher; Ignaz Rutter (J. Graph Algorithms Appl., 2019)

A Strategic Routing Framework and Algorithms for Computing Alternative Paths. - Thomas Bläsius; Maximilian Böther; Philipp Fischbeck; Tobias Friedrich 001; Alina Gries; Falk Hüffner; Otto Kißig; Pascal Lenzner; Louise Molitor; Leon Schiller; Armin Wells; Simon Wietheger (ATMOS, 2020)

The Minimization of Random Hypergraphs. - Thomas Bläsius; Tobias Friedrich 001; Martin Schirneck (ESA, 2020)

Hyperbolic Embeddings for Near-Optimal Greedy Routing. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer (ACM J. Exp. Algorithmics, 2020)

Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. - Johann Birnick; Thomas Bläsius; Tobias Friedrich 001; Felix Naumann; Thorsten Papenbrock; Martin Schirneck (Proc. VLDB Endow., 2020)

Efficiently Computing Maximum Flows in Scale-Free Networks. - Thomas Bläsius; Tobias Friedrich 001; Christopher Weyand (ESA, 2021)

PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (IPEC, 2021)

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (IPEC, 2021)

Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann (SEA, 2021)

The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs. - Thomas Bläsius; Tobias Friedrich 001; Martin S. Krejca; Louise Molitor (CoRR, 2021)

Routing in Strongly Hyperbolic Unit Disk Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Daniel Stephan (CoRR, 2021)

An Efficient Branch-and-Bound Solver for Hitting Set. - Thomas Bläsius; Tobias Friedrich 001; David Stangl; Christopher Weyand (ALENEX, 2022)

A Branch-And-Bound Algorithm for Cluster Editing. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (SEA, 2022)

Efficiently enumerating hitting sets of hypergraphs arising in data profiling. - Thomas Bläsius; Tobias Friedrich 001; Julius Lischeid; Kitty Meeks; Martin Schirneck (J. Comput. Syst. Sci., 2022)

Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. - Thomas Bläsius; Cedric Freiberger; Tobias Friedrich 001; Maximilian Katzmann; Felix Montenegro-Retana; Marianne Thieffry (ACM Trans. Algorithms, 2022)

The complexity of dependency detection and discovery in relational databases. - Thomas Bläsius; Tobias Friedrich 001; Martin Schirneck (Theor. Comput. Sci., 2022)

Efficiently generating geometric inhomogeneous and hyperbolic random graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Ulrich Meyer 001; Manuel Penschuck; Christopher Weyand (Netw. Sci., 2022)

Dynamic Flows with Time-Dependent Capacities. - Thomas Bläsius; Adrian Feilhauer; Jannik Westenfelder (CIAC, 2023)

On the Giant Component of Geometric Inhomogeneous Random Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Janosch Ruff; Ziena Zeif (ESA, 2023)

Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. - Thomas Bläsius; Marcus Wilhelm (IWOCA, 2023)

Strongly Hyperbolic Unit Disk Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Daniel Stephan (STACS, 2023)

Partitioning the Bags of a Tree Decomposition into Cliques. - Thomas Bläsius; Maximilian Katzmann; Marcus Wilhelm (SEA, 2023)

The impact of geometry on monochrome regions in the flip Schelling process. - Thomas Bläsius; Tobias Friedrich 001; Martin S. Krejca; Louise Molitor (Comput. Geom., 2023)

Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete. - Nicholas Bieker; Thomas Bläsius; Emil Dohse; Paul Jungeblut (CoRR, 2023)

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. - Thomas Bläsius; Philipp Fischbeck; Tobias Friedrich 001; Maximilian Katzmann (Theory Comput. Syst., 2023)

Synchronized Planarity with Applications to Constrained Planarity Problems. - Thomas Bläsius; Simon D. Fink; Ignaz Rutter (ACM Trans. Algorithms, 2023)

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann (Algorithmica, 2023)

The impact of heterogeneity and geometry on the proof complexity of random satisfiability. - Thomas Bläsius; Tobias Friedrich 001; Andreas Göbel 001; Jordi Levy; Ralf Rothenberger (Random Struct. Algorithms, 2023)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. - Thomas Bläsius; Sarel Cohen; Philipp Fischbeck; Tobias Friedrich 001; Martin S. Krejca (CoRR, 2024)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling. - Thomas Bläsius; Max Göttlicher; Sascha Gritzbach; Wendy Yi (CoRR, 2024)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks. - Lukas Geis; Daniel Allendorf; Thomas Bläsius; Alexander Leonhardt; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (CoRR, 2024)

Maximal cliques in scale-free random graphs. - Thomas Bläsius; Maximilian Katzmann; Clara Stegehuis (Netw. Sci., 2024)

On the External Validity of Average-case Analyses of Graph Algorithms. - Thomas Bläsius; Philipp Fischbeck (ACM Trans. Algorithms, 2024)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation (Data and Code). - Thomas Bläsius; Sarel Cohen; Philipp Fischbeck; Tobias Friedrich 001; Martin S. Krejca (Zenodo, 2024)

Discovering Functional Dependencies through Hitting Set Enumeration. - Tobias Bleifuß; Thorsten Papenbrock; Thomas Bläsius; Martin Schirneck; Felix Naumann (Proc. ACM Manag. Data, 2024)

Weighted Embeddings for Low-Dimensional Graph Representation. - Thomas Bläsius; Jean-Pierre von der Heydt; Maximilian Katzmann; Nikolai Maas (AAAI, 2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs. - Thomas Bläsius; Jean-Pierre von der Heydt; Sándor Kisfaludi-Bak; Marcus Wilhelm; Geert van Wordragen (SoCG, 2025)

Synergistic Traffic Assignment. - Thomas Bläsius; Adrian Feilhauer; Markus Jung; Moritz Laupichler; Peter Sanders 001; Michael Zündorf (AAMAS, 2025)

Customizable Contraction Hierarchies - A Survey. - Thomas Bläsius; Valentin Buchhold; Dorothea Wagner; Tim Zeitz; Michael Zündorf (CoRR, 2025)

An Efficient Algorithm for Power Dominating Set. - Thomas Bläsius; Max Göttlicher (Algorithmica, 2025)

Assortativity in geometric and scale-free networks. - Marc Kaufmann; Ulysse Schaller; Thomas Bläsius; Johannes Lengler (CoRR, 2025)