( en | de | ru )

 

Disambiguation of "Bläsius, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Pixel and Voxel Representations of Graphs.

, , , , and . CoRR, (2015)

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

Memory-Restricted Routing with Tiled Map Data., , , , , , , , , and . SMC, page 3347-3354. IEEE, (2018)Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling., , , , and . ALENEX, page 130-143. SIAM, (2019)A Branch-And-Bound Algorithm for Cluster Editing., , , , , , , and . SEA, volume 233 of LIPIcs, page 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Minimization of Random Hypergraphs., , and . ESA, volume 173 of LIPIcs, page 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Strongly Hyperbolic Unit Disk Graphs., , , and . STACS, volume 254 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete., , , and . CoRR, (2023)New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity.. Karlsruhe Institute of Technology, (2015)Synchronized Planarity with Applications to Constrained Planarity Problems., , and . CoRR, (2020)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)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)