( en | de | ru )

 

Disambiguation of "Bläsius, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
How to Draw a Planarization.

, , and . SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 295-308. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Blasius

Alfred Bläsius

Albert Bläsius

Klaus Bläsius

Rainer Bläsius

 

Other publications of authors with the same name

Local and Union Boxicity., , and . CoRR, (2016)Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs., , , and . STACS, volume 154 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Synchronized Planarity with Applications to Constrained Planarity Problems., , and . CoRR, (2020)New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity.. Karlsruhe Institute of Technology, (2015)Partitioning the Bags of a Tree Decomposition into Cliques., , and . SEA, volume 265 of LIPIcs, page 3:1-3:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Synchronized Planarity with Applications to Constrained Planarity Problems., , and . ESA, volume 204 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Hyperbolic Embeddings for Near-Optimal Greedy Routing., , , and . ACM J. Exp. Algorithmics, (2020)The impact of geometry on monochrome regions in the flip Schelling process., , , and . Comput. Geom., (2023)Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete., , , and . CoRR, (2023)Efficiently Computing Maximum Flows in Scale-Free Networks., , and . CoRR, (2020)