Skip to content

Thomas Blsius

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

45

Venues

17

Active years

2010–2026

Best venue rank

A*

Where they publish

Papers

45 indexed papers, newest first.

YearVenueTitleAuthors
2026ESABenchmarking and Engineering Data Structures for Spherical Range Queries.Thomas Blsius, Jean-Pierre von der Heydt, Tobias Kempf, Dennis Kobert, Nikolai Maas
2026ESAEfficient Uniform Negative Edge Weights.Lukas Geis, Daniel Allendorf, Thomas Blsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, Hung Tran
2025AAAIWeighted Embeddings for Low-Dimensional Graph Representation.Thomas Blsius, Jean-Pierre von der Heydt, Maximilian Katzmann, Nikolai Maas
2025ALENEXThe Constrained Layer Tree Problem and Applications to Solar Farm Cabling.Thomas Blsius, Max Gttlicher, Sascha Gritzbach, Wendy Yi
2025ATMOSSeparator-Based Alternative Paths in Customizable Contraction Hierarchies.Scott Bacherle, Thomas Blsius, Michael Zndorf
2023CIACDynamic Flows with Time-Dependent Capacities.Thomas Blsius, Adrian Feilhauer, Jannik Westenfelder
2023ESAOn the Giant Component of Geometric Inhomogeneous Random Graphs.Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
2023ESAAn Efficient Algorithm for Power Dominating Set.Thomas Blsius, Max Gttlicher
2023IWOCADeterministic Performance Guarantees for Bidirectional BFS on Real-World Networks.Thomas Blsius, Marcus Wilhelm
2023STACSStrongly Hyperbolic Unit Disk Graphs.Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
2022ALENEXAn Efficient Branch-and-Bound Solver for Hitting Set.Thomas Blsius, Tobias Friedrich, David Stangl, Christopher Weyand
2022ESAOn the External Validity of Average-Case Analyses of Graph Algorithms.Thomas Blsius, Philipp Fischbeck
2021ESAEfficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.Thomas Blsius, Tobias Friedrich, Maximilian Katzmann
2021ESAEfficiently Computing Maximum Flows in Scale-Free Networks.Thomas Blsius, Tobias Friedrich, Christopher Weyand
2021ESASynchronized Planarity with Applications to Constrained Planarity Problems.Thomas Blsius, Simon D. Fink, Ignaz Rutter
2021ISAACThe Impact of Geometry on Monochrome Regions in the Flip Schelling Process.Thomas Blsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
2021SODAThe Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability.Thomas Blsius, Tobias Friedrich, Andreas Gbel, Jordi Levy, Ralf Rothenberger
2020ATMOSA Strategic Routing Framework and Algorithms for Computing Alternative Paths.Thomas Blsius, Maximilian Bther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hffner, Otto Kiig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger
2020ESAThe Minimization of Random Hypergraphs.Thomas Blsius, Tobias Friedrich, Martin Schirneck
2020STACSSolving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.Thomas Blsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
2019ALENEXEfficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling.Thomas Blsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
2019ESAEfficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2019TACASOn the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition.Thomas Blsius, Tobias Friedrich, Andrew M. Sutton
2019WAWUnderstanding the Effectiveness of Data Reduction in Public Transportation Networks.Thomas Blsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck
2018ALENEXHyperbolic Embeddings for Near-Optimal Greedy Routing.Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2018ICALPEfficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry.Thomas Blsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
2018SMCMemory-Restricted Routing with Tiled Map Data.Thomas Blsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann
2018WAWTowards a Systematic Evaluation of Generative Network Models.Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel
2017CHITrussFab: Fabricating Sturdy Large-Scale Structures on Desktop 3D Printers.Robert Kovacs, Anna Seufert, Ludwig Wall, Hsiang-Ting Chen, Florian Meinel, Willi Mller, Sijing You, Maximilian Brehm, Jonathan Striebel, Yannis Kommana, Alexander Popiak, Thomas Blsius, Patrick Baudisch
2017UISTDemonstrating TrussFab's Editor: Designing Sturdy Large-Scale Structures.Robert Kovacs, Ludwig Wall, Anna Seufert, Hsiang-Ting Chen, Willi Mller, Florian Meinel, Yannis Kommana, Thomas Blsius, Oliver S. Schneider, Thijs Roumen, Patrick Baudisch
2017SOFSEMHow to Draw a Planarization.Thomas Blsius, Marcel Radermacher, Ignaz Rutter
2016ESAScalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths.Moritz Baum, Thomas Blsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner
2016ESAHyperbolic Random Graphs: Separators and Treewidth.Thomas Blsius, Tobias Friedrich, Anton Krohmer
2016ESAEfficient Embedding of Scale-Free Graphs in the Hyperbolic Plane.Thomas Blsius, Tobias Friedrich, Anton Krohmer, Sren Laue
2015CIACOrthogonal Graph Drawing with Inflexible Edges.Thomas Blsius, Sebastian Lehmann, Ignaz Rutter
2015GDPixel and Voxel Representations of Graphs.Md. Jawaherul Alam, Thomas Blsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff
2014ESAComplexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model.Thomas Blsius, Guido Brckner, Ignaz Rutter
2014GDA New Perspective on Clustered Planarity as a Combinatorial Embedding Problem.Thomas Blsius, Ignaz Rutter
2013GDUsing ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings.Therese Biedl, Thomas Blsius, Benjamin Niedermann, Martin Nllenburg, Roman Prutkin, Ignaz Rutter
2013GDSimultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices.Thomas Blsius, Annette Karrer, Ignaz Rutter
2013ICALPOptimal Orthogonal Graph Drawing with Convex Bend Costs.Thomas Blsius, Ignaz Rutter, Dorothea Wagner
2013ISAACTesting Mutual Duality of Planar Graphs.Patrizio Angelini, Thomas Blsius, Ignaz Rutter
2013SODASimultaneous PQ-Ordering with Applications to Constrained Embedding Problems.Thomas Blsius, Ignaz Rutter
2012GDDisconnectivity and Relative Positions in Simultaneous Embeddings.Thomas Blsius, Ignaz Rutter
2010GDOrthogonal Graph Drawing with Flexibility Constraints.Thomas Blsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner