The following pages link to Sándor P. Fekete (Q169289):
Displaying 50 items.
- Minimum covering with travel cost (Q454247) (← links)
- A survey on relay placement with runtime and approximation guarantees (Q465673) (← links)
- Online square packing with gravity (Q476449) (← links)
- Online square-into-square packing (Q521815) (← links)
- New geometric algorithms for fully connected staged self-assembly (Q529018) (← links)
- Constructing convex 3-polytopes from two triangulations of a polygon (Q598553) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- A general framework for bounds for higher-dimensional orthogonal packing problems. (Q703155) (← links)
- The one-round Voronoi game replayed (Q705543) (← links)
- A competitive strategy for distance-aware online shape allocation (Q744054) (← links)
- Reallocation problems in scheduling (Q747625) (← links)
- Facets for art gallery problems (Q747627) (← links)
- A new exact algorithm for general orthogonal d-dimensional knapsack problems (Q826081) (← links)
- Folding polyominoes with holes into a cube (Q827332) (← links)
- The freeze-tag problem: How to wake up a swarm of robots (Q850797) (← links)
- The minimum backlog problem (Q888427) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues (Q941687) (← links)
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- A minimization version of a directed subgraph homeomorphism problem (Q1014308) (← links)
- The complexity of economic equilibria for house allocation markets (Q1029018) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- (Q1269447) (redirect page) (← links)
- Visibility complexes and the Baues problem for triangulations in the plane (Q1269448) (← links)
- The nucleon of cooperative games and an algorithm for matching games (Q1290660) (← links)
- The folk theorem for dominance solutions (Q1293477) (← links)
- New maximal numbers of equilibria in bimatrix games (Q1293674) (← links)
- On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) (← links)
- Centroids, centers, medians: What is the difference? (Q1376474) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Voronoi diagrams of real algebraic sets (Q1397917) (← links)
- Characterizing matchings as the intersection of matroids (Q1416794) (← links)
- Facility location on a polyhedral surface (Q1434248) (← links)
- Lines and many points on both sides (Q1434251) (← links)
- Complexity of the Delaunay triangulation of points on polyhedral surfaces (Q1434252) (← links)
- Totally balanced combinatorial optimization games (Q1575068) (← links)
- Morphing simple polygons (Q1577545) (← links)
- Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
- Split packing: algorithms for packing circles with optimal worst-case density (Q1731458) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Reconfiguring massive particle swarms with limited, global control (Q1796425) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Configurations of \(2n-2\) quadrics in \(\mathbb{R}^n\) with \(3\cdot 2 ^{n-1}\) common tangent lines (Q1849446) (← links)
- An algorithmic study of manufacturing paperclips and other folded structures. (Q1873158) (← links)
- Maximum dispersion and geometric maximum weight cliques (Q1879248) (← links)
- Traveling salesmen in the presence of competition (Q1884998) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Large cells in Poisson-Delaunay tessellations (Q1889912) (← links)
- On minimum stars and maximum matchings. (Q1972312) (← links)
- Tilt assembly: algorithms for micro-factories that build objects with uniform external forces (Q1986953) (← links)
