( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Classifying Subset Feedback Vertex Set for H-Free Graphs.

, , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 412-424. Springer, (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 Golak

Pawel Urbanski

Sascha Pawel

Pawel Durek

Pawel Silberring

 

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

Improving High-Performance GPU Graph Traversal with Compression., , и . ADBIS (2), том 312 из Advances in Intelligent Systems and Computing, стр. 201-214. Springer, (2014)Representing Graphs and Hypergraphs by Touching Polygons in 3D., , , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 18-32. Springer, (2019)Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths., , и . SOSA, стр. 204-209. SIAM, (2021)Classifying Subset Feedback Vertex Set for H-Free Graphs., , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 412-424. Springer, (2022)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)Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs., , и . MFCS, том 202 из LIPIcs, стр. 82:1-82:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Sparse induced subgraphs in P7-free graphs of bounded clique number., , , , и . CoRR, (2024)Coloring squares of planar graphs with small maximum degree., , и . Discuss. Math. Graph Theory, 44 (3): 817 (2024)