- A fully dynamic approximation scheme for shortest paths in planar graphs
- Finding minimum spanning forests in logarithmic time and linear work using random sampling
- Indexing Based on EditDistance Matching of Shape Graphs Srikanta Tirthapura 2 ,Daniel Sharvit 1 ,Philip Klein 2 ,Benjamin B. Kimia 1
- Computing the edit-distance between unrooted ordered trees
- A linearprocessor polylogtime algorithm for shortest paths in planar graphs
- arXiv:cs.DS/0205046v119May2002 On the Number of Iterations for Dantzig-Wolfe
- Appears in ICCV 2001, pages 755-762 Recognition of Shapes by Editing Shock Graphs
- Using Router Stamping to Identify the Source of IP Packets Thomas W. Doeppner
- A randomized parallel algorithm for singlesource shortestpaths \Lambda Philip N. Klein Sairam Subramanian
- The journal version is submitted to Algorithmica. The conference version appeared in Fourth European Symposium on Algorithms (ESA'96).
- Ecient parallel algorithms for chordal graphs Philip N. Klein y
- Finding the closest lattice vector when it's unusually close Philip Klein
- An O(n log n) Approximation Scheme for Steiner Tree in Planar Graphs
- Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log2
- A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs Glencora Borradaile
- A Subset Spanner for Planar Graphs, with Application to Subset TSP
- DOI: 10.1007/s00453-002-1004-3 Algorithmica (2003) 35: 321345
- Shock-Based Indexing into Large Shape Thomas B. Sebastian1
- When trees collide: An approximation algorithm for the generalized Steiner problem on networks
- A polynomial-time approximation scheme for Euclidean Steiner Glencora Borradaile
- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
- Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
- A tree-edit-distance algorithm for comparing simple, closed shapes Philip Klein Srikanta Tirthapura * Daniel Sharvit Ben Kimia y
- Approximation Algorithms for Steiner and Directed Multicuts
- Spaceefficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
- Appeared in Proceedings, 28th Annual ACM Symposium on Theory of Computing (May 1996), pp. 338--347. Efficient Approximation Algorithms for Semidefinite Programs
- Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
- Appeared in Workshop on Algorithms and Data Structures (WADS'93), August 1113, Montreal, Canada Detecting Race Conditions in Parallel Programs that Use One
- A Parallel Algorithm for Eliminating Cycles in Undirected Graphs
- SEBASTIAN et al.: ON ALIGNING CURVES 1 On Aligning Curves
- Shape matching using edit-distance: an implementation Philip N. Klein* Thomas B. Sebastian t Benjamin B. Kimia t
- A linear-time approximation scheme for TSP in planar graphs with edge-weights
- A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights
- A Parallel Algorithm for Approximating the Minimum Cycle Cover
- Steiner tree in planar graphs: An O(n log n) approximation scheme with singly-exponential
- Alignment-Based Recognition of Shape Outlines Thomas B. Sebastian, Philip N. Klein, and Benjamin B. Kimia
- Excluded Minors, Network Decomposition, and Multicommodity Flow
- A linear-work parallel algorithm for nding minimum spanning trees to appear in Proceedings of SPAA '94
- A Randomized LinearTime Algorithm to Find Minimum Spanning Trees
- Approximation algorithms for nding low-degree subgraphs Philip N. Klein y Radha Krishnan z Balaji Raghavachari x R. Ravi {
- copyright CRC press Approximation algorithms for NPhard optimization problems
- Recognition of Shapes by Editing their Shock Graphs Thomas B. Sebastian Philip N. Klein Benjamin B. Kimia
- A fully dynamic approximation scheme for shortest paths in planar graphs
- Faster shortestpath algorithms for planar graphs Monika R. Henzinger \Lambda
- A Polynomial-time Approximation Scheme for Planar Multiway Cut
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs
- Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter n log n)