2 citations · 5 across the 5 of their papers we have counts for
6 papers
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms
Chandra Chekuri, Manuel R. Torres
Dense subgraph discovery is an important problem in graph mining and network analysis with several applications. Two canonical problems here are to find a maxcore (subgraph of maxi…
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
We develop fast approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem (BD-MST) and its generalization the Crossing Spanning Tree problem (Crossing…
Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching
David Eppstein, Michael T. Goodrich, Jordan Jorgensen +1
Motivated by the problem of fingerprint matching, we present geometric approximation algorithms for matching a pattern point set against a background point set, where the points ha…
A Topological Algorithm for Determining How Road Networks Evolve Over Time
M T Goodrich, Siddharth Gupta, Manuel R. Torres
We provide an efficient algorithm for determining how a road network has evolved over time, given two snapshot instances from different dates. To allow for such determinations acro…
Models and Algorithms for Graph Watermarking
David Eppstein, Michael T. Goodrich, Jenny Lam +3
We introduce models and algorithmic foundations for graph watermarking. Our frameworks include security definitions and proofs, as well as characterizations when graph watermarking…
Knuthian Drawings of Series-Parallel Flowcharts
Michael T. Goodrich, Timothy Johnson, Manuel Torres
Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms s…