( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.

, и . TOCT, 6 (4): 16:1-16:26 (2014)

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 Koch

 

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

Quadratic Kernelization for Convex Recoloring of Trees., , , , , и . Algorithmica, 61 (2): 362-388 (2011)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)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)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)The Private Neighbor Cube., , , и . SIAM J. Discret. Math., 7 (1): 41-47 (1994)A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals., , и . J. Univers. Comput. Sci., 3 (11): 1194-1198 (1997)On problems without polynomial kernels., , , и . J. Comput. Syst. Sci., 75 (8): 423-434 (2009)Proving NP-hardness for clique-width II: non-approximability of clique-width, , , и . Electron. Colloquium Comput. Complex., (2005)