206 citations · 303 across the 29 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.GT2009★ 21 cited
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Jean Cardinal, Erik D. Demaine, Samuel Fiorini +3
The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem played on a graph representing a network. Its edges are colored either red or blue, and the…
cs.CC2009★ 3 cited
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
Danny Hermelin, Gad M. Landau, Shir Landau +1
We present a unified framework for accelerating edit-distance computation between two compressible strings using straight-line programs. For two strings of total length having…