## Computing and CombinatoricsSpringer-Verlag, 2000 - Combinatorial analysis |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Invited Talks | 1 |

Hao Wang Award Paper | 23 |

Computational Geometry 1 | 44 |

Copyright | |

28 other sections not shown

### Other editions - View all

### Common terms and phrases

assume Berlin Heidelberg 2000 boolean called combinatorial competitive ratio computable real function Computer Science connected consecutive consider construction contains convex hull convex polygon corresponding cubic graph cycle defined denote digraph dominating edge edge-visible polygon embedding endpoints exists extreme level factor factorisation field sieve finite function given GNFS graph drawing graph G independent set induced matching input integer integer factorisation integer linear program labels least Lemma level planar linear LNCS lower bound matrix maximum minimal level non-planar minimum Mips-years MPQS node obtain octant on-line algorithm one-way i-SAFA optimal pair paper parameter path planar graph plane polynomial problem Proc processors quadratic sieve random ratio real numbers rectangular drawing result root satisfies segment sequence solution strings subgraph subset Theorem tree triangle upper bound vector vertex cover vertices of degree visible Voronoi diagram weight