( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Coloring and Recognizing Mixed Interval Graphs.

, , , , , и . ISAAC, том 283 из LIPIcs, стр. 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Sascha Pawel

Pawel Durek

Pawel Moskał

 

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

Improving High-Performance GPU Graph Traversal with Compression., , и . ADBIS (2), том 312 из Advances in Intelligent Systems and Computing, стр. 201-214. Springer, (2014)On the complexity of exact algorithm for L(2, 1)-labeling of graphs., и . Inf. Process. Lett., 111 (14): 697-701 (2011)On edge intersection graphs of paths with 2 bends., и . Discret. Appl. Math., (2017)Determining L(2,1)-Span in Polynomial Space, и . CoRR, (2011)Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree., , , , , , и . J. Comb. Theory, Ser. B, (января 2024)Finding Large H-Colorable Subgraphs in Hereditary Graph Classes., , , , и . SIAM J. Discret. Math., 35 (4): 2357-2386 (2021)A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number., и . CoRR, (2023)On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest., , , , , и . Algorithmica, 82 (10): 2841-2866 (2020)Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs., , , , , и . Algorithmica, 83 (8): 2634-2650 (2021)Sparse induced subgraphs in P6-free graphs., , , , и . SODA, стр. 5291-5299. SIAM, (2024)