Thomas Bläsius

From MaRDI portal
Person:476440

Available identifiers

zbMath Open blasius.thomasMaRDI QIDQ476440

List of research outcomes

PublicationDate of PublicationType
Understanding the effectiveness of data reduction in public transportation networks2024-02-16Paper
https://portal.mardi4nfdi.de/entity/Q61924962024-02-12Paper
https://portal.mardi4nfdi.de/entity/Q61925082024-02-12Paper
https://portal.mardi4nfdi.de/entity/Q61472502024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61475302024-01-15Paper
Deterministic performance guarantees for bidirectional BFS on real-world networks2023-12-22Paper
Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry2023-12-13Paper
The impact of heterogeneity and geometry on the proof complexity of random satisfiability2023-11-07Paper
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry2023-10-31Paper
Synchronized Planarity with Applications to Constrained Planarity Problems2023-10-23Paper
Dynamic flows with time-dependent capacities2023-10-04Paper
Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry2023-09-20Paper
https://portal.mardi4nfdi.de/entity/Q60759062023-09-20Paper
Efficiently Computing Maximum Flows in Scale-Free Networks.2023-09-20Paper
Maximal Cliques in Scale-Free Random Graphs2023-09-06Paper
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane2023-06-23Paper
Hyperbolic Embeddings for Near-Optimal Greedy Routing2023-05-23Paper
Solving vertex cover in polynomial time on hyperbolic random graphs2023-04-27Paper
Towards a Systematic Evaluation of Generative Network Models2023-03-09Paper
https://portal.mardi4nfdi.de/entity/Q58742962023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58744882023-02-07Paper
The impact of geometry on monochrome regions in the flip Schelling process2022-10-06Paper
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.2022-05-11Paper
The complexity of dependency detection and discovery in relational databases2021-12-22Paper
Efficiently enumerating hitting sets of hypergraphs arising in data profiling2021-11-25Paper
https://portal.mardi4nfdi.de/entity/Q50026892021-07-28Paper
The Flip Schelling Process on Random Geometric and Erd\"os-R\'enyi Graphs2021-02-19Paper
The Minimization of Random Hypergraphs2019-10-01Paper
How to Draw a Planarization2019-09-16Paper
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling2019-09-13Paper
Hyperbolic Embeddings for Near-Optimal Greedy Routing2019-09-12Paper
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems2019-05-15Paper
Scalable exact visualization of isocontours in road networks via minimum-link paths2019-02-27Paper
Optimal Orthogonal Graph Drawing with Convex Bend Costs2018-11-05Paper
Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems2018-10-30Paper
Cliques in hyperbolic random graphs2018-07-25Paper
Simultaneous embedding: edge orderings, relative positions, cutvertices2018-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46343892018-04-10Paper
Local and union boxicity2018-04-05Paper
Hyperbolic Random Graphs: Separators and Treewidth2018-03-02Paper
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane2018-03-02Paper
Orthogonal graph drawing with inflexible edges2018-01-19Paper
How to Draw a Planarization2017-04-04Paper
Pixel and Voxel Representations of Graphs2017-02-10Paper
A new perspective on clustered planarity as a combinatorial embedding problem2015-12-08Paper
Orthogonal Graph Drawing with Inflexible Edges2015-09-21Paper
TESTING MUTUAL DUALITY OF PLANAR GRAPHS2015-07-01Paper
Disconnectivity and relative positions in simultaneous embeddings2015-06-17Paper
Orthogonal graph drawing with flexibility constraints2014-12-02Paper
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model2014-10-08Paper
Testing Mutual Duality of Planar Graphs2014-01-14Paper
Simultaneous embedding: edge orderings, relative positions, cutvertices2013-12-20Paper
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings2013-12-20Paper
Optimal Orthogonal Graph Drawing with Convex Bend Costs2013-08-06Paper
Disconnectivity and Relative Positions in Simultaneous Embeddings2013-04-03Paper
Orthogonal Graph Drawing with Flexibility Constraints2011-02-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Thomas Bläsius