The following pages link to Algorithms - ESA 2003 (Q5897246):
Displaying 25 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- On the bin packing problem with a fixed number of object weights (Q872247) (← links)
- Optimal routing in double loop networks (Q995561) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- A linear algorithm for integer programming in the plane (Q1771307) (← links)
- On the complexity of computing Kronecker coefficients (Q2012174) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- Minimum dimensional Hamming embeddings (Q2397500) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- On minimum integer representations of weighted games (Q2446687) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
- Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Conjugacy and Other Properties of One-Relator Groups (Q2810627) (← links)
- Optimal edge-coloring with edge rate constraints (Q2811307) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization (Q4609983) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- Reconfiguration of multisets with applications to bin packing (Q6575396) (← links)