The following pages link to Thomas Bläsius (Q476440):
Displaying 50 items.
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- Orthogonal graph drawing with inflexible edges (Q679739) (← links)
- Cliques in hyperbolic random graphs (Q724237) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- Local and union boxicity (Q1709530) (← links)
- Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- The impact of geometry on monochrome regions in the flip Schelling process (Q2088882) (← links)
- Disconnectivity and relative positions in simultaneous embeddings (Q2349740) (← links)
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings (Q2867684) (← links)
- Testing Mutual Duality of Planar Graphs (Q2872099) (← links)
- Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model (Q2921402) (← links)
- Orthogonal Graph Drawing with Inflexible Edges (Q2947010) (← links)
- Pixel and Voxel Representations of Graphs (Q2959781) (← links)
- How to Draw a Planarization (Q2971142) (← links)
- Orthogonal Graph Drawing with Flexibility Constraints (Q3073663) (← links)
- Hyperbolic Random Graphs: Separators and Treewidth (Q4606284) (← links)
- Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane (Q4606285) (← links)
- Scalable exact visualization of isocontours in road networks via minimum-link paths (Q4626288) (← links)
- (Q4634389) (← links)
- Disconnectivity and Relative Positions in Simultaneous Embeddings (Q4912188) (← links)
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems (Q4962212) (← links)
- Optimal Orthogonal Graph Drawing with Convex Bend Costs (Q4962610) (← links)
- (Q5002689) (← links)
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. (Q5075758) (← links)
- Hyperbolic Embeddings for Near-Optimal Greedy Routing (Q5232738) (← links)
- Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling (Q5232759) (← links)
- How to Draw a Planarization (Q5233140) (← links)
- TESTING MUTUAL DUALITY OF PLANAR GRAPHS (Q5261018) (← links)
- Optimal Orthogonal Graph Drawing with Convex Bend Costs (Q5326560) (← links)
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems (Q5741782) (← links)
- (Q5874296) (← links)
- (Q5874488) (← links)
- Towards a Systematic Evaluation of Generative Network Models (Q5881231) (← links)
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
- (Q6075906) (← links)
- Efficiently Computing Maximum Flows in Scale-Free Networks. (Q6075907) (← links)
- (Q6147530) (← links)
- Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane (Q6159913) (← links)
- (Q6192496) (← links)
- (Q6192508) (← links)
- The Minimization of Random Hypergraphs (Q6326314) (← links)
- An efficient branch-and-bound solver for hitting set (Q6543144) (← links)
- A strategic routing framework and algorithms for computing alternative paths (Q6587169) (← links)
- Strongly hyperbolic unit disk graphs (Q6615114) (← links)
- On the giant component of geometric inhomogeneous random graphs (Q6656961) (← links)
- An efficient algorithm for power dominating set (Q6656963) (← links)
