Thomas Bläsius

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 92

Top Venues

CoRR

ESA

ACM Trans. Algorithms

Algorithmica

Karlsruhe Institute of Technology (PHD)

Education History

Karlsruhe Institute of Technology

PHD

Publications

Tobias Bleifuß, Thorsten Papenbrock, Thomas Bläsius, Martin Schirneck, Felix Naumann
Discovering Functional Dependencies through Hitting Set Enumeration. Proc. ACM Manag. Data 2 (1) (2024)
Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. CoRR (2024)
Thomas Bläsius, Philipp Fischbeck
On the External Validity of Average-case Analyses of Graph Algorithms. ACM Trans. Algorithms 20 (1) (2024)
Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, Geert van Wordragen
Structure and Independence in Hyperbolic Uniform Disk Graphs. CoRR (2024)
Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm
Partitioning the Bags of a Tree Decomposition into Cliques. SEA (2023)
Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm
Partitioning the Bags of a Tree Decomposition Into Cliques. CoRR (2023)
Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
The impact of geometry on monochrome regions in the flip Schelling process. Comput. Geom. 108 (2023)
Thomas Bläsius, Max Göttlicher
An Efficient Algorithm for Power Dominating Set. ESA (2023)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
On the Giant Component of Geometric Inhomogeneous Random Graphs. ESA (2023)
Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis
Maximal Cliques in Scale-Free Random Graphs. CoRR (2023)
Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder
Dynamic Flows with Time-Dependent Capacities. CIAC (2023)
Thomas Bläsius, Max Göttlicher
An Efficient Algorithm for Power Dominating Set. CoRR (2023)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
On the Giant Component of Geometric Inhomogeneous Random Graphs. CoRR (2023)
Thomas Bläsius, Marcus Wilhelm
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. IWOCA (2023)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The impact of heterogeneity and geometry on the proof complexity of random satisfiability. Random Struct. Algorithms 63 (4) (2023)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
Strongly Hyperbolic Unit Disk Graphs. STACS (2023)
Nicholas Bieker, Thomas Bläsius, Emil Dohse, Paul Jungeblut
Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete. CoRR (2023)
Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder
Dynamic Flows with Time-Dependent Capacities. CoRR (2023)
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. 67 (1) (2023)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica 85 (12) (2023)
Thomas Bläsius, Simon D. Fink, Ignaz Rutter
Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms 19 (4) (2023)
Thomas Bläsius, Philipp Fischbeck
On the External Validity of Average-Case Analyses of Graph Algorithms. CoRR (2022)
Thomas Bläsius, Philipp Fischbeck
On the External Validity of Average-Case Analyses of Graph Algorithms. ESA (2022)
Thomas Bläsius, Marcus Wilhelm
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. CoRR (2022)
Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX (2022)
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
A Branch-And-Bound Algorithm for Cluster Editing. SEA (2022)
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ACM Trans. Algorithms 18 (2) (2022)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10 (4) (2022)
Thomas Bläsius, Tobias Friedrich, Martin Schirneck
The complexity of dependency detection and discovery in relational databases. Theor. Comput. Sci. 900 (2022)
Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. 124 (2022)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
Routing in Strongly Hyperbolic Unit Disk Graphs. CoRR (2021)
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. IPEC (2021)
Thomas Bläsius, Tobias Friedrich, Martin Schirneck
The Complexity of Dependency Detection and Discovery in Relational Databases. CoRR (2021)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ESA (2021)
Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
An Efficient Branch-and-Bound Solver for Hitting Set. CoRR (2021)
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. IPEC (2021)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA (2021)
Thomas Bläsius, Simon D. Fink, Ignaz Rutter
Synchronized Planarity with Applications to Constrained Planarity Problems. ESA (2021)
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
Efficiently Computing Maximum Flows in Scale-Free Networks. ESA (2021)
Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. ISAAC (2021)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. SEA (2021)
Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs. CoRR (2021)
Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. CoRR (2020)
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. STACS (2020)
Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. ATMOS (2020)
Thomas Bläsius, Tobias Friedrich, Martin Schirneck
The Minimization of Random Hypergraphs. ESA (2020)
Thomas Bläsius, Simon D. Fink, Ignaz Rutter
Synchronized Planarity with Applications to Constrained Planarity Problems. CoRR (2020)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR (2020)
Johann Birnick, Thomas Bläsius, Tobias Friedrich, Felix Naumann, Thorsten Papenbrock, Martin Schirneck
Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. Proc. VLDB Endow. 13 (11) (2020)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics 25 (2020)
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
Efficiently Computing Maximum Flows in Scale-Free Networks. CoRR (2020)
Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR (2020)
Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX (2019)
Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton
On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. TACAS (1) (2019)
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. CoRR (2019)
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. WAW (2019)
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. CoRR (2019)
Thomas Bläsius, Marcel Radermacher, Ignaz Rutter
How to Draw a Planarization. J. Graph Algorithms Appl. 23 (4) (2019)
Thomas Bläsius, Tobias Friedrich, Martin Schirneck
The Minimization of Random Hypergraphs. CoRR (2019)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA (2019)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR (2019)
Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. IEEE/ACM Trans. Netw. 26 (2) (2018)
Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann
Memory-Restricted Routing with Tiled Map Data. SMC (2018)
Thomas Bläsius, Annette Karrer, Ignaz Rutter
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Algorithmica 80 (4) (2018)
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR (2018)
Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck
On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR (2018)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX (2018)
Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
Scalable exact visualization of isocontours in road networks via minimum-link paths. J. Comput. Geom. 9 (1) (2018)
Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
Local and union boxicity. Discret. Math. 341 (5) (2018)
Thomas Bläsius, Tobias Friedrich, Anton Krohmer
Cliques in Hyperbolic Random Graphs. Algorithmica 80 (8) (2018)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel
Towards a Systematic Evaluation of Generative Network Models. WAW (2018)
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ICALP (2018)
Thomas Bläsius, Marcel Radermacher, Ignaz Rutter
How to Draw a Planarization. SOFSEM (2017)
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
Demonstrating TrussFab's Editor: Designing Sturdy Large-Scale Structures. UIST (Adjunct Volume) (2017)
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, Patrick Baudisch
TrussFab: Fabricating Sturdy Large-Scale Structures on Desktop 3D Printers. CHI (2017)
Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths. CoRR (2016)
Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. ESA (2016)
Thomas Bläsius, Ignaz Rutter
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. ACM Trans. Algorithms 12 (2) (2016)
Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. ESA (2016)
Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
Orthogonal graph drawing with inflexible edges. Comput. Geom. 55 (2016)
Thomas Bläsius, Tobias Friedrich, Martin Schirneck
The Parameterized Complexity of Dependency Detection in Relational Databases. IPEC (2016)
Thomas Bläsius, Tobias Friedrich, Anton Krohmer
Hyperbolic Random Graphs: Separators and Treewidth. ESA (2016)
Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
Local and Union Boxicity. CoRR (2016)
Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
Optimal Orthogonal Graph Drawing with Convex Bend Costs. ACM Trans. Algorithms 12 (3) (2016)
Thomas Bläsius, Ignaz Rutter
A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. 609 (2016)
Thomas Bläsius, Annette Karrer, Ignaz Rutter
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. CoRR (2015)
Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
Pixel and Voxel Representations of Graphs. Graph Drawing (2015)
Thomas Bläsius
Neue Methoden für klassische Grapheinbettungsprobleme - Orthogonale Zeichnungen & bedingte Planarität. Ausgezeichnete Informatikdissertationen (2015)
Thomas Bläsius, Ignaz Rutter
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. CoRR (2015)
Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
Orthogonal Graph Drawing with Inflexible Edges. CIAC (2015)
Thomas Bläsius, Ignaz Rutter
Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. 48 (6) (2015)
Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
Pixel and Voxel Representations of Graphs. CoRR (2015)
Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
Testing Mutual duality of Planar graphs. Int. J. Comput. Geom. Appl. 24 (4) (2014)
Thomas Bläsius, Guido Brückner, Ignaz Rutter
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. ESA (2014)
Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
Orthogonal Graph Drawing with Inflexible Edges. CoRR (2014)
Thomas Bläsius, Guido Brückner, Ignaz Rutter
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. CoRR (2014)
Thomas Bläsius, Ignaz Rutter
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. Graph Drawing (2014)
Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica 68 (4) (2014)
Thomas Bläsius, Ignaz Rutter
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. SODA (2013)
Therese C. Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. Graph Drawing (2013)

Thomas Bläsius.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Bläsius