The following pages link to Algorithm Theory — SWAT '94 (Q5054758):
Displaying 33 items.
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759) (← links)
- On intersection searching problems involving curved objects (Q5054760) (← links)
- Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
- Asymptotically optimal election on weighted rings (Q5054762) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763) (← links)
- Recent results in hardness of approximation (Q5054764) (← links)
- The parallel hierarchical memory model (Q5054765) (← links)
- Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments (Q5054766) (← links)
- On self-stabilizing wait-free clock synchronization (Q5054767) (← links)
- Hard graphs for randomized subgraph exclusion algorithms (Q5054768) (← links)
- Task scheduling in networks (Q5054769) (← links)
- Parallel dynamic lowest common ancestors (Q5054770) (← links)
- An O(log log n) algorithm to compute the kernel of a polygon (Q5054771) (← links)
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel (Q5054772) (← links)
- Exploiting locality in LT-RAM computations (Q5054773) (← links)
- Efficient preprocessing of simple binary pattern forests (Q5054774) (← links)
- A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)
- Dominating cliques in distance-hereditary graphs (Q5054776) (← links)
- Computing depth orders and related problems (Q5056161) (← links)
- Selection in monotone matrices and computing k th nearest neighbors (Q5056162) (← links)
- New on-line algorithms for the page replication problem (Q5056163) (← links)
- Serving requests with on-line routing (Q5056164) (← links)
- A new algorithm for the construction of optimal B-trees (Q5056165) (← links)
- New results on binary space partitions in the plane (extended abstract) (Q5056166) (← links)
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon (Q5056167) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q5056168) (← links)
- Parallel and sequential approximation of shortest superstrings (Q5056169) (← links)
- Separating translates in the plane: Combinatorial bounds and an algorithm (Q5056170) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- A tight lower bound for on-line monotonic list labeling (Q5056172) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q5056173) (← links)
- Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
- Lower bounds for dynamic algorithms (Q5056175) (← links)
