Avinandan Das

Hi, I am Avinandan.  I am a Post-Doctoral Researcher in Aalto University in the group of Prof. Jukka Suomela. I completed my PhD in  IRIF , Paris, in December 2024 under the supervision of Dr. Adi Rosen and Dr. Pierre Fraigniaud.  Until July 2020, I was a visiting student in The Institute of Mathematical Sciences, Chennai in the Parameterized Complexity group. I did my B.Tech in Computer Science and Engineering  from Tezpur University in 2016 and my Master's in Computer Science from Chennai Mathematical Institute in 2018. My current research is based on designing local algorithms on graph theoretic problems, in streaming and distributed settings. Previously, I also used to work on designing parameterized and exact algorithms on graph theoretic problems.

Here is a link to my CV and select project abstracts .

(Update) Our paper, Semi-Streaming Algorithms for Graph Property Certification, is up in arxiv.

(Update) Our paper, Distributed Partial Coloring via Gradual Rounding, has been accepted in OPODIS 2023. The paper is available here .

(Update) Our paper,  Odd Cycle Transversal in Mixed Graphs, has been published in WG 2021.

(Update) The journal version of our paper, On the Complexity of Singly Connected Vertex Deletion, has been published in TCS, and is available online (link )

My scribe for Primal Dual methods.

My notes on Back Propagation algorithm and it's from scratch implementation.

Projects 

Publications

Computational Geometry

1. (Journal Version)Jammigumpula Ajay, Avinandan Das, Binayak Dutta, Arindam Karmakar, Sasanka Roy, Navaneeta Saikia. Problems on One Way Road Networks. J. Graph Algorithms Appl. 24(3): 523-546 (2020)

2. Jammigumpula Ajaykumar, Avinandan Das, Navaneeta Saikia, Arindam Karmakar: Problems on One Way Road Networks. CCCG 2016: 303–308

Parameterized Complexity

1. (Journal Version)Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh: On the Complexity of Singly Connected Vertex Deletion. Theoretical Computer Science , August 2022.

2. Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh. Odd Cycle Transversal in Mixed Graphs. WG 2021: 130-142 (full version available here. )

3. Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh: On the Complexity of Singly Connected Vertex Deletion. IWOCA 2020: 237-250 

Distributed Algorithms

1. Avinandan Das, Pierre Fraigniaud, Adi Rosen. Distributed Partial Coloring via Gradual Rounding. (accepted in OPODIS 2023) full version available here. Slides available  here .

2. Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedličková. Generalizing Brook’s theorem via Partial Coloring is Hard Classically and Locally. (submitted)

Streaming Algorithms

1. Avinandan Das, Pierre Fraigniaud, Adi Rosen, Ami Paz. Semi-Streaming Algorithms for Graph Property Certification.  [arxiv] 

Contact

avinandan.das@aalto.fi

adas33745@gmail.com