Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Venkatesh Raman 0001
@article{DBLP:journals/algorithms/JacobMR23,
author = {Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing},
journal = {Algorithms},
volume = {16},
number = {3},
pages = {144},
year = {2023},
url = {https://doi.org/10.3390/a16030144},
doi = {10.3390/A16030144},
timestamp = {Sun, 16 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/JacobMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChoudharyGGKMR23,
author = {Pratibha Choudhary and
Michael T. Goodrich and
Siddharth Gupta and
Hadi Khodabandeh and
Pedro Matias and
Venkatesh Raman},
title = {Improved kernels for tracking paths},
journal = {Inf. Process. Lett.},
volume = {181},
pages = {106360},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2023.106360},
doi = {10.1016/J.IPL.2023.106360},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChoudharyGGKMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JacobM023,
author = {Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Deletion to scattered graph classes {II} - improved {FPT} algorithms
for deletion to pairs of graph classes},
journal = {J. Comput. Syst. Sci.},
volume = {136},
pages = {280--301},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.03.004},
doi = {10.1016/J.JCSS.2023.03.004},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/JacobM023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JacobKMR23,
author = {Ashwin Jacob and
Jari J. H. de Kroon and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Deletion to scattered graph classes {I} - Case of finite number of
graph classes},
journal = {J. Comput. Syst. Sci.},
volume = {138},
pages = {103460},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.05.005},
doi = {10.1016/J.JCSS.2023.05.005},
timestamp = {Thu, 14 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/JacobKMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BandopadhyayBBR23,
author = {Susobhan Bandopadhyay and
Suman Banerjee and
Aritra Banik and
Venkatesh Raman},
title = {Structural parameterizations of budgeted graph coloring},
journal = {Theor. Comput. Sci.},
volume = {940},
number = {Part},
pages = {209--221},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.11.002},
doi = {10.1016/J.TCS.2022.11.002},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BandopadhyayBBR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BanikKR23,
author = {Aritra Banik and
Prahlad Narasimhan Kasthurirangan and
Venkatesh Raman},
editor = {Pat Morin and
Subhash Suri},
title = {Dominator Coloring and {CD} Coloring in Almost Cluster Graphs},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {106--119},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_8},
doi = {10.1007/978-3-031-38906-1\_8},
timestamp = {Tue, 01 Aug 2023 13:49:25 +0200},
biburl = {https://dblp.org/rec/conf/wads/BanikKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-02687,
author = {Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Expansion Lemma - Variations and Applications to Polynomial-Time Preprocessing},
journal = {CoRR},
volume = {abs/2303.02687},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.02687},
doi = {10.48550/ARXIV.2303.02687},
eprinttype = {arXiv},
eprint = {2303.02687},
timestamp = {Tue, 14 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-02687.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JacobPRS22,
author = {Ashwin Jacob and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot},
title = {Structural Parameterizations with Modulator Oblivion},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2335--2357},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00971-7},
doi = {10.1007/S00453-022-00971-7},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JacobPRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/KapoorMR22,
author = {Hemangee Kalpesh Kapoor and
Mausam and
Venkatesh Raman},
title = {Welcome back!},
journal = {Commun. {ACM}},
volume = {65},
number = {11},
pages = {40--42},
year = {2022},
url = {https://doi.org/10.1145/3564603},
doi = {10.1145/3564603},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/KapoorMR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BiswasJRS22,
author = {Arindam Biswas and
Varunkumar Jayapaul and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Finding kings in tournaments},
journal = {Discret. Appl. Math.},
volume = {322},
pages = {240--252},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.08.014},
doi = {10.1016/J.DAM.2022.08.014},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BiswasJRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChakrabortyMRS22,
author = {Sankardeep Chakraborty and
Anish Mukherjee and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Frameworks for designing in-place graph algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {123},
pages = {1--19},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.07.004},
doi = {10.1016/J.JCSS.2021.07.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ChakrabortyMRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoudharyR22,
author = {Pratibha Choudhary and
Venkatesh Raman},
title = {Structural parameterizations of Tracking Paths problem},
journal = {Theor. Comput. Sci.},
volume = {934},
pages = {91--102},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.09.009},
doi = {10.1016/J.TCS.2022.09.009},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChoudharyR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BanerjeeGRS22,
author = {Niranka Banerjee and
Manoj Gupta and
Venkatesh Raman and
Saket Saurabh},
editor = {Alexander S. Kulikov and
Sofya Raskhodnikova},
title = {Output Sensitive Fault Tolerant Maximum Matching},
booktitle = {Computer Science - Theory and Applications - 17th International Computer
Science Symposium in Russia, {CSR} 2022, Virtual Event, June 29 -
July 1, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13296},
pages = {115--132},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-09574-0\_8},
doi = {10.1007/978-3-031-09574-0\_8},
timestamp = {Wed, 05 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/BanerjeeGRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BandopadhyayBBR22,
author = {Susobhan Bandopadhyay and
Suman Banerjee and
Aritra Banik and
Venkatesh Raman},
editor = {Petra Mutzel and
Md. Saidur Rahman and
Slamin},
title = {Structural Parameterizations of Budgeted Graph Coloring},
booktitle = {{WALCOM:} Algorithms and Computation - 16th International Conference
and Workshops, {WALCOM} 2022, Jember, Indonesia, March 24-26, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13174},
pages = {340--351},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-96731-4\_28},
doi = {10.1007/978-3-030-96731-4\_28},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BandopadhyayBBR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-03142,
author = {Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Deletion to Scattered Graph Classes {II} - Improved {FPT} Algorithms
for Deletion to Pairs of Graph Classes},
journal = {CoRR},
volume = {abs/2201.03142},
year = {2022},
url = {https://arxiv.org/abs/2201.03142},
eprinttype = {arXiv},
eprint = {2201.03142},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-03142.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-17321,
author = {Aritra Banik and
Prahlad Narasimhan Kasthurirangan and
Venkatesh Raman},
title = {Dominator Coloring Parameterized by Cluster Vertex Deletion Number},
journal = {CoRR},
volume = {abs/2210.17321},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.17321},
doi = {10.48550/ARXIV.2210.17321},
eprinttype = {arXiv},
eprint = {2210.17321},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-17321.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiswasRS21,
author = {Arindam Biswas and
Venkatesh Raman and
Saket Saurabh},
title = {Approximation in (Poly-) Logarithmic Space},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2303--2331},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00826-7},
doi = {10.1007/S00453-021-00826-7},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiswasRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FrancisNR21,
author = {Mathew C. Francis and
Rian Neogi and
Venkatesh Raman},
title = {Recognizing k-Clique Extendible Orderings},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3338--3362},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00857-0},
doi = {10.1007/S00453-021-00857-0},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FrancisNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JacobMR21,
author = {Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Parameterized Complexity of Conflict-Free Set Cover},
journal = {Theory Comput. Syst.},
volume = {65},
number = {3},
pages = {515--540},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-10022-9},
doi = {10.1007/S00224-020-10022-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JacobMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BiswasR21,
author = {Arindam Biswas and
Venkatesh Raman},
editor = {Chi{-}Yeh Chen and
Wing{-}Kai Hon and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {Sublinear-Space Approximation Algorithms for Max r-SAT},
booktitle = {Computing and Combinatorics - 27th International Conference, {COCOON}
2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13025},
pages = {124--136},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-89543-3\_11},
doi = {10.1007/978-3-030-89543-3\_11},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BiswasR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/JacobMR21,
author = {Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {Faster {FPT} Algorithms for Deletion to Pairs of Graph Classes},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {314--326},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_22},
doi = {10.1007/978-3-030-86593-1\_22},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/JacobMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/PandeyRS21,
author = {Sukanya Pandey and
Venkatesh Raman and
Vibha Sahlot},
editor = {Tom{\'{a}}s Bures and
Riccardo Dondi and
Johann Gamper and
Giovanna Guerrini and
Tomasz Jurdzinski and
Claus Pahl and
Florian Sikora and
Prudence W. H. Wong},
title = {Parameterizing Role Coloring on Forests},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12607},
pages = {308--321},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67731-2\_22},
doi = {10.1007/978-3-030-67731-2\_22},
timestamp = {Sun, 25 Jul 2021 11:44:25 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/PandeyRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-04660,
author = {Ashwin Jacob and
Jari J. H. de Kroon and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Deletion to Scattered Graph Classes {I} -- case of finite number of
graph classes},
journal = {CoRR},
volume = {abs/2105.04660},
year = {2021},
url = {https://arxiv.org/abs/2105.04660},
eprinttype = {arXiv},
eprint = {2105.04660},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-04660.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-01673,
author = {Arindam Biswas and
Venkatesh Raman},
title = {Sublinear-Space Approximation Algorithms for Max r-SAT},
journal = {CoRR},
volume = {abs/2107.01673},
year = {2021},
url = {https://arxiv.org/abs/2107.01673},
eprinttype = {arXiv},
eprint = {2107.01673},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-01673.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-14498,
author = {Susobhan Bandopadhyay and
Suman Banerjee and
Aritra Banik and
Venkatesh Raman},
title = {Structural Parameterizations of Budgeted Graph Coloring},
journal = {CoRR},
volume = {abs/2110.14498},
year = {2021},
url = {https://arxiv.org/abs/2110.14498},
eprinttype = {arXiv},
eprint = {2110.14498},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-14498.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-15233,
author = {Arindam Biswas and
Venkatesh Raman and
Srinivasa Rao Satti and
Saket Saurabh},
title = {Space-Efficient {FPT} Algorithms},
journal = {CoRR},
volume = {abs/2112.15233},
year = {2021},
url = {https://arxiv.org/abs/2112.15233},
eprinttype = {arXiv},
eprint = {2112.15233},
timestamp = {Wed, 05 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-15233.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanikPRSS20,
author = {Aritra Banik and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot and
Saket Saurabh},
title = {Parameterized Complexity of Geometric Covering Problems Having Conflicts},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {1--19},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00600-w},
doi = {10.1007/S00453-019-00600-W},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BanikPRSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanikCLRS20,
author = {Aritra Banik and
Pratibha Choudhary and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {A Polynomial Sized Kernel for Tracking Paths Problem},
journal = {Algorithmica},
volume = {82},
number = {1},
pages = {41--63},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00602-8},
doi = {10.1007/S00453-019-00602-8},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BanikCLRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GoyalJ020,
author = {Dishant Goyal and
Varunkumar Jayapaul and
Venkatesh Raman},
title = {Elusiveness of finding degrees},
journal = {Discret. Appl. Math.},
volume = {286},
pages = {128--139},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.06.009},
doi = {10.1016/J.DAM.2019.06.009},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GoyalJ020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamanRS20,
author = {Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
title = {A characterization of K{\"{o}}nig-Egerv{\'{a}}ry graphs
with extendable vertex covers},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105964},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105964},
doi = {10.1016/J.IPL.2020.105964},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RamanRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BanikJPR20,
author = {Aritra Banik and
Ashwin Jacob and
Vijay Kumar Paliwal and
Venkatesh Raman},
title = {Fixed-Parameter Tractability of (n - k) List Coloring},
journal = {Theory Comput. Syst.},
volume = {64},
number = {7},
pages = {1307--1316},
year = {2020},
url = {https://doi.org/10.1007/s00224-020-10014-9},
doi = {10.1007/S00224-020-10014-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BanikJPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AroraBPR20,
author = {Pranav Arora and
Aritra Banik and
Vijay Kumar Paliwal and
Venkatesh Raman},
title = {List-coloring - Parameterizing from triviality},
journal = {Theor. Comput. Sci.},
volume = {821},
pages = {102--110},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.02.022},
doi = {10.1016/J.TCS.2020.02.022},
timestamp = {Tue, 05 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AroraBPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BanerjeeRS20,
author = {Niranka Banerjee and
Venkatesh Raman and
Saket Saurabh},
title = {Fully dynamic arboricity maintenance},
journal = {Theor. Comput. Sci.},
volume = {822},
pages = {1--14},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.04.010},
doi = {10.1016/J.TCS.2020.04.010},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BanerjeeRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BanikCRS20,
author = {Aritra Banik and
Pratibha Choudhary and
Venkatesh Raman and
Saket Saurabh},
title = {Fixed-parameter tractable algorithms for Tracking Shortest Paths},
journal = {Theor. Comput. Sci.},
volume = {846},
pages = {1--13},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.09.006},
doi = {10.1016/J.TCS.2020.09.006},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BanikCRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Banerjee0020,
author = {Niranka Banerjee and
Venkatesh Raman and
Saket Saurabh},
editor = {Nitin Saxena and
Sunil Simon},
title = {Optimal Output Sensitive Fault Tolerant Cuts},
booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2020, December 14-18, 2020,
{BITS} Pilani, {K} {K} Birla Goa Campus, Goa, India (Virtual Conference)},
series = {LIPIcs},
volume = {182},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.10},
doi = {10.4230/LIPICS.FSTTCS.2020.10},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Banerjee0020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/Choudhary020,
author = {Pratibha Choudhary and
Venkatesh Raman},
editor = {Gennaro Cordasco and
Luisa Gargano and
Adele A. Rescigno},
title = {Structural Parameterizations of Tracking Paths Problem},
booktitle = {Proceedings of the 21st Italian Conference on Theoretical Computer
Science, Ischia, Italy, September 14-16, 2020},
series = {{CEUR} Workshop Proceedings},
volume = {2756},
pages = {15--27},
publisher = {CEUR-WS.org},
year = {2020},
url = {https://ceur-ws.org/Vol-2756/paper\_2.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:17 +0100},
biburl = {https://dblp.org/rec/conf/ictcs/Choudhary020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JacobM020,
author = {Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {Parameterized Complexity of Deletion to Scattered Graph Classes},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {18:1--18:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.18},
doi = {10.4230/LIPICS.IPEC.2020.18},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/JacobM020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JacobP0S20,
author = {Ashwin Jacob and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {Structural Parameterizations with Modulator Oblivion},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {19:1--19:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.19},
doi = {10.4230/LIPICS.IPEC.2020.19},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/JacobP0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/00010020,
author = {Arindam Biswas and
Venkatesh Raman and
Saket Saurabh},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Approximation in (Poly-) Logarithmic Space},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {16:1--16:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.16},
doi = {10.4230/LIPICS.MFCS.2020.16},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/00010020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FrancisNR20,
author = {Mathew C. Francis and
Rian Neogi and
Venkatesh Raman},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Recognizing k-Clique Extendible Orderings},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {274--285},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_22},
doi = {10.1007/978-3-030-60440-0\_22},
timestamp = {Fri, 27 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/FrancisNR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-03161,
author = {Pratibha Choudhary and
Venkatesh Raman},
title = {Improved Kernels for Tracking Path Problems},
journal = {CoRR},
volume = {abs/2001.03161},
year = {2020},
url = {http://arxiv.org/abs/2001.03161},
eprinttype = {arXiv},
eprint = {2001.03161},
timestamp = {Mon, 13 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-03161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-08977,
author = {Aritra Banik and
Pratibha Choudhary and
Venkatesh Raman and
Saket Saurabh},
title = {Fixed-parameter tractable algorithms for Tracking Shortest Paths},
journal = {CoRR},
volume = {abs/2001.08977},
year = {2020},
url = {https://arxiv.org/abs/2001.08977},
eprinttype = {arXiv},
eprint = {2001.08977},
timestamp = {Thu, 30 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-08977.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-09972,
author = {Ashwin Jacob and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot},
title = {Structural Parameterizations with Modulator Oblivion},
journal = {CoRR},
volume = {abs/2002.09972},
year = {2020},
url = {https://arxiv.org/abs/2002.09972},
eprinttype = {arXiv},
eprint = {2002.09972},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-09972.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-06060,
author = {Mathew C. Francis and
Rian Neogi and
Venkatesh Raman},
title = {Recognizing k-Clique Extendible Orderings},
journal = {CoRR},
volume = {abs/2007.06060},
year = {2020},
url = {https://arxiv.org/abs/2007.06060},
eprinttype = {arXiv},
eprint = {2007.06060},
timestamp = {Fri, 27 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-06060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-04416,
author = {Arindam Biswas and
Venkatesh Raman and
Saket Saurabh},
title = {Approximation in (Poly-) Logarithmic Space},
journal = {CoRR},
volume = {abs/2008.04416},
year = {2020},
url = {https://arxiv.org/abs/2008.04416},
eprinttype = {arXiv},
eprint = {2008.04416},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-04416.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-09806,
author = {Pratibha Choudhary and
Venkatesh Raman},
title = {Structural Parameterizations of Tracking Paths Problem},
journal = {CoRR},
volume = {abs/2008.09806},
year = {2020},
url = {https://arxiv.org/abs/2008.09806},
eprinttype = {arXiv},
eprint = {2008.09806},
timestamp = {Fri, 28 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-09806.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MisraPRRS19,
author = {Neeldhara Misra and
Fahad Panolan and
Ashutosh Rai and
Venkatesh Raman and
Saket Saurabh},
title = {Parameterized Algorithms for Max Colorable Induced Subgraph Problem
on Perfect Graphs},
journal = {Algorithmica},
volume = {81},
number = {1},
pages = {26--46},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0431-8},
doi = {10.1007/S00453-018-0431-8},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MisraPRRS19.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/tcs/MajumdarNRV19,
author = {Diptapriyo Majumdar and
Rian Neogi and
Venkatesh Raman and
S. Vaishali},
title = {Tractability of K{\"{o}}nig edge deletion problems},
journal = {Theor. Comput. Sci.},
volume = {796},
pages = {207--215},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.09.011},
doi = {10.1016/J.TCS.2019.09.011},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MajumdarNRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Banerjee0019,
author = {Niranka Banerjee and
Venkatesh Raman and
Saket Saurabh},
editor = {Ding{-}Zhu Du and
Zhenhua Duan and
Cong Tian},
title = {Fully Dynamic Arboricity Maintenance},
booktitle = {Computing and Combinatorics - 25th International Conference, {COCOON}
2019, Xi'an, China, July 29-31, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11653},
pages = {1--12},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-26176-4\_1},
doi = {10.1007/978-3-030-26176-4\_1},
timestamp = {Wed, 24 Jul 2019 17:02:06 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Banerjee0019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Jacob0S19,
author = {Ashwin Jacob and
Venkatesh Raman and
Vibha Sahlot},
editor = {Ding{-}Zhu Du and
Zhenhua Duan and
Cong Tian},
title = {Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems},
booktitle = {Computing and Combinatorics - 25th International Conference, {COCOON}
2019, Xi'an, China, July 29-31, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11653},
pages = {325--337},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-26176-4\_27},
doi = {10.1007/978-3-030-26176-4\_27},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Jacob0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/JacobM019,
author = {Ashwin Jacob and
Diptapriyo Majumdar and
Venkatesh Raman},
editor = {Ren{\'{e}} van Bevern and
Gregory Kucherov},
title = {Parameterized Complexity of Conflict-Free Set Cover},
booktitle = {Computer Science - Theory and Applications - 14th International Computer
Science Symposium in Russia, {CSR} 2019, Novosibirsk, Russia, July
1-5, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11532},
pages = {191--202},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-19955-5\_17},
doi = {10.1007/978-3-030-19955-5\_17},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/JacobM019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgrawalBBBCMM0019,
author = {Akanksha Agrawal and
Arindam Biswas and
{\'{E}}douard Bonnet and
Nick Brettell and
Radu Curticapean and
D{\'{a}}niel Marx and
Tillmann Miltzow and
Venkatesh Raman and
Saket Saurabh},
editor = {Arkadev Chattopadhyay and
Paul Gastin},
title = {Parameterized Streaming Algorithms for Min-Ones d-SAT},
booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
Bombay, India},
series = {LIPIcs},
volume = {150},
pages = {8:1--8:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.8},
doi = {10.4230/LIPICS.FSTTCS.2019.8},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AgrawalBBBCMM0019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BanikJP019,
author = {Aritra Banik and
Ashwin Jacob and
Vijay Kumar Paliwal and
Venkatesh Raman},
editor = {Charles J. Colbourn and
Roberto Grossi and
Nadia Pisanti},
title = {Fixed-Parameter Tractability of (n-k) List Coloring},
booktitle = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
Pisa, Italy, July 23-25, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11638},
pages = {61--69},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25005-8\_6},
doi = {10.1007/978-3-030-25005-8\_6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BanikJP019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Biswas0S19,
author = {Arindam Biswas and
Venkatesh Raman and
Saket Saurabh},
editor = {Charles J. Colbourn and
Roberto Grossi and
Nadia Pisanti},
title = {Solving Group Interval Scheduling Efficiently},
booktitle = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
Pisa, Italy, July 23-25, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11638},
pages = {97--107},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25005-8\_9},
doi = {10.1007/978-3-030-25005-8\_9},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/Biswas0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fiorini0N018,
author = {Samuel Fiorini and
R. Krithika and
N. S. Narayanaswamy and
Venkatesh Raman},
title = {Approximability of Clique Transversal in Perfect Graphs},
journal = {Algorithmica},
volume = {80},
number = {8},
pages = {2221--2239},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0315-3},
doi = {10.1007/S00453-017-0315-3},
timestamp = {Fri, 11 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Fiorini0N018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BanikPRS18,
author = {Aritra Banik and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot},
title = {Fr{\'{e}}chet Distance Between a Line and Avatar Point Set},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2616--2636},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0352-y},
doi = {10.1007/S00453-017-0352-Y},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BanikPRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MajumdarR18,
author = {Diptapriyo Majumdar and
Venkatesh Raman},
title = {Structural Parameterizations of Undirected Feedback Vertex Set: {FPT}
Algorithms and Kernelization},
journal = {Algorithmica},
volume = {80},
number = {9},
pages = {2683--2724},
year = {2018},
url = {https://doi.org/10.1007/s00453-018-0419-4},
doi = {10.1007/S00453-018-0419-4},
timestamp = {Fri, 01 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MajumdarR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/MouawadNRS18,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman and
Sebastian Siebertz},
title = {Vertex Cover Reconfiguration and Beyond},
journal = {Algorithms},
volume = {11},
number = {2},
pages = {20},
year = {2018},
url = {https://doi.org/10.3390/a11020020},
doi = {10.3390/A11020020},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/MouawadNRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/0001M018,
author = {R. Krithika and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Revisiting Connected Vertex Cover: {FPT} Algorithms and Lossy Kernels},
journal = {Theory Comput. Syst.},
volume = {62},
number = {8},
pages = {1690--1714},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9837-y},
doi = {10.1007/S00224-017-9837-Y},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/0001M018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BanerjeeC0S18,
author = {Niranka Banerjee and
Sankardeep Chakraborty and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Space Efficient Linear Time Algorithms for BFS, {DFS} and Applications},
journal = {Theory Comput. Syst.},
volume = {62},
number = {8},
pages = {1736--1762},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9841-2},
doi = {10.1007/S00224-017-9841-2},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BanerjeeC0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Majumdar0018,
author = {Diptapriyo Majumdar and
Venkatesh Raman and
Saket Saurabh},
title = {Polynomial Kernels for Vertex Cover Parameterized by Small Degree
Modulators},
journal = {Theory Comput. Syst.},
volume = {62},
number = {8},
pages = {1910--1951},
year = {2018},
url = {https://doi.org/10.1007/s00224-018-9858-1},
doi = {10.1007/S00224-018-9858-1},
timestamp = {Thu, 13 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Majumdar0018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChanMR18,
author = {Timothy M. Chan and
J. Ian Munro and
Venkatesh Raman},
title = {Selection and Sorting in the "Restore" Model},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {2},
pages = {11:1--11:18},
year = {2018},
url = {https://doi.org/10.1145/3168005},
doi = {10.1145/3168005},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChanMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Banerjee0S18,
author = {Niranka Banerjee and
Venkatesh Raman and
Srinivasa Rao Satti},
editor = {Fedor V. Fomin and
Vladimir V. Podolskii},
title = {Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds},
booktitle = {Computer Science - Theory and Applications - 13th International Computer
Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10846},
pages = {29--40},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90530-3\_4},
doi = {10.1007/978-3-319-90530-3\_4},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/Banerjee0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GoyalJKM018,
author = {Dishant Goyal and
Ashwin Jacob and
Kaushtubh Kumar and
Diptapriyo Majumdar and
Venkatesh Raman},
editor = {Fedor V. Fomin and
Vladimir V. Podolskii},
title = {Structural Parameterizations of Dominating Set Variants},
booktitle = {Computer Science - Theory and Applications - 13th International Computer
Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10846},
pages = {157--168},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90530-3\_14},
doi = {10.1007/978-3-319-90530-3\_14},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/GoyalJKM018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Chakraborty00S18,
author = {Sankardeep Chakraborty and
Anish Mukherjee and
Venkatesh Raman and
Srinivasa Rao Satti},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {A Framework for In-place Graph Algorithms},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {13:1--13:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.13},
doi = {10.4230/LIPICS.ESA.2018.13},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/Chakraborty00S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/AroraBP018,
author = {Pranav Arora and
Aritra Banik and
Vijay Kumar Paliwal and
Venkatesh Raman},
editor = {Jianer Chen and
Pinyan Lu},
title = {Some (in)tractable Parameterizations of Coloring and List-Coloring},
booktitle = {Frontiers in Algorithmics - 12th International Workshop, {FAW} 2018,
Guangzhou, China, May 8-10, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10823},
pages = {126--139},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-78455-7\_10},
doi = {10.1007/978-3-319-78455-7\_10},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/AroraBP018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BanikCL0018,
author = {Aritra Banik and
Pratibha Choudhary and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {A Polynomial Sized Kernel for Tracking Paths Problem},
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 = {94--107},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_8},
doi = {10.1007/978-3-319-77404-6\_8},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BanikCL0018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04560,
author = {Diptapriyo Majumdar and
Rian Neogi and
Venkatesh Raman and
S. Vaishali},
title = {Tractability of Konig Edge Deletion Problems},
journal = {CoRR},
volume = {abs/1811.04560},
year = {2018},
url = {http://arxiv.org/abs/1811.04560},
eprinttype = {arXiv},
eprint = {1811.04560},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04560.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MouawadN0SS17,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman and
Narges Simjour and
Akira Suzuki},
title = {On the Parameterized Complexity of Reconfiguration Problems},
journal = {Algorithmica},
volume = {78},
number = {1},
pages = {274--297},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0159-2},
doi = {10.1007/S00453-016-0159-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MouawadN0SS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/El-ZeinLMRC17,
author = {Hicham El{-}Zein and
Moshe Lewenstein and
J. Ian Munro and
Venkatesh Raman and
Timothy M. Chan},
title = {On the Succinct Representation of Equivalence Classes},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {1020--1040},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0192-1},
doi = {10.1007/S00453-016-0192-1},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/El-ZeinLMRC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChakrabortyRS17,
author = {Sankardeep Chakraborty and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Biconnectivity, st-numbering and other applications of {DFS} using
O(n) bits},
journal = {J. Comput. Syst. Sci.},
volume = {90},
pages = {63--79},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2017.06.006},
doi = {10.1016/J.JCSS.2017.06.006},
timestamp = {Mon, 18 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ChakrabortyRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MouawadNPR17,
author = {Amer E. Mouawad and
Naomi Nishimura and
Vinayak Pathak and
Venkatesh Raman},
title = {Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {3},
pages = {2185--2200},
year = {2017},
url = {https://doi.org/10.1137/16M1065288},
doi = {10.1137/16M1065288},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MouawadNPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JayapaulMRR17,
author = {Varunkumar Jayapaul and
J. Ian Munro and
Venkatesh Raman and
S. Srinivasa Rao},
title = {Finding modes with equality comparisons},
journal = {Theor. Comput. Sci.},
volume = {704},
pages = {28--41},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.09.007},
doi = {10.1016/J.TCS.2017.09.007},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/JayapaulMRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/BiswasJ017,
author = {Arindam Biswas and
Varunkumar Jayapaul and
Venkatesh Raman},
editor = {Daya Ram Gaur and
N. S. Narayanaswamy},
title = {Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime},
booktitle = {Algorithms and Discrete Applied Mathematics - Third International
Conference, {CALDAM} 2017, Sancoale, Goa, India, February 16-18, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10156},
pages = {50--59},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53007-9\_5},
doi = {10.1007/978-3-319-53007-9\_5},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/BiswasJ017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/GoyalJ017,
author = {Dishant Goyal and
Varunkumar Jayapaul and
Venkatesh Raman},
editor = {Daya Ram Gaur and
N. S. Narayanaswamy},
title = {Elusiveness of Finding Degrees},
booktitle = {Algorithms and Discrete Applied Mathematics - Third International
Conference, {CALDAM} 2017, Sancoale, Goa, India, February 16-18, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10156},
pages = {242--253},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53007-9\_22},
doi = {10.1007/978-3-319-53007-9\_22},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/caldam/GoyalJ017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/MajumdarN0T17,
author = {Diptapriyo Majumdar and
Rian Neogi and
Venkatesh Raman and
Prafullkumar Tale},
editor = {Daya Ram Gaur and
N. S. Narayanaswamy},
title = {Exact and Parameterized Algorithms for (k, i)-Coloring},
booktitle = {Algorithms and Discrete Applied Mathematics - Third International
Conference, {CALDAM} 2017, Sancoale, Goa, India, February 16-18, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10156},
pages = {281--293},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53007-9\_25},
doi = {10.1007/978-3-319-53007-9\_25},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/caldam/MajumdarN0T17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/BiswasJ0S17,
author = {Arindam Biswas and
Varunkumar Jayapaul and
Venkatesh Raman and
Srinivasa Rao Satti},
editor = {Mingyu Xiao and
Frances A. Rosamond},
title = {The Complexity of Finding (Approximate Sized) Distance-d Dominating
Set in Tournaments},
booktitle = {Frontiers in Algorithmics - 11th International Workshop, {FAW} 2017,
Chengdu, China, June 23-25, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10336},
pages = {22--33},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59605-1\_3},
doi = {10.1007/978-3-319-59605-1\_3},
timestamp = {Mon, 08 Jan 2024 16:42:23 +0100},
biburl = {https://dblp.org/rec/conf/faw/BiswasJ0S17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/Majumdar017,
author = {Diptapriyo Majumdar and
Venkatesh Raman},
editor = {Mingyu Xiao and
Frances A. Rosamond},
title = {{FPT} Algorithms for {FVS} Parameterized by Split and Cluster Vertex
Deletion Sets and Other Parameters},
booktitle = {Frontiers in Algorithmics - 11th International Workshop, {FAW} 2017,
Chengdu, China, June 23-25, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10336},
pages = {209--220},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59605-1\_19},
doi = {10.1007/978-3-319-59605-1\_19},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/faw/Majumdar017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BanikP0SS17,
author = {Aritra Banik and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot and
Saket Saurabh},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Parameterized Complexity of Geometric Covering Problems Having Conflicts},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {61--72},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_6},
doi = {10.1007/978-3-319-62127-2\_6},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BanikP0SS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-07872,
author = {R. Krithika and
Diptapriyo Majumdar and
Venkatesh Raman},
title = {Revisiting Connected Vertex Cover: {FPT} Algorithms and Lossy Kernels},
journal = {CoRR},
volume = {abs/1711.07872},
year = {2017},
url = {http://arxiv.org/abs/1711.07872},
eprinttype = {arXiv},
eprint = {1711.07872},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-07872.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-09859,
author = {Sankardeep Chakraborty and
Anish Mukherjee and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Frameworks for Designing In-place Graph Algorithms},
journal = {CoRR},
volume = {abs/1711.09859},
year = {2017},
url = {http://arxiv.org/abs/1711.09859},
eprinttype = {arXiv},
eprint = {1711.09859},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-09859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JayapaulJRRS16,
author = {Varunkumar Jayapaul and
Seungbum Jo and
Rajeev Raman and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Space efficient data structures for nearest larger neighbor},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {63--75},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.01.001},
doi = {10.1016/J.JDA.2016.01.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JayapaulJRRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BanerjeeC016,
author = {Niranka Banerjee and
Sankardeep Chakraborty and
Venkatesh Raman},
editor = {Thang N. Dinh and
My T. Thai},
title = {Improved Space Efficient Algorithms for BFS, {DFS} and Applications},
booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}
2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9797},
pages = {119--130},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-42634-1\_10},
doi = {10.1007/978-3-319-42634-1\_10},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BanerjeeC016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BanikP0S16,
author = {Aritra Banik and
Fahad Panolan and
Venkatesh Raman and
Vibha Sahlot},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {Fr{\'{e}}chet Distance Between a Line and Avatar Point Set},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {32:1--32:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.32},
doi = {10.4230/LIPICS.FSTTCS.2016.32},
timestamp = {Tue, 30 Nov 2021 13:29:05 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BanikP0S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Chakraborty0S16,
author = {Sankardeep Chakraborty and
Venkatesh Raman and
Srinivasa Rao Satti},
editor = {Seok{-}Hee Hong},
title = {Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {22:1--22:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.22},
doi = {10.4230/LIPICS.ISAAC.2016.22},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Chakraborty0S16.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/walcom/JayapaulRS16,
author = {Varunkumar Jayapaul and
Venkatesh Raman and
Srinivasa Rao Satti},
editor = {Mohammad Kaykobad and
Rossella Petreschi},
title = {Finding Mode Using Equality Comparisons},
booktitle = {{WALCOM:} Algorithms and Computation - 10th International Workshop,
{WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9627},
pages = {351--360},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30139-6\_28},
doi = {10.1007/978-3-319-30139-6\_28},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/JayapaulRS16.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/corr/BanerjeeC016,
author = {Niranka Banerjee and
Sankardeep Chakraborty and
Venkatesh Raman},
title = {Improved Space efficient algorithms for BFS, {DFS} and applications},
journal = {CoRR},
volume = {abs/1606.04718},
year = {2016},
url = {http://arxiv.org/abs/1606.04718},
eprinttype = {arXiv},
eprint = {1606.04718},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BanerjeeC016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Chakraborty0S16,
author = {Sankardeep Chakraborty and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Biconnectivity, chain decomposition and {\textdollar}st{\textdollar}-numbering
using {\textdollar}O(n){\textdollar} bits},
journal = {CoRR},
volume = {abs/1606.08645},
year = {2016},
url = {http://arxiv.org/abs/1606.08645},
eprinttype = {arXiv},
eprint = {1606.08645},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Chakraborty0S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChanMR15,
author = {Timothy M. Chan and
J. Ian Munro and
Venkatesh Raman},
title = {Finding median in read-only memory on integer input},
journal = {Theor. Comput. Sci.},
volume = {583},
pages = {51--56},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.03.042},
doi = {10.1016/J.TCS.2015.03.042},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChanMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BanerjeeCRRS15,
author = {Niranka Banerjee and
Sankardeep Chakraborty and
Venkatesh Raman and
Sasanka Roy and
Saket Saurabh},
editor = {Dachuan Xu and
Donglei Du and
Ding{-}Zhu Du},
title = {Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and
Bounded Treewidth Graphs},
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 = {349--360},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21398-9\_28},
doi = {10.1007/978-3-319-21398-9\_28},
timestamp = {Sun, 25 Oct 2020 22:58:52 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BanerjeeCRRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MouawadNPR15,
author = {Amer E. Mouawad and
Naomi Nishimura and
Vinayak Pathak and
Venkatesh Raman},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {985--996},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_80},
doi = {10.1007/978-3-662-47672-7\_80},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/MouawadNPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MajumdarRS15,
author = {Diptapriyo Majumdar and
Venkatesh Raman and
Saket Saurabh},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Kernels for Structural Parameterizations of Vertex Cover - Case of
Small Degree Modulators},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {331--342},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.331},
doi = {10.4230/LIPICS.IPEC.2015.331},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/MajumdarRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/splc/LiangGCR15,
author = {Jia Hui (Jimmy) Liang and
Vijay Ganesh and
Krzysztof Czarnecki and
Venkatesh Raman},
editor = {Douglas C. Schmidt},
title = {SAT-based analysis of large real-world feature models is easy},
booktitle = {Proceedings of the 19th International Conference on Software Product
Line, {SPLC} 2015, Nashville, TN, USA, July 20-24, 2015},
pages = {91--100},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2791060.2791070},
doi = {10.1145/2791060.2791070},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/splc/LiangGCR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/JayapaulMRS15,
author = {Varunkumar Jayapaul and
J. Ian Munro and
Venkatesh Raman and
Srinivasa Rao Satti},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Sorting and Selection with Equality Comparisons},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {434--445},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_36},
doi = {10.1007/978-3-319-21840-3\_36},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/JayapaulMRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LiangGRC15,
author = {Jia Hui (Jimmy) Liang and
Vijay Ganesh and
Venkatesh Raman and
Krzysztof Czarnecki},
title = {SAT-based Analysis of Large Real-world Feature Models is Easy},
journal = {CoRR},
volume = {abs/1506.05198},
year = {2015},
url = {http://arxiv.org/abs/1506.05198},
eprinttype = {arXiv},
eprint = {1506.05198},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/LiangGRC15.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}
}
@article{DBLP:journals/algorithmica/MisraPRS14,
author = {Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh},
title = {The Kernelization Complexity of Connected Domination in Graphs with
(no) Small Cycles},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {504--530},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9681-z},
doi = {10.1007/S00453-012-9681-Z},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MisraPRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CrowstonGJRSY14,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Venkatesh Raman and
Saket Saurabh and
Anders Yeo},
title = {Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {739--757},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9697-4},
doi = {10.1007/S00453-012-9697-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CrowstonGJRSY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LokshtanovNRRS14,
author = {Daniel Lokshtanov and
N. S. Narayanaswamy and
Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
title = {Faster Parameterized Algorithms Using Linear Programming},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {2},
pages = {15:1--15:31},
year = {2014},
url = {https://doi.org/10.1145/2566616},
doi = {10.1145/2566616},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/LokshtanovNRRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/SrihariRLR14,
author = {Sriganesh Srihari and
Venkatesh Raman and
Hon Wai Leong and
Mark A. Ragan},
title = {Evolution and Controllability of CancerNetworks: {A} Boolean Perspective},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {11},
number = {1},
pages = {83--94},
year = {2014},
url = {https://doi.org/10.1109/TCBB.2013.128},
doi = {10.1109/TCBB.2013.128},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/SrihariRLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LewensteinMRT14,
author = {Moshe Lewenstein and
J. Ian Munro and
Venkatesh Raman and
Sharma V. Thankachan},
title = {Less space: Indexing for queries with wildcards},
journal = {Theor. Comput. Sci.},
volume = {557},
pages = {120--127},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.09.003},
doi = {10.1016/J.TCS.2014.09.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LewensteinMRT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/KratschPRR14,
author = {Stefan Kratsch and
Marcin Pilipczuk and
Ashutosh Rai and
Venkatesh Raman},
title = {Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary
Subgraphs},
journal = {{ACM} Trans. Comput. Theory},
volume = {7},
number = {1},
pages = {4:1--4:18},
year = {2014},
url = {https://doi.org/10.1145/2691321},
doi = {10.1145/2691321},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/KratschPRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FioriniKNR14,
author = {Samuel Fiorini and
R. Krithika and
N. S. Narayanaswamy and
Venkatesh Raman},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {{LP} Approaches to Improved Approximation for Clique Transversal in
Perfect Graphs},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {430--442},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_36},
doi = {10.1007/978-3-662-44777-2\_36},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/FioriniKNR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/LewensteinMNR14,
author = {Moshe Lewenstein and
J. Ian Munro and
Patrick K. Nicholson and
Venkatesh Raman},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {Improved Explicit Data Structures in the Bitprobe Model},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {630--641},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_52},
doi = {10.1007/978-3-662-44777-2\_52},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/LewensteinMNR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MouawadNR14,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Vertex Cover Reconfiguration and Beyond},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {452--463},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_36},
doi = {10.1007/978-3-319-13075-0\_36},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MouawadNR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/El-ZeinMR14,
author = {Hicham El{-}Zein and
J. Ian Munro and
Venkatesh Raman},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Tradeoff Between Label Space and Auxiliary Space for Representation
of Equivalence Classes},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {543--552},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_43},
doi = {10.1007/978-3-319-13075-0\_43},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/El-ZeinMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/JayapaulJRS14,
author = {Varunkumar Jayapaul and
Seungbum Jo and
Venkatesh Raman and
Srinivasa Rao Satti},
editor = {Jan Kratochv{\'{\i}}l and
Mirka Miller and
Dalibor Froncek},
title = {Space Efficient Data Structures for Nearest Larger Neighbor},
booktitle = {Combinatorial Algorithms - 25th International Workshop, {IWOCA} 2014,
Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8986},
pages = {176--187},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-19315-1\_16},
doi = {10.1007/978-3-319-19315-1\_16},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/JayapaulJRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BonsmaMNR14,
author = {Paul S. Bonsma and
Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman},
editor = {Marek Cygan and
Pinar Heggernes},
title = {The Complexity of Bounded Length Graph Recoloring and {CSP} Reconfiguration},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {110--121},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_10},
doi = {10.1007/978-3-319-13524-3\_10},
timestamp = {Sat, 19 Oct 2019 20:25:35 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BonsmaMNR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MouawadNRW14,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman and
Marcin Wrochna},
editor = {Marek Cygan and
Pinar Heggernes},
title = {Reconfiguration over Tree Decompositions},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {246--257},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_21},
doi = {10.1007/978-3-319-13524-3\_21},
timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/MouawadNRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChanMR14,
author = {Timothy M. Chan and
J. Ian Munro and
Venkatesh Raman},
editor = {Chandra Chekuri},
title = {Selection and Sorting in the "Restore" Model},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {995--1004},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.74},
doi = {10.1137/1.9781611973402.74},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChanMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2014,
editor = {Venkatesh Raman and
S. P. Suresh},
title = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {http://www.dagstuhl.de/dagpub/978-3-939897-77-4},
isbn = {978-3-939897-77-4},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MouawadNR14,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman},
title = {Vertex Cover Reconfiguration and Beyond},
journal = {CoRR},
volume = {abs/1402.4926},
year = {2014},
url = {http://arxiv.org/abs/1402.4926},
eprinttype = {arXiv},
eprint = {1402.4926},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MouawadNR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MouawadNPR14,
author = {Amer E. Mouawad and
Naomi Nishimura and
Vinayak Pathak and
Venkatesh Raman},
title = {Shortest reconfiguration paths in the solution space of Boolean formulas},
journal = {CoRR},
volume = {abs/1404.3801},
year = {2014},
url = {http://arxiv.org/abs/1404.3801},
eprinttype = {arXiv},
eprint = {1404.3801},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MouawadNPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MouawadNRW14,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman and
Marcin Wrochna},
title = {Reconfiguration over tree decompositions},
journal = {CoRR},
volume = {abs/1405.2447},
year = {2014},
url = {http://arxiv.org/abs/1405.2447},
eprinttype = {arXiv},
eprint = {1405.2447},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MouawadNRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MisraMRSS13,
author = {Neeldhara Misra and
Hannes Moser and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
title = {The Parameterized Complexity of Unique Coverage and Its Variants},
journal = {Algorithmica},
volume = {65},
number = {3},
pages = {517--544},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9608-0},
doi = {10.1007/S00453-011-9608-0},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MisraMRSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RamanS13,
author = {Venkatesh Raman and
Saket Saurabh},
title = {Guest Editorial: Special Issue on Parameterized and Exact Computation,
Part {II}},
journal = {Algorithmica},
volume = {65},
number = {4},
pages = {711--712},
year = {2013},
url = {https://doi.org/10.1007/s00453-013-9744-9},
doi = {10.1007/S00453-013-9744-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RamanS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HeggernesKLRS13,
author = {Pinar Heggernes and
Dieter Kratsch and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle
Stabbing via iterative localization},
journal = {Inf. Comput.},
volume = {231},
pages = {109--116},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2013.08.007},
doi = {10.1016/J.IC.2013.08.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HeggernesKLRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DornFLRS13,
author = {Frederic Dorn and
Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {Beyond bidimensionality: Parameterized subexponential algorithms on
directed graphs},
journal = {Inf. Comput.},
volume = {233},
pages = {60--70},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2013.11.006},
doi = {10.1016/J.IC.2013.11.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DornFLRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RamanSS13,
author = {Venkatesh Raman and
Saket Saurabh and
Ondrej Such{\'{y}}},
title = {An {FPT} algorithm for Tree Deletion Set},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {6},
pages = {615--628},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00308},
doi = {10.7155/JGAA.00308},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RamanSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MisraRRS13,
author = {Pranabendu Misra and
Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
title = {A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments},
journal = {Theory Comput. Syst.},
volume = {53},
number = {4},
pages = {609--620},
year = {2013},
url = {https://doi.org/10.1007/s00224-013-9453-4},
doi = {10.1007/S00224-013-9453-4},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/MisraRRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MisraNRS13,
author = {Neeldhara Misra and
N. S. Narayanaswamy and
Venkatesh Raman and
Bal Sri Shankar},
title = {Solving min ones 2-sat as fast as vertex cover},
journal = {Theor. Comput. Sci.},
volume = {506},
pages = {115--121},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.07.019},
doi = {10.1016/J.TCS.2013.07.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MisraNRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrowstonGJRS13,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Venkatesh Raman and
Saket Saurabh},
title = {Parameterized complexity of MaxSat Above Average},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {77--84},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.01.005},
doi = {10.1016/J.TCS.2013.01.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrowstonGJRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/NicholsonR013,
author = {Patrick K. Nicholson and
Venkatesh Raman and
S. Srinivasa Rao},
editor = {Andrej Brodnik and
Alejandro L{\'{o}}pez{-}Ortiz and
Venkatesh Raman and
Alfredo Viola},
title = {A Survey of Data Structures in the Bitprobe Model},
booktitle = {Space-Efficient Data Structures, Streams, and Algorithms - Papers
in Honor of J. Ian Munro on the Occasion of His 66th Birthday},
series = {Lecture Notes in Computer Science},
volume = {8066},
pages = {303--318},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40273-9\_19},
doi = {10.1007/978-3-642-40273-9\_19},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/NicholsonR013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LewensteinMRT13,
author = {Moshe Lewenstein and
J. Ian Munro and
Venkatesh Raman and
Sharma V. Thankachan},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Less Space: Indexing for Queries with Wildcards},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {89--99},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_9},
doi = {10.1007/978-3-642-45030-3\_9},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LewensteinMRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChanMR13,
author = {Timothy M. Chan and
J. Ian Munro and
Venkatesh Raman},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Faster, Space-Efficient Selection Algorithms in Read-Only Memory for
Integers},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {405--412},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_38},
doi = {10.1007/978-3-642-45030-3\_38},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChanMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LewensteinMR13,
author = {Moshe Lewenstein and
J. Ian Munro and
Venkatesh Raman},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Succinct Data Structures for Representing Equivalence Classes},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {502--512},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_47},
doi = {10.1007/978-3-642-45030-3\_47},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LewensteinMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MouawadNRSS13,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman and
Narges Simjour and
Akira Suzuki},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {On the Parameterized Complexity of Reconfiguration Problems},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {281--294},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_24},
doi = {10.1007/978-3-319-03898-8\_24},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/MouawadNRSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/MisraORS13,
author = {Neeldhara Misra and
Sebastian Ordyniak and
Venkatesh Raman and
Stefan Szeider},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {Upper and Lower Bounds for Weak Backdoor Set Detection},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {394--402},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_29},
doi = {10.1007/978-3-642-39071-5\_29},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/MisraORS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/RamanS13,
author = {Venkatesh Raman and
Bal Sri Shankar},
editor = {Subir Kumar Ghosh and
Takeshi Tokuyama},
title = {Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem},
booktitle = {{WALCOM:} Algorithms and Computation, 7th International Workshop,
{WALCOM} 2013, Kharagpur, India, February 14-16, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7748},
pages = {265--273},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36065-7\_25},
doi = {10.1007/978-3-642-36065-7\_25},
timestamp = {Sat, 30 Sep 2023 09:58:46 +0200},
biburl = {https://dblp.org/rec/conf/walcom/RamanS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/RamanSS13,
author = {Venkatesh Raman and
Saket Saurabh and
Ondrej Such{\'{y}}},
editor = {Subir Kumar Ghosh and
Takeshi Tokuyama},
title = {An {FPT} Algorithm for Tree Deletion Set},
booktitle = {{WALCOM:} Algorithms and Computation, 7th International Workshop,
{WALCOM} 2013, Kharagpur, India, February 14-16, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7748},
pages = {286--297},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36065-7\_27},
doi = {10.1007/978-3-642-36065-7\_27},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/RamanSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MisraPRRS13,
author = {Neeldhara Misra and
Fahad Panolan and
Ashutosh Rai and
Venkatesh Raman and
Saket Saurabh},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Parameterized Algorithms for Max Colorable Induced Subgraph Problem
on Perfect Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {370--381},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_32},
doi = {10.1007/978-3-642-45043-3\_32},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/MisraPRRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/birthday/2013munro,
editor = {Andrej Brodnik and
Alejandro L{\'{o}}pez{-}Ortiz and
Venkatesh Raman and
Alfredo Viola},
title = {Space-Efficient Data Structures, Streams, and Algorithms - Papers
in Honor of J. Ian Munro on the Occasion of His 66th Birthday},
series = {Lecture Notes in Computer Science},
volume = {8066},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40273-9},
doi = {10.1007/978-3-642-40273-9},
isbn = {978-3-642-40272-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/2013munro.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5518,
author = {Neeldhara Misra and
Sebastian Ordyniak and
Venkatesh Raman and
Stefan Szeider},
title = {Upper and Lower Bounds for Weak Backdoor Set Detection},
journal = {CoRR},
volume = {abs/1304.5518},
year = {2013},
url = {http://arxiv.org/abs/1304.5518},
eprinttype = {arXiv},
eprint = {1304.5518},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LewensteinMR13,
author = {Moshe Lewenstein and
J. Ian Munro and
Venkatesh Raman},
title = {Succinct data structures for representing equivalence classes},
journal = {CoRR},
volume = {abs/1306.4287},
year = {2013},
url = {http://arxiv.org/abs/1306.4287},
eprinttype = {arXiv},
eprint = {1306.4287},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LewensteinMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MouawadNRSS13,
author = {Amer E. Mouawad and
Naomi Nishimura and
Venkatesh Raman and
Narges Simjour and
Akira Suzuki},
title = {On the Parameterized Complexity of Reconfiguration Problems},
journal = {CoRR},
volume = {abs/1308.2409},
year = {2013},
url = {http://arxiv.org/abs/1308.2409},
eprinttype = {arXiv},
eprint = {1308.2409},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MouawadNRSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RamanS12,
author = {Venkatesh Raman and
Saket Saurabh},
title = {Guest Editorial: Special Issue on Parameterized and Exact Computation,
Part {I}},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {1--2},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9605-3},
doi = {10.1007/S00453-011-9605-3},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RamanS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MisraPRSS12,
author = {Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
title = {{FPT} algorithms for Connected Feedback Vertex Set},
journal = {J. Comb. Optim.},
volume = {24},
number = {2},
pages = {131--146},
year = {2012},
url = {https://doi.org/10.1007/s10878-011-9394-2},
doi = {10.1007/S10878-011-9394-2},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MisraPRSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FominLRSR12,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh and
B. V. Raghavendra Rao},
title = {Faster algorithms for finding and counting subgraphs},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {3},
pages = {698--706},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.10.001},
doi = {10.1016/J.JCSS.2011.10.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FominLRSR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuptaRS12,
author = {Sushmita Gupta and
Venkatesh Raman and
Saket Saurabh},
title = {Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms
and Combinatorial Bounds},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {4},
pages = {1758--1780},
year = {2012},
url = {https://doi.org/10.1137/09077850X},
doi = {10.1137/09077850X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuptaRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PhilipRS12,
author = {Geevarghese Philip and
Venkatesh Raman and
Somnath Sikdar},
title = {Polynomial kernels for dominating set in graphs of bounded degeneracy
and beyond},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {1},
pages = {11:1--11:23},
year = {2012},
url = {https://doi.org/10.1145/2390176.2390187},
doi = {10.1145/2390176.2390187},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/PhilipRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MunroRRR12,
author = {J. Ian Munro and
Rajeev Raman and
Venkatesh Raman and
S. Srinivasa Rao},
title = {Succinct representations of permutations and functions},
journal = {Theor. Comput. Sci.},
volume = {438},
pages = {74--88},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.03.005},
doi = {10.1016/J.TCS.2012.03.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MunroRRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MisraPRS12,
author = {Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh},
title = {On Parameterized Independent Feedback Vertex Set},
journal = {Theor. Comput. Sci.},
volume = {461},
pages = {65--75},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.02.012},
doi = {10.1016/J.TCS.2012.02.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MisraPRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Raman12,
author = {Venkatesh Raman},
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {Vertex Cover, Dominating Set and My Encounters with Parameterized
Complexity and Mike Fellows},
booktitle = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
pages = {69--73},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8\_6},
doi = {10.1007/978-3-642-30891-8\_6},
timestamp = {Mon, 03 Jan 2022 22:35:50 +0100},
biburl = {https://dblp.org/rec/conf/birthday/Raman12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CrowstonGJRS12,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Venkatesh Raman and
Saket Saurabh},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Parameterized Complexity of MaxSat above Average},
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 = {184--194},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_16},
doi = {10.1007/978-3-642-29344-3\_16},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/CrowstonGJRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/CrowstonGJRSY12,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Venkatesh Raman and
Saket Saurabh and
Anders Yeo},
editor = {Alessandro Cimatti and
Roberto Sebastiani},
title = {Fixed-Parameter Tractability of Satisfying beyond the Number of Variables},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2012 - 15th
International Conference, Trento, Italy, June 17-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7317},
pages = {355--368},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31612-8\_27},
doi = {10.1007/978-3-642-31612-8\_27},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/CrowstonGJRSY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NarayanaswamyRRS12,
author = {N. S. Narayanaswamy and
Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {{LP} can be a cure for Parameterized Problems},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {338--349},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.338},
doi = {10.4230/LIPICS.STACS.2012.338},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/NarayanaswamyRRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KratschPRR12,
author = {Stefan Kratsch and
Marcin Pilipczuk and
Ashutosh Rai and
Venkatesh Raman},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary
Subgraphs},
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 = {364--375},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_32},
doi = {10.1007/978-3-642-31155-0\_32},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KratschPRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MisraRRS12,
author = {Pranabendu Misra and
Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Parameterized Algorithms for Even Cycle Transversal},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {172--183},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_19},
doi = {10.1007/978-3-642-34611-8\_19},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/MisraRRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-0833,
author = {Daniel Lokshtanov and
N. S. Narayanaswamy and
Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
title = {Faster Parameterized Algorithms using Linear Programming},
journal = {CoRR},
volume = {abs/1203.0833},
year = {2012},
url = {http://arxiv.org/abs/1203.0833},
eprinttype = {arXiv},
eprint = {1203.0833},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-0833.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-0106,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Venkatesh Raman and
Saket Saurabh and
Anders Yeo},
title = {Fixed-parameter tractability of satisfying beyond the number of variables},
journal = {CoRR},
volume = {abs/1212.0106},
year = {2012},
url = {http://arxiv.org/abs/1212.0106},
eprinttype = {arXiv},
eprint = {1212.0106},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-0106.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MishraRSSS11,
author = {Sounaka Mishra and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar and
C. R. Subramanian},
title = {The Complexity of K{\"{o}}nig Subgraph Problems and Above-Guarantee
Vertex Cover},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {857--881},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9412-2},
doi = {10.1007/S00453-010-9412-2},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MishraRSSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LokshtanovRSS11,
author = {Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
title = {On the directed Full Degree Spanning Tree problem},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {97--109},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.09.001},
doi = {10.1016/J.DISOPT.2010.09.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LokshtanovRSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/MisraRS11,
author = {Neeldhara Misra and
Venkatesh Raman and
Saket Saurabh},
title = {Lower bounds on kernelization},
journal = {Discret. Optim.},
volume = {8},
number = {1},
pages = {110--128},
year = {2011},
url = {https://doi.org/10.1016/j.disopt.2010.10.001},
doi = {10.1016/J.DISOPT.2010.10.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/MisraRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominLRS11,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {Subexponential algorithms for partial cover problems},
journal = {Inf. Process. Lett.},
volume = {111},
number = {16},
pages = {814--818},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.05.016},
doi = {10.1016/J.IPL.2011.05.016},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FominLRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/MisraPRS11,
author = {Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh},
editor = {Bin Fu and
Ding{-}Zhu Du},
title = {On Parameterized Independent Feedback Vertex Set},
booktitle = {Computing and Combinatorics - 17th Annual International Conference,
{COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6842},
pages = {98--109},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_9},
doi = {10.1007/978-3-642-22685-4\_9},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/MisraPRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/RamanRS11,
author = {Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Paths, Flowers and Vertex Cover},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {382--393},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_33},
doi = {10.1007/978-3-642-23719-5\_33},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/RamanRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MisraRRS11,
author = {Pranabendu Misra and
Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {333--343},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_35},
doi = {10.1007/978-3-642-25591-5\_35},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/MisraRRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FominLRS11,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
editor = {Dana Randall},
title = {Bidimensionality and {EPTAS}},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {748--759},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.59},
doi = {10.1137/1.9781611973082.59},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/FominLRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-1983,
author = {J. Ian Munro and
Rajeev Raman and
Venkatesh Raman and
S. Srinivasa Rao},
title = {Succinct Representations of Permutations and Functions},
journal = {CoRR},
volume = {abs/1108.1983},
year = {2011},
url = {http://arxiv.org/abs/1108.1983},
eprinttype = {arXiv},
eprint = {1108.1983},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-1983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-4501,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Venkatesh Raman and
Saket Saurabh},
title = {Parameterized Complexity of MaxSat Above Average},
journal = {CoRR},
volume = {abs/1108.4501},
year = {2011},
url = {http://arxiv.org/abs/1108.4501},
eprinttype = {arXiv},
eprint = {1108.4501},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-4501.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FominLRS10,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
editor = {Maria Fox and
David Poole},
title = {Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments},
booktitle = {Proceedings of the Twenty-Fourth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2010, Atlanta, Georgia, USA, July 11-15, 2010},
pages = {65--70},
publisher = {{AAAI} Press},
year = {2010},
url = {https://doi.org/10.1609/aaai.v24i1.7557},
doi = {10.1609/AAAI.V24I1.7557},
timestamp = {Mon, 04 Sep 2023 16:23:45 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FominLRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MisraPRS10,
author = {Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {The effect of girth on the kernelization complexity of Connected Dominating
Set},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2010, December 15-18, 2010,
Chennai, India},
series = {LIPIcs},
volume = {8},
pages = {96--107},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.96},
doi = {10.4230/LIPICS.FSTTCS.2010.96},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/MisraPRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MisraNRS10,
author = {Neeldhara Misra and
N. S. Narayanaswamy and
Venkatesh Raman and
Bal Sri Shankar},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Solving minones-2-sat as Fast as vertex cover},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {549--555},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_48},
doi = {10.1007/978-3-642-15155-2\_48},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MisraNRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DornFLRS10,
author = {Frederic Dorn and
Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Beyond Bidimensionality: Parameterized Subexponential Algorithms on
Directed Graphs},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {251--262},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2459},
doi = {10.4230/LIPICS.STACS.2010.2459},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DornFLRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HeggernesKLRS10,
author = {Pinar Heggernes and
Dieter Kratsch and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
editor = {Haim Kaplan},
title = {Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle
Stabbing},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {334--345},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_32},
doi = {10.1007/978-3-642-13731-0\_32},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/HeggernesKLRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/MisraPRSS10,
author = {Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
editor = {Md. Saidur Rahman and
Satoshi Fujita},
title = {{FPT} Algorithms for Connected Feedback Vertex Set},
booktitle = {{WALCOM:} Algorithms and Computation, 4th International Workshop,
{WALCOM} 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5942},
pages = {269--280},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11440-3\_25},
doi = {10.1007/978-3-642-11440-3\_25},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/MisraPRSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/PhilipRV10,
author = {Geevarghese Philip and
Venkatesh Raman and
Yngve Villanger},
editor = {Dimitrios M. Thilikos},
title = {A Quartic Kernel for Pathwidth-One Vertex Deletion},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {196--207},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_19},
doi = {10.1007/978-3-642-16926-7\_19},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/PhilipRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2010,
editor = {Venkatesh Raman and
Saket Saurabh},
title = {Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6478},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17493-3},
doi = {10.1007/978-3-642-17493-3},
isbn = {978-3-642-17492-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-0821,
author = {Frederic Dorn and
Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {Beyond Bidimensionality: Parameterized Subexponential Algorithms on
Directed Graphs},
journal = {CoRR},
volume = {abs/1001.0821},
year = {2010},
url = {http://arxiv.org/abs/1001.0821},
eprinttype = {arXiv},
eprint = {1001.0821},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-0821.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-5449,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {Bidimensionality and {EPTAS}},
journal = {CoRR},
volume = {abs/1005.5449},
year = {2010},
url = {http://arxiv.org/abs/1005.5449},
eprinttype = {arXiv},
eprint = {1005.5449},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-5449.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0806,
author = {Geevarghese Philip and
Venkatesh Raman and
Yngve Villanger},
title = {A Quartic Kernel for Pathwidth-One Vertex Deletion},
journal = {CoRR},
volume = {abs/1009.0806},
year = {2010},
url = {http://arxiv.org/abs/1009.0806},
eprinttype = {arXiv},
eprint = {1009.0806},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-0806.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MahajanRS09,
author = {Meena Mahajan and
Venkatesh Raman and
Somnath Sikdar},
title = {Parameterizing above or below guaranteed values},
journal = {J. Comput. Syst. Sci.},
volume = {75},
number = {2},
pages = {137--153},
year = {2009},
url = {https://doi.org/10.1016/j.jcss.2008.08.004},
doi = {10.1016/J.JCSS.2008.08.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MahajanRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/MisraRSS09,
author = {Neeldhara Misra and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
editor = {Anna E. Frid and
Andrey Morozov and
Andrey Rybalchenko and
Klaus W. Wagner},
title = {The Budgeted Unique Coverage Problem and Color-Coding},
booktitle = {Computer Science - Theory and Applications, Fourth International Computer
Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
18-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5675},
pages = {310--321},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03351-3\_29},
doi = {10.1007/978-3-642-03351-3\_29},
timestamp = {Mon, 01 Mar 2021 13:46:21 +0100},
biburl = {https://dblp.org/rec/conf/csr/MisraRSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PhilipRS09,
author = {Geevarghese Philip and
Venkatesh Raman and
Somnath Sikdar},
editor = {Amos Fiat and
Peter Sanders},
title = {Solving Dominating Set in Larger Classes of Graphs: {FPT} Algorithms
and Polynomial Kernels},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {694--705},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_62},
doi = {10.1007/978-3-642-04128-0\_62},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/PhilipRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FominLRS09,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
editor = {Ravi Kannan and
K. Narayan Kumar},
title = {Subexponential Algorithms for Partial Cover Problems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
{IIT} Kanpur, India},
series = {LIPIcs},
volume = {4},
pages = {193--201},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2318},
doi = {10.4230/LIPICS.FSTTCS.2009.2318},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/FominLRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/LokshtanovRSS09,
author = {Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {On the Directed Degree-Preserving Spanning Tree Problem},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {276--287},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_23},
doi = {10.1007/978-3-642-11269-0\_23},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/LokshtanovRSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-4521,
author = {Geevarghese Philip and
Venkatesh Raman and
Somnath Sikdar},
title = {Polynomial Kernels for Dominating Set in K\({}_{\mbox{i,j}}\)-free
and d-degenerate Graphs},
journal = {CoRR},
volume = {abs/0903.4521},
year = {2009},
url = {http://arxiv.org/abs/0903.4521},
eprinttype = {arXiv},
eprint = {0903.4521},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-4521.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-3180,
author = {Neeldhara Misra and
Geevarghese Philip and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
title = {{FPT} Algorithms for Connected Feedback Vertex Set},
journal = {CoRR},
volume = {abs/0909.3180},
year = {2009},
url = {http://arxiv.org/abs/0909.3180},
eprinttype = {arXiv},
eprint = {0909.3180},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-3180.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-2371,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Venkatesh Raman and
B. V. Raghavendra Rao and
Saket Saurabh},
title = {Faster Algorithms for Finding and Counting Subgraphs},
journal = {CoRR},
volume = {abs/0912.2371},
year = {2009},
url = {http://arxiv.org/abs/0912.2371},
eprinttype = {arXiv},
eprint = {0912.2371},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-2371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RamanS08,
author = {Venkatesh Raman and
Saket Saurabh},
title = {Short Cycles Make \emph{W} -hard Problems Hard: {FPT} Algorithms for
\emph{W} -hard Problems in Graphs with no Short Cycles},
journal = {Algorithmica},
volume = {52},
number = {2},
pages = {203--225},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9148-9},
doi = {10.1007/S00453-007-9148-9},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/RamanS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/RamanSS08,
author = {Venkatesh Raman and
Saket Saurabh and
Sriganesh Srihari},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Parameterized Algorithms for Generalized Domination},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {116--126},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_11},
doi = {10.1007/978-3-540-85097-7\_11},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/RamanSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MishraRSS08,
author = {Sounaka Mishra and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {K{\"{o}}nig Deletion Sets and Vertex Covers above the Matching
Size},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {836--847},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_73},
doi = {10.1007/978-3-540-92182-0\_73},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MishraRSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamanS07,
author = {Venkatesh Raman and
Saket Saurabh},
title = {Improved fixed parameter tractable algorithms for two "edge"
problems: {MAXCUT} and {MAXDAG}},
journal = {Inf. Process. Lett.},
volume = {104},
number = {2},
pages = {65--72},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.05.014},
doi = {10.1016/J.IPL.2007.05.014},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/RamanS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamanS07a,
author = {Venkatesh Raman and
Somnath Sikdar},
title = {Parameterized complexity of the induced subgraph problem in directed
graphs},
journal = {Inf. Process. Lett.},
volume = {104},
number = {3},
pages = {79--85},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.05.005},
doi = {10.1016/J.IPL.2007.05.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamanS07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RamanSS07,
author = {Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
title = {Efficient Exact Algorithms through Enumerating Maximal Independent
Sets and Other Techniques},
journal = {Theory Comput. Syst.},
volume = {41},
number = {3},
pages = {563--587},
year = {2007},
url = {https://doi.org/10.1007/s00224-007-1334-2},
doi = {10.1007/S00224-007-1334-2},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/RamanSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RamanRS07,
author = {Rajeev Raman and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Succinct indexable dictionaries with applications to encoding \emph{k}-ary
trees, prefix sums and multisets},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {4},
pages = {43},
year = {2007},
url = {https://doi.org/10.1145/1290672.1290680},
doi = {10.1145/1290672.1290680},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/RamanRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MishraRSSS07,
author = {Sounaka Mishra and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar and
C. R. Subramanian},
editor = {Takeshi Tokuyama},
title = {The Complexity of Finding Subgraphs Whose Matching Number Equals the
Vertex Cover Number},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {268--279},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_25},
doi = {10.1007/978-3-540-77120-3\_25},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/MishraRSSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MoserRS07,
author = {Hannes Moser and
Venkatesh Raman and
Somnath Sikdar},
editor = {Takeshi Tokuyama},
title = {The Parameterized Complexity of the Unique Coverage Problem},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {621--631},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_54},
doi = {10.1007/978-3-540-77120-3\_54},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MoserRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0705-0552,
author = {Rajeev Raman and
Venkatesh Raman and
Srinivasa Rao Satti},
title = {Succinct Indexable Dictionaries with Applications to Encoding {\textdollar}k{\textdollar}-ary
Trees, Prefix Sums and Multisets},
journal = {CoRR},
volume = {abs/0705.0552},
year = {2007},
url = {http://arxiv.org/abs/0705.0552},
eprinttype = {arXiv},
eprint = {0705.0552},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0705-0552.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/MahajanRRV06,
author = {Meena Mahajan and
Raghavan Rama and
Venkatesh Raman and
S. Vijaykumar},
title = {Approximate Block Sorting},
journal = {Int. J. Found. Comput. Sci.},
volume = {17},
number = {2},
pages = {337--356},
year = {2006},
url = {https://doi.org/10.1142/S0129054106003863},
doi = {10.1142/S0129054106003863},
timestamp = {Mon, 15 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/MahajanRRV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RamanSS06,
author = {Venkatesh Raman and
Saket Saurabh and
C. R. Subramanian},
title = {Faster fixed parameter tractable algorithms for finding feedback vertex
sets},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {3},
pages = {403--415},
year = {2006},
url = {https://doi.org/10.1145/1159892.1159898},
doi = {10.1145/1159892.1159898},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/RamanSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GearyRR06,
author = {Richard F. Geary and
Rajeev Raman and
Venkatesh Raman},
title = {Succinct ordinal trees with level-ancestor queries},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {4},
pages = {510--534},
year = {2006},
url = {https://doi.org/10.1145/1198513.1198516},
doi = {10.1145/1198513.1198516},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GearyRR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RamanS06,
author = {Venkatesh Raman and
Saket Saurabh},
title = {Parameterized algorithms for feedback set problems and their duals
in tournaments},
journal = {Theor. Comput. Sci.},
volume = {351},
number = {3},
pages = {446--458},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2005.10.010},
doi = {10.1016/J.TCS.2005.10.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RamanS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GearyRRR06,
author = {Richard F. Geary and
Naila Rahman and
Rajeev Raman and
Venkatesh Raman},
title = {A simple optimal representation for balanced parentheses},
journal = {Theor. Comput. Sci.},
volume = {368},
number = {3},
pages = {231--246},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.09.014},
doi = {10.1016/J.TCS.2006.09.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GearyRRR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuptaRS06,
author = {Sushmita Gupta and
Venkatesh Raman and
Saket Saurabh},
editor = {S. Arun{-}Kumar and
Naveen Garg},
title = {Fast Exponential Algorithms for Maximum \emph{r}-Regular Induced Subgraph
Problems},
booktitle = {{FSTTCS} 2006: Foundations of Software Technology and Theoretical
Computer Science, 26th International Conference, Kolkata, India, December
13-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4337},
pages = {139--151},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944836\_15},
doi = {10.1007/11944836\_15},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GuptaRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MahajanRS06,
author = {Meena Mahajan and
Venkatesh Raman and
Somnath Sikdar},
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {Parameterizing {MAX} {SNP} Problems Above Guaranteed Values},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4169},
pages = {38--49},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250\_4},
doi = {10.1007/11847250\_4},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/MahajanRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RamanS06,
author = {Venkatesh Raman and
Saket Saurabh},
editor = {Lars Arge and
Rusins Freivalds},
title = {Triangles, 4-Cycles and Parameterized (In-)Tractability},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {304--315},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_29},
doi = {10.1007/11785293\_29},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/RamanS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BenoitDMRRR05,
author = {David Benoit and
Erik D. Demaine and
J. Ian Munro and
Rajeev Raman and
Venkatesh Raman and
S. Srinivasa Rao},
title = {Representing Trees of Higher Degree},
journal = {Algorithmica},
volume = {43},
number = {4},
pages = {275--292},
year = {2005},
url = {https://doi.org/10.1007/s00453-004-1146-6},
doi = {10.1007/S00453-004-1146-6},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BenoitDMRRR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/RamanSS05,
author = {Venkatesh Raman and
Saket Saurabh and
C. R. Subramanian},
title = {Faster algorithms for feedback vertex set},
journal = {Electron. Notes Discret. Math.},
volume = {19},
pages = {273--279},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.05.037},
doi = {10.1016/J.ENDM.2005.05.037},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/RamanSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/RamanSS05,
author = {Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar},
editor = {Mario Coppo and
Elena Lodi and
G. Michele Pinna},
title = {Improved Exact Exponential Algorithms for Vertex Bipartization and
Other Problems},
booktitle = {Theoretical Computer Science, 9th Italian Conference, {ICTCS} 2005,
Siena, Italy, October 12-14, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3701},
pages = {375--389},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11560586\_30},
doi = {10.1007/11560586\_30},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/RamanSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GearyRRR04,
author = {Richard F. Geary and
Naila Rahman and
Rajeev Raman and
Venkatesh Raman},
editor = {S{\"{u}}leyman Cenk Sahinalp and
S. Muthukrishnan and
Ugur Dogrus{\"{o}}z},
title = {A Simple Optimal Representation for Balanced Parentheses},
booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
Istanbul,Turkey, July 5-7, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3109},
pages = {159--172},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27801-6\_12},
doi = {10.1007/978-3-540-27801-6\_12},
timestamp = {Fri, 07 May 2021 12:57:04 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GearyRRR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/RamanS04,
author = {Venkatesh Raman and
Saket Saurabh},
editor = {Rodney G. Downey and
Michael R. Fellows and
Frank K. H. A. Dehne},
title = {Improved Parameterized Algorithms for Feedback Set Problems in Weighted
Tournaments},
booktitle = {Parameterized and Exact Computation, First International Workshop,
{IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {260--270},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28639-4\_23},
doi = {10.1007/978-3-540-28639-4\_23},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/RamanS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GearyRR04,
author = {Richard F. Geary and
Rajeev Raman and
Venkatesh Raman},
editor = {J. Ian Munro},
title = {Succinct ordinal trees with level-ancestor queries},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {1--10},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982794},
timestamp = {Fri, 27 May 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GearyRR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/BalasubramanianRY03,
author = {R. Balasubramanian and
Venkatesh Raman and
V. Yegnanarayanan},
title = {On the pseudoachromatic number of join of graphs},
journal = {Int. J. Comput. Math.},
volume = {80},
number = {9},
pages = {1131--1137},
year = {2003},
url = {https://doi.org/10.1080/00207160310001597206},
doi = {10.1080/00207160310001597206},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/BalasubramanianRY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MahajanRRV03,
author = {Meena Mahajan and
Raghavan Rama and
Venkatesh Raman and
Vijayakumar Sundarrajan},
editor = {Paritosh K. Pandya and
Jaikumar Radhakrishnan},
title = {Merging and Sorting By Strip Moves},
booktitle = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical
Computer Science, 23rd Conference, Mumbai, India, December 15-17,
2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2914},
pages = {314--325},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24597-1\_27},
doi = {10.1007/978-3-540-24597-1\_27},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MahajanRRV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MunroRRR03,
author = {J. Ian Munro and
Rajeev Raman and
Venkatesh Raman and
S. Srinivasa Rao},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {Succinct Representations of Permutations},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {345--356},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_29},
doi = {10.1007/3-540-45061-0\_29},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MunroRRR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/RamanS03,
author = {Venkatesh Raman and
Saket Saurabh},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Michiel H. M. Smid},
title = {Parameterized Complexity of Directed Feedback Set Problems in Tournaments},
booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS}
2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2748},
pages = {484--492},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45078-8\_42},
doi = {10.1007/978-3-540-45078-8\_42},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/RamanS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KhotR02,
author = {Subhash Khot and
Venkatesh Raman},
title = {Parameterized complexity of finding subgraphs with hereditary properties},
journal = {Theor. Comput. Sci.},
volume = {289},
number = {2},
pages = {997--1008},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00414-5},
doi = {10.1016/S0304-3975(01)00414-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KhotR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/RamanSS02,
author = {Venkatesh Raman and
Saket Saurabh and
C. R. Subramanian},
editor = {Prosenjit Bose and
Pat Morin},
title = {Faster Fixed Parameter Tractable Algorithms for Undirected Feedback
Vertex Set},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {241--248},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_22},
doi = {10.1007/3-540-36136-7\_22},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/RamanSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ArvindR02,
author = {Vikraman Arvind and
Venkatesh Raman},
editor = {Prosenjit Bose and
Pat Morin},
title = {Approximation Algorithms for Some Parameterized Counting Problems},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {453--464},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_40},
doi = {10.1007/3-540-36136-7\_40},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ArvindR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RamanRR02,
author = {Rajeev Raman and
Venkatesh Raman and
S. Srinivasa Rao},
editor = {David Eppstein},
title = {Succinct indexable dictionaries with applications to encoding k-ary
trees and multisets},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {233--242},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545411},
timestamp = {Fri, 27 May 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/RamanRR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-031,
author = {Vikraman Arvind and
Venkatesh Raman},
title = {Approximate Counting small subgraphs of bounded treewidth and related
problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-031}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-031/index.html},
eprinttype = {ECCC},
eprint = {TR02-031},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RadhakrishnanR01,
author = {Jaikumar Radhakrishnan and
Venkatesh Raman},
title = {A tradeoff between search and update in dictionaries},
journal = {Inf. Process. Lett.},
volume = {80},
number = {5},
pages = {243--247},
year = {2001},
url = {https://doi.org/10.1016/S0020-0190(01)00173-9},
doi = {10.1016/S0020-0190(01)00173-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RadhakrishnanR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MunroRR01,
author = {J. Ian Munro and
Venkatesh Raman and
S. Srinivasa Rao},
title = {Space Efficient Suffix Trees},
journal = {J. Algorithms},
volume = {39},
number = {2},
pages = {205--222},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1151},
doi = {10.1006/JAGM.2000.1151},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MunroRR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MunroR01,
author = {J. Ian Munro and
Venkatesh Raman},
title = {Succinct Representation of Balanced Parentheses and Static Trees},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {762--776},
year = {2001},
url = {https://doi.org/10.1137/S0097539799364092},
doi = {10.1137/S0097539799364092},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MunroR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/RadhakrishnanRR01,
author = {Jaikumar Radhakrishnan and
Venkatesh Raman and
S. Srinivasa Rao},
editor = {Friedhelm Meyer auf der Heide},
title = {Explicit Deterministic Constructions for Membership in the Bitprobe
Model},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {290--299},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_24},
doi = {10.1007/3-540-44676-1\_24},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/RadhakrishnanRR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MunroRS01,
author = {J. Ian Munro and
Venkatesh Raman and
Adam J. Storm},
editor = {S. Rao Kosaraju},
title = {Representing dynamic binary trees succinctly},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {529--536},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365526},
timestamp = {Fri, 27 May 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/MunroRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/RamanRR01,
author = {Rajeev Raman and
Venkatesh Raman and
S. Srinivasa Rao},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Succinct Dynamic Data Structures},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {426--437},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_39},
doi = {10.1007/3-540-44634-6\_39},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/RamanRR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DowneyFR00,
author = {Rodney G. Downey and
Michael R. Fellows and
Venkatesh Raman},
title = {The complexity of irredundant sets parameterized by size},
journal = {Discret. Appl. Math.},
volume = {100},
number = {3},
pages = {155--167},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00185-7},
doi = {10.1016/S0166-218X(99)00185-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DowneyFR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KhotR00,
author = {Subhash Khot and
Venkatesh Raman},
editor = {Ding{-}Zhu Du and
Peter Eades and
Vladimir Estivill{-}Castro and
Xuemin Lin and
Arun Sharma},
title = {Parameterized Complexity of Finding Subgraphs with Hereditary Properties},
booktitle = {Computing and Combinatorics, 6th Annual International Conference,
{COCOON} 2000, Sydney, Australia, July 26-28, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1858},
pages = {137--147},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44968-X\_14},
doi = {10.1007/3-540-44968-X\_14},
timestamp = {Mon, 16 Mar 2020 17:44:09 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/KhotR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamnathR99,
author = {Sarnath Ramnath and
Venkatesh Raman},
title = {Selecting Small Ranks in {EREW} {PRAM}},
journal = {Inf. Process. Lett.},
volume = {71},
number = {5-6},
pages = {183--186},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(99)00113-1},
doi = {10.1016/S0020-0190(99)00113-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamnathR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MahajanR99,
author = {Meena Mahajan and
Venkatesh Raman},
title = {Parameterizing above Guaranteed Values: MaxSat and MaxCut},
journal = {J. Algorithms},
volume = {31},
number = {2},
pages = {335--354},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.0996},
doi = {10.1006/JAGM.1998.0996},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MahajanR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/RamanR99,
author = {Venkatesh Raman and
Sarnath Ramnath},
title = {Improved Upper Bounds for Time-Space Trade-offs for Selection},
journal = {Nord. J. Comput.},
volume = {6},
number = {2},
pages = {162--180},
year = {1999},
timestamp = {Fri, 27 May 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/RamanR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/RamanR99,
author = {Venkatesh Raman and
S. Srinivasa Rao},
editor = {Alok Aggarwal and
C. Pandu Rangan},
title = {Static Dictionaries Supporting Rank},
booktitle = {Algorithms and Computation, 10th International Symposium, {ISAAC}
'99, Chennai, India, December 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1741},
pages = {18--26},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46632-0\_3},
doi = {10.1007/3-540-46632-0\_3},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/RamanR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BansalR99,
author = {Nikhil Bansal and
Venkatesh Raman},
editor = {Alok Aggarwal and
C. Pandu Rangan},
title = {Upper Bounds for MaxSat: Further Improved},
booktitle = {Algorithms and Computation, 10th International Symposium, {ISAAC}
'99, Chennai, India, December 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1741},
pages = {247--258},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46632-0\_26},
doi = {10.1007/3-540-46632-0\_26},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BansalR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BenoitDMR99,
author = {David Benoit and
Erik D. Demaine and
J. Ian Munro and
Venkatesh Raman},
editor = {Frank K. H. A. Dehne and
Arvind Gupta and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Representing Trees of Higer Degree},
booktitle = {Algorithms and Data Structures, 6th International Workshop, {WADS}
'99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1663},
pages = {169--180},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48447-7\_18},
doi = {10.1007/3-540-48447-7\_18},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BenoitDMR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/1999,
editor = {C. Pandu Rangan and
Venkatesh Raman and
Ramaswamy Ramanujam},
title = {Foundations of Software Technology and Theoretical Computer Science,
19th Conference, Chennai, India, December 13-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1738},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46691-6},
doi = {10.1007/3-540-46691-6},
isbn = {3-540-66836-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/1999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RamanRR98,
author = {Venkatesh Raman and
Bala Ravikumar and
S. Srinivasa Rao},
title = {A Simplified NP-Complete {MAXSAT} Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {1},
pages = {1--6},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00223-8},
doi = {10.1016/S0020-0190(97)00223-8},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RamanRR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BalasubramanianFR98,
author = {R. Balasubramanian and
Michael R. Fellows and
Venkatesh Raman},
title = {An Improved Fixed-Parameter Algorithm for Vertex Cover},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {163--168},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00213-5},
doi = {10.1016/S0020-0190(97)00213-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BalasubramanianFR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MunroRR98,
author = {J. Ian Munro and
Venkatesh Raman and
S. Srinivasa Rao},
editor = {Vikraman Arvind and
Ramaswamy Ramanujam},
title = {Space Efficient Suffix Trees},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
18th Conference, Chennai, India, December 17-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1530},
pages = {186--196},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/978-3-540-49382-2\_17},
doi = {10.1007/978-3-540-49382-2\_17},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MunroRR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RamanR98,
author = {Venkatesh Raman and
Sarnath Ramnath},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Improved Upper Bounds for Time-Space Tradeoffs for Selection with
Limited Storage},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {131--142},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054361},
doi = {10.1007/BFB0054361},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/RamanR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BalasubramanianRS97,
author = {R. Balasubramanian and
Venkatesh Raman and
G. Srinivasaragavan},
title = {Finding Scores in Tournaments},
journal = {J. Algorithms},
volume = {24},
number = {2},
pages = {380--394},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0865},
doi = {10.1006/JAGM.1997.0865},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BalasubramanianRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MunroR97,
author = {J. Ian Munro and
Venkatesh Raman},
title = {Succinct Representation of Balanced Parentheses, Static Trees and
Planar Graphs},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {118--126},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646100},
doi = {10.1109/SFCS.1997.646100},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MunroR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-033,
author = {Meena Mahajan and
Venkatesh Raman},
title = {Parametrizing Above Guaranteed Values: MaxSat and MaxCut},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-033}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-033/index.html},
eprinttype = {ECCC},
eprint = {TR97-033},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MunroR96,
author = {J. Ian Munro and
Venkatesh Raman},
title = {Fast Stable In-Place Sorting with \emph{O (n)} Data Moves},
journal = {Algorithmica},
volume = {16},
number = {2},
pages = {151--160},
year = {1996},
url = {https://doi.org/10.1007/BF01940644},
doi = {10.1007/BF01940644},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MunroR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MunroR96,
author = {J. Ian Munro and
Venkatesh Raman},
title = {Selection from Read-Only Memory and Sorting with Minimum Data Movement},
journal = {Theor. Comput. Sci.},
volume = {165},
number = {2},
pages = {311--323},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00225-1},
doi = {10.1016/0304-3975(95)00225-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MunroR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BalasubramanianR95,
author = {R. Balasubramanian and
Venkatesh Raman},
editor = {P. S. Thiagarajan},
title = {Path Balance Heuristic for Self-Adjusting Binary Search Trees},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
15th Conference, Bangalore, India, December 18-20, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1026},
pages = {338--348},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60692-0\_59},
doi = {10.1007/3-540-60692-0\_59},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BalasubramanianR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BalasubramanianRS95,
author = {R. Balasubramanian and
Venkatesh Raman and
G. Srinivasaraghavan},
editor = {Ricardo A. Baeza{-}Yates and
Eric Goles Ch. and
Patricio V. Poblete},
title = {Tight Bounds for Finding Degrees from the Adjacency Matrix},
booktitle = {{LATIN} '95: Theoretical Informatics, Second Latin American Symposium,
Valpara{\'{\i}}so, Chile, April 3-7, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {911},
pages = {49--59},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59175-3\_80},
doi = {10.1007/3-540-59175-3\_80},
timestamp = {Fri, 21 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/BalasubramanianRS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BalasubramanianRS93,
author = {R. Balasubramanian and
Venkatesh Raman and
G. Srinivasaraghavan},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {The Complexity of Finding Certain Trees in Tournaments},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {142--150},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_243},
doi = {10.1007/3-540-57155-8\_243},
timestamp = {Fri, 21 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BalasubramanianRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MunroR92,
author = {J. Ian Munro and
Venkatesh Raman},
title = {Sorting with Minimum Data Movement},
journal = {J. Algorithms},
volume = {13},
number = {3},
pages = {374--393},
year = {1992},
url = {https://doi.org/10.1016/0196-6774(92)90045-E},
doi = {10.1016/0196-6774(92)90045-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MunroR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MunroR92,
author = {J. Ian Munro and
Venkatesh Raman},
editor = {R. K. Shyamasundar},
title = {Selection from Read-Only Memory and Sorting with Optimum Data Movement},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
12th Conference, New Delhi, India, December 18-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {652},
pages = {380--391},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56287-7\_120},
doi = {10.1007/3-540-56287-7\_120},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MunroR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MunroR91,
author = {J. Ian Munro and
Venkatesh Raman},
editor = {Somenath Biswas and
Kesav V. Nori},
title = {Fast Sorting In-Place Sorting with O(n) Data},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
11th Conference, New Delhi, India, December 17-19, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {560},
pages = {266--277},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54967-6\_74},
doi = {10.1007/3-540-54967-6\_74},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MunroR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MunroR91,
author = {J. Ian Munro and
Venkatesh Raman},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Sorting Multisets and Vectors In-Place},
booktitle = {Algorithms and Data Structures, 2nd Workshop {WADS} '91, Ottawa, Canada,
August 14-16, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {519},
pages = {473--480},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0028285},
doi = {10.1007/BFB0028285},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/wads/MunroR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/MunroRS90,
author = {J. Ian Munro and
Venkatesh Raman and
Jeffrey S. Salowe},
title = {Stable in Situ Sorting and Minimum Data Movement},
journal = {{BIT}},
volume = {30},
number = {2},
pages = {220--234},
year = {1990},
url = {https://doi.org/10.1007/BF02017344},
doi = {10.1007/BF02017344},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/MunroRS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MunroR89,
author = {J. Ian Munro and
Venkatesh Raman},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Sorting with Minimum Data Movement (Preliminary Draft)},
booktitle = {Algorithms and Data Structures, Workshop {WADS} '89, Ottawa, Canada,
August 17-19, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {382},
pages = {552--562},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51542-9\_46},
doi = {10.1007/3-540-51542-9\_46},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/wads/MunroR89.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-02-06 23:48 CET 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:
