Entity usage

Showing below up to 33 results in range #1 to #33.

1. Dominating cliques in distance-hereditary graphs: Label: en
2. A parallel algorithm for edge-coloring partial k-trees: Label: en
3. Efficient preprocessing of simple binary pattern forests: Label: en
4. Exploiting locality in LT-RAM computations: Label: en
5. Computing the L 1-diameter and center of a simple rectilinear polygon in parallel: Label: en
6. An O(log log n) algorithm to compute the kernel of a polygon: Label: en
7. Parallel dynamic lowest common ancestors: Label: en
8. Task scheduling in networks: Label: en
9. Hard graphs for randomized subgraph exclusion algorithms: Label: en
10. On self-stabilizing wait-free clock synchronization: Label: en
11. Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments: Label: en
12. The parallel hierarchical memory model: Label: en
13. Recent results in hardness of approximation: Label: en
14. Optimal algorithms for broadcast and gossip in the edge-disjoint path modes: Label: en
15. Asymptotically optimal election on weighted rings: Label: en
16. Improved approximations of independent sets in bounded-degree graphs: Label: en
17. On intersection searching problems involving curved objects: Label: en
18. Sequential and parallel algorithms for embedding problems on classes of partial k-trees: Label: en
19. Lower bounds for dynamic algorithms: Label: en
20. Optimal parametric search on graphs of bounded tree-width: Label: en
21. Trapezoid graphs and generalizations, geometry and algorithms: Label: en
22. A tight lower bound for on-line monotonic list labeling: Label: en
23. Finding all weakly-visible chords of a polygon in linear time: Label: en
24. Separating translates in the plane: Combinatorial bounds and an algorithm: Label: en
25. Parallel and sequential approximation of shortest superstrings: Label: en
26. On triangulating planar graphs under the four-connectivity constraint: Label: en
27. A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon: Label: en
28. New results on binary space partitions in the plane (extended abstract): Label: en
29. A new algorithm for the construction of optimal B-trees: Label: en
30. Serving requests with on-line routing: Label: en
31. New on-line algorithms for the page replication problem: Label: en
32. Selection in monotone matrices and computing k th nearest neighbors: Label: en
33. Computing depth orders and related problems: Label: en