Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Somnath Sikdar
@article{DBLP:journals/jcss/DemaineRRVSS19,
author = {Erik D. Demaine and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar and
Blair D. Sullivan},
title = {Structural sparsity of complex networks: Bounded expansion in random
models and real-world graphs},
journal = {J. Comput. Syst. Sci.},
volume = {105},
pages = {199--241},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2019.05.004},
doi = {10.1016/J.JCSS.2019.05.004},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DemaineRRVSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChangCHLRS18,
author = {Maw{-}Shang Chang and
Li{-}Hsuan Chen and
Ling{-}Ju Hung and
Yi{-}Zhi Liu and
Peter Rossmanith and
Somnath Sikdar},
title = {Moderately exponential time algorithms for the maximum bounded-degree-1
set problem},
journal = {Discret. Appl. Math.},
volume = {251},
pages = {114--125},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.05.032},
doi = {10.1016/J.DAM.2018.05.032},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChangCHLRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GajarskyHOORRVS17,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {Kernelization using structural parameters on sparse graph classes},
journal = {J. Comput. Syst. Sci.},
volume = {84},
pages = {219--242},
year = {2017},
url = {https://doi.org/10.1016/j.jcss.2016.09.002},
doi = {10.1016/J.JCSS.2016.09.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/GajarskyHOORRVS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GanianHK0ORS16,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Are there any good digraph width measures?},
journal = {J. Comb. Theory, Ser. {B}},
volume = {116},
pages = {250--286},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2015.09.001},
doi = {10.1016/J.JCTB.2015.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GanianHK0ORS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/0002LPRRSS16,
author = {Eun Jung Kim and
Alexander Langer and
Christophe Paul and
Felix Reidl and
Peter Rossmanith and
Ignasi Sau and
Somnath Sikdar},
title = {Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {2},
pages = {21:1--21:41},
year = {2016},
url = {https://doi.org/10.1145/2797140},
doi = {10.1145/2797140},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/0002LPRRSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DrangeDFKLPPRVS16,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus Sortland Dregi and
Fedor V. Fomin and
Stephan Kreutzer and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Felix Reidl and
Fernando S{\'{a}}nchez Villaamil and
Saket Saurabh and
Sebastian Siebertz and
Somnath Sikdar},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Kernelization and Sparseness: the Case of Dominating Set},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {31:1--31:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.31},
doi = {10.4230/LIPICS.STACS.2016.31},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DrangeDFKLPPRVS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DrangeRVS15,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Felix Reidl and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Fast Biclustering by Dual Parameterization},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {402--413},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.402},
doi = {10.4230/LIPICS.IPEC.2015.402},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/DrangeRVS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DrangeRVS15,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Felix Reidl and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {Fast Biclustering by Dual Parameterization},
journal = {CoRR},
volume = {abs/1507.08158},
year = {2015},
url = {http://arxiv.org/abs/1507.08158},
eprinttype = {arXiv},
eprint = {1507.08158},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DrangeRVS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csr/LangerRRS14,
author = {Alexander Langer and
Felix Reidl and
Peter Rossmanith and
Somnath Sikdar},
title = {Practical algorithms for {MSO} model-checking on tree-decomposable
graphs},
journal = {Comput. Sci. Rev.},
volume = {13-14},
pages = {39--74},
year = {2014},
url = {https://doi.org/10.1016/j.cosrev.2014.08.001},
doi = {10.1016/J.COSREV.2014.08.001},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csr/LangerRRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GanianHLORS14,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Lower bounds on the complexity of MSO\({}_{\mbox{1}}\) model-checking},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {1},
pages = {180--194},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2013.07.005},
doi = {10.1016/J.JCSS.2013.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GanianHLORS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ReidlRVS14,
author = {Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {A Faster Parameterized Algorithm for Treedepth},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {931--942},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_77},
doi = {10.1007/978-3-662-43948-7\_77},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ReidlRVS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GajarskyOORRVS14,
author = {Jakub Gajarsk{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
editor = {Marek Cygan and
Pinar Heggernes},
title = {Finite Integer Index of Pathwidth and Treewidth},
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 = {258--269},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_22},
doi = {10.1007/978-3-319-13524-3\_22},
timestamp = {Sat, 19 Oct 2019 20:25:35 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GajarskyOORRVS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ReidlRVS14,
author = {Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {A Faster Parameterized Algorithm for Treedepth},
journal = {CoRR},
volume = {abs/1401.7540},
year = {2014},
url = {http://arxiv.org/abs/1401.7540},
eprinttype = {arXiv},
eprint = {1401.7540},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ReidlRVS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DemaineRRVSS14,
author = {Erik D. Demaine and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar and
Blair D. Sullivan},
title = {Structural Sparsity of Complex Networks: Random Graph Models and Linear
Algorithms},
journal = {CoRR},
volume = {abs/1406.2587},
year = {2014},
url = {http://arxiv.org/abs/1406.2587},
eprinttype = {arXiv},
eprint = {1406.2587},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DemaineRRVSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DrangeDFKLPPRSVS14,
author = {P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Stephan Kreutzer and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Felix Reidl and
Saket Saurabh and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {Kernelization and Sparseness: the case of Dominating Set},
journal = {CoRR},
volume = {abs/1411.4575},
year = {2014},
url = {http://arxiv.org/abs/1411.4575},
eprinttype = {arXiv},
eprint = {1411.4575},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DrangeDFKLPPRSVS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DreierKPRRS14,
author = {Jan Dreier and
Philipp Kuinke and
Rafael Przybylski and
Felix Reidl and
Peter Rossmanith and
Somnath Sikdar},
title = {Overlapping Communities in Social Networks},
journal = {CoRR},
volume = {abs/1412.4973},
year = {2014},
url = {http://arxiv.org/abs/1412.4973},
eprinttype = {arXiv},
eprint = {1412.4973},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DreierKPRRS14.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}
}
@inproceedings{DBLP:conf/esa/GajarskyHOORRVS13,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Kernelization Using Structural Parameters on Sparse Graph Classes},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {529--540},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_45},
doi = {10.1007/978-3-642-40450-4\_45},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/GajarskyHOORRVS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0002LPRRSS13,
author = {Eun Jung Kim and
Alexander Langer and
Christophe Paul and
Felix Reidl and
Peter Rossmanith and
Ignasi Sau and
Somnath Sikdar},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {613--624},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_52},
doi = {10.1007/978-3-642-39206-1\_52},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0002LPRRSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6863,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
Felix Reidl and
Peter Rossmanith and
Fernando S{\'{a}}nchez Villaamil and
Somnath Sikdar},
title = {Kernelization Using Structural Parameters on Sparse Graph Classes},
journal = {CoRR},
volume = {abs/1302.6863},
year = {2013},
url = {http://arxiv.org/abs/1302.6863},
eprinttype = {arXiv},
eprint = {1302.6863},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-6863.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DomFRS12,
author = {Michael Dom and
Michael R. Fellows and
Frances A. Rosamond and
Somnath Sikdar},
title = {The Parameterized Complexity of Stabbing Rectangles},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {564--594},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9471-4},
doi = {10.1007/S00453-010-9471-4},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DomFRS12.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/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}
}
@inproceedings{DBLP:conf/alenex/LangerRRS12,
author = {Alexander Langer and
Felix Reidl and
Peter Rossmanith and
Somnath Sikdar},
editor = {David A. Bader and
Petra Mutzel},
title = {Evaluation of an MSO-Solver},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {55--63},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.5},
doi = {10.1137/1.9781611972924.5},
timestamp = {Tue, 29 Dec 2020 18:28:33 +0100},
biburl = {https://dblp.org/rec/conf/alenex/LangerRRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GanianHLOR12,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Lower Bounds on the Complexity of MSO{\_}1 Model-Checking},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {326--337},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.326},
doi = {10.4230/LIPICS.STACS.2012.326},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GanianHLOR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-2780,
author = {Alexander Langer and
Felix Reidl and
Peter Rossmanith and
Somnath Sikdar},
title = {Linear Kernels on Graphs Excluding Topological Minors},
journal = {CoRR},
volume = {abs/1201.2780},
year = {2012},
url = {http://arxiv.org/abs/1201.2780},
eprinttype = {arXiv},
eprint = {1201.2780},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-2780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0835,
author = {Eun Jung Kim and
Alexander Langer and
Christophe Paul and
Felix Reidl and
Peter Rossmanith and
Ignasi Sau and
Somnath Sikdar},
title = {Linear kernels and single-exponential algorithms via protrusion decompositions},
journal = {CoRR},
volume = {abs/1207.0835},
year = {2012},
url = {http://arxiv.org/abs/1207.0835},
eprinttype = {arXiv},
eprint = {1207.0835},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-0835.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}
}
@inproceedings{DBLP:conf/tamc/LangerRS11,
author = {Alexander Langer and
Peter Rossmanith and
Somnath Sikdar},
editor = {Mitsunori Ogihara and
Jun Tarui},
title = {Linear-Time Algorithms for Graphs of Bounded Rankwidth: {A} Fresh
Look Using Game Theory - (Extended Abstract)},
booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
{TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6648},
pages = {505--516},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20877-5\_49},
doi = {10.1007/978-3-642-20877-5\_49},
timestamp = {Sun, 25 Oct 2020 23:06:59 +0100},
biburl = {https://dblp.org/rec/conf/tamc/LangerRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-0908,
author = {Alexander Langer and
Peter Rossmanith and
Somnath Sikdar},
title = {Linear-Time Algorithms for Graphs of Bounded Rankwidth: {A} Fresh
Look Using Game Theory},
journal = {CoRR},
volume = {abs/1102.0908},
year = {2011},
url = {http://arxiv.org/abs/1102.0908},
eprinttype = {arXiv},
eprint = {1102.0908},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-0908.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-5804,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Lower Bounds on the Complexity of {MSO1} Model-Checking},
journal = {CoRR},
volume = {abs/1109.5804},
year = {2011},
url = {http://arxiv.org/abs/1109.5804},
eprinttype = {arXiv},
eprint = {1109.5804},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-5804.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GanianHKMORS10,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
editor = {Venkatesh Raman and
Saket Saurabh},
title = {Are There Any Good Digraph Width Measures?},
booktitle = {Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6478},
pages = {135--146},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17493-3\_14},
doi = {10.1007/978-3-642-17493-3\_14},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GanianHKMORS10.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}
}
@article{DBLP:journals/corr/abs-1004-1485,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Are there any good digraph width measures?},
journal = {CoRR},
volume = {abs/1004.1485},
year = {2010},
url = {http://arxiv.org/abs/1004.1485},
eprinttype = {arXiv},
eprint = {1004.1485},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-1485.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MoserS09,
author = {Hannes Moser and
Somnath Sikdar},
title = {The parameterized complexity of the induced matching problem},
journal = {Discret. Appl. Math.},
volume = {157},
number = {4},
pages = {715--727},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.07.011},
doi = {10.1016/J.DAM.2008.07.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MoserS09.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/iwoca/LokshtanovSS09,
author = {Daniel Lokshtanov and
Saket Saurabh and
Somnath Sikdar},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Simpler Parameterized Algorithm for {OCT}},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {380--384},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_37},
doi = {10.1007/978-3-642-10217-2\_37},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/LokshtanovSS09.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}
}
@inproceedings{DBLP:conf/faw/DomS08,
author = {Michael Dom and
Somnath Sikdar},
editor = {Franco P. Preparata and
Xiaodong Wu and
Jianping Yin},
title = {The Parameterized Complexity of the Rectangle Stabbing Problem and
Its Variants},
booktitle = {Frontiers in Algorithmics, Second Annual International Workshop, {FAW}
2008, Changsha, China, June 19-21, 2008, Proceeedings},
series = {Lecture Notes in Computer Science},
volume = {5059},
pages = {288--299},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69311-6\_30},
doi = {10.1007/978-3-540-69311-6\_30},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/DomS08.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/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}
}
@inproceedings{DBLP:conf/faw/MoserS07,
author = {Hannes Moser and
Somnath Sikdar},
editor = {Franco P. Preparata and
Qizhi Fang},
title = {The Parameterized Complexity of the Induced Matching Problem in Planar
Graphs},
booktitle = {Frontiers in Algorithmics, First Annual International Workshop, {FAW}
2007, Lanzhou, China, August 1-3, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4613},
pages = {325--336},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73814-5\_32},
doi = {10.1007/978-3-540-73814-5\_32},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/MoserS07.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}
}
@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/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/indocrypt/AdhikariS03,
author = {Avishek Adhikari and
Somnath Sikdar},
editor = {Thomas Johansson and
Subhamoy Maitra},
title = {A New (2, n)-Visual Threshold Scheme for Color Images},
booktitle = {Progress in Cryptology - {INDOCRYPT} 2003, 4th International Conference
on Cryptology in India, New Delhi, India, December 8-10, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2904},
pages = {148--161},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24582-7\_11},
doi = {10.1007/978-3-540-24582-7\_11},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/indocrypt/AdhikariS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 17:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
