Proper Interval Vertex Deletion

ISSN： 0178-4617

Source： Algorithmica, Vol.65, Iss.4, 2013-04, pp. : 845-867

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

Obtaining a Planar Graph by Vertex Deletion

By Marx Dániel Schlotter Ildikó

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 807-822

Springer Publishing Company

Access to resources Recommend Favorite

Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion

By Bevern René Moser Hannes Niedermeier Rolf

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 930-950

Springer Publishing Company

Access to resources Recommend Favorite

The bounded eight-vertex model

By Eloranta K.

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 539-552

Elsevier

Access to resources Recommend Favorite

On Cutwidth Parameterized by Vertex Cover

By Cygan Marek Lokshtanov Daniel Pilipczuk Marcin Pilipczuk Michał Saurabh Saket

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 940-953

Springer Publishing Company

Access to resources Recommend Favorite

Finding and Counting Vertex-Colored Subtrees

By Guillemot Sylvain

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 828-844

Springer Publishing Company

Access to resources Recommend Favorite