Sudeshna Kolay

Navedeno

	Vse	Od leta 2018
Navedbe	302	217
indeks h	11	10
indeks i10	14	10

2012201320142015201620172018201920202021202220232 8 5 11 16 26 32 32 47 40 53 9

Javni dostop

Prikaži vse

14 člankov

4 članki

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Saket SaurabhProfessor at Institute of Mathematical SciencesPreverjeni e-poštni naslov na imsc.res.in
Fahad PanolanIndian Institute of Technology HyderabadPreverjeni e-poštni naslov na iith.ac.in
Pradeesha AshokInternational Institute of Information Technology, BangalorePreverjeni e-poštni naslov na iiitb.ac.in
Ramanujan M. S.University of Warwick, UKPreverjeni e-poštni naslov na warwick.ac.uk
Pranabendu MisraAssistant Professor at Chennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
Akanksha AgrawalIndian Institute of Technology MadrasPreverjeni e-poštni naslov na cse.iitm.ac.in
Ashutosh RaiDepartment of Mathematics, IIT DelhiPreverjeni e-poštni naslov na maths.iitd.ac.in
Esha GhoshMicrosoft ResearchPreverjeni e-poštni naslov na microsoft.com
Meirav ZehaviBen-Gurion University of the NegevPreverjeni e-poštni naslov na bgu.ac.il
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityPreverjeni e-poštni naslov na uu.nl
Neeldhara MisraIndian Institute of Technology, GandhinagarPreverjeni e-poštni naslov na iitgn.ac.in
Sándor Kisfaludi-BakAalto UniversityPreverjeni e-poštni naslov na aalto.fi
Mark de BergProfessor of Computer Science, TU EindhovenPreverjeni e-poštni naslov na win.tue.nl
Minati DeIndian Institute of Technology DelhiPreverjeni e-poštni naslov na maths.iitd.ac.in
Subhas C NandyIndian Statistical InstitutePreverjeni e-poštni naslov na isical.ac.in
Susmita Sur-KolayProfessor of Computer SciencePreverjeni e-poštni naslov na isical.ac.in
Kunal DuttaInstitute of Informatics, University of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Jean-Daniel BoissonnatDirecteur de RecherchePreverjeni e-poštni naslov na inria.fr

Spremljaj

Sudeshna Kolay

IIT Kharagpur

Preverjeni e-poštni naslov na cse.iitkgp.ac.in - Domača stran

Parameterized Complexity Computational Geometry


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	45	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	26	2016
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
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	24	2018
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	20	2020
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	20	2015
Faster Parameterized Algorithms for Deletion to Split Graphs. E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan SWAT 7357, 107-118, 2012	18	2012
Parameterized Algorithms for Deletion to (r, l)-Graphs S Kolay, F Panolan arXiv preprint arXiv:1504.08120, 2015	17	2015
Quick but odd growth of cacti S Kolay, D Lokshtanov, F Panolan, S Saurabh Algorithmica 79 (1), 271-290, 2017	12	2017
Exact and FPT algorithms for max-conflict free coloring in hypergraphs P Ashok, A Dudeja, S Kolay Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya …, 2015	12	2015
Parameterized complexity of conflict-free graph coloring HL Bodlaender, S Kolay, A Pieterse SIAM Journal on Discrete Mathematics 35 (3), 2003-2038, 2021	11	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	11	2018
Unique covering problems with geometric sets P Ashok, S Kolay, N Misra, S Saurabh Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015	11	2015
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
Multivariate complexity analysis of geometric red blue set cover P Ashok, S Kolay, S Saurabh Algorithmica 79 (3), 667-697, 2017	7	2017
Parameterized Approximations via d-Skew-Symmetric Multicut S Kolay, P Misra, MS Ramanujan, S Saurabh Mathematical Foundations of Computer Science 2014: 39th International …, 2014	5	2014
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting AC Giannopoulou, S Kolay, S Saurabh LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa …, 2012	5	2012
Parameter analysis for guarding terrains A Agrawal, S Kolay, M Zehavi Algorithmica 84 (4), 961-981, 2022	4	2022
Harmonious coloring: Parameterized algorithms and upper bounds S Kolay, R Pandurangan, F Panolan, V Raman, P Tale Theoretical Computer Science 772, 132-142, 2019	4	2019
Parameterized complexity of strip packing and minimum volume packing P Ashok, S Kolay, SM Meesum, S Saurabh Theoretical Computer Science 661, 56-64, 2017	4	2017

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji