The following pages link to Tillmann Miltzow (Q390175):
Displayed 43 items.
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Between shapes, using the Hausdorff distance (Q824335) (← links)
- \(\forall\exists\mathbb {R}\)-completeness and area-universality (Q1627164) (← links)
- Intersection graphs of rays and grounded segments (Q1687911) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- Extreme point and halving edge search in abstract order types (Q2391543) (← links)
- Counting \(K_4\)-subdivisions (Q2515581) (← links)
- Upper and Lower Bounds on Long Dual Paths in Line Arrangements (Q2946411) (← links)
- (Q2968079) (← links)
- Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings (Q2970420) (← links)
- Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems (Q3132888) (← links)
- Irrational Guards are Sometimes Needed (Q4580074) (← links)
- (Q4580091) (← links)
- (Q4580094) (← links)
- Intersection Graphs of Rays and Grounded Segments (Q4585058) (← links)
- (Q4606288) (← links)
- (Q4606338) (← links)
- (Q4626304) (← links)
- (Q4636614) (← links)
- On the VC-dimension of half-spaces with respect to convex sets (Q5024665) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- The Art Gallery Problem is ∃ℝ-complete (Q5066941) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- The art gallery problem is ∃ ℝ-complete (Q5230277) (← links)
- Counting Houses of Pareto Optimal Matchings in the House Allocation Problem (Q5265030) (← links)
- Points with large quadrant-depth (Q5405901) (← links)
- (Q5875640) (← links)
- Parameterized Hardness of Art Gallery Problems (Q5888933) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- (Q6060035) (← links)
- (Q6065409) (← links)
- The complexity of the Hausdorff distance (Q6145675) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
- Topological art in simple galleries (Q6204773) (← links)
- Tron, a combinatorial Game on abstract Graphs (Q6228367) (← links)
- Flip Distance to a Non-crossing Perfect Matching (Q6269579) (← links)
- Smoothed Analysis of Order Types (Q6321865) (← links)
- A Universality Theorem for Nested Polytopes (Q6323267) (← links)
- Smoothing the gap between NP and ER (Q6330459) (← links)
- Avoider-Enforcer Game is NP-hard (Q6407785) (← links)