Pawel Rzazewski

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 139

Top Venues

CoRR

SIAM J. Discret. Math.

Algorithmica

Publications

Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. ICALP (2024)
Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. 53 (3) (2024)
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
-free Graphs in Polynomial Time. CoRR (2024)
Jacob Focke, Dániel Marx, Pawel Rzazewski
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. ACM Trans. Algorithms 20 (2) (2024)
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. J. Comb. Theory, Ser. B 164 (2024)
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. CoRR (2024)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying subset feedback vertex set for H-free graphs. Theor. Comput. Sci. 1003 (2024)
Mateusz Krzyzinski, Pawel Rzazewski, Szymon Tur
Coloring squares of planar graphs with small maximum degree. Discuss. Math. Graph Theory 44 (3) (2024)
Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP (2024)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
List Covering of Regular Multigraphs with Semi-edges. Algorithmica 86 (3) (2024)
Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR (2024)
Pawel Rzazewski, Bartosz Walczak
Polynomial-time recognition and maximum independent set in Burling graphs. CoRR (2024)
Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS (2024)
Katarzyna Lyczek, Maria Nazarczuk, Pawel Rzazewski
Towards the Chen-Raspaud conjecture. Discret. Math. 347 (3) (2024)
Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski
Max Weight Independent Set in Sparse Graphs with No Long Claws. STACS (2024)
Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC (2024)
Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
-free graphs. SODA (2024)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica 85 (4) (2023)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-width: Harnessing the power of atoms. J. Graph Theory 104 (4) (2023)
Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski
Max Weight Independent Set in sparse graphs with no long claws. CoRR (2023)
Natasha Morrison, JD Nir, Sergey Norin, Pawel Rzazewski, Alexandra Wesolek
Every graph is eventually Turán-good. J. Comb. Theory, Ser. B 162 (2023)
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
-coloring in hereditary classes of graphs. Inf. Comput. 292 (2023)
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink
Coloring and Recognizing Mixed Interval Graphs. ISAAC (2023)
Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality. Discret. Comput. Geom. 70 (1) (2023)
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink
Coloring and Recognizing Directed Interval Graphs. CoRR (2023)
Marcin Pilipczuk, Pawel Rzazewski
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. CoRR (2023)
Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR (2023)
Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR (2023)
Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
Sparse induced subgraphs in P_6-free graphs. CoRR (2023)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying Subset Feedback Vertex Set for H-Free Graphs. CoRR (2022)
Martin Milanic, Pawel Rzazewski
Tree decompositions with bounded independence number: beyond independent sets. CoRR (2022)
Konstanty Junosza-Szaniawski, Dariusz Nogalski, Pawel Rzazewski
Exact and approximation algorithms for sensor placement against DDoS attacks. CoRR (2022)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. SIAM J. Discret. Math. 36 (4) (2022)
Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. 36 (2) (2022)
Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk
List Locally Surjective Homomorphisms in Hereditary Graph Classes. ISAAC (2022)
Konstanty Junosza-Szaniawski, Dariusz Nogalski, Pawel Rzazewski
Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks. Int. J. Appl. Math. Comput. Sci. 32 (1) (2022)
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Taming graphs with no large creatures and skinny ladders. CoRR (2022)
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Taming Graphs with No Large Creatures and Skinny Ladders. ESA (2022)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
List Covering of Regular Multigraphs. IWOCA (2022)
Jacob Focke, Dániel Marx, Pawel Rzazewski
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. SODA (2022)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying Subset Feedback Vertex Set for H-Free Graphs. WG (2022)
Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Packing Directed Cycles Quarter- and Half-Integrally. Comb. 42 (Supplement 2) (2022)
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. SODA (2022)
Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
Computing list homomorphisms in geometric intersection graphs. CoRR (2022)
Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
-free graphs with no large complete bipartite subgraphs. J. Comb. Theory, Ser. B 152 (2022)
Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. ISAAC (2022)
Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk
List Locally Surjective Homomorphisms in Hereditary Graph Classes. CoRR (2022)
Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
Computing List Homomorphisms in Geometric Intersection Graphs. WG (2022)
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP (2022)
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR (2022)
Michal Debski, Marta Piecyk, Pawel Rzazewski
Faster 3-Coloring of Small-Diameter Graphs. SIAM J. Discret. Math. 36 (3) (2022)
Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
List covering of regular multigraphs. CoRR (2022)
Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws. CoRR (2022)
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. CoRR (2022)
Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
-free graphs in quasipolynomial time. STOC (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR (2021)
Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
-free graphs via shrinking the space of induced paths. SOSA (2021)
Jacob Focke, Dániel Marx, Pawel Rzazewski
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. CoRR (2021)
Karolina Okrasa, Pawel Rzazewski
Complexity of the List Homomorphism Problem in Hereditary Graph Classes. STACS (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68 (2) (2021)
Michal Debski, Marta Piecyk, Pawel Rzazewski
Faster 3-coloring of small-diameter graphs. CoRR (2021)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. CoRR (2021)
Karolina Okrasa, Pawel Rzazewski
Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs. SIAM J. Comput. 50 (2) (2021)
Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Constant congestion brambles in directed graphs. CoRR (2021)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83 (8) (2021)
Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. SIAM J. Discret. Math. 35 (4) (2021)
Michal Debski, Marta Piecyk, Pawel Rzazewski
Faster 3-Coloring of Small-Diameter Graphs. ESA (2021)
Marta Piecyk, Pawel Rzazewski
Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. STACS (2021)
Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
Induced subgraphs of bounded treewidth and the container method. SODA (2021)
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. CoRR (2021)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. MFCS (2021)
Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
Finding large $H$-colorable subgraphs in hereditary graph classes. CoRR (2020)
Édouard Bonnet, Pawel Rzazewski, Florian Sikora
Designing RNA Secondary Structures Is Hard. J. Comput. Biol. 27 (3) (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. CoRR (2020)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Sparsification Lower Bounds for List H-Coloring. ISAAC (2020)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Sparsification Lower Bounds for List H-Coloring. CoRR (2020)
Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
Induced subgraphs of bounded treewidth and the container method. CoRR (2020)
Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
-free graphs via shrinking the space of connecting subgraphs. CoRR (2020)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR (2020)
Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. ESA (2020)
Keith Edwards, Pawel Rzazewski
Complete colourings of hypergraphs. Discret. Math. 343 (2) (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. WG (2020)
Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
Parameterized Inapproximability of Independent Set in H-Free Graphs. WG (2020)
Joanna Sokól, Konstanty Junosza-Szaniawski, Pawel Rzazewski
L(2, 1)-labeling of disk intersection graphs. Discret. Appl. Math. 277 (2020)
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
-coloring in hereditary classes of graphs. CoRR (2020)
Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
Full complexity classification of the list homomorphism problem for bounded-treewidth graphs. CoRR (2020)
Karolina Okrasa, Pawel Rzazewski
Complexity of the list homomorphism problem in hereditary graph classes. CoRR (2020)
Karolina Okrasa, Pawel Rzazewski
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. SODA (2020)
Karolina Okrasa, Pawel Rzazewski
Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. 109 (2020)
Marta Piecyk, Pawel Rzazewski
Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth. CoRR (2020)
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82 (10) (2020)
Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. ESA (2020)
William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Representing Graphs and Hypergraphs by Touching Polygons in 3D. Graph Drawing (2019)
William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR (2019)
Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Packing directed circuits quarter-integrally. CoRR (2019)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR (2019)
Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267 (2019)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC (2019)
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
-Coloring in Hereditary Classes of Graphs. ESA (2019)
Édouard Bonnet, Pawel Rzazewski
Optimality Program in Segment and String Graphs. Algorithmica 81 (7) (2019)

Pawel Rzazewski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pawel Rzazewski