( en | de | ru )

 

Disambiguation of "Rzazewski, Pawel"

Author of the publication

copydeleteadd this publication to your clipboard
Coloring and Recognizing Mixed Interval Graphs.

, , , , , and . ISAAC, volume 283 of LIPIcs, page 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. You can also use the button next to the name to display some publications already assigned to the person.

Pawel Silberring

Pawel Moskał

Pawel Paczkowski

Pawel Urbanski

Pawel Golak

 

Other publications of authors with the same name

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)Determining L(2,1)-Span in Polynomial Space, and . CoRR, (2011)Finding Large H-Colorable Subgraphs in Hereditary Graph Classes., , , , and . SIAM J. Discret. Math., 35 (4): 2357-2386 (2021)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)List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs., , , and . CoRR, (2022)Coloring and Recognizing Directed Interval Graphs., , , , , and . CoRR, (2023)