This paper describes a general technique that can be used to obtain approximation
schemes for various NP-complete problems on planar graphs. The strategy depends on …

Algorithms for VLSI Physical Design Automation, Second Edition is a core reference text for
graduate students and CAD professionals. Based on the very successful First Edition, it …

A complete, self-contained introduction to a powerful and resurging mathematical discipline
Combinatorial Geometry presents and explains with complete proofs some of the most …

This thesis deals with the polynomial approximability of combinatorial optimization problems
which are NP-complete in their decision problem version. Different measures of …

Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices
or edges whose removal divides the graph roughly in half. Most graphs do not have the …

We show that every 2-connected triangulated planar graph with n vertices has a simple
cycle C of length at most 4@@@@ n which separates the interior vertices A from the exterior …

We propose a class of graphs called¿-overlap graphs. Special cases of¿-overlap graphs
include planai graphs,¿-nearest neighbor graphs, and earlier classes of graphs associated …

This paper describes an efficient approach to partitioning unstructured meshes that occur
naturally in the finite element and finite difference methods. This approach makes use of the …

Nested dissection is an algorithm invented by Alan George for preserving sparsity in
Gaussian elimination on symmetric positive definite matrices. Nested dissection can be …

Solution of large, sparse linear systems is an important problem in science and engineering.
Such systems arise in many applications, such as electrical networks, stress analysis, and …