( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number.

, и . 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.

Pawel Urbanski

Pawel Golak

Pawel Durek

Sascha Pawel

Pawel Silberring

 

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

Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization., , и . STACS, том 96 из LIPIcs, стр. 27:1-27:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Clique-Width: Harnessing the Power of Atoms., , , , и . WG, том 12301 из Lecture Notes in Computer Science, стр. 119-133. Springer, (2020)Faster 3-Coloring of Small-Diameter Graphs., , и . SIAM J. Discret. Math., 36 (3): 2205-2224 (сентября 2022)Homothetic polygons and beyond: Maximal cliques in intersection graphs., , , , , , , и . Discret. Appl. Math., (2018)Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs., , и . ESA, том 173 из LIPIcs, стр. 74:1-74:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)List Covering of Regular Multigraphs., , , , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 228-242. Springer, (2022)Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time., , , , и . STOC, стр. 330-341. ACM, (2021)Exact algorithm for graph homomorphism and locally injective graph homomorphism.. Inf. Process. Lett., 114 (7): 387-391 (2014)On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs., и . IWOCA, том 6460 из Lecture Notes in Computer Science, стр. 34-37. Springer, (2010)Beyond Homothetic Polygons: Recognition and Maximum Clique., , , и . ISAAC, том 7676 из Lecture Notes in Computer Science, стр. 619-628. Springer, (2012)