Sudeshna Kolay

68 papers A* 4A 1B 15Misc 3Journal 38Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs. CoRR Aryan Sanghi, Anubhav Dhar, Sudeshna Kolay
2026	J	`jnl`	Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices. CoRR Palash Dey, Anubhav Dhar, Ashlesha Hota, Sudeshna Kolay, Aritra Mitra
2025	J	`jnl`	Knapsack on Graphs with Relaxed Neighborhood Constraints. CoRR Palash Dey, Ashlesha Hota, Sudeshna Kolay
2025	J	`jnl`	The Complexity of Minimum-Envy House Allocation Over Graphs. CoRR Palash Dey, Anubhav Dhar, Ashlesha Hota, Sudeshna Kolay
2025	J	`jnl`	Universal Solvability for Robot Motion Planning on Graphs. CoRR Anubhav Dhar, Ashlesha Hota, Sudeshna Kolay, Pranav Nyati, Tanishq Prasad
2024	J	`jnl`	Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares. CoRR Anubhav Dhar, Subham Ghosh, Sudeshna Kolay
2024	B	`conf`	Knapsack with Vertex Cover, Set Cover, and Hitting Set. ISAAC Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh
2024	J	`jnl`	Knapsack with Vertex Cover, Set Cover, and Hitting Set. CoRR Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh
2024	—	`conf`	Knapsack: Connectedness, Path, and Shortest-Path. LATIN (2) Palash Dey, Sudeshna Kolay, Sipra Singh
2024	Misc	`conf`	α-Persistent Temporal Clique Enumeration with an Application. ADC Bithika Pal, Sudeshna Kolay, Suman Banerjee
2023	J	`jnl`	Almost optimal query algorithm for hitting set using a subset query. J. Comput. Syst. Sci. Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2023	J	`jnl`	An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2023	B	`conf`	Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. ISAAC Anubhav Dhar, Soumita Hait, Sudeshna Kolay
2023	J	`jnl`	Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. CoRR Anubhav Dhar, Soumita Hait, Sudeshna Kolay
2023	J	`jnl`	Knapsack: Connectedness, Path, and Shortest-Path. CoRR Palash Dey, Sudeshna Kolay, Sipra Singh
2023	J	`jnl`	Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2023	J	`jnl`	Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2022	A*	`conf`	A Study on the Ramanujan Graph Property of Winning Lottery Tickets. ICML Bithika Pal, Arindam Biswas, Sudeshna Kolay, Pabitra Mitra, Biswajit Basu
2022	J	`jnl`	Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2022	J	`jnl`	Parameter Analysis for Guarding Terrains. Algorithmica Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
2021	J	`jnl`	Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2020	J	`jnl`	FPT Algorithms for Embedding into Low-Complexity Graphic Metrics. ACM Trans. Comput. Theory Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
2020	J	`jnl`	Faster Graph bipartization. J. Comput. Syst. Sci. Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2020	Misc	`conf`	Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. COCOON Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2020	—	`conf`	Parameter Analysis for Guarding Terrains. SWAT Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
2020	—	`conf`	Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2020	J	`jnl`	Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2020	J	`jnl`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2019	J	`jnl`	Communication Complexity and Graph Families. ACM Trans. Comput. Theory Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2019	J	`jnl`	Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. CoRR Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2019	J	`jnl`	Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
2019	B	`conf`	Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ISAAC Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh
2019	B	`conf`	Parameterized Complexity of Conflict-Free Graph Coloring. WADS Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2019	J	`jnl`	Parameterized Complexity of Conflict-free Graph Coloring. CoRR Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2018	A*	`conf`	An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018	J	`jnl`	An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018	J	`jnl`	Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. SIAM J. Discret. Math. Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh
2018	A	`conf`	FPT Algorithms for Embedding into Low Complexity Graphic Metrics. ESA Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
2018	J	`jnl`	FPT algorithms for embedding into low complexity graphic metrics. CoRR Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
2018	B	`conf`	Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. ISAAC Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2018	J	`jnl`	Parameterized Query Complexity of Hitting Set using Stability of Sunflowers. CoRR Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
2018	B	`conf`	Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. LATIN Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay
2017	B	`conf`	Communication Complexity of Pairs of Graph Families with Applications. MFCS Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2017	A*	`conf`	Exact Algorithms for Terrain Guarding. SoCG Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Kernelization of the Subset General Position Problem in Geometry. MFCS Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay
2017	J	`jnl`	Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2017	J	`jnl`	Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh
2017	J	`jnl`	Quick but Odd Growth of Cacti. Algorithmica Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	B	`conf`	A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2016	B	`conf`	Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
2016	—	`conf`	Kernelizing Buttons and Scissors. CCCG Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma
2016	B	`conf`	Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2016	B	`conf`	Parameterized Complexity of Red Blue Set Cover for Lines. LATIN Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2016	A*	`conf`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	J	`jnl`	A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion. CoRR Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2015	J	`jnl`	Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay
2015	B	`conf`	Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. ISAAC Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay
2015	J	`jnl`	Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
2015	J	`jnl`	Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}. CoRR Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2015	—	`conf`	Parameterized Algorithms for Deletion to (r, ell)-Graphs. FSTTCS Sudeshna Kolay, Fahad Panolan
2015	J	`jnl`	Parameterized Algorithms for Deletion to (r, l)-graphs. CoRR Sudeshna Kolay, Fahad Panolan
2015	J	`jnl`	Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2015	B	`conf`	Quick but Odd Growth of Cacti. IPEC Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	Misc	`conf`	Unique Covering Problems with Geometric Sets. COCOON Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2014	—	`conf`	Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2012	—	`conf`	Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
2012	B	`conf`	New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. LATIN Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh