( en | de | ru )

 

Disambiguation of "Rzazewski, Pawel"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of Token Swapping and its Variants.

, , and . STACS, volume 66 of LIPIcs, page 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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. You can also use the button next to the name to display some publications already assigned to the person.

Pawel Urbanski

Pawel Golak

Pawel Durek

Sascha Pawel

Pawel Paczkowski

 

Other publications of authors with the same name

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