A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection

An Optimal Decomposition Algorithm for Tree Edit Distance

An optimal decomposition algorithm for tree edit distance

Better Tradeoffs for Exact Distance Oracles in Planar Graphs

Deterministic dense coding with partially entangled states

article published in 2005

Effect of unitary noise on Grover’s quantum search algorithm

Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes

Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs

Efficient Vertex-Label Distance Oracles for Planar Graphs

Efficient Vertex-Label Distance Oracles for Planar Graphs

Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes

scientific article published on 4 January 2010

Exact Distance Oracles for Planar Graphs

Fast Algorithms for Computing Tree LCS

scholarly article

Fast algorithms for computing tree LCS

Faster shortest paths in dense distance graphs, with applications

Improved Submatrix Maximum Queries in Monge Matrices

Minimum Cut of Directed Planar Graphs in O(n log log n) Time

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time

Near-Optimal Compression for the Planar Graph Metric

New construction for a QMA complete three-local Hamiltonian ⬇️

article by Daniel Nagaj & Shay Mozes published July 2007 in Journal of Mathematical Physics

Recursive Separator Decompositions for Planar Graphs

Recursive Separator Decompositions for Planar Graphs

Short and Simple Cycle Separators in Planar Graphs

Short and Simple Cycle Separators in Planar Graphs

Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-SpaceO(nlog2n)-Time Algorithm

Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time

Shortest paths in directed planar graphs with negative lengths

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions

Structured recursive separator decompositions for planar graphs in linear time

Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

The Train Delivery Problem - Vehicle Routing Meets Bin Packing

The nearest colored node in a tree

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time