A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs

Ajaykrishnan E S, Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan
January 2026
PDF bib Project Project Project DOI

Abstract

Full Citation:

Ajaykrishnan E S, Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan. A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs. 2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026 (Sepehr Assadi, Eva Rotenberg, eds.), pages 65–80, 2026, SIAM.

Type
Conference Paper
Coe PGD ParAI
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.