( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Clique-Width is NP-Complete.

, , , и . SIAM J. Discret. Math., 23 (2): 909-939 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Christine Fellows

Edward Fellows

Michael R Schön

Michael R Glaubitz

Michael R Schön

 

Другие публикации лиц с тем же именем

Fixed Parameter Tractability and Completeness., и . Complexity Theory: Current Research, стр. 191-225. Cambridge University Press, (1992)Quadratic Kernelization for Convex Recoloring of Trees., , , , , и . Algorithmica, 61 (2): 362-388 (2011)Polynomial Time Data Reduction for Dominating Set, , и . CoRR, (2002)Determining the Winner of a Dodgson Election is Hard., , , , и . FSTTCS, том 8 из LIPIcs, стр. 459-468. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)The Private Neighbor Cube., , , и . SIAM J. Discret. Math., 7 (1): 41-47 (1994)Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average., , , , , , и . FSTTCS, том 13 из LIPIcs, стр. 229-240. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders., и . TOCT, 6 (4): 16:1-16:26 (2014)An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem., , , , и . Theory Comput. Syst., 41 (3): 479-492 (2007)Processor Utilization in a Linearly Connected Parallel Processing System., и . IEEE Trans. Computers, 37 (5): 594-603 (1988)Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover., , , и . IWPEC, том 3162 из Lecture Notes in Computer Science, стр. 271-280. Springer, (2004)