Sudeshna Kolay

CoRR, 2024

Knapsack: Connectedness, Path, and Shortest-Path.

[BibT_eX]

[DOI]

Palash Dey

Sipra Singh

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Knapsack with Vertex Cover, Set Cover, and Hitting Set.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

α-Persistent Temporal Clique Enumeration with an Application.

[BibT_eX]

[DOI]

Bithika Pal

Suman Banerjee

Proceedings of the Databases Theory and Applications, 2024

2023

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams.

[BibT_eX]

[DOI]

Theory Comput. Syst., December, 2023

Almost optimal query algorithm for hitting set using a subset query.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., November, 2023

An ETH-Tight Exact Algorithm for Euclidean TSP.

[BibT_eX]

[DOI]

SIAM J. Comput., June, 2023

Parameterized Study of Steiner Tree on Unit Disk Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2023

Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets.

[BibT_eX]

[DOI]

Anubhav Dhar

Soumita Hait

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

Exact Multi-Covering Problems with Geometric Sets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Parameter Analysis for Guarding Terrains.

[BibT_eX]

[DOI]

Akanksha Agrawal

Meirav Zehavi

Algorithmica, 2022

A Study on the Ramanujan Graph Property of Winning Lottery Tickets.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

Parameterized Complexity of Conflict-Free Graph Coloring.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Astrid Pieterse

SIAM J. Discret. Math., 2021

2020

FPT Algorithms for Embedding into Low-Complexity Graphic Metrics.

[BibT_eX]

[DOI]

Arijit Ghosh

Gopinath Mishra

ACM Trans. Comput. Theory, 2020

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Faster Graph bipartization.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Fixed Parameter Tractability of Graph Deletion Problems over Data Streams.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Communication Complexity and Graph Families.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

Harmonious coloring: Parameterized algorithms and upper bounds.

[BibT_eX]

[DOI]

Ragukumar Pandurangan

Venkatesh Raman

Prafullkumar Tale

Theor. Comput. Sci., 2019

Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices.

[BibT_eX]

[DOI]

Akanksha Agrawal

Jayakrishnan Madathil

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Exact Algorithms for Terrain Guarding.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set.

[BibT_eX]

[DOI]

Jean-Daniel Boissonnat

Kunal Dutta

Arijit Ghosh

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Parameterized complexity of Strip Packing and Minimum Volume Packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Quick but Odd Growth of Cacti.

[BibT_eX]

[DOI]

Algorithmica, 2017

Multivariate Complexity Analysis of Geometric Red Blue Set Cover.

[BibT_eX]

[DOI]

Algorithmica, 2017

Communication Complexity of Pairs of Graph Families with Applications.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Kernelization of the Subset General Position Problem in Geometry.

[BibT_eX]

[DOI]

Jean-Daniel Boissonnat

Kunal Dutta

Arijit Ghosh

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Parameterized Complexity of Red Blue Set Cover for Lines.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Kernelizing Buttons and Scissors.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Approximation algorithms for maximum independent set of a unit disk graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Parameterized Algorithms for Deletion to (r, l)-graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}.

[BibT_eX]

[DOI]

CoRR, 2015

Faster Parameterized Algorithms for Deletion to Split Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2015

Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.

[BibT_eX]

[DOI]

Aditi Dudeja

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Parameterized Algorithms for Deletion to (r, ell)-Graphs.

[BibT_eX]

[DOI]

Archontia C. Giannopoulou

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Unique Covering Problems with Geometric Sets.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Parameterized Approximations via d-Skew-Symmetric Multicut.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2012

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting.

[BibT_eX]

[DOI]