Improved fixed parameter tractable algorithms for two edge problems : MAXCUT and MAXDAGRAMAN, Venkatesh; SAURABH, Saket.Information processing letters. 2007, Vol 104, Num 2, pp 65-72, issn 0020-0190, 8 p.Article

Parameterized and Exact Computation, Part IRAMAN, Venkatesh; SAURABH, Saket.Algorithmica. 2012, Vol 64, Num 1, issn 0178-4617, 213 p.Serial Issue

An exact algorithm for minimum distortion embeddingFOMIN, Fedor V; LOKSHTANOV, Daniel; SAURABH, Saket et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3530-3536, issn 0304-3975, 7 p.Article

The Kernelization Complexity of Connected Domination in Graphs with (no) Small CyclesMISRA, Neeldhara; PHILIP, Geevarghese; RAMAN, Venkatesh et al.Algorithmica. 2014, Vol 68, Num 2, pp 504-530, issn 0178-4617, 27 p.Article

Algorithmic Meta-theorems for Restrictions of TreewidthLAMPIS, Michael.Algorithmica. 2012, Vol 64, Num 1, pp 19-37, issn 0178-4617, 19 p.Article

Triangles, 4-cycles and parameterized (In-)tractabilityRAMAN, Venkatesh; SAURABH, Saket.Lecture notes in computer science. 2006, pp 304-315, issn 0302-9743, isbn 3-540-35753-X, 1Vol, 12 p.Conference Paper

Multivariate Complexity Analysis of Swap BriberyDORN, Britta; SCHLOTTER, Ildikó.Algorithmica. 2012, Vol 64, Num 1, pp 126-151, issn 0178-4617, 26 p.Article

Cluster Editing: Kernelization Based on Edge CutsYIXIN CAO; JIANER CHEN.Algorithmica. 2012, Vol 64, Num 1, pp 152-169, issn 0178-4617, 18 p.Article

Improved exact exponential algorithms for vertex bipartization and other problemsRAMAN, Venkatesh; SAURABH, Saket; SIKDAR, Somnath et al.Lecture notes in computer science. 2005, pp 375-389, issn 0302-9743, isbn 3-540-29106-7, 1Vol, 15 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

Branching and Treewidth Based Exact AlgorithmsFOMIN, Fedor V; GASPERS, Serge; SAURABH, Saket et al.Lecture notes in computer science. 2006, pp 16-25, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Parameterized Measure & Conquer for Problems with No Small KernelsBINKELE-RAIBLE, Daniel; FERNAU, Henning.Algorithmica. 2012, Vol 64, Num 1, pp 189-212, issn 0178-4617, 24 p.Article

INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V; GOLOVACH, Petr A; LOKSHTANOV, Daniel et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1941-1956, issn 0097-5397, 16 p.Article

Short Cycles Make W-hard Problems Hard : FPT Algorithms for W-hard Problems in Graphs with no Short CyclesRAMAN, Venkatesh; SAURABH, Saket.Algorithmica. 2008, Vol 52, Num 2, pp 203-225, issn 0178-4617, 23 p.Article

Improved parameterized algorithms for feedback set problems in weighted tournamentsRAMAN, Venkatesh; SAURABH, Saket.Lecture notes in computer science. 2004, pp 260-270, issn 0302-9743, isbn 3-540-23071-8, 11 p.Conference Paper

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 Unique Coverage and Its VariantsMISRA, Neeldhara; MOSER, Hannes; RAMAN, Venkatesh et al.Algorithmica. 2013, Vol 65, Num 3, pp 517-544, issn 0178-4617, 28 p.Article

Subexponential algorithms for partial cover problemsFOMIN, Fedor V; LOKSHTANOV, Daniel; RAMAN, Venkatesh et al.Information processing letters. 2011, Vol 111, Num 16, pp 814-818, issn 0020-0190, 5 p.Article

Parameterized algorithms for feedback set problems and their duals in tournamentsRAMAN, Venkatesh; SAURABH, Saket.Theoretical computer science. 2006, Vol 351, Num 3, pp 446-458, issn 0304-3975, 13 p.Conference Paper

Parameterized algorithm for eternal vertex coverFOMIN, Fedor V; GASPERS, Serge; GOLOVACH, Petr A et al.Information processing letters. 2010, Vol 110, Num 16, pp 702-706, issn 0020-0190, 5 p.Article

Faster fixed parameter tractable algorithms for undirected feedback vertex setRAMAN, Venkatesh; SAURABH, Saket; SUBRAMANIAN, C. R et al.Lecture notes in computer science. 2002, pp 241-248, issn 0302-9743, isbn 3-540-00142-5, 8 p.Conference Paper

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex DeletionCYGAN, Marek; PILIPCZUK, Marcin; PILIPCZUK, Michat et al.Algorithmica. 2012, Vol 64, Num 1, pp 170-188, issn 0178-4617, 19 p.Article

BANDWIDTH on AT-free graphsGOLOVACH, Petr; HEGGERNES, Pinar; KRATSCH, Dieter et al.Theoretical computer science. 2011, Vol 412, Num 50, pp 7001-7008, issn 0304-3975, 8 p.Article

Fast exponential algorithms for maximum r-regular induced subgraph problemsGUPTA, Sushmita; RAMAN, Venkatesh; SAURABH, Saket et al.Lecture notes in computer science. 2006, pp 139-151, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 13 p.Conference Paper

Fixed-Parameter Tractability of Satisfying Beyond the Number of VariablesCROWSTON, Robert; GUTIN, Gregory; JONES, Mark et al.Algorithmica. 2014, Vol 68, Num 3, pp 739-757, issn 0178-4617, 19 p.Article