( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Constant Congestion Brambles in Directed Graphs.

, , , и . SIAM J. Discret. Math., 36 (2): 922-938 (2022)

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 Silberring

 

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

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)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)Coloring and Recognizing Directed Interval Graphs., , , , , и . CoRR, (2023)Sparse induced subgraphs in P6-free graphs., , , , и . SODA, стр. 5291-5299. SIAM, (2024)Induced subgraphs of bounded treewidth and the container method., , , , и . SODA, стр. 1948-1964. SIAM, (2021)Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws., , , и . SODA, стр. 1448-1470. SIAM, (2022)Classifying Subset Feedback Vertex Set for H-Free Graphs., , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 412-424. Springer, (2022)A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number., и . CoRR, (2023)