The following pages link to Sándor Kisfaludi-Bak (Q1693323):
Displaying 22 items.
- On the number of touching pairs in a set of planar curves (Q1693324) (← links)
- The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
- The homogeneous broadcast problem in narrow and wide strips (Q2405290) (← links)
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
- The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds (Q2415370) (← links)
- Online search for a hyperplane in high-dimensional Euclidean space (Q2671802) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446) (← links)
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- (Q5077643) (← links)
- The Dominating Set Problem in Geometric Intersection Graphs (Q5111873) (← links)
- Hyperbolic intersection graphs and (quasi)-polynomial time (Q5146878) (← links)
- A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs (Q5230321) (← links)
- On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs (Q5283382) (← links)
- How Does Object Fatness Impact the Complexity of Packing in d Dimensions (Q5875599) (← links)
- On one-round discrete voronoi games (Q5875600) (← links)
- Euclidean TSP in narrow strips (Q6059948) (← links)
- (Q6060006) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)
- (Q6147519) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
