Publications
Publications
Is a LOCAL algorithm computable ?
Antonio Cruciani, Avinandan Das, Massimo Equi, Henrik Lievonen, Diep Luong-Le, Augusto Modanese, Jukka Suomela.
🏗️ preprint
One color makes all the difference in the tractibility of Partial Coloring in Semi-Streaming.
Avinandan Das.
🏗️ preprint
It does not matter how you define locally checkable labelings.
Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela.
🏗️ preprint
Generalizing Brook’s theorem via Partial Coloring is Hard Classically and Locally.
Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedličková.
🏗️ preprint
🎙️WALCOM 2026
Orientation does not help with 3-coloring a grid in onlline-LOCAL.
Thomas Boudier, Filippo Casagrande, Avinandan Das, Massimo Equi, Henrik Lievonen, Augusto Modanese, Ronja Stimpert.
🏗️ preprint
🎙️OPODIS 2025
Semi-Streaming Algorithms for Graph Property Certification.
Avinandan Das, Pierre Fraigniaud, Ami Paz, Adi Rosen.
🏗️ preprint
Distributed Partial Coloring via Gradual Rounding.
Avinandan Das, Pierre Fraigniaud, Adi Rosen.
🎙️ OPODIS 2023
Odd Cycle Transversal in Mixed Graphs.
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh.
🏗️ preprint
🎙️ WG 2021
On the Complexity of Singly Connected Vertex Deletion.
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh.
🎙️ IWOCA 2020
Problems on One Way Road Networks.
Jammigumpula Ajay, Avinandan Das, Binayak Dutta, Arindam Karmakar, Sasanka Roy, Navaneeta Saikia.
🎙️CCCG 2016
📰 J. Graph Algorithms Appl. 24(3): 523-546 (2020)