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

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

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)Graphs with at most two moplexes.C. Dallard, R. Ganian, M. Hatzel, M. Krnc, и M. Milanic. CoRR, (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)Functionality of box intersection graphs.C. Dallard, V. Lozin, M. Milanic, K. Storgel, и V. Zamaraev. CoRR, (2023)Complexity of Scheduling for DARP with Soft Ride Times.J. Chlebíková, C. Dallard, и N. Paulsen. CIAC, том 11485 из Lecture Notes in Computer Science, стр. 149-160. Springer, (2019)Graphs with Two Moplexes.C. Dallard, R. Ganian, M. Hatzel, M. Krnc, и M. Milanic. LAGOS, том 195 из Procedia Computer Science, стр. 248-256. Elsevier, (2021)On Girth and the Parameterized Complexity of Token Sliding and Token Jumping.V. Bartier, N. Bousquet, C. Dallard, K. Lomer, и A. Mouawad. ISAAC, том 181 из LIPIcs, стр. 44:1-44:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Allocation of indivisible items with individual preference graphs.N. Chiarelli, C. Dallard, A. Darmann, S. Lendl, M. Milanic, P. Mursic, U. Pferschy, и N. Pivac. Discret. Appl. Math., (июля 2023)Computing Tree Decompositions with Small Independence Number.C. Dallard, F. Fomin, P. Golovach, T. Korhonen, и M. Milanic. CoRR, (2022)Treewidth versus clique number. II. Tree-independence number.C. Dallard, M. Milanic, и K. Storgel. J. Comb. Theory B, (января 2024)

BibSonomy

Disambiguation