From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.

J. Chlebíková, и C. Dallard. IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 136-147. Springer, (2019)

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.

Clément Grimal

Clément Ménier

Clément Dupont

Clément Quinton

Felix Clément

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

Proportionally dense subgraph of maximum size: complexity and approximation.J. Chlebíková, C. Bazgan, C. Dallard, и T. Pontoizeau. CoRR, (2019)Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure.C. Dallard, M. Milanic, и K. Storgel. WG, том 12301 из Lecture Notes in Computer Science, стр. 92-105. Springer, (2020)On Constrained Intersection Representations of Graphs and Digraphs.F. Cicalese, C. Dallard, и M. Milanic. ISAAC, том 248 из LIPIcs, стр. 38:1-38:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.J. Chlebíková, и C. Dallard. IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 136-147. Springer, (2019)Detecting K2,3 as an Induced Minor.C. Dallard, M. Dumas, C. Hilaire, M. Milanic, A. Perez, и N. Trotignon. IWOCA, том 14764 из Lecture Notes in Computer Science, стр. 151-164. Springer, (2024)Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure.C. Dallard, M. Milanic, и K. Storgel. SIAM J. Discret. Math., 35 (4): 2618-2646 (2021)Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs.N. Chiarelli, C. Dallard, A. Darmann, S. Lendl, M. Milanic, P. Mursic, N. Pivac, и U. Pferschy. ADT, том 13023 из Lecture Notes in Computer Science, стр. 243-257. Springer, (2021)Graphs with at most two moplexes.C. Dallard, R. Ganian, M. Hatzel, M. Krnc, и M. Milanic. CoRR, (2021)Functionality of box intersection graphs.C. Dallard, V. Lozin, M. Milanic, K. Storgel, и V. Zamaraev. CoRR, (2023)Computing Tree Decompositions with Small Independence Number.C. Dallard, F. Fomin, P. Golovach, T. Korhonen, и M. Milanic. ICALP, том 297 из LIPIcs, стр. 51:1-51:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

BibSonomy

Disambiguation