The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- Station assignment with reallocation (Q666668) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Deterministic parallel algorithms for bilinear objective functions (Q666681) (← links)
- Finding and counting given length cycles (Q675293) (← links)
- Randomized multipacket routing and sorting on meshes (Q675295) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- The complexity of almost-optimal simultaneous coordination (Q675301) (← links)
- Randomized quickhull (Q675302) (← links)
- Minimizing channel density with movable terminals (Q675304) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- Evaluating signs of determinants using single-precision arithmetic (Q675307) (← links)
- Algorithms for the boundary selection problem (Q675310) (← links)
- A linear-time algorithm for the generation of trees (Q675311) (← links)
- Maintaining dynamic sequences under equality tests in polylogarithmic time (Q675314) (← links)
- Three-dimensional graph drawing (Q675316) (← links)
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- Construction of C-space roadmaps from local sensory data. What should the sensors look for? (Q676266) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- An \(O(n^ 3)\) recognition algorithm for bithreshold graphs (Q676270) (← links)
- New algorithms for mimizing the longest wire length during circuit compaction. (Q676272) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis (Q679456) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- An opportunistic global path planner (Q686736) (← links)
- Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles (Q686739) (← links)
- Continuous alternation: the complexity of pursuit in continuous domains (Q686740) (← links)
- Shortest paths for line segments (Q686741) (← links)
- Orienting polygonal parts without sensors (Q686743) (← links)
- Mechanical parts orienting: the case of a polyhedron on a table (Q686747) (← links)
- Randomization for robot tasks: using dynamic programming in the space of knowledge states (Q686748) (← links)
- Issues in computing contact forces for non-penetrating rigid bodies (Q686750) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
