( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Treewidth is NP-Complete on Cubic Graphs (and related results).

, , , , , , , , и . CoRR, (2023)

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.

Paloma Kulisiewicz

Paloma Serrano

Paloma Cornejo

Paloma Díaz

Antonio Lima

 

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

A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs., и . CoRR, (2018)b-Coloring Parameterized by Clique-Width., , и . CoRR, (2020)On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs., и . ISAAC, том 248 из LIPIcs, стр. 43:1-43:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Treewidth Is NP-Complete on Cubic Graphs., , , , , , , , и . IPEC, том 285 из LIPIcs, стр. 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)b-Coloring Parameterized by Clique-Width., , и . Theory Comput. Syst., 68 (4): 1049-1081 (августа 2024)Finding connected secluded subgraphs., , , и . J. Comput. Syst. Sci., (2020)Parameterized Aspects of Strong Subgraph Closure., , , , и . Algorithmica, 82 (7): 2006-2038 (2020)Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs., , , , и . MFCS, том 117 из LIPIcs, стр. 83:1-83:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths., , , и . WG, том 12301 из Lecture Notes in Computer Science, стр. 148-160. Springer, (2020)A tight quasi-polynomial bound for Global Label Min-Cut., , , , и . CoRR, (2022)