On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs. - Konstanty Junosza-Szaniawski; Pawel Rzazewski (IWOCA, 2010)

Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Mathieu Liedloff; Peter Rossmanith; Pawel Rzazewski (TAMC, 2011)

Determining L(2,1)-Span in Polynomial Space - Konstanty Junosza-Szaniawski; Pawel Rzazewski (CoRR, 2011)

On the complexity of exact algorithm for L(2, 1)-labeling of graphs. - Konstanty Junosza-Szaniawski; Pawel Rzazewski (Inf. Process. Lett., 2011)

Thrust and CUDA in Data Intensive Algorithms. - Krzysztof Kaczmarski; Pawel Rzazewski (ADBIS Workshops, 2012)

Beyond Homothetic Polygons: Recognition and Maximum Clique. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski (ISAAC, 2012)

Determining the L(2, 1)-Span in Polynomial Space. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Mathieu Liedloff; Pawel Rzazewski (WG, 2012)

On the number of 2-packings in a connected graph. - Konstanty Junosza-Szaniawski; Pawel Rzazewski (Discret. Math., 2012)

Determining the L(2, 1)L(2, 1)-span in polynomial space. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Mathieu Liedloff; Pawel Rzazewski (Discret. Appl. Math., 2013)

Fast exact algorithm for L(2, 1)-labeling of graphs. - Konstanty Junosza-Szaniawski; Jan Kratochvíl; Mathieu Liedloff; Peter Rossmanith; Pawel Rzazewski (Theor. Comput. Sci., 2013)

Improving High-Performance GPU Graph Traversal with Compression. - Krzysztof Kaczmarski; Piotr Przymus; Pawel Rzazewski (ADBIS (2), 2014)

Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. - Valentin E. Brimkov; Konstanty Junosza-Szaniawski; Sean Kafer; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski; Matthew Szczepankiewicz; Joshua Terhaar (CoRR, 2014)

An Exact Algorithm for the Generalized List T-Coloring Problem. - Konstanty Junosza-Szaniawski; Pawel Rzazewski (Discret. Math. Theor. Comput. Sci., 2014)

Exact algorithm for graph homomorphism and locally injective graph homomorphism. - Pawel Rzazewski (Inf. Process. Lett., 2014)

Massively Parallel Construction of the Cell Graph. - Krzysztof Kaczmarski; Pawel Rzazewski; Albert Wolant (PPAM (1), 2015)

Fixing Improper Colorings of Graphs. - Konstanty Junosza-Szaniawski; Mathieu Liedloff; Pawel Rzazewski (SOFSEM, 2015)

Harmonious and achromatic colorings of fragmentable hypergraphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (Electron. Notes Discret. Math., 2015)

Constructing Optimal k-Radius Sequences. - J. Adrian Bondy; Zbigniew Lonc; Pawel Rzazewski (SIAM J. Discret. Math., 2016)

Parallel algorithms constructing the cell graph. - Krzysztof Kaczmarski; Pawel Rzazewski; Albert Wolant (Concurr. Comput. Pract. Exp., 2017)

Sequences of radius k for complete bipartite graphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (Discret. Appl. Math., 2017)

On edge intersection graphs of paths with 2 bends. - Martin Pergel; Pawel Rzazewski (Discret. Appl. Math., 2017)

Tight Euler tours in uniform hypergraphs - computational aspects. - Zbigniew Lonc; Pawel Naroski; Pawel Rzazewski (Discret. Math. Theor. Comput. Sci., 2017)

Erratum: Constructing Optimal k-Radius Sequences. - J. Adrian Bondy; Zbigniew Lonc; Pawel Rzazewski (SIAM J. Discret. Math., 2017)

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. - Édouard Bonnet; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora (SoCG, 2018)

Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. - László Egri; Dániel Marx; Pawel Rzazewski (STACS, 2018)

∀∃ℝ-Completeness and Area-Universality. - Michael Gene Dobbins; Linda Kleist; Tillmann Miltzow; Pawel Rzazewski (WG, 2018)

Complexity of Token Swapping and Its Variants. - Édouard Bonnet; Tillmann Miltzow; Pawel Rzazewski (Algorithmica, 2018)

Intersecting edge distinguishing colorings of hypergraphs. - Karolina Okrasa; Pawel Rzazewski (CoRR, 2018)

Homothetic polygons and beyond: Maximal cliques in intersection graphs. - Valentin E. Brimkov; Konstanty Junosza-Szaniawski; Sean Kafer; Jan Kratochvíl; Martin Pergel; Pawel Rzazewski; Matthew Szczepankiewicz; Joshua Terhaar (Discret. Appl. Math., 2018)

Achromatic and Harmonious Colorings of Circulant Graphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (J. Graph Theory, 2018)

Fine-grained complexity of coloring unit disks and balls. - Csaba Biró; Édouard Bonnet; Dániel Marx; Tillmann Miltzow; Pawel Rzazewski (J. Comput. Geom., 2018)

Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs. - Konstanty Junosza-Szaniawski; Pawel Rzazewski; Joanna Sokól; Krzysztof Wesek (SIAM J. Discret. Math., 2018)

Fixing improper colorings of graphs. - Valentin Garnero; Konstanty Junosza-Szaniawski; Mathieu Liedloff; Pedro Montealegre 001; Pawel Rzazewski (Theor. Comput. Sci., 2018)

Complexity of Ck-Coloring in Hereditary Classes of Graphs. - Maria Chudnovsky; Shenwei Huang; Pawel Rzazewski; Sophie Spirkl; Mingxian Zhong (ESA, 2019)

Packing Directed Circuits Quarter-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (ESA, 2019)

Representing Graphs and Hypergraphs by Touching Polygons in 3D. - William S. Evans; Pawel Rzazewski; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (GD, 2019)

Optimality Program in Segment and String Graphs. - Édouard Bonnet; Pawel Rzazewski (Algorithmica, 2019)

H-colouring Pt-free graphs in subexponential time. - Carla Groenland; Karolina Okrasa; Pawel Rzazewski; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Discret. Appl. Math., 2019)

Finding small-width connected path decompositions in polynomial time. - Dariusz Dereniowski; Dorota Osula; Pawel Rzazewski (Theor. Comput. Sci., 2019)

Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. - Karolina Okrasa; Marta Piecyk; Pawel Rzazewski (ESA, 2020)

Sparsification Lower Bounds for List H-Coloring. - Hubie Chen; Bart M. P. Jansen; Karolina Okrasa; Astrid Pieterse; Pawel Rzazewski (ISAAC, 2020)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. - Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (Algorithmica, 2020)

Quasi-polynomial-time algorithm for Independent Set in Pt-free and C>t-free graphs via shrinking the space of connecting subgraphs. - Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (CoRR, 2020)

L(2, 1)-labeling of disk intersection graphs. - Joanna Sokól; Konstanty Junosza-Szaniawski; Pawel Rzazewski (Discret. Appl. Math., 2020)

Complete colourings of hypergraphs. - Keith Edwards; Pawel Rzazewski (Discret. Math., 2020)

Designing RNA Secondary Structures Is Hard. - Édouard Bonnet; Pawel Rzazewski; Florian Sikora (J. Comput. Biol., 2020)

Subexponential algorithms for variants of the homomorphism problem in string graphs. - Karolina Okrasa; Pawel Rzazewski (J. Comput. Syst. Sci., 2020)

Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths. - Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (SOSA, 2021)

Complexity of the List Homomorphism Problem in Hereditary Graph Classes. - Karolina Okrasa; Pawel Rzazewski (STACS, 2021)

Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. - Marta Piecyk; Pawel Rzazewski (STACS, 2021)

Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time. - Peter Gartland; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (STOC, 2021)

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. - Jana Novotná 001; Karolina Okrasa; Michal Pilipczuk; Pawel Rzazewski; Erik Jan van Leeuwen; Bartosz Walczak (Algorithmica, 2021)

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. - Marthe Bonamy; Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora; Stéphan Thomassé (J. ACM, 2021)

Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs. - Karolina Okrasa; Pawel Rzazewski (SIAM J. Comput., 2021)

Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. - Maria Chudnovsky; Jason King; Michal Pilipczuk; Pawel Rzazewski; Sophie Spirkl (SIAM J. Discret. Math., 2021)

Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. - Michal Debski; Zbigniew Lonc; Karolina Okrasa; Marta Piecyk; Pawel Rzazewski (ISAAC, 2022)

List Locally Surjective Homomorphisms in Hereditary Graph Classes. - Pavel Dvorák; Tomás Masarík; Jana Novotná 001; Monika Krawczyk; Pawel Rzazewski; Aneta Zuk (ISAAC, 2022)

List Covering of Regular Multigraphs. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Pawel Rzazewski (IWOCA, 2022)

Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. - Tara Abrishami; Maria Chudnovsky; Cemil Dibek; Pawel Rzazewski (SODA, 2022)

Computing List Homomorphisms in Geometric Intersection Graphs. - Sándor Kisfaludi-Bak; Karolina Okrasa; Pawel Rzazewski (WG, 2022)

Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks. - Konstanty Junosza-Szaniawski; Dariusz Nogalski; Pawel Rzazewski (Int. J. Appl. Math. Comput. Sci., 2022)

Tree decompositions with bounded independence number: beyond independent sets. - Martin Milanic; Pawel Rzazewski (CoRR, 2022)

Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. - Marthe Bonamy; Nicolas Bousquet 001; Michal Pilipczuk; Pawel Rzazewski; Stéphan Thomassé; Bartosz Walczak (J. Comb. Theory B, 2022)

Constant Congestion Brambles in Directed Graphs. - Tomás Masarík; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (SIAM J. Discret. Math., 2022)

Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. - Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (SIAM J. Discret. Math., 2022)

Faster 3-Coloring of Small-Diameter Graphs. - Michal Debski; Marta Piecyk; Pawel Rzazewski (SIAM J. Discret. Math., 2022)

Packing Directed Cycles Quarter- and Half-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (Comb., 2022)

Coloring and Recognizing Mixed Interval Graphs. - Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Felix Klesen; Pawel Rzazewski; Alexander Wolff 001; Johannes Zink 001 (ISAAC, 2023)

Coloring and Recognizing Directed Interval Graphs. - Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Felix Klesen; Pawel Rzazewski; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

Sparse induced subgraphs in P_6-free graphs. - Maria Chudnovsky; Rose McCarty; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (CoRR, 2023)

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. - Carla Groenland; Isja Mannens; Jesper Nederlof; Marta Piecyk; Pawel Rzazewski (CoRR, 2023)

Every graph is eventually Turán-good. - Natasha Morrison; JD Nir; Sergey Norin; Pawel Rzazewski; Alexandra Wesolek (J. Comb. Theory B, 2023)

Sparsification Lower Bounds for List H-Coloring. - Hubie Chen; Bart M. P. Jansen; Karolina Okrasa; Astrid Pieterse; Pawel Rzazewski (ACM Trans. Comput. Theory, 2023)

Parameterized Inapproximability of Independent Set in H-Free Graphs. - Pavel Dvorák; Andreas Emil Feldmann; Ashutosh Rai 001; Pawel Rzazewski (Algorithmica, 2023)

Complexity of Ck-coloring in hereditary classes of graphs. - Maria Chudnovsky; Shenwei Huang; Pawel Rzazewski; Sophie Spirkl; Mingxian Zhong (Inf. Comput., 2023)

Completeness for the Complexity Class $ forall exists mathbb {R}$ and Area-Universality. - Michael Gene Dobbins; Linda Kleist; Tillmann Miltzow; Pawel Rzazewski (Discret. Comput. Geom., 2023)

Clique-width: Harnessing the power of atoms. - Konrad K. Dabrowski; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Pawel Rzazewski (J. Graph Theory, 2023)

List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. - Baris Can Esmer; Jacob Focke; Dániel Marx; Pawel Rzazewski (ESA, 2024)

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. - Paloma T. Lima; Martin Milanic; Peter Mursic; Karolina Okrasa; Pawel Rzazewski; Kenny Storgel (ESA, 2024)

Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. - Baris Can Esmer; Jacob Focke; Dániel Marx; Pawel Rzazewski (ICALP, 2024)

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. - Carla Groenland; Isja Mannens; Jesper Nederlof; Marta Piecyk; Pawel Rzazewski (ICALP, 2024)

Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. - Jan Goedgebeur; Jorik Jooken; Karolina Okrasa; Pawel Rzazewski; Oliver Schaudt (MFCS, 2024)

Sparse induced subgraphs in P6-free graphs. - Maria Chudnovsky; Rose McCarty; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (SODA, 2024)

Max Weight Independent Set in Sparse Graphs with No Long Claws. - Tara Abrishami; Maria Chudnovsky; Marcin Pilipczuk; Pawel Rzazewski (STACS, 2024)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov; Tomás Masarík; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (STOC, 2024)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (CoRR, 2024)

Polynomial-time recognition and maximum independent set in Burling graphs. - Pawel Rzazewski; Bartosz Walczak (CoRR, 2024)

Maximum Partial List H-Coloring on P5-free graphs in polynomial time. - Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (CoRR, 2024)

Sparse induced subgraphs in P7-free graphs of bounded clique number. - Maria Chudnovsky; Jadwiga Czyzewska; Kacper Kluk; Marcin Pilipczuk; Pawel Rzazewski (CoRR, 2024)

Coloring squares of planar graphs with small maximum degree. - Mateusz Krzyzinski; Pawel Rzazewski; Szymon Tur (Discuss. Math. Graph Theory, 2024)

Induced Subgraphs of Bounded Treewidth and the Container Method. - Tara Abrishami; Maria Chudnovsky; Marcin Pilipczuk; Pawel Rzazewski; Paul D. Seymour (SIAM J. Comput., 2024)

Taming Graphs with No Large Creatures and Skinny Ladders. - Jakub Gajarský; Lars Jaffke; Paloma T. Lima; Jana Masaríková; Marcin Pilipczuk; Pawel Rzazewski; Uéverton S. Souza (SIAM J. Discret. Math., 2024)

Classifying subset feedback vertex set for H-free graphs. - Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (Theor. Comput. Sci., 2024)

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. - Konrad Majewski; Tomás Masarík; Jana Masaríková; Karolina Okrasa; Marcin Pilipczuk; Pawel Rzazewski; Marek Sokolowski 001 (ACM Trans. Comput. Theory, 2024)

Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. - Tara Abrishami; Maria Chudnovsky; Cemil Dibek; Sepehr Hajebi; Pawel Rzazewski; Sophie Spirkl; Kristina Vuskovic (J. Comb. Theory B, 2024)

List Covering of Regular Multigraphs with Semi-edges. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Pawel Rzazewski (Algorithmica, 2024)

Towards the Chen-Raspaud conjecture. - Katarzyna Lyczek; Maria Nazarczuk; Pawel Rzazewski (Discret. Math., 2024)

Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. - Jacob Focke; Dániel Marx; Pawel Rzazewski (ACM Trans. Algorithms, 2024)

An 11/6-Approximation Algorithm for Vertex Cover on String Graphs. - Édouard Bonnet; Pawel Rzazewski (SoCG, 2025)

Tabular Intermediate Logics Comparison. - Pawel Rzazewski; Michal M. Stronkowski (WoLLIC, 2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. - Marcin Pilipczuk; Pawel Rzazewski (Discret. Math. Theor. Comput. Sci., 2025)

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth. - Tara Abrishami; Marcin Brianski; Jadwiga Czyzewska; Rose McCarty; Martin Milanic; Pawel Rzazewski; Bartosz Walczak (SIAM J. Discret. Math., 2025)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (ACM Trans. Algorithms, 2025)

On coarse tree decompositions and coarse balanced separators. - Tara Abrishami; Jadwiga Czyzewska; Kacper Kluk; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (CoRR, 2025)

Finding large k-colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs. - Nadzieja Hodur; Monika Pilsniak; Magdalena Prorok; Pawel Rzazewski (CoRR, 2025)

Parameterized Complexity of Directed Traveling Salesman Problem. - Václav Blazej; Andreas Emil Feldmann; Foivos Fioravantes; Pawel Rzazewski; Ondrej Suchý 001 (CoRR, 2025)

Kernelization for list H-coloring for graphs with small vertex cover. - Marta Piecyk; Astrid Pieterse; Pawel Rzazewski; Magnus Wahlström (CoRR, 2025)

On Approximate MMS Allocations on Restricted Graph Classes. - Václav Blazej; Michal Debski; Zbigniew Lonc; Marta Piecyk; Pawel Rzazewski (CoRR, 2025)