93 citations · 244 across the 16 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 2 cited
Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
Andreas Björklund, Petteri Kaski, Ioannis Koutis
We are motivated by a tantalizing open question in exact algorithms: can we detect whether an -vertex directed graph has a Hamiltonian cycle in time significantly less than…
cs.DS2016★ 22 cited
On Fully Dynamic Graph Sparsifiers
Ittai Abraham, David Durfee, Ioannis Koutis +2
We initiate the study of dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polyl…