No. |
Title |
Author |
Year |
1 |
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits |
Chakraborty, Sankardeep et al. |
2016 |
2 |
Fréchet Distance Between a Line and Avatar Point Set |
Banik, Aritra et al. |
2016 |
3 |
Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs |
Kolay, Sudeshna et al. |
2016 |
4 |
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators |
Majumdar, Diptapriyo et al. |
2015 |
5 |
Front Matter, Table of Contents, Preface, Conference Organization |
Raman, Venkatesh et al. |
2014 |
6 |
LIPIcs, Volume 29, FSTTCS'14, Complete Volume |
Raman, Venkatesh et al. |
2014 |
7 |
LP can be a cure for Parameterized Problems |
Narayanaswamy, N.S. et al. |
2012 |
8 |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
Dorn, Frederic et al. |
2010 |
9 |
The effect of girth on the kernelization complexity of Connected Dominating Set |
Misra, Neeldhara et al. |
2010 |
10 |
Subexponential Algorithms for Partial Cover Problems |
Fomin, Fedor V. et al. |
2009 |