Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sudeshna Kolay
@inproceedings{DBLP:conf/latin/DeyKS24,
author = {Palash Dey and
Sudeshna Kolay and
Sipra Singh},
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {Knapsack: Connectedness, Path, and Shortest-Path},
booktitle = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14579},
pages = {162--176},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55601-2\_11},
doi = {10.1007/978-3-031-55601-2\_11},
timestamp = {Wed, 13 Mar 2024 19:10:54 +0100},
biburl = {https://dblp.org/rec/conf/latin/DeyKS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhoreCKZ23,
author = {Sujoy Bhore and
Paz Carmi and
Sudeshna Kolay and
Meirav Zehavi},
title = {Parameterized Study of Steiner Tree on Unit Disk Graphs},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {133--152},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01020-z},
doi = {10.1007/S00453-022-01020-Z},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BhoreCKZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BishnuGKMS23,
author = {Arijit Bishnu and
Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra and
Saket Saurabh},
title = {Almost optimal query algorithm for hitting set using a subset query},
journal = {J. Comput. Syst. Sci.},
volume = {137},
pages = {50--65},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.02.002},
doi = {10.1016/J.JCSS.2023.02.002},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BishnuGKMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BishnuGKMS23,
author = {Arijit Bishnu and
Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra and
Saket Saurabh},
title = {Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph
Deletion Problems over Data Streams},
journal = {Theory Comput. Syst.},
volume = {67},
number = {6},
pages = {1241--1267},
year = {2023},
url = {https://doi.org/10.1007/s00224-023-10136-w},
doi = {10.1007/S00224-023-10136-W},
timestamp = {Tue, 12 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BishnuGKMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BergBKK23,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
Sudeshna Kolay},
title = {An ETH-Tight Exact Algorithm for Euclidean {TSP}},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {3},
pages = {740--760},
year = {2023},
url = {https://doi.org/10.1137/22m1469122},
doi = {10.1137/22M1469122},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BergBKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DharHK23,
author = {Anubhav Dhar and
Soumita Hait and
Sudeshna Kolay},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex
Terminal Sets},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {25:1--25:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.25},
doi = {10.4230/LIPICS.ISAAC.2023.25},
timestamp = {Tue, 28 Nov 2023 13:12:50 +0100},
biburl = {https://dblp.org/rec/conf/isaac/DharHK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-00254,
author = {Anubhav Dhar and
Soumita Hait and
Sudeshna Kolay},
title = {Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex
Terminal Sets},
journal = {CoRR},
volume = {abs/2307.00254},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.00254},
doi = {10.48550/ARXIV.2307.00254},
eprinttype = {arXiv},
eprint = {2307.00254},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-00254.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-12547,
author = {Palash Dey and
Sudeshna Kolay and
Sipra Singh},
title = {Knapsack: Connectedness, Path, and Shortest-Path},
journal = {CoRR},
volume = {abs/2307.12547},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.12547},
doi = {10.48550/ARXIV.2307.12547},
eprinttype = {arXiv},
eprint = {2307.12547},
timestamp = {Tue, 01 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-12547.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgrawalKZ22,
author = {Akanksha Agrawal and
Sudeshna Kolay and
Meirav Zehavi},
title = {Parameter Analysis for Guarding Terrains},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {961--981},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00913-9},
doi = {10.1007/S00453-021-00913-9},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AgrawalKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AshokKMS22,
author = {Pradeesha Ashok and
Sudeshna Kolay and
Neeldhara Misra and
Saket Saurabh},
title = {Exact Multi-Covering Problems with Geometric Sets},
journal = {Theory Comput. Syst.},
volume = {66},
number = {1},
pages = {89--113},
year = {2022},
url = {https://doi.org/10.1007/s00224-021-10050-z},
doi = {10.1007/S00224-021-10050-Z},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/AshokKMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Pal0KMB22,
author = {Bithika Pal and
Arindam Biswas and
Sudeshna Kolay and
Pabitra Mitra and
Biswajit Basu},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {A Study on the Ramanujan Graph Property of Winning Lottery Tickets},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {17186--17201},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/pal22a.html},
timestamp = {Fri, 29 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/Pal0KMB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderKP21,
author = {Hans L. Bodlaender and
Sudeshna Kolay and
Astrid Pieterse},
title = {Parameterized Complexity of Conflict-Free Graph Coloring},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {3},
pages = {2003--2038},
year = {2021},
url = {https://doi.org/10.1137/19M1307160},
doi = {10.1137/19M1307160},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KolayMRS20,
author = {Sudeshna Kolay and
Pranabendu Misra and
M. S. Ramanujan and
Saket Saurabh},
title = {Faster Graph bipartization},
journal = {J. Comput. Syst. Sci.},
volume = {109},
pages = {45--55},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2019.11.001},
doi = {10.1016/J.JCSS.2019.11.001},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KolayMRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FominLKPS20,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Sudeshna Kolay and
Fahad Panolan and
Saket Saurabh},
title = {Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence
Problems},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {2},
pages = {21:1--21:37},
year = {2020},
url = {https://doi.org/10.1145/3381420},
doi = {10.1145/3381420},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/FominLKPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GhoshKM20,
author = {Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra},
title = {{FPT} Algorithms for Embedding into Low-Complexity Graphic Metrics},
journal = {{ACM} Trans. Comput. Theory},
volume = {12},
number = {1},
pages = {1:1--1:41},
year = {2020},
url = {https://doi.org/10.1145/3369933},
doi = {10.1145/3369933},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GhoshKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BishnuGKM020,
author = {Arijit Bishnu and
Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra and
Saket Saurabh},
editor = {Donghyun Kim and
R. N. Uma and
Zhipeng Cai and
Dong Hoon Lee},
title = {Fixed Parameter Tractability of Graph Deletion Problems over Data
Streams},
booktitle = {Computing and Combinatorics - 26th International Conference, {COCOON}
2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12273},
pages = {652--663},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58150-3\_53},
doi = {10.1007/978-3-030-58150-3\_53},
timestamp = {Thu, 27 Aug 2020 12:32:24 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BishnuGKM020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgrawalKZ20,
author = {Akanksha Agrawal and
Sudeshna Kolay and
Meirav Zehavi},
editor = {Susanne Albers},
title = {Parameter Analysis for Guarding Terrains},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {4:1--4:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.4},
doi = {10.4230/LIPICS.SWAT.2020.4},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/AgrawalKZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BhoreCKZ20,
author = {Sujoy Bhore and
Paz Carmi and
Sudeshna Kolay and
Meirav Zehavi},
editor = {Susanne Albers},
title = {Parameterized Study of Steiner Tree on Unit Disk Graphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {13:1--13:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.13},
doi = {10.4230/LIPICS.SWAT.2020.13},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BhoreCKZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-09220,
author = {Sujoy Bhore and
Paz Carmi and
Sudeshna Kolay and
Meirav Zehavi},
title = {Parameterized Study of Steiner Tree on Unit Disk Graphs},
journal = {CoRR},
volume = {abs/2004.09220},
year = {2020},
url = {https://arxiv.org/abs/2004.09220},
eprinttype = {arXiv},
eprint = {2004.09220},
timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-09220.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KolayPPRT19,
author = {Sudeshna Kolay and
Ragukumar Pandurangan and
Fahad Panolan and
Venkatesh Raman and
Prafullkumar Tale},
title = {Harmonious coloring: Parameterized algorithms and upper bounds},
journal = {Theor. Comput. Sci.},
volume = {772},
pages = {132--142},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.12.011},
doi = {10.1016/J.TCS.2018.12.011},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KolayPPRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/KolayPS19,
author = {Sudeshna Kolay and
Fahad Panolan and
Saket Saurabh},
title = {Communication Complexity and Graph Families},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {2},
pages = {11:1--11:28},
year = {2019},
url = {https://doi.org/10.1145/3313234},
doi = {10.1145/3313234},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/KolayPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AgrawalKM019,
author = {Akanksha Agrawal and
Sudeshna Kolay and
Jayakrishnan Madathil and
Saket Saurabh},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Parameterized Complexity Classification of Deletion to List Matrix-Partition
for Low-Order Matrices},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {41:1--41:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.41},
doi = {10.4230/LIPICS.ISAAC.2019.41},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AgrawalKM019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BodlaenderKP19,
author = {Hans L. Bodlaender and
Sudeshna Kolay and
Astrid Pieterse},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Parameterized Complexity of Conflict-Free Graph Coloring},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {168--180},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_13},
doi = {10.1007/978-3-030-24766-9\_13},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BodlaenderKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00305,
author = {Hans L. Bodlaender and
Sudeshna Kolay and
Astrid Pieterse},
title = {Parameterized Complexity of Conflict-free Graph Coloring},
journal = {CoRR},
volume = {abs/1905.00305},
year = {2019},
url = {http://arxiv.org/abs/1905.00305},
eprinttype = {arXiv},
eprint = {1905.00305},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00305.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-05458,
author = {Arijit Bishnu and
Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra and
Saket Saurabh},
title = {Fixed-Parameter Tractability of Graph Deletion Problems over Data
Streams},
journal = {CoRR},
volume = {abs/1906.05458},
year = {2019},
url = {http://arxiv.org/abs/1906.05458},
eprinttype = {arXiv},
eprint = {1906.05458},
timestamp = {Mon, 24 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-05458.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AshokDKS18,
author = {Pradeesha Ashok and
Aditi Dudeja and
Sudeshna Kolay and
Saket Saurabh},
title = {Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free
Coloring in Hypergraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {2},
pages = {1189--1208},
year = {2018},
url = {https://doi.org/10.1137/16M1107462},
doi = {10.1137/16M1107462},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/AshokDKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AshokFKSZ18,
author = {Pradeesha Ashok and
Fedor V. Fomin and
Sudeshna Kolay and
Saket Saurabh and
Meirav Zehavi},
title = {Exact Algorithms for Terrain Guarding},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {2},
pages = {25:1--25:20},
year = {2018},
url = {https://doi.org/10.1145/3186897},
doi = {10.1145/3186897},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AshokFKSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GhoshKM18,
author = {Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {{FPT} Algorithms for Embedding into Low Complexity Graphic Metrics},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {35:1--35:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.35},
doi = {10.4230/LIPICS.ESA.2018.35},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/GhoshKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BergBKK18,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
Sudeshna Kolay},
editor = {Mikkel Thorup},
title = {An ETH-Tight Exact Algorithm for Euclidean {TSP}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {450--461},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00050},
doi = {10.1109/FOCS.2018.00050},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BergBKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BishnuGKM018,
author = {Arijit Bishnu and
Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra and
Saket Saurabh},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {25:1--25:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.25},
doi = {10.4230/LIPICS.ISAAC.2018.25},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BishnuGKM018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoissonnatDGK18,
author = {Jean{-}Daniel Boissonnat and
Kunal Dutta and
Arijit Ghosh and
Sudeshna Kolay},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {Tight Kernels for Covering and Hitting: Point Hyperplane Cover and
Polynomial Point Hitting Set},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {187--200},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_15},
doi = {10.1007/978-3-319-77404-6\_15},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BoissonnatDGK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-03253,
author = {Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra},
title = {{FPT} algorithms for embedding into low complexity graphic metrics},
journal = {CoRR},
volume = {abs/1801.03253},
year = {2018},
url = {http://arxiv.org/abs/1801.03253},
eprinttype = {arXiv},
eprint = {1801.03253},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-03253.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06272,
author = {Arijit Bishnu and
Arijit Ghosh and
Sudeshna Kolay and
Gopinath Mishra and
Saket Saurabh},
title = {Parameterized Query Complexity of Hitting Set using Stability of Sunflowers},
journal = {CoRR},
volume = {abs/1807.06272},
year = {2018},
url = {http://arxiv.org/abs/1807.06272},
eprinttype = {arXiv},
eprint = {1807.06272},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06272.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06933,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
Sudeshna Kolay},
title = {An ETH-Tight Exact Algorithm for Euclidean {TSP}},
journal = {CoRR},
volume = {abs/1807.06933},
year = {2018},
url = {http://arxiv.org/abs/1807.06933},
eprinttype = {arXiv},
eprint = {1807.06933},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06933.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KolayLPS17,
author = {Sudeshna Kolay and
Daniel Lokshtanov and
Fahad Panolan and
Saket Saurabh},
title = {Quick but Odd Growth of Cacti},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {271--290},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0317-1},
doi = {10.1007/S00453-017-0317-1},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KolayLPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AshokKS17,
author = {Pradeesha Ashok and
Sudeshna Kolay and
Saket Saurabh},
title = {Multivariate Complexity Analysis of Geometric Red Blue Set Cover},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {667--697},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0216-x},
doi = {10.1007/S00453-016-0216-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AshokKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AshokKMS17,
author = {Pradeesha Ashok and
Sudeshna Kolay and
Syed Mohammad Meesum and
Saket Saurabh},
title = {Parameterized complexity of Strip Packing and Minimum Volume Packing},
journal = {Theor. Comput. Sci.},
volume = {661},
pages = {56--64},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2016.11.034},
doi = {10.1016/J.TCS.2016.11.034},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AshokKMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AshokFKSZ17,
author = {Pradeesha Ashok and
Fedor V. Fomin and
Sudeshna Kolay and
Saket Saurabh and
Meirav Zehavi},
editor = {Boris Aronov and
Matthew J. Katz},
title = {Exact Algorithms for Terrain Guarding},
booktitle = {33rd International Symposium on Computational Geometry, SoCG 2017,
July 4-7, 2017, Brisbane, Australia},
series = {LIPIcs},
volume = {77},
pages = {11:1--11:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2017.11},
doi = {10.4230/LIPICS.SOCG.2017.11},
timestamp = {Wed, 16 Jun 2021 12:03:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AshokFKSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KolayP017,
author = {Sudeshna Kolay and
Fahad Panolan and
Saket Saurabh},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Communication Complexity of Pairs of Graph Families with Applications},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {13:1--13:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.13},
doi = {10.4230/LIPICS.MFCS.2017.13},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/KolayP017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BoissonnatDGK17,
author = {Jean{-}Daniel Boissonnat and
Kunal Dutta and
Arijit Ghosh and
Sudeshna Kolay},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Kernelization of the Subset General Position Problem in Geometry},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {25:1--25:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.25},
doi = {10.4230/LIPICS.MFCS.2017.25},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BoissonnatDGK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AgrawalKSS16,
author = {Akanksha Agrawal and
Sudeshna Kolay and
Saket Saurabh and
Roohani Sharma},
editor = {Thomas C. Shermer},
title = {Kernelizing Buttons and Scissors},
booktitle = {Proceedings of the 28th Canadian Conference on Computational Geometry,
{CCCG} 2016, August 3-5, 2016, Simon Fraser University, Vancouver,
British Columbia, Canada},
pages = {279--286},
publisher = {Simon Fraser University, Vancouver, British Columbia, Canada},
year = {2016},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AgrawalKSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/FominKLPS16,
author = {Fedor V. Fomin and
Sudeshna Kolay and
Daniel Lokshtanov and
Fahad Panolan and
Saket Saurabh},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence
Problems},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {39:1--39:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.39},
doi = {10.4230/LIPICS.SOCG.2016.39},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/FominKLPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AgrawalKLS16,
author = {Akanksha Agrawal and
Sudeshna Kolay and
Daniel Lokshtanov and
Saket Saurabh},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {A Faster {FPT} Algorithm and a Smaller Kernel for Block Graph Vertex
Deletion},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {1--13},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_1},
doi = {10.1007/978-3-662-49529-2\_1},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/AgrawalKLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AshokKS16,
author = {Pradeesha Ashok and
Sudeshna Kolay and
Saket Saurabh},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {Parameterized Complexity of Red Blue Set Cover for Lines},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {96--109},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_8},
doi = {10.1007/978-3-662-49529-2\_8},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/AshokKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KolayP0S16,
author = {Sudeshna Kolay and
Fahad Panolan and
Venkatesh Raman and
Saket Saurabh},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {75:1--75:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.75},
doi = {10.4230/LIPICS.MFCS.2016.75},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/KolayP0S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KolayPP0T16,
author = {Sudeshna Kolay and
Ragukumar Pandurangan and
Fahad Panolan and
Venkatesh Raman and
Prafullkumar Tale},
editor = {Pinar Heggernes},
title = {Harmonious Coloring: Parameterized Algorithms and Upper Bounds},
booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
pages = {245--256},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_21},
doi = {10.1007/978-3-662-53536-3\_21},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/KolayPP0T16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GhoshK0MPRR15,
author = {Esha Ghosh and
Sudeshna Kolay and
Mrinal Kumar and
Pranabendu Misra and
Fahad Panolan and
Ashutosh Rai and
M. S. Ramanujan},
title = {Faster Parameterized Algorithms for Deletion to Split Graphs},
journal = {Algorithmica},
volume = {71},
number = {4},
pages = {989--1006},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9837-5},
doi = {10.1007/S00453-013-9837-5},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GhoshK0MPRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DasDKNS15,
author = {Gautam K. Das and
Minati De and
Sudeshna Kolay and
Subhas C. Nandy and
Susmita Sur{-}Kolay},
title = {Approximation algorithms for maximum independent set of a unit disk
graph},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {439--446},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.002},
doi = {10.1016/J.IPL.2014.11.002},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DasDKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AshokKMS15,
author = {Pradeesha Ashok and
Sudeshna Kolay and
Neeldhara Misra and
Saket Saurabh},
editor = {Dachuan Xu and
Donglei Du and
Ding{-}Zhu Du},
title = {Unique Covering Problems with Geometric Sets},
booktitle = {Computing and Combinatorics - 21st International Conference, {COCOON}
2015, Beijing, China, August 4-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9198},
pages = {548--558},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21398-9\_43},
doi = {10.1007/978-3-319-21398-9\_43},
timestamp = {Sun, 25 Oct 2020 22:58:52 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/AshokKMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KolayP15,
author = {Sudeshna Kolay and
Fahad Panolan},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {Parameterized Algorithms for Deletion to (r, ell)-Graphs},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {420--433},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.420},
doi = {10.4230/LIPICS.FSTTCS.2015.420},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/KolayP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AshokDK15,
author = {Pradeesha Ashok and
Aditi Dudeja and
Sudeshna Kolay},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Exact and {FPT} Algorithms for Max-Conflict Free Coloring in Hypergraphs},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {271--282},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_24},
doi = {10.1007/978-3-662-48971-0\_24},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AshokDK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KolayLPS15,
author = {Sudeshna Kolay and
Daniel Lokshtanov and
Fahad Panolan and
Saket Saurabh},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Quick but Odd Growth of Cacti},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {258--269},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.258},
doi = {10.4230/LIPICS.IPEC.2015.258},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/KolayLPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KolayP15,
author = {Sudeshna Kolay and
Fahad Panolan},
title = {Parameterized Algorithms for Deletion to (r, l)-graphs},
journal = {CoRR},
volume = {abs/1504.08120},
year = {2015},
url = {http://arxiv.org/abs/1504.08120},
eprinttype = {arXiv},
eprint = {1504.08120},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KolayP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AgrawalKLS15,
author = {Akanksha Agrawal and
Sudeshna Kolay and
Daniel Lokshtanov and
Saket Saurabh},
title = {A faster {FPT} Algorithm and a smaller Kernel for Block Graph Vertex
Deletion},
journal = {CoRR},
volume = {abs/1510.08154},
year = {2015},
url = {http://arxiv.org/abs/1510.08154},
eprinttype = {arXiv},
eprint = {1510.08154},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AgrawalKLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AshokKS15,
author = {Pradeesha Ashok and
Sudeshna Kolay and
Saket Saurabh},
title = {Multivariate Complexity Analysis of Geometric \{{\textbackslash}sc
Red Blue Set Cover\}},
journal = {CoRR},
volume = {abs/1511.07642},
year = {2015},
url = {http://arxiv.org/abs/1511.07642},
eprinttype = {arXiv},
eprint = {1511.07642},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AshokKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KolayPRS15,
author = {Sudeshna Kolay and
Fahad Panolan and
Venkatesh Raman and
Saket Saurabh},
title = {Parameterized Algorithms on Perfect Graphs for deletion to (r, {\(\mathscr{l}\)})-graphs},
journal = {CoRR},
volume = {abs/1512.04200},
year = {2015},
url = {http://arxiv.org/abs/1512.04200},
eprinttype = {arXiv},
eprint = {1512.04200},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KolayPRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KolayMRS14,
author = {Sudeshna Kolay and
Pranabendu Misra and
M. S. Ramanujan and
Saket Saurabh},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Parameterized Approximations via d-Skew-Symmetric Multicut},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {457--468},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_39},
doi = {10.1007/978-3-662-44465-8\_39},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/KolayMRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GiannopoulouKS12,
author = {Archontia C. Giannopoulou and
Sudeshna Kolay and
Saket Saurabh},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {New Lower Bound on Max Cut of Hypergraphs with an Application to r
-Set Splitting},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {408--419},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_35},
doi = {10.1007/978-3-642-29344-3\_35},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/GiannopoulouKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GhoshKKMPRR12,
author = {Esha Ghosh and
Sudeshna Kolay and
Mrinal Kumar and
Pranabendu Misra and
Fahad Panolan and
Ashutosh Rai and
M. S. Ramanujan},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Faster Parameterized Algorithms for Deletion to Split Graphs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {107--118},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_10},
doi = {10.1007/978-3-642-31155-0\_10},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GhoshKKMPRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:17 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:
