The following pages link to Csaba D. Tóth (Q344783):
Displaying 50 items.
- (Q194168) (redirect page) (← links)
- Packing anchored rectangles (Q276437) (← links)
- The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
- Counting carambolas (Q293619) (← links)
- Diffuse reflection diameter in simple polygons (Q299067) (← links)
- On the number of anchored rectangle packings for a planar point set (Q344784) (← links)
- On fence patrolling by mobile agents (Q405281) (← links)
- Graphs that admit right angle crossing drawings (Q419368) (← links)
- Watchman tours for polygons with holes (Q419503) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Disjoint edges in topological graphs and the tangled-thrackle conjecture (Q499492) (← links)
- Binary plane partitions for disjoint line segments (Q540437) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Connectivity augmentation in planar straight line graphs (Q661949) (← links)
- New bounds on the average distance from the Fermat-Weber center of a planar convex body (Q665992) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- On the total perimeter of homothetic convex bodies in a convex container (Q747571) (← links)
- The reach of axis-aligned squares in the plane (Q783038) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- On stars and Steiner stars (Q834191) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- Range counting over multidimensional data streams (Q854715) (← links)
- Selfish load balancing and atomic congestion games (Q868439) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- Guarding curvilinear art galleries with vertex or point guards (Q924067) (← links)
- Tight bounds for connecting sites across barriers (Q958235) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- A vertex-face assignment for plane graphs (Q1025293) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- Convex subdivisions with low stabbing numbers (Q1046805) (← links)
- A note on binary plane partitions (Q1404527) (← links)
- Illuminating labyrinths. (Q1428567) (← links)
- Illuminating disjoint line segments in the plane (Q1434256) (← links)
- Art gallery problem with guards whose range of vision is \(180^{\circ}\) (Q1595400) (← links)
- Online unit clustering in higher dimensions (Q1644944) (← links)
- Recognizing weakly simple polygons (Q1688854) (← links)
- Note on \(k\)-planar crossing numbers (Q1699274) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations (Q1772125) (← links)
- Gap-planar graphs (Q1786592) (← links)
- The \(k\) most frequent distances in the plane (Q1864121) (← links)
- Guarding disjoint triangles and claws in the plane (Q1873155) (← links)
- Illumination of polygons by 45\(^{\circ}\)-floodlights (Q1874365) (← links)
