The following pages link to Algorithm Theory — SWAT'96 (Q4375638):
Displayed 37 items.
- Approximate hypergraph coloring (Q4375639) (← links)
- Randomized approximation of the constraint satisfaction problem (Q4375640) (← links)
- On the hardness of global and local approximation (Q4375641) (← links)
- Approximation algorithms for the maximum satisfiability problem (Q4375642) (← links)
- Vertex partitioning problems on partial k-trees (Q4375643) (← links)
- Making an arbitrary filled graph minimal by removing fill edges (Q4375644) (← links)
- The randomized complexity of maintaining the minimum (Q5054803) (← links)
- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning (Q5054804) (← links)
- Service-constrained network design problems (Q5054805) (← links)
- Facility dispersion and remote subgraphs (Q5054806) (← links)
- The constrained minimum spanning tree problem (Q5054807) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- Computing the unrooted maximum agreement subtree in sub-quadratic time (Q5054809) (← links)
- Greedily finding a dense subgraph (Q5054810) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Sorting and searching revisted (Q5054812) (← links)
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching (Q5054813) (← links)
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814) (← links)
- Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- Optimal cost-sensitive distributed minimum spanning tree algorithm (Q5054817) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- Linear-time heuristics for minimum weight rectangulation (Q5054819) (← links)
- Visibility with multiple reflections (Q5054820) (← links)
- A fast heuristic for approximating the minimum weight triangulation (Q5054821) (← links)
- Neighbours on a grid (Q5054822) (← links)
- On two dimensional packing (Q5054823) (← links)
- Optimal orthogonal drawings of triconnected plane graphs (Q5054824) (← links)
- Walking streets faster (Q5054825) (← links)
- Safe and efficient traffic laws for mobile robots (Q5054827) (← links)
- Progress in selection (Q5054828) (← links)
- Probabilistic ancestral sequences and multiple alignments (Q5054829) (← links)
- Efficient algorithms for Lempel-Ziv encoding (Q5054830) (← links)
- The deterministic complexity of parallel multisearch (Q5054831) (← links)
- Priority queues on parallel machines (Q5054832) (← links)
- Binary search trees: How low can you go? (Q5054833) (← links)
- Boolean analysis of incomplete examples (Q5054834) (← links)