3 citations · 5 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 3 cited
Bilu-Linial stability, certified algorithms and the Independent Set problem
Haris Angelidakis, Pranjal Awasthi, Avrim Blum +2
We study the Maximum Independent Set (MIS) problem under the notion of stability introduced by Bilu and Linial (2010): a weighted instance of MIS is -stable if it has a unique o…
cs.DS2018
Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings
Haris Angelidakis
In this thesis, we design algorithms for several NP-hard problems in both worst and beyond worst case settings. In the first part of the thesis, we apply the traditional worst case…