No. Title Author Year
1 Approximation in (Poly-) Logarithmic Space Biswas, Arindam et al. 2020
2 Optimal Output Sensitive Fault Tolerant Cuts Banerjee, Niranka et al. 2020
3 Parameterized Complexity of Deletion to Scattered Graph Classes Jacob, Ashwin et al. 2020
4 Structural Parameterizations with Modulator Oblivion Jacob, Ashwin et al. 2020
5 Parameterized Streaming Algorithms for Min-Ones d-SAT Agrawal, Akanksha et al. 2019
6 A Framework for In-place Graph Algorithms Chakraborty, Sankardeep et al. 2018
7 Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits Chakraborty, Sankardeep et al. 2016
8 Fr├ęchet Distance Between a Line and Avatar Point Set Banik, Aritra et al. 2016
9 Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs Kolay, Sudeshna et al. 2016
10 Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators Majumdar, Diptapriyo et al. 2015
11 Front Matter, Table of Contents, Preface, Conference Organization Raman, Venkatesh et al. 2014
12 LIPIcs, Volume 29, FSTTCS'14, Complete Volume Raman, Venkatesh et al. 2014
13 LP can be a cure for Parameterized Problems Narayanaswamy, N.S. et al. 2012
14 Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs Dorn, Frederic et al. 2010
15 The effect of girth on the kernelization complexity of Connected Dominating Set Misra, Neeldhara et al. 2010
16 Subexponential Algorithms for Partial Cover Problems Fomin, Fedor V. et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 16


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI