Sudeshna Kolay

Cited by

	All	Since 2018
Citations	323	250
h-index	11	10
i10-index	15	11

2012201320142015201620172018201920202021202220232 6 5 11 15 27 35 32 48 36 49 45

Public access

View all

16 articles

5 articles

available

not available

Based on funding mandates

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Fahad PanolanSchool of Computing, University of LeedsVerified email at leeds.ac.uk
Pradeesha AshokInternational Institute of Information Technology, BangaloreVerified email at iiitb.ac.in
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteVerified email at cmi.ac.in
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Akanksha AgrawalIndian Institute of Technology MadrasVerified email at cse.iitm.ac.in
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityVerified email at uu.nl
Ashutosh RaiDepartment of Mathematics, IIT DelhiVerified email at maths.iitd.ac.in
Esha GhoshMicrosoft ResearchVerified email at microsoft.com
Meirav ZehaviBen-Gurion University of the NegevVerified email at bgu.ac.il
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Sándor Kisfaludi-BakAalto UniversityVerified email at aalto.fi
Mark de BergProfessor of Computer Science, TU EindhovenVerified email at win.tue.nl
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Minati DeIndian Institute of Technology DelhiVerified email at maths.iitd.ac.in
Subhas C NandyIndian Statistical InstituteVerified email at isical.ac.in
Susmita Sur-KolayProfessor of Computer ScienceVerified email at isical.ac.in
Kunal DuttaInstitute of Informatics, University of WarsawVerified email at mimuw.edu.pl
Jean-Daniel BoissonnatDirecteur de RechercheVerified email at inria.fr

Sudeshna Kolay

IIT Kharagpur

Verified email at cse.iitkgp.ac.in - Homepage

Parameterized Complexity Computational Geometry


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Faster parameterized algorithms for deletion to split graphs E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan Algorithmica 71 (4), 989-1006, 2015	47	2015
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion A Agrawal, S Kolay, D Lokshtanov, S Saurabh LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016	29	2016
An ETH-tight exact algorithm for Euclidean TSP M De Berg, HL Bodlaender, S Kisfaludi-Bak, S Kolay 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018	28	2018
Exact algorithms for terrain guarding P Ashok, FV Fomin, S Kolay, S Saurabh, M Zehavi ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018	25	2018
Approximation algorithms for maximum independent set of a unit disk graph GK Das, M De, S Kolay, SC Nandy, S Sur-Kolay Information Processing Letters 115 (3), 439-446, 2015	21	2015
Subexponential algorithms for rectilinear Steiner tree and arborescence problems FV Fomin, D Lokshtanov, S Kolay, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 16 (2), 1-37, 2020	19	2020
Faster parameterized algorithms for deletion to split graphs E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan Scandinavian Workshop on Algorithm Theory, 107-118, 2012	19	2012
Parameterized algorithms for deletion to (r, l)-graphs S Kolay, F Panolan arXiv preprint arXiv:1504.08120, 2015	16	2015
Parameterized complexity of conflict-free graph coloring HL Bodlaender, S Kolay, A Pieterse SIAM Journal on Discrete Mathematics 35 (3), 2003-2038, 2021	13	2021
Parameterized query complexity of hitting set using stability of sunflowers A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh arXiv preprint arXiv:1807.06272, 2018	13	2018
Unique covering problems with geometric sets P Ashok, S Kolay, N Misra, S Saurabh International Computing and Combinatorics Conference, 548-558, 2015	12	2015
Quick but odd growth of cacti S Kolay, D Lokshtanov, F Panolan, S Saurabh Algorithmica 79 (1), 271-290, 2017	11	2017
Exact and FPT algorithms for max-conflict free coloring in hypergraphs P Ashok, A Dudeja, S Kolay International Symposium on Algorithms and Computation, 271-282, 2015	11	2015
Multivariate complexity analysis of geometric red blue set cover P Ashok, S Kolay, S Saurabh Algorithmica 79 (3), 667-697, 2017	10	2017
Parameterized algorithms on perfect graphs for deletion to (r, l)-graphs S Kolay, F Panolan, V Raman, S Saurabh 41st International Symposium on Mathematical Foundations of Computer Science …, 2016	10	2016
A Study on the Ramanujan Graph Property of Winning Lottery Tickets B Pal, A Biswas, S Kolay, P Mitra, B Basu International Conference on Machine Learning, 17186-17201, 2022	6	2022
Parameter analysis for guarding terrains A Agrawal, S Kolay, M Zehavi Algorithmica 84 (4), 961-981, 2022	4	2022
Parameterized Approximations via d-Skew-Symmetric Multicut S Kolay, P Misra, MS Ramanujan, S Saurabh Mathematical Foundations of Computer Science 2014: 39th International …, 2014	4	2014
New Lower Bound on Max Cut of Hypergraphs with an Application to r-Set Splitting AC Giannopoulou, S Kolay, S Saurabh Latin American Symposium on Theoretical Informatics, 408-419, 2012	4	2012
Fixed parameter tractability of graph deletion problems over data streams A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh International Computing and Combinatorics Conference, 652-663, 2020	3	2020

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors