Hasso-Plattner-Institut
  
Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Dr. Thomas Bläsius

Research Group Algorithm Engineering
Hasso Plattner Institute

Office: A-1.4
Tel.: +49 331 5509-412
E-Mail: Thomas.Blaesius(at)hpi.de

Research Interest

Most of my current and past research centers around graph algorithms. More specifically, I am interested in the following aspects.

  • Random scale-free networks (in particular hyperbolic random graphs and related models).
  • Graph drawing (in particular planarity and extensions thereof and orthogonal drawings).

Publications

[2016] [2015] [2014] [2013] [2012] [2010]

2016 [ to top ]

  • OptimalOrthogonalGraphDrawingWithConvexBendCostsJournal.pdf
    Bläsius, Thomas; Rutter, Ignaz; Wagner, Dorothea Optimal Orthogonal Graph Drawing with Convex Bend Costs. Transactions on Algorithms 2016: 33
     
  • EfficientEmbeddingOfScaleFreeGraphsInTheHyperbolicPlane.pdf
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton; Laue, Sören Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. European Symposium on Algorithms (ESA) 2016: 16:1-16:18
     
  • new-perspective-on-clustered-planarity.pdf
    Bläsius, Thomas; Rutter, Ignaz A new perspective on clustered planarity as a combinatorial embedding problem. Theoretical Computer Science 2016: 306-315
     
  • SimultaneousPq-OrderingWithApplicationsToConstrainedEmbeddingProblems.pdf
    Bläsius, Thomas; Rutter, Ignaz Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. Transactions on Algorithms 2016: 16
     
  • Bläsius_et_al_Parameterized_Complexity_of_Dependency_Detection.pdf
    Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin The Parameterized Complexity of Dependency Detection in Relational Databases. International Symposium on Parameterized and Exact Computation (IPEC) 2016
     
  • OrthogonalGraphDrawingsWithInflexibleEdges.pdf
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible Edges. Computational Geometry 2016: 26-40
     
  • HyperbolicRandomGraphsSeparatorsAndTreewidth.pdf
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton Hyperbolic Random Graphs: Separators and Treewidth. European Symposium on Algorithms (ESA) 2016: 15:1-15:16
     
  • ScalableExactVisualizationOfIsocontoursInRoadNetworksViaMinimum-LinkPaths.pdf
    Baum, Moritz; Bläsius, Thomas; Gemsa, Andreas; Rutter, Ignaz; Wegner, Franziska Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. European Symposium on Algorithms (ESA) 2016: 7:1-7:18
     

2015 [ to top ]

  • DisconnectivityAndRelativePositionsInSimultaneousEmbeddingsJournal.pdf
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and relative positions in simultaneous embeddings. Computational Geometry 2015: 459-478
     
  • Blaesius_Thomas_diss.pdf
    Bläsius, Thomas New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings {\&} Constrained Planarity. 2015
     
  • OrthogonalGraphDrawingWithInflexibleEdges.pdf
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible Edges. Conference on Algorithms and Complexity (CIAC) 2015: 61-73
     
  • PixelAndVoxelRepresentationsOfGraphs.pdf
    Alam, Md. Jawaherul; Bläsius, Thomas; Rutter, Ignaz; Ueckerdt, Torsten; Wolff, Alexander Pixel and Voxel Representations of Graphs. Graph Drawing (GD) 2015: 472-486
     

2014 [ to top ]

  • ComplexityOfHigher-DegreeOrthogonalGraphEmbeddingInTheKandinskyModel.pdf
    Bläsius, Thomas; Brückner, Guido; Rutter, Ignaz Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. European Symposium on Algorithms (ESA) 2014: 161-172
     
  • OrthogonalGraphDrawingWithFlexibilityConstraints.pdf
    Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica 2014: 859-885
     
  • ANewPerspectiveOnClusteredPlanarityAsACombinatorialEmbeddingProblem.pdf
    Bläsius, Thomas; Rutter, Ignaz A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. Graph Drawing (GD) 2014: 440-451
     
  • TestingMutualDualityOfPlanarGraphsJournal.pdf
    Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz Testing Mutual duality of Planar graphs. Computational Geometry and Applications 2014: 325-346
     

2013 [ to top ]

  • OptimalOrthogonalGraphDrawingWithConvexBendCosts.pdf
    Bläsius, Thomas; Rutter, Ignaz; Wagner, Dorothea Optimal Orthogonal Graph Drawing with Convex Bend Costs. International Colloquium on Automata, Languages, and Programming (ICALP) 2013: 184-195
     
  • SimultaneousPQOrderingWithApplicationsToConstrainedEmbeddingProblems.pdf
    Bläsius, Thomas; Rutter, Ignaz Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. Symposium on Discrete Algorithms 2013: 1030-1043
     
  • SimultaneousEmbeddingEdgeOrderingsRelativePositionsCutvertices.pdf
    Bläsius, Thomas; Karrer, Annette; Rutter, Ignaz Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Graph Drawing (GD) 2013: 220-231
     
  • TestingMutualDualityOfPlanarGraphs.pdf
    Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz Testing Mutual Duality of Planar Graphs. International Symposium on Algorithms and Computation (ISAAC) 2013: 350-360
     
  • UsingIlp:SatToDeterminePathwidth,VisibilityRepresentations,AndOtherGrid-BasedGraphDrawings.pdf
    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 Drawings. Graph Drawing (GD) 2013: 460-471
     
  • SimultaneousEmbeddingOfPlanarGraphs.pdf
    Bläsius, Thomas; Kobourov, Stephen G.; Rutter, Ignaz Simultaneous Embedding of Planar Graphs. Handbook of Graph Drawing and Visualization 2013: 349-381
     

2012 [ to top ]

  • DisconnectivityAndRelativePositionsInSimultaneousEmbeddings.pdf
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and Relative Positions in Simultaneous Embeddings. Graph Drawing (GD) 2012: 31-42
     

2010 [ to top ]

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

Teaching

Advised Master (or Diploma) Theses

Advised Bachelor (or Study) Theses

Miscellaneous