My publications on

- (With Alexander Langer, Felix Reidl and Peter Rossmanith).
*Recent Progress in Practical Aspects of MSO Model-Checking. Submitted.*

- (With A. Langer and P. Rossmanith).
*Linear-Time Algorithms for Graphs of Bounded Rankwidth--A Fresh Look Using Game Theory.*A preliminary version appeared in TAMC 2011, Tokyo, Japan. - (With R. Ganian, P. Hliněný, A. Langer, J. Obdržálek, P. Rossmanith).
*Lower Bounds on the Complexity of MSO*Accepted at STACS 2012, Paris, France._{1}Model Checking. - (With A. Langer, F. Reidl and P. Rossmanith).
*Evaluation of an MSO-Solver.*Accepted at ALENEX 2012, Kyoto, Japan. - (with J.-F.Couturier and others).
*The Complexity of Edge-Partitioning Problems.*Submitted.

- (With R. Ganian, P. Hliněný, J. Kneis, D. Meister, J. Obdržálek, P. Rossmanith).
*Are there any good digraph width measures?*In proceedings of IPEC 2010, Chennai, India. A full version is currently under review. - (With N. Misra, G. Philip, V. Raman and S. Saurabh).
*FPT-Algorithms for Connected Feedback Vertex Set.*In proceedings of WALCOM 2010, Springer LNCS.

- With D. Lokshtanov and S. Saurabh).
*A SimplerParameterized Algorithm for OCT.*In proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 2009). - (With D. Lokshtanov, V. Raman and S. Saurabh).
*On the Directed Degree Preserving Spanning Tree Problem.*In proceedings of IWPEC 2009, Springer LNCS. - (With G. Philip and V. Raman).
*A Polynomial Kernel for the Dominating Set Problem in K*In proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009)._{{i,j}}-Free and Degenerate Graphs. - (With N. Misra, V. Raman and S. Saurabh).
*The Budgeted Unique Coverage Problem and Color Coding.*In proceedings of the 4th Computer Science Symposium in Russia, CSR 2009.

- (With S. Mishra, V. Raman and S. Saurabh).
*Konig Deletion Sets and Vertex Covers Above the Matching Size.*In proceedings of ISAAC 2008. - (With M. Dom).
*The Parameterized Complexity of the Rectangle Stabbing Problem.*In proceedings of Frontiers of Algorithmics Workshop (FAW 2008).

- (With H. Moser and V. Raman).
*Making a Hard Problem Easier: The Complexity of the Unique Coverage Problem.*Accepted in ISAAC 2007. Here's an extended version of this work. - (With S. Mishra, V. Raman, S. Saurabh and C. R. Subramanian).
*The Complexity of Finding Subgraphs whose Matching Number Equals the Vertex Cover Number.*In proceedings of ISAAC 2007. An extended version is to appear in Algorithmica. - (With H. Moser).
*Parameterized Complexity of the Induced Matching Problem in Planar Graphs.*In proceedings of Frontiers of Algorithms Workshop (FAW 2007), Lanzhou, China. Springer LNCS. An extended version is to appear in Discrete Applied Mathematics.

- (With V. Raman).
*Parameterized Complexity of the Induced Subgraph Problem in Directed Graphs.*Information Processing Letters. - (With M. Mahajan and V. Raman).
*Parameterizing NP-Optimization Problems Above/Below Guaranteed Values.*In proceedings of IWPEC 2006. An extended version appeared in the Journal of Computer and System Sciences.

- (With V. Raman and S. Saurabh).
*Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.*The Theory of Computing Systems. - (With V. Raman and S. Saurabh).
*Improved Exact Algorithms for Vertex Bipartization and Other Problems*In proceedings of the 9th Italian Conference on Theoretical Computer Science, ICTCS 2005. Springer Verlag LNCS Vol. 3701, pp 375-389, 2005.

- (With A. Adhikari).
*A new (2,n)-Visual Threshold Scheme for Color Images.*In proceedings of Indocrypt 2003, Springer Verlag, LNCS Vol. 2904, pp 148-161, 2003.