default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSudeshna Kolay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Palash Dey, Sudeshna Kolay, Sipra Singh:
Knapsack: Connectedness, Path, and Shortest-Path. LATIN (2) 2024: 162-176- [i14]Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh:
Knapsack with Vertex Cover, Set Cover, and Hitting Set. CoRR abs/2406.01057 (2024) - [i13]Anubhav Dhar, Subham Ghosh, Sudeshna Kolay:
Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares. CoRR abs/2407.02658 (2024) - 2023
- [j19]Sujoy Bhore
, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85(1): 133-152 (2023) - [j18]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Almost optimal query algorithm for hitting set using a subset query. J. Comput. Syst. Sci. 137: 50-65 (2023) - [j17]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. 67(6): 1241-1267 (2023) - [j16]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. 52(3): 740-760 (2023) - [c27]Anubhav Dhar, Soumita Hait, Sudeshna Kolay:
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. ISAAC 2023: 25:1-25:17 - [i12]Anubhav Dhar, Soumita Hait, Sudeshna Kolay:
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. CoRR abs/2307.00254 (2023) - [i11]Palash Dey, Sudeshna Kolay, Sipra Singh:
Knapsack: Connectedness, Path, and Shortest-Path. CoRR abs/2307.12547 (2023) - 2022
- [j15]Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi:
Parameter Analysis for Guarding Terrains. Algorithmica 84(4): 961-981 (2022) - [j14]Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66(1): 89-113 (2022) - [c26]Bithika Pal, Arindam Biswas, Sudeshna Kolay, Pabitra Mitra, Biswajit Basu:
A Study on the Ramanujan Graph Property of Winning Lottery Tickets. ICML 2022: 17186-17201 - 2021
- [j13]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. 35(3): 2003-2038 (2021) - 2020
- [j12]Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Graph bipartization. J. Comput. Syst. Sci. 109: 45-55 (2020) - [j11]Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16(2): 21:1-21:37 (2020) - [j10]Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra:
FPT Algorithms for Embedding into Low-Complexity Graphic Metrics. ACM Trans. Comput. Theory 12(1): 1:1-1:41 (2020) - [c25]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. COCOON 2020: 652-663 - [c24]Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi:
Parameter Analysis for Guarding Terrains. SWAT 2020: 4:1-4:18 - [c23]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT 2020: 13:1-13:18 - [i10]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR abs/2004.09220 (2020)
2010 – 2019
- 2019
- [j9]Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772: 132-142 (2019) - [j8]Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Communication Complexity and Graph Families. ACM Trans. Comput. Theory 11(2): 11:1-11:28 (2019) - [c22]Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh:
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ISAAC 2019: 41:1-41:14 - [c21]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-Free Graph Coloring. WADS 2019: 168-180 - [i9]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-free Graph Coloring. CoRR abs/1905.00305 (2019) - [i8]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. CoRR abs/1906.05458 (2019) - 2018
- [j7]Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh:
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. SIAM J. Discret. Math. 32(2): 1189-1208 (2018) - [j6]Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms 14(2): 25:1-25:20 (2018) - [c20]Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra:
FPT Algorithms for Embedding into Low Complexity Graphic Metrics. ESA 2018: 35:1-35:13 - [c19]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS 2018: 450-461 - [c18]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. ISAAC 2018: 25:1-25:12 - [c17]Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay:
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. LATIN 2018: 187-200 - [i7]Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra:
FPT algorithms for embedding into low complexity graphic metrics. CoRR abs/1801.03253 (2018) - [i6]Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh:
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers. CoRR abs/1807.06272 (2018) - [i5]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR abs/1807.06933 (2018) - 2017
- [j5]Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Quick but Odd Growth of Cacti. Algorithmica 79(1): 271-290 (2017) - [j4]Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica 79(3): 667-697 (2017) - [j3]Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh:
Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. 661: 56-64 (2017) - [c16]Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. SoCG 2017: 11:1-11:15 - [c15]Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Communication Complexity of Pairs of Graph Families with Applications. MFCS 2017: 13:1-13:13 - [c14]Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay:
Kernelization of the Subset General Position Problem in Geometry. MFCS 2017: 25:1-25:13 - 2016
- [c13]Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma:
Kernelizing Buttons and Scissors. CCCG 2016: 279-286 - [c12]Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG 2016: 39:1-39:15 - [c11]Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN 2016: 1-13 - [c10]Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Parameterized Complexity of Red Blue Set Cover for Lines. LATIN 2016: 96-109 - [c9]Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS 2016: 75:1-75:13 - [c8]Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG 2016: 245-256 - 2015
- [j2]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71(4): 989-1006 (2015) - [j1]Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay:
Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. 115(3): 439-446 (2015) - [c7]Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Unique Covering Problems with Geometric Sets. COCOON 2015: 548-558 - [c6]Sudeshna Kolay, Fahad Panolan:
Parameterized Algorithms for Deletion to (r, ell)-Graphs. FSTTCS 2015: 420-433 - [c5]Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay:
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. ISAAC 2015: 271-282 - [c4]Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Quick but Odd Growth of Cacti. IPEC 2015: 258-269 - [i4]Sudeshna Kolay, Fahad Panolan:
Parameterized Algorithms for Deletion to (r, l)-graphs. CoRR abs/1504.08120 (2015) - [i3]Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion. CoRR abs/1510.08154 (2015) - [i2]Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh:
Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}. CoRR abs/1511.07642 (2015) - [i1]Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR abs/1512.04200 (2015) - 2014
- [c3]Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) 2014: 457-468 - 2012
- [c2]Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh:
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. LATIN 2012: 408-419 - [c1]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT 2012: 107-118
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-08 19:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
