Stem planar$ (all stems)

166 papers:

STOC-2015-FoxKM #approximate #polynomial

A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (KF, PNK, SM), pp. 841–850.

ICALP-v1-2015-DvorakK #csp #on the

On Planar Boolean CSP (ZD, MK), pp. 432–443.

ICALP-v1-2015-KarpinskiLS #set

A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (MK, AL, DS), pp. 785–796.

ICALP-v1-2014-AngeliniLBFPR #graph

Morphing Planar Graph Drawings Optimally (PA, GDL, GDB, FF, MP, VR), pp. 126–137.

ICALP-v1-2014-Biedl #graph #on the

On Area-Optimal Planar Graph Drawings (TCB), pp. 198–210.

ICALP-v1-2014-FialaKKN #algorithm #aspect-oriented #graph

Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (JF, PK, JK, RN), pp. 489–501.

ICPR-2014-YingWMYZ #problem #using

The Perspective-3-Point Problem When Using a Planar Mirror (XY, GW, XM, SY, HZ), pp. 4033–4037.

CASE-2013-NaikMRHB

An example of computing the failure-tolerant workspace area for a planar kinematically redundant robot (PSN, AAM, RGR, RCH, KMBG), pp. 306–311.

CASE-2013-PrettoTM #3d #flexibility #industrial #locality

Flexible 3D localization of planar objects for industrial bin-picking with monocamera vision system (AP, ST, EM), pp. 168–175.

CASE-2013-SeoYK #assembly #composition

Assembly planning for planar structures of a brick wall pattern with rectangular modular robots (JS, MY, VK), pp. 1016–1021.

PODS-2013-Kejlberg-RasmussenTTTY

I/O-efficient planar range skyline and attrition priority queues (CKR, YT, KT, KT, JY), pp. 103–114.

STOC-2013-EisenstatK #algorithm #graph #linear #multi

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (DE, PNK), pp. 735–744.

STOC-2013-KleinMS #graph #linear #recursion

Structured recursive separator decompositions for planar graphs in linear time (PNK, SM, CS), pp. 505–514.

ICALP-v1-2013-GuoW #complexity #csp

The Complexity of Planar Boolean #CSP with Complex Weights (HG, TW), pp. 516–527.

ICALP-v1-2013-WeimannY #approximate #graph #linear

Approximating the Diameter of Planar Graphs in Near Linear Time (OW, RY), pp. 828–839.

ICALP-v2-2013-Marx #graph

The Square Root Phenomenon in Planar Graphs (DM), p. 28.

CASE-2012-ChowdhuryTWSLG #automation #biology #using

Automated indirect transport of biological cells with optical tweezers using planar gripper formations (SC, AT, CW, PS, WL, SKG), pp. 267–272.

CASE-2012-LeeLMNL

Kinematics of the Robomec robot hand with planar and spherical four bar linkages for power grasping (SML, KDL, HKM, TSN, JWL), pp. 1120–1125.

CASE-2012-SintovRMS #algorithm #set

A common 3-finger grasp search algorithm for a set of planar objects (AS, SR, RM, AS), pp. 1095–1100.

STOC-2012-AbrahamCG #approximate #distance #graph

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (IA, SC, CG), pp. 1199–1218.

ICALP-v1-2012-ChekuriEV #design #graph #network #product line

Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs (CC, AE, AV), pp. 206–217.

ICALP-v1-2012-KleinM

Solving Planar k-Terminal Cut in $O(n^(c√k)) Time (PNK, DM), pp. 569–580.

ICALP-v1-2012-Marx #bound #multi

A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals (DM), pp. 677–688.

ICPR-2012-DecrouezDGC

Extracting planar structures efficiently with revisited BetaSAC (MD, RD, FG, JLC), pp. 2100–2103.

ICPR-2012-NakamuraSMS #artificial reality

Calibration-free projector-camera system for spatial augmented reality on planar surfaces (TN, FdS, SM, HS), pp. 85–88.

ICPR-2012-NurunnabiBW #3d #multi #robust #segmentation

Robust segmentation for multiple planar surface extraction in laser scanning 3D point cloud data (AN, DB, GAWW), pp. 1367–1370.

STOC-2011-ItalianoNSW #algorithm #graph

Improved algorithms for min cut and max flow in undirected planar graphs (GFI, YN, PS, CWN), pp. 313–322.

ICALP-v1-2011-AdlerKKLST #bound #graph

Tight Bounds for Linkages in Planar Graphs (IA, SGK, PKK, DL, SS, DMT), pp. 110–121.

ICALP-v1-2011-BrodalT #query

Dynamic Planar Range Maxima Queries (GSB, KT), pp. 256–267.

ICALP-v1-2011-KawarabayashiKS #approximate #bound #distance #graph

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (KiK, PNK, CS), pp. 135–146.

ICALP-v1-2011-Moldenhauer #algorithm #approximate #graph

Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (CM), pp. 748–759.

LATA-2011-LisitsaPS #automaton

Planarity of Knots, Register Automata and LogSpace Computability (AL, IP, RS), pp. 366–377.

DHM-2011-OzsoyY #case study

Planar Vertical Jumping Simulation-A Pilot Study (BO, J(Y), pp. 161–170.

STOC-2010-BateniHM #approximate #bound #graph

Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.

ICPR-2010-FaureF #composition #linear

Linear Decomposition of Planar Shapes (AF, FF), pp. 1096–1099.

ICPR-2010-ParkP

Active Calibration of Camera-Projector Systems Based on Planar Homography (SYP, GGP), pp. 320–323.

ICPR-2010-YamanakaSS #adaptation #image #using

Adaptive Image Projection onto Non-planar Screen Using Projector-Camera Systems (TY, FS, JS), pp. 307–310.

ICPR-2010-YamashitaSS #3d

Recovering 3D Shape and Light Source Positions from Non-planar Shadows (YY, FS, JS), pp. 1775–1778.

ICMT-2010-VoigtH #distance #edit distance #graph #metamodelling

Metamodel Matching Based on Planar Graph Edit Distance (KV, TH), pp. 245–259.

SAC-2010-FunfzigTA #constraints #parametricity #using

Haptic manipulation of rational parametric planar cubics using shape constraints (CF, PT, GA), pp. 1253–1257.

DATE-2009-RealVD #correlation #using

Enhancing correlation electromagnetic attack using planar near-field cartography (DR, FV, MD), pp. 628–633.

DRR-2009-IwamuraNHKUO #documentation #image

Layout-free dewarping of planar document images (MI, RN, AH, KK, SU, SO), pp. 1–10.

STOC-2009-ChalopinG #graph

Every planar graph is the intersection graph of segments in the plane: extended abstract (JC, DG), pp. 631–638.

ICALP-v1-2009-DemaineHK09a #graph

Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (EDD, MH, PNK), pp. 328–340.

ICALP-v1-2009-WeimannY #graph

Computing the Girth of a Planar Graph in O(n logn) Time (OW, RY), pp. 764–773.

CHI-2009-LichtschlagKB #named

Fly: a tool to author planar presentations (LL, TK, JOB), pp. 547–556.

ICALP-A-2008-BorradaileK #graph #network #problem

The Two-Edge Connectivity Survivable Network Problem in Planar Graphs (GB, PNK), pp. 485–501.

ICPR-2008-SwadzbaVHW

Reducing noise and redundancy in registered range data for planar surface extraction (AS, ALV, MH, SW), pp. 1–4.

ICPR-2008-TortorellaPM #approach #programming

A Dynamic Programming approach for segmenting digital planar curves into line segments and circular arcs (FT, RP, MM), pp. 1–4.

ICPR-2008-TuSK #3d #approach #image

A new approach to 3D shape recovery of local planar surface patches from shift-variant blurred images (XT, MS, YsK), pp. 1–5.

ICPR-2008-YamauchiSS

Calibration of a structured light system by observing planar object from unknown viewpoints (KY, HS, YS), pp. 1–4.

CASE-2007-ChakrabortyAW #multi #set

Coverage of a Planar Point Set with Multiple Constrained Robots (NC, SA, JTW), pp. 899–904.

ICDAR-2007-ToujAA07a #approach #hybrid #markov #modelling #recognition

A hybrid approach for off-line Arabic handwriting recognition based on a Planar Hidden Markov modeling (SMT, NEBA, HA), pp. 964–968.

STOC-2007-HayesVV #graph

Randomly coloring planar graphs with fewer colors than the maximum degree (TPH, JCV, EV), pp. 450–458.

ICALP-2007-BergerG #graph

Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs (AB, MG), pp. 90–101.

ICALP-2007-GuoN #graph #kernel #linear #np-hard #problem

Linear Problem Kernels for NP-Hard Problems on Planar Graphs (JG, RN), pp. 375–386.

SAC-2007-SarfrazR #algorithm #image #polynomial #random #using

A randomized knot insertion algorithm for outline capture of planar images using cubic spline (MS, AR), pp. 71–75.

CASE-2006-XuLT #using #visual notation

Visual Positioning Using Four-Point Planar Patterns (DX, YL, MT), pp. 600–605.

STOC-2006-ChekuriKS #constant #graph

Edge-disjoint paths in Planar graphs with constant congestion (CC, SK, FBS), pp. 757–766.

STOC-2006-Klein #graph #set

A subset spanner for Planar graphs, : with application to subset TSP (PNK), pp. 749–756.

ICALP-v1-2006-DjidjevV #graph

Planar Crossing Numbers of Genus g Graphs (HD, IV), pp. 419–430.

ICPR-v1-2006-LourakisA #3d #performance #reliability

Chaining Planar Homographies for Fast and Reliable 3D Plane Tracking (MIAL, AAA), pp. 582–586.

ICPR-v1-2006-WangL #matrix

Characteristic Line of Planar Homography Matrix and Its Applications in Camera Calibration (JW, YL), pp. 147–150.

ICPR-v3-2006-LakamperL #3d #using

Using Extended EM to Segment Planar Structures in 3D (RL, LJL), pp. 1077–1082.

ICPR-v3-2006-WatanabeS #image #multi

Planar Structure Based Registration of Multiple Range Images (DW, HS), pp. 689–692.

ICPR-v4-2006-KiseNIY #approach #performance #physics #recognition #towards

Efficient Recognition of Planar Objects Based on Hashing of Keypoints — An Approach Towards Making the Physical World Clickable (KK, TN, MI, SY), pp. 813–816.

STOC-2005-Goncalves #graph

Edge partition of planar sraphs into two outerplanar graphs (DG0), pp. 504–512.

ICALP-2005-GuT #graph

Optimal Branch-Decomposition of Planar Graphs in O(n3) Time (QPG, HT), pp. 373–384.

ICALP-2005-JampalaZ

Cache-Oblivious Planar Shortest Paths (HJ, NZ), pp. 563–575.

PODS-2004-BenediktLBW #first-order

A Characterization of First-Order Topological Properties of Planar Spatial Data (MB, CL, JVdB, TW), pp. 107–114.

ICPR-v1-2004-GarciaS #distance #estimation

Estimation of Distance to Planar Surfaces and Type of Material with Infrared Sensors (MAG, AS), pp. 745–748.

ICPR-v2-2004-GotardoBBS #image #robust

Robust Extraction of Planar and Quadric Surfaces from Range Images (PFUG, KLB, ORPB, LS), pp. 216–219.

ICPR-v2-2004-ManoMT #generative

Factorization-Based Planar Mapping Method for Generating Intermediate Views (HM, AM, NT), pp. 891–894.

ICPR-v4-2004-ChenI #algebra #image #metric

Planar Metric Rectification by Algebraically Estimating The Image of the Absolute Conic (YC, HHSI), pp. 88–91.

ICPR-v4-2004-GaoA #parallel #using

Single Camera Stereo using Planar Parallel Plate (CG, NA), pp. 108–111.

ICPR-v4-2004-GuptaD

Planar Motion of a Parabolic Catadioptric Camera (DG, KD), pp. 68–71.

STOC-2003-AmirKR #approximate #constant #graph

Constant factor approximation of vertex-cuts in planar graphs (EA, RK, SR), pp. 90–99.

STOC-2003-KowalikK #constant #graph #query

Short path queries in planar graphs in constant time (LK, MK), pp. 143–148.

ICALP-2003-BodirskyGK #generative #graph #random

Generating Labeled Planar Graphs Uniformly at Random (MB, CG, MK), pp. 1095–1107.

ICALP-2003-DemaineFHT #algorithm #graph #parametricity

Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (EDD, FVF, MTH, DMT), pp. 829–844.

MLDM-2003-ImiyaTOH #bound #detection #random #set

Detecting the Boundary Curve of Planar Random Point Set (AI, KT, HO, VH), pp. 413–424.

ICPR-v1-2002-KuthirummalJN #multi #recognition

Planar Shape Recognition across Multiple Views (SK, CVJ, PJN), pp. 456–459.

ICPR-v1-2002-MindruGM #estimation

Model Estimation for Photometric Changes of Outdoor Planar Color Surfaces Caused by Changes in Illumination and Viewpoint (FM, LJVG, TM), pp. 620–623.

ICPR-v2-2002-Klette #grid #orthogonal

Topologies on the Planar Orthogonal Grid (RK), pp. 354–357.

ICPR-v3-2002-ChabbiTP #automation #detection #image

Automatic Detection of Planar Contours from Uncalibrated Images (HC, LT, SP), pp. 541–544.

ICPR-v3-2002-GolenzerVL #documentation #image

Finding Regions of Interest in Document Images by Planar HMM (JG, CVG, PML), pp. 415–418.

CSL-2002-BarbanchonG #linear #problem

Local Problems, Planar Local Problems and Linear Time (RB, EG), pp. 397–411.

ICDAR-2001-MiledA #markov #modelling #recognition

Planar Markov Modeling for Arabic Writing Recognition: Advancement State (HM, NEBA), pp. 69–73.

ICALP-2001-AlberFN #complexity #exponential #graph #problem

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (JA, HF, RN), pp. 261–272.

PODS-2000-GeertsK #approximate #database #linear #logic #transitive #using

Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic (FG, BK), pp. 126–135.

STOC-2000-ChenX #graph #query

Shortest path queries in planar graphs (DZC, JX), pp. 469–478.

STOC-2000-Istrail #3d #statistics

Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract) (SI), pp. 87–96.

STOC-2000-MahajanV #graph

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (MM, KRV), pp. 351–357.

ICALP-2000-BanderierFSS

Planar Maps and Airy Phenomena (CB, PF, GS, MS), pp. 388–402.

ICALP-2000-Djidjev #graph

Computing the Girth of a Planar Graph (HD), pp. 821–831.

ICPR-v1-2000-GandhiKA #segmentation

Application of Planar Motion Segmentation for Scene Text Extraction (TG, RK, SA), pp. 1445–1449.

ICPR-v1-2000-HaindlHZ #automation #modelling

Automatic Acquisition of Planar-Faced Virtual Models (MH, VH, PZ), pp. 1987–1990.

ICPR-v1-2000-KnightR #self

Self-Calibration of a Stereo Rig in a Planar Scene by Data Combination (JK, IDR), pp. 1411–1414.

ICPR-v1-2000-MalisC #self

Self-Calibration of Zooming Cameras Observing an Unknown Planar Structure (EM, RC), pp. 1085–1088.

ICPR-v1-2000-YangSH

Planar Conic Based Camera Calibration (CY, FS, ZH), pp. 1555–1558.

ICPR-v3-2000-DaoudiM #invariant #multi #representation

New Multiscale Planar Shape Invariant Representation under a General Affine Transformations (MD, SM), pp. 3794–3797.

ICPR-v3-2000-Liu

A Generalized Shape-Axis Model for Planar Shapes (TLL), pp. 3491–3495.

ICPR-v3-2000-LuTH #detection #estimation #novel #robust

A Novel Method for Camera Planar Motion Detection and Robust Estimation of the 1D Trifocal Tensor (LL, HTT, ZH), pp. 3815–3818.

ICPR-v4-2000-CongP

Surface Recovery from Planar Sectional Contours (GC, BP), pp. 4106–4109.

STOC-1999-Schaeffer #random #scalability

Random Sampling of Large Planar Maps and Convex Polyhedra (GS), pp. 760–769.

DLT-1999-JirickaK #automaton #finite #nondeterminism

Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata (PJ, JK), pp. 71–80.

STOC-1998-ChenGP #graph

Planar Map Graphs (ZZC, MG, CHP), pp. 514–523.

ICALP-1998-ChuangGHKL #canonical #encoding #graph #multi #order

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses (RCNC, AG, XH, MYK, HIL), pp. 118–129.

ICPR-1998-HaindlZ #image #performance #segmentation

Fast segmentation of planar surfaces in range images (MH, PZ), pp. 985–987.

ICPR-1998-MokhtariB #constant #multi #using

Multiscale compression of planar curves using constant curvature segments (MM, RB), pp. 744–746.

LICS-1998-Grohe #fixpoint #graph #logic

Fixed-Point Logics on Planar Graphs (MG), pp. 6–15.

STOC-1997-He #graph #on the

On Floorplans of Planar Graphs (XH), pp. 426–435.

STOC-1996-RobertsonSST #graph

Efficiently Four-Coloring Planar Graphs (NR, DPS, PDS, RT), pp. 571–575.

ICPR-1996-AmaraB #markov #modelling #recognition

Printed PAW recognition based on planar hidden Markov models (NEBA, AB), pp. 220–224.

ICPR-1996-GhorbelDMAS #estimation #object-oriented

Global planar rigid motion estimation applied to object-oriented coding (FG, MD, AM, OA, HS), pp. 641–645.

ICPR-1996-Karasik #3d #commutative #on the #representation #set

On a planar representation of 3D figures commutative with respect to set and morphological operations (YBK), pp. 615–619.

ICPR-1996-Kimmel #difference #image

Affine differential signatures for gray level images of planar shapes (RK), pp. 45–49.

ICPR-1996-LiM #3d #estimation

3D pose estimation from an n-degree planar curved feature in two perspective views (LL, SM), pp. 374–377.

ICPR-1996-Nagao #2d #using

Direct methods for evaluating the planarity and rigidity of a surface using only 2D views (KN), pp. 417–422.

ICPR-1996-SteinerKB

Planar shape enhancement and exaggeration (AS, RK, AMB), pp. 523–527.

ICPR-1996-VossS #invariant

Invariant fitting of planar objects by primitives (KV, HS), pp. 508–512.

STOC-1995-KleinbergT #approximate #network #problem

Approximations for the disjoint paths problem in high-diameter planar networks (JMK, ÉT), pp. 26–35.

STOC-1994-KleinRRS #algorithm #graph #performance

Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.

STOC-1994-Poutre #incremental #testing

Alpha-algorithms for incremental planarity testing (preliminary version) (JALP), pp. 706–715.

ALP-1994-Balbiani #equation

Equation Solving in Projective Planes and Planar Ternary Rings (PB), pp. 95–113.

SAC-1994-TsouS #adaptation #fuzzy #problem

Fuzzy control for the pursuing problem of an adaptive planar structure (PT, MHHS), pp. 150–154.

STOC-1993-BattistaV #graph

Angles of planar triangular graphs (GDB, LV), pp. 431–437.

STOC-1993-EppsteinGIS #algorithm #graph

Separator based sparsification for dynamic planar graph algorithms (DE, ZG, GFI, THS), pp. 208–217.

STOC-1993-FelsnerW #algorithm #combinator #set

Maximum k-chains in planar point sets: combinatorial structure and algorithms (SF, LW), pp. 146–153.

STOC-1993-ParkP #graph

Finding minimum-quotient cuts in planar graphs (JKP, CAP), pp. 766–775.

ICALP-1993-CzumajG #graph #problem

Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs (AC, AG), pp. 88–101.

CAV-1993-MalerP #analysis #multi #reachability

Reachability Analysis of Planar Multi-limear Systems (OM, AP), pp. 194–209.

STOC-1992-GalilIS #testing

Fully Dynamic Planarity Testing (Extended Abstract) (ZG, GFI, NS), pp. 495–506.

STOC-1992-Goodrich #parallel

Planar Separators and Parallel Polygon Triangulation (Preliminary Version) (MTG), pp. 507–516.

STOC-1992-Lin #communication #fault tolerance #network

Fault Tolerant Planar Communication Networks (GL), pp. 133–139.

STOC-1992-MalitzP #graph #on the

On the Angular Resolution of Planar Graphs (SMM, AP), pp. 527–538.

STOC-1992-Rao #algorithm #graph #performance

Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) (SR), pp. 229–240.

ICALP-1992-Westbrook #incremental #performance #testing

Fast Incremental Planarity Testing (JW), pp. 342–353.

ICALP-1991-DjidjevPZ #graph

Computing Shortest Paths and Distances in Planar Graphs (HD, GEP, CDZ), pp. 327–338.

ICALP-1991-GalilI #component #graph #maintenance

Maintaining Biconnected Components of Dynamic Planar Graphs (ZG, GFI), pp. 339–350.

STOC-1990-KaoK #algorithm #graph #parallel #performance #towards #transitive

Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs (MYK, PNK), pp. 181–192.

DAC-1989-LokanathanK #graph #performance

Performance optimized floor planning by graph planarization (BL, EK), pp. 116–121.

STOC-1989-KaoS #order

Local Reorientation, Global Order, and Planar Topology (Preliminary Version) (MYK, GES), pp. 286–296.

CHI-1989-BaudelaireG #design #interactive #paradigm

Planar maps: an interaction paradigm for graphic design (PB, MG), pp. 313–318.

STOC-1988-FraysseixPP #graph #set

Small Sets Supporting Fáry Embeddings of Planar Graphs (HdF, JP, RP), pp. 426–433.

ICALP-1988-BajajK #algorithm #geometry #modelling

Algorithms for Planar Geometric Models (CLB, MSK), pp. 67–81.

ICALP-1988-MehlhornY #how #theorem

Constructive Hopf’s Theorem: Or How to Untangle Closed Planar Curves (KM, CKY), pp. 410–423.

ICALP-1988-Tamassia #data type #graph

A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract) (RT), pp. 576–590.

STOC-1987-Frederickson #approach #graph

A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) (GNF), pp. 19–28.

ICALP-1987-HagerupCD #graph #parallel

Parallel 5-Colouring of Planar Graphs (TH, MC, KD), pp. 304–313.

FPCA-1987-Schlag #functional #source code

The planar topology of functional programs (MDFS), pp. 174–193.

DAC-1986-BhaskerS #algorithm #graph #linear

A linear algorithm to find a rectangular dual of a planar triangulated graph (JB, SS), pp. 108–114.

STOC-1986-Yannakakis #graph

Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) (MY), pp. 104–108.

GG-1986-CarlyleGP #complexity #generative #parallel

Complexity of pattern generation via planar parallel binary fission/fusion grammars (JWC, SAG, AP), pp. 515–533.

STOC-1985-LeisersonM #algorithm #testing

Algorithms for Routing and Testing Routability of Planar VLSI Layouts (CEL, FMM), pp. 69–78.

STOC-1985-SuzukiNS #graph #multi

Multicommodity Flows in Planar Undirected Graphs and Shortest Paths (HS, TN, NS), pp. 195–204.

DAC-1984-KozminskiK #algorithm #graph

An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits (KK, EK), pp. 655–656.

STOC-1984-BussS #graph #on the

On the Pagenumber of Planar Graphs (JFB, PWS), pp. 98–100.

STOC-1984-Miller #graph

Finding Small Simple Cycle Separators for 2-Connected Planar Graphs (GLM), pp. 376–382.

DAC-1982-HellerSM #design

The planar package planner for system designers (WRH, GBS, KM), pp. 253–260.

STOC-1982-Bar-YehudaE #approximate #graph #on the

On Approximating a Vertex Cover for Planar Graphs (RBY, SE), pp. 303–309.

ICALP-1981-Reif #network

Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time (JHR), pp. 56–67.

STOC-1980-Storer #graph #grid

The Node Cost Measure for Embedding Graphs on the Planar Grid (Extended Abstract) (JAS), pp. 201–210.

STOC-1976-LeeP

Location of a Point in a Planar Subdivision and its Applications (DTL, FPP), pp. 231–235.

ICALP-1976-Fontet #algorithm #graph #linear #morphism #testing

A Linear Algorithm for Testing Isomorphism of Planar Graphs (MF), pp. 411–424.

STOC-1974-HopcroftW #algorithm #graph #linear #morphism

Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report) (JEH, JKW), pp. 172–184.