Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications of Dr. Thomas Bläsius

The following listing contains all publications of Dr. Thomas Bläsius. Further publications of the research group can be found on the current list of publications and the complete list of publications. Individual listings are available externally on DBLP and Google Scholar or locally as PDF.

[ 2021 ] [ 2020 ] [ 2019 ] [ 2018 ] [ 2017 ] [ 2016 ] [ 2015 ] [ 2014 ] [ 2013 ] [ 2012 ] [ 2010 ]

2021 [ nach oben ]

  • Bläsius, Thomas; Tobias, Friedrich; Christopher, Weyand Efficiently Computing Maximum Flows in Scale-Free NetworksEuropean Symposium on Algorithms (ESA) 2021
     
  • Efficiently Approximating... - Download
    Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic GeometryEuropean Symposium on Algorithms (ESA) 2021: 20:1–20:15
     
  • Bläsius, Thomas; Friedrich, Tobias; Krejca, Martin; Molitor, Louise The Impact of Geometry on Monochrome Regions in the Flip Schelling ProcessInternational Symposium on Algorithms and Computation (ISAAC) 2021
     
  • Force-Directed Embedding ... - Download
    Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian Force-Directed Embedding of Scale-Free Networks in the Hyperbolic PlaneSymposium on Experimental Algorithms (SEA) 2021: 22:1–22:18
     
  • The Impact of Heterogenei... - Download
    Bläsius, Thomas; Friedrich, Tobias; Göbel, Andreas; Levy, Jordi; Rothenberger, Ralf The Impact of Heterogeneity and Geometry on the Proof Complexity of Random SatisfiabilitySymposium on Discrete Algorithms (SODA) 2021: 42–53
     

2020 [ nach oben ]

  • Hyperbolic Embeddings for... - Download
    Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton Hyperbolic Embeddings for Near-Optimal Greedy RoutingJournal of Experimental Algorithmics (JEA) 2020
     
  • Hitting Set Enumeration w... - Download
    Birnick, Johann; Bläsius, Thomas; Friedrich, Tobias; Naumann, Felix; Papenbrock, Thorsten; Schirneck, Martin Hitting Set Enumeration with Partial Information for Unique Column Combination DiscoveryProceedings of the VLDB Endowment 2020: 2270–2283
     
  • A Strategic Routing Frame... - Download
    Bläsius, Thomas; Böther, Maximilian; Fischbeck, Philipp; Friedrich, Tobias; Gries, Alina; Hüffner, Falk; Kißig, Otto; Lenzner, Pascal; Molitor, Louise; Schiller, Leon; Wells, Armin; Witheger, Simon A Strategic Routing Framework and Algorithms for Computing Alternative PathsAlgorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 2020: 10:1–10:14
     
  • The Minimization of Rando... - Download
    Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin The Minimization of Random HypergraphsEuropean Symposium on Algorithms (ESA) 2020: 21:1–21:15
     
  • Solving Vertex Cover in P... - Download
    Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Katzmann, Maximilian Solving Vertex Cover in Polynomial Time on Hyperbolic Random GraphsSymposium on the Theoretical Aspects of Computer Science (STACS) 2020: 25:1–25:14
     

2019 [ nach oben ]

  • How to Draw a Planarizati... - Download
    Bläsius, Thomas; Rademacher, Marcel; Rutter, Ignaz How to Draw a PlanarizationGraph Algorithms and Applications 2019: 653–682
     
  • Efficiently Enumerating H... - Download
    Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, Martin Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data ProfilingAlgorithm Engineering and Experiments (ALENEX) 2019: 130–143
     
  • Efficiently Generating Ge... - Download
    Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Meyer, Ulrich; Penschuck, Manuel; Weyand, Christopher Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random GraphsEuropean Symposium on Algorithms (ESA) 2019: 21:2–21:14
    EATCS Best Paper Award
     
  • On the Empirical Time Com... - Download
    Bläsius, Thomas; Friedrich, Tobias; Sutton, Andrew M. On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase TransitionTools and Algorithms for the Construction and Analysis of Systems (TACAS) 2019: 117–134
     
  • Understanding the Effecti... - Download
    Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Schirneck, Martin Understanding the Effectiveness of Data Reduction in Public Transportation NetworksWorkshop on Algorithms and Models for the Web Graph (WAW) 2019: 87–101
     

2018 [ nach oben ]

  • Simultaneous Embedding: E... - Download
    Bläsius, Thomas; Karrer, Annette; Rutter, Ignaz Simultaneous Embedding: Edge Orderings, Relative Positions, CutverticesAlgorithmica 2018: 1214–1277
     
  • Cliques in Hyperbolic Ran... - Download
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton Cliques in Hyperbolic Random GraphsAlgorithmica 2018: 2324–2344
     
  • Local and Union Boxicity - Download
    Bläsius, Thomas; Stumpf, Peter; Ueckerdt, Torsten Local and Union BoxicityDiscrete Mathematics 2018: 1307–1315
     
  • Scalable Exact Visualizat... - Download
    Baum, Moritz; Bläsius, Thomas; Gemsa, Andreas; Rutter, Ignaz; Wegner, Franziska Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link PathsJournal of Computational Geometry 2018: 27–73
     
  • Efficient Embedding of Sc... - Download
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton; Laue, Sören Efficient Embedding of Scale-Free Graphs in the Hyperbolic PlaneTransactions on Networking 2018: 920–933
     
  • Hyperbolic Embeddings for... - Download
    Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton Hyperbolic Embeddings for Near-Optimal Greedy RoutingAlgorithm Engineering and Experiments (ALENEX) 2018: 199–208
     
  • Efficient Shortest Paths ... - Download
    Bläsius, Thomas; Freiberger, Cedric; Friedrich, Tobias; Katzmann, Maximilian; Montenegro-Retana, Felix; Thieffry, Marianne Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic GeometryInternational Colloquium on Automata, Languages, and Programming (ICALP) 2018: 20:1–20:14
     
  • Memory-restricted Routing... - Download
    Bläsius, Thomas; Eube, Jan; Feldtkeller, Thomas; Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rothenberger, Ralf; Severin, Julius; Sommer, Fabian; Trautmann, Justin Memory-restricted Routing With Tiled Map DataSystems, Man, and Cybernetics (SMC) 2018: 3347–3354
     
  • Towards a Systematic Eval... - Download
    Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton; Striebel, Jonathan Towards a Systematic Evaluation of Generative Network ModelsWorkshop on Algorithms and Models for the Web Graph (WAW) 2018: 99–114
     

2017 [ nach oben ]

  • TrussFab: Fabricating Stu... - Download
    Kovacs, Robert; Seufert, Anna; Wall, Ludwig; Chen, Hsiang-Ting; Meinel, Florian; Müller, Willi; You, Sijing; Brehm, Maximilian; Striebel, Jonathan; Kommana, Yannis; Popiak, Alexander; Bläsius, Thomas; Baudisch, Patrick TrussFab: Fabricating Sturdy Large-Scale Structures on Desktop 3D PrintersHuman Factors in Computing Systems (CHI) 2017: 2606–2616
     
  • How to Draw a Planarizati... - Download
    Bläsius, Thomas; Radermacher, Marcel; Rutter, Ignaz How to Draw a PlanarizationCurrent Trends in Theory and Practice of Computer Science (SOFSEM) 2017: 295–308
     

2016 [ nach oben ]

  • Orthogonal Graph Drawing ... - Download
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible EdgesComputational Geometry 2016: 26–40
     
  • A new perspective on clus... - Download
    Bläsius, Thomas; Rutter, Ignaz A new perspective on clustered planarity as a combinatorial embedding problemTheoretical Computer Science 2016: 306–315
     
  • Simultaneous PQ-Ordering ... - Download
    Bläsius, Thomas; Rutter, Ignaz Simultaneous PQ-Ordering with Applications to Constrained Embedding ProblemsTransactions on Algorithms 2016: 16
     
  • Optimal Orthogonal Graph ... - Download
    Bläsius, Thomas; Rutter, Ignaz; Wagner, Dorothea Optimal Orthogonal Graph Drawing with Convex Bend CostsTransactions on Algorithms 2016: 33
     
  • Scalable Exact Visualizat... - Download
    Baum, Moritz; Bläsius, Thomas; Gemsa, Andreas; Rutter, Ignaz; Wegner, Franziska Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link PathsEuropean Symposium on Algorithms (ESA) 2016: 7:1–7:18
     
  • Hyperbolic Random Graphs:... - Download
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton Hyperbolic Random Graphs: Separators and TreewidthEuropean Symposium on Algorithms (ESA) 2016: 15:1–15:16
     
  • Efficient Embedding of Sc... - Download
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton; Laue, Sören Efficient Embedding of Scale-Free Graphs in the Hyperbolic PlaneEuropean Symposium on Algorithms (ESA) 2016: 16:1–16:18
    EATCS Best Paper Award
     
  • The Parameterized Complex... - Download
    Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin The Parameterized Complexity of Dependency Detection in Relational DatabasesInternational Symposium on Parameterized and Exact Computation (IPEC) 2016: 6:1–6:13
     

2015 [ nach oben ]

  • Disconnectivity and relat... - Download
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and relative positions in simultaneous embeddingsComputational Geometry 2015: 459–478
     
  • Orthogonal Graph Drawing ... - Download
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible EdgesInternational Conference on Algorithms and Complexity (CIAC) 2015: 61–73
     
  • Pixel and Voxel Represent... - Download
    Alam, Md. Jawaherul; Bläsius, Thomas; Rutter, Ignaz; Ueckerdt, Torsten; Wolff, Alexander Pixel and Voxel Representations of GraphsGraph Drawing (GD) 2015: 472–486
     
  • New Approaches to Classic... - Download
    Bläsius, Thomas New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained PlanarityDoctoral Dissertation, Karlsruhe Institute of Technology 2015
     

2014 [ nach oben ]

  • Orthogonal Graph Drawing ... - Download
    Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal Graph Drawing with Flexibility ConstraintsAlgorithmica 2014: 859–885
     
  • Testing Mutual duality of... - Download
    Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz Testing Mutual duality of Planar graphsComputational Geometry and Applications 2014: 325–346
     
  • Complexity of Higher-Degr... - Download
    Bläsius, Thomas; Brückner, Guido; Rutter, Ignaz Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky ModelEuropean Symposium on Algorithms (ESA) 2014: 161–172
     
  • A New Perspective on Clus... - Download
    Bläsius, Thomas; Rutter, Ignaz A New Perspective on Clustered Planarity as a Combinatorial Embedding ProblemGraph Drawing (GD) 2014: 440–451
     

2013 [ nach oben ]

  • Simultaneous Embedding of... - Download
    Bläsius, Thomas; Kobourov, Stephen G.; Rutter, Ignaz Simultaneous Embedding of Planar GraphsHandbook of Graph Drawing and Visualization 2013: 349–381
     
  • Simultaneous Embedding: E... - Download
    Bläsius, Thomas; Karrer, Annette; Rutter, Ignaz Simultaneous Embedding: Edge Orderings, Relative Positions, CutverticesGraph Drawing (GD) 2013: 220–231
     
  • Using ILP/SAT to Determin... - Download
    Biedl, Therese C.; Bläsius, Thomas; Niedermann, Benjamin; Nöllenburg, Martin; Prutkin, Roman; Rutter, Ignaz Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph DrawingsGraph Drawing (GD) 2013: 460–471
     
  • Optimal Orthogonal Graph ... - Download
    Bläsius, Thomas; Rutter, Ignaz; Wagner, Dorothea Optimal Orthogonal Graph Drawing with Convex Bend CostsInternational Colloquium on Automata, Languages, and Programming (ICALP) 2013: 184–195
     
  • Testing Mutual Duality of... - Download
    Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz Testing Mutual Duality of Planar GraphsInternational Symposium on Algorithms and Computation (ISAAC) 2013: 350–360
     
  • Simultaneous PQ-Ordering ... - Download
    Bläsius, Thomas; Rutter, Ignaz Simultaneous PQ-Ordering with Applications to Constrained Embedding ProblemsSymposium on Discrete Algorithms (SODA) 2013: 1030–1043
     

2012 [ nach oben ]

  • Disconnectivity and Relat... - Download
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and Relative Positions in Simultaneous EmbeddingsGraph Drawing (GD) 2012: 31–42
     

2010 [ nach oben ]

  • Orthogonal Graph Drawing ... - Download
    Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal Graph Drawing with Flexibility ConstraintsGraph Drawing (GD) 2010: 92–104