Parameterized graph separation problemsMARX, Daniel.Theoretical computer science. 2006, Vol 351, Num 3, pp 394-406, issn 0304-3975, 13 p.Conference Paper

Cleaning Interval GraphsMARX, Dániel; SCHLOTTER, Ildikó.Algorithmica. 2013, Vol 65, Num 2, pp 275-316, issn 0178-4617, 42 p.Article

Augmenting tractable fragments of abstract argumentationDVORAK, Wolfgang; ORDYNIAK, Sebastian; SZEIDER, Stefan et al.Artificial intelligence (General ed.). 2012, Vol 186, pp 157-173, issn 0004-3702, 17 p.Article

Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphsCHUNMEI LIU; YINGLEI SONG.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 684-698, issn 1382-6905, 15 p.Article

Polynomial time approximation schemes and parameterized complexityJIANER CHEN; XIUZHEN HUANG; KANJ, Iyad A et al.Discrete applied mathematics. 2007, Vol 155, Num 2, pp 180-193, issn 0166-218X, 14 p.Conference Paper

Parameterized Modal SatisfiabilityACHILLEOS, Antonis; LAMPIS, Michael; MITSOU, Valia et al.Algorithmica. 2012, Vol 64, Num 1, pp 38-55, issn 0178-4617, 18 p.Article

Small Vertex Cover makes Petri Net Coverability and Boundedness EasierPRAVEEN, M.Algorithmica. 2013, Vol 65, Num 4, pp 713-753, issn 0178-4617, 41 p.Article

Parameterized Two-Player Nash EquilibriumHERMELIN, Danny; HUANG, Chien-Chung; KRATSCH, Stefan et al.Algorithmica. 2013, Vol 65, Num 4, pp 802-816, issn 0178-4617, 15 p.Article

ON THE PARAMETERIZED COMPLEXITY OF APPROXIMATE COUNTINGANDRES MONTOYA, J.Informatique théorique et applications (Imprimé). 2011, Vol 45, Num 2, pp 197-223, issn 0988-3754, 27 p.Article

AN ISOMORPHISM BETWEEN SUBEXPONENTIAL AND PARAMETERIZED COMPLEXITY THEORYYIJIA CHEN; GROHE, Martin.SIAM journal on computing (Print). 2008, Vol 37, Num 4, pp 1228-1258, issn 0097-5397, 31 p.Article

The Complexity of Konig Subgraph Problems and Above-Guarantee Vertex CoverMISHRA, Sounaka; RAMAN, Venkatesh; SAURABH, Saket et al.Algorithmica. 2011, Vol 61, Num 4, pp 857-881, issn 0178-4617, 25 p.Conference Paper

On the Parameterized Complexity and Kernelization of the Workflow Satisfiability ProblemCRAMPTON, Jason; GUTIN, Gregory; YEO, Anders et al.ACM transactions on information and system security. 2013, Vol 16, Num 1, issn 1094-9224, 4.1-4.31Article

Polynomial Kernelizations for MIN F⁺Π₁ and MAX NPKRATSCH, Stefan.Algorithmica. 2012, Vol 63, Num 1-2, pp 532-550, issn 0178-4617, 19 p.Article

Consequence-based and fixed-parameter tractable reasoning in description logicsSIMANCIK, František; MOTIK, Boris; HORROCKS, Ian et al.Artificial intelligence (General ed.). 2014, Vol 209, pp 29-77, issn 0004-3702, 49 p.Article

From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting ProblemYIJIA CHEN; JORG FLUM.Journal of the Association for Computing Machinery. 2012, Vol 59, Num 4, issn 0004-5411, 17.1-17.34Article

On the parameterized complexity of the Multi-MCT and Multi-MCST problemsWENBIN CHEN; SCHMIDT, Matthew C; SAMATOVA, Nagiza F et al.Journal of combinatorial optimization. 2011, Vol 21, Num 2, pp 151-158, issn 1382-6905, 8 p.Article

Fast Minor Testing in Planar GraphsADLER, Isolde; DORN, Frederic; FOMIN, Fedor V et al.Algorithmica. 2012, Vol 64, Num 1, pp 69-84, issn 0178-4617, 16 p.Article

Parameterized computational complexity of control problems in voting systemsHONG LIU; HAODI FENG; DAMING ZHU et al.Theoretical computer science. 2009, Vol 410, Num 27-29, pp 2746-2753, issn 0304-3975, 8 p.Article

On miniaturized problems in parameterized complexity theoryYIJIA CHEN; FLUM, Jörg.Theoretical computer science. 2006, Vol 351, Num 3, pp 314-336, issn 0304-3975, 23 p.Conference Paper

Parameterized enumeration, transversals, and imperfect phylogeny reconstructionDAMASCHKE, Peter.Theoretical computer science. 2006, Vol 351, Num 3, pp 337-350, issn 0304-3975, 14 p.Conference Paper

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing ProblemsFELLOWS, M. R; KNAUER, C; NISHIMURA, N et al.Algorithmica. 2008, Vol 52, Num 2, pp 167-176, issn 0178-4617, 10 p.Article

Machine-based methods in parameterized complexity theoryYIJIA CHEN; FLUM, Jörg; GROHE, Martin et al.Theoretical computer science. 2005, Vol 339, Num 2-3, pp 167-199, issn 0304-3975, 33 p.Article

On Cutwidth Parameterized by Vertex CoverCYGAN, Marek; LOKSHTANOV, Daniel; PILIPCZUK, Marcin et al.Algorithmica. 2014, Vol 68, Num 4, pp 940-953, issn 0178-4617, 14 p.Article

The Parameterized Complexity of the Shared Center ProblemCHEN, Zhi-Zhong; WENJI MA; LUSHENG WANG et al.Algorithmica. 2014, Vol 69, Num 2, pp 269-293, issn 0178-4617, 25 p.Article

Finding and Counting Vertex-Colored SubtreesGUILLEMOT, Sylvain; SIKORA, Florian.Algorithmica. 2013, Vol 65, Num 4, pp 828-844, issn 0178-4617, 17 p.Article