A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
We present a novel multi-planar display system based on an uncalibrated projector-camera pair. Our system exploits the juxtaposition of planar surfaces in a room to create ad-hoc ...
Mark Ashdown, Matthew Flagg, Rahul Sukthankar, Jam...
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...