The Turing way to parameterized complexity

Author： Cesati M.  

Publisher： Elsevier

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.67, Iss.4, 2003-12, pp. : 654-685

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

The Parameterized Complexity of the Shared Center Problem

By Chen Zhi-Zhong   Ma Wenji   Wang Lusheng  

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 269-293

Springer Publishing Company

Access to resources Recommend Favorite

The parameterized complexity of sequence alignment and consensus

By Bodlaender H.L.   Downey R.G.   Fellows M.R.   Wareham H.T.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 31-54

Elsevier

Access to resources Recommend Favorite

On the Parameterized Complexity of Layered Graph Drawing

By Dujmović Vida   Fellows Michael   Kitching Matthew   Liotta Giuseppe   McCartin Catherine   Nishimura Naomi   Ragde Prabhakar   Rosamond Frances   Whitesides Sue   Wood David  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 267-292

Springer Publishing Company

Access to resources Recommend Favorite

Parameterized circuit complexity and the W hierarchy

By Downey R.G.   Fellows M.R.   Regan K.W.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 97-115

Elsevier

Access to resources Recommend Favorite

The Parameterized Complexity of Local Search for TSP, More Refined

By Guo Jiong  

Algorithmica, Vol. 67, Iss. 1, 2013-09 ,pp. : 89-110

Springer Publishing Company

Access to resources Recommend Favorite