88 citations · 293 across the 27 of their papers we have counts for
Showing 2018 · cs.DMShow all
2 papers · 2 filters
cs.DM2018
Efficiently list-edge coloring multigraphs asymptotically optimally
Fotis Iliopoulos, Alistair Sinclair
We give polynomial time algorithms for the seminal results of Kahn, who showed that the Goldberg-Seymour and List-Coloring conjectures for (list-)edge coloring multigraphs hold asy…
cs.DM2018
Beyond the Lovasz Local Lemma: Point to Set Correlations and Their Algorithmic Applications
Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair
Following the groundbreaking algorithm of Moser and Tardos for the Lovasz Local Lemma (LLL), there has been a plethora of results analyzing local search algorithms for various cons…