activity
20112021
most citedOptimal dynamic program for r-domination problems over tree decompositions

5 citations · 9 across the 8 of their papers we have counts for

collaborators

12 papers

cs.CR2021

The Motivated Can Encrypt (Even with PGP)

Glencora Borradaile, Kelsy Kretschmer, Michele Gretes +1

Existing end-to-end-encrypted (E2EE) email systems, mainly PGP, have long been evaluated in controlled lab settings. While these studies have exposed usability obstacles for the av…

cs.DS2020

Low-stretch spanning trees of graphs with bounded width

Glencora Borradaile, Erin Wolf Chambers, David Eppstein +2

We study the problem of low-stretch spanning trees in graphs of bounded width: bandwidth, cutwidth, and treewidth. We show that any simple connected graph with a linear arrange…

cs.CG2020

Minimum bounded chains and minimum homologous chains in embedded simplicial complexes

Glencora Borradaile, William Maxwell, Amir Nayyeri

We study two optimization problems on simplicial complexes with homology over , the minimum bounded chain problem: given a -dimensional complex embed…

cs.CY2020

Whose Tweets are Surveilled for the Police: An Audit of Social-Media Monitoring Tool via Log Files

Glencora Borradaile, Brett Burkhardt, Alexandria LeClerc

Social media monitoring by law enforcement is becoming commonplace, but little is known about what software packages for it do. Through public records requests, we obtained log fil…

cs.DS2018

Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs

Glencora Borradaile, Hung Le, Baigong Zheng

We present two algorithms for the minimum feedback vertex set problem in planar graphs: an PTAS using a linear kernel and balanced separator, and a heuristic algorith…

cs.CG2017

Greedy spanners are optimal in doubling metrics

Glencora Borradaile, Hung Le, Christian Wulff-Nilsen

We show that the greedy spanner algorithm constructs a -spanner of weight for a point set in metrics of doubling dimension , resolving an open…