Publications

Filter by type:

(2018). Exact computation of the number of accepting paths of an NTM. Proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics - CALDAM 2018, Guwahati, India.

PDF Slides Publisher Link

(2018). On the Tractability of $(k,i)$-Coloring. Proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics - CALDAM 2018, Guwahati, India.

PDF arXiv Publisher Link

(2017). On Structural Parameterizations of the Matching Cut Problem. Proceedings of the 11th International Conference on Combinatorial Optimization and Applications - COCOA 2017, Shanghai, China.

PDF

(2017). Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture. Presented in the 1st International Workshop on Algorithms & Architectures for Distributed Data Analytics (AADDA). Proceedings of the 18th International Conference on Distributed Computing and Networking - ICDCN 2017, Hyderabad, India.

PDF Publisher Link

(2016). Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. Proceedings of the 27th International Workshop on Combinatorial Algorithms - IWOCA 2016, Helsinki, Finland.

PDF Publisher Link

(2015). The Chromatic Discrepancy of Graphs. Discrete Applied Mathematics, 184. pp. 40-49.

arXiv Publisher Link

(2015). An Optimal Algorithm for Computing Frieze-Kannan Regular Partitions. Combinatorics, Probability and Computing, 24(2), pages 407–437.

PDF Publisher Link

(2014). Acquisition, storage, retrieval and dissemination of disaster related data. Proceedings of the IEEE Region 10 Humanitarian Technology Conference 2014, Chennai, India.

PDF Publisher Link

(2013). A Note on Even Cycles and Quasi-Random Tournaments. Journal of Graph Theory, Volume 73, Issue 3, pages 260–266.

PDF arXiv Publisher Link

(2013). A Wowzer-type Lower bound for the Strong Regularity Lemma. Proceedings of the London Mathematical Society, Volume 106, Issue 3, pages 621–649.

arXiv Publisher Link

(2012). Improved Simulation of Nondeterministic Turing Machines. Theoretical Computer Science (Special MFCS 2010 Issue) Volume 417, pages 66–73.
Preliminary version appeared in the Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2010.

PDF Publisher Link Publisher Link for Conference Version

(2012). A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. SIAM Journal on Discrete Math (SIDMA) Volume 26 Issue 1, pages 15–29.
Preliminary version appeared in the Proceedings of the 15th International Workshop on Randomization and Computation - RANDOM 2011.

PDF Publisher Link Publisher Link for Conference Version

(2009). Algorithms for Message Ferrying on Mobile ad hoc Networks. Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2009, Kanpur, India.

PDF

(2003). High-rate, full-diversity STBCs from field extensions. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2003, Yokohama, Japan.

PDF Publisher Link