Avinandan Das

Orcid: 0000-0002-7471-7499

According to our database1, Avinandan Das authored at least 13 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Is a LOCAL algorithm computable?
CoRR, February, 2026

One Color Makes All the Difference in the Tractability of Partial Coloring in Semi-Streaming.
CoRR, February, 2026

It does not matter how you define locally checkable labelings.
CoRR, February, 2026

Generalizing Brooks' Theorem via Partial Coloring Is Hard Classically and Locally.
Proceedings of the WALCOM: Algorithms and Computation, 2026

2025
Semi-Streaming Algorithms for Graph Property Certification.
CoRR, March, 2025

Orientation Does Not Help with 3-Coloring a Grid in Online-LOCAL.
Proceedings of the 29th International Conference on Principles of Distributed Systems, 2025

2024
Computation with Partial Information : An Algorithmic Investigation of Graph Problems in Distributed Computing and Streaming. (Calcul avec Information Partielle : Une Étude Algorithmique de Problèmes de Graphes en Distribué et en Streaming).
PhD thesis, 2024

2023
Distributed Partial Coloring via Gradual Rounding.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2021
Odd Cycle Transversal in Mixed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020
Problems on One Way Road Networks.
J. Graph Algorithms Appl., 2020

On the Complexity of Singly Connected Vertex Deletion.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
Wireless Information and Power Transfer in Three-Phase Two-Way DF-Relay Networks over Nakagami-m Fading.
Proceedings of the IEEE VTS Asia Pacific Wireless Communications Symposium, 2019

2016
Problems on One Way Road Networks.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016


  Loading...