|
42
|
Near-optimal fully-dynamic graph connectivity
– M Thorup
- 2000
|
|
9
|
An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits
– K Kozminski, E Kinnen
- 1984
|
|
10
|
Two Algorithms for Finding Rectangular Duals of Planar Graphs
– Goos Kant, Xin He
- 1992
|
|
6
|
All Separating Triangles in a Plane Graph Can Be Optimally “Broken
– A Accornero, M Ancona, S Varini
- 2000
|
|
20
|
On Triangulating Planar Graphs under the Four-Connectivity Constraint
– T. Biedl, G. Kant, M. Kaufmann
- 1995
|
|
106
|
An o( |V ||E|) algorithm for finding maximum matching in general graphs
– S Micali, V V Vazirani
- 1980
|
|
39
|
Die Theorie der regularen graphs
– J Petersen
|
|
5
|
On Floorplans of Planar Graphs
– X He
- 1997
|
|
10
|
Algorithms for Floorplan Design Via Rectangular Dualization
– Y-T Lai, S M Leinwand
- 1988
|
|
58
|
Arboricity and subgraph listing algorithms
– N Chiba, T Nishizeki
- 1985
|
|
35
|
Mesh refinement processes based on the generalized bisection of simplices
– M C Rivara
- 1984
|
|
16
|
The completion of locally refined simplicial partitions created by bisection
– Rob Stevenson
- 2006
|
|
12
|
Uniform convergence of multigrid V–cycle on adaptively refined finite element meshes for second order elliptic problems
– H J Wu, Z M Chen
|
|
24
|
Automatic generation of triangulations for piecewise polynomial approximation
– E G Sewell
- 1972
|
|
71
|
A comparison of adaptive refinement techniques for elliptic problems
– W Mitchell
- 1989
|
|
32
|
Optimality of a standard adaptive finite element method
– Rob Stevenson
|
|
56
|
Local mesh refinement in 2 and 3 dimensions
– E Bänsch
- 1991
|
|
55
|
Adaptive finite element methods with convergence rates
– Peter Binev, Wolfgang Dahmen, Ron DeVore
|
|
112
|
Refinement algorithms and data structures for regular local mesh refinement
– R E Bank, A H Sherman, A Weiser
- 1983
|
