Pawel Rzazewski

199 papers A* 14A 16B 26C 6Journal 133Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Burling Graphs in Graphs with Large Chromatic Number. SODA Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masaríková, Pawel Rzazewski, Bartosz Walczak
2026	B	`conf`	Complexity Aspects of Homomorphisms of Ordered Graphs. SOFSEM Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2026	J	`jnl`	Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number. CoRR Daniel Lokshtanov, Michal Pilipczuk, Pawel Rzazewski
2026	A	`conf`	List Coloring Ordered Graphs with Forbidden Induced Subgraphs. STACS Marta Piecyk, Pawel Rzazewski
2026	J	`jnl`	Minimal obstructions to C5-coloring in hereditary graph classes. Inf. Comput. Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
2026	C	`conf`	On Computational Aspects of Cores of Ordered Graphs. RAMICS Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2026	J	`jnl`	QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes. CoRR Édouard Bonnet, Jadwiga Czyzewska, Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski
2025	J	`jnl`	A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. Discret. Math. Theor. Comput. Sci. Marcin Pilipczuk, Pawel Rzazewski
2025	A*	`conf`	An 11/6-Approximation Algorithm for Vertex Cover on String Graphs. SoCG Édouard Bonnet, Pawel Rzazewski
2025	J	`jnl`	Burling graphs in graphs with large chromatic number. CoRR Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masaríková, Pawel Rzazewski, Bartosz Walczak
2025	J	`jnl`	Complexity Aspects of Homomorphisms of Ordered Graphs. CoRR Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	J	`jnl`	Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth. SIAM J. Discret. Math. Tara Abrishami, Marcin Brianski, Jadwiga Czyzewska, Rose McCarty, Martin Milanic, Pawel Rzazewski, Bartosz Walczak
2025	J	`jnl`	Finding large CoRR Nadzieja Hodur, Monika Pilsniak, Magdalena Prorok, Pawel Rzazewski
2025	J	`jnl`	Hitting all longest paths in H-free graphs and H-graphs. CoRR Paloma Thomé de Lima, Amir Nikabadi, Pawel Rzazewski
2025	J	`jnl`	Induced matching treewidth and tree-independence number, revisited. CoRR Noga Alon, Martin Milanic, Pawel Rzazewski
2025	J	`jnl`	Kernelization for list CoRR Marta Piecyk, Astrid Pieterse, Pawel Rzazewski, Magnus Wahlström
2025	J	`jnl`	List coloring ordered graphs with forbidden induced subgraphs. CoRR Marta Piecyk, Pawel Rzazewski
2025	J	`jnl`	Odd Cycle Transversal on ACM Trans. Algorithms Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
2025	A	`conf`	On Approximate MMS Allocations on Restricted Graph Classes. ECAI Václav Blazej, Michal Debski, Zbigniew Lonc, Marta Piecyk, Pawel Rzazewski
2025	J	`jnl`	On Approximate MMS Allocations on Restricted Graph Classes. CoRR Václav Blazej, Michal Debski, Zbigniew Lonc, Marta Piecyk, Pawel Rzazewski
2025	J	`jnl`	On Computational Aspects of Cores of Ordered Graphs. CoRR Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	C	`conf`	On Computational Aspects of Ordered Matching Problems. ICTAC Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	J	`jnl`	On Computational Aspects of Ordered Matching Problems. CoRR Michal Certík, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski
2025	J	`jnl`	On coarse tree decompositions and coarse balanced separators. CoRR Tara Abrishami, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2025	B	`conf`	Parameterized Complexity of Directed Traveling Salesman Problem. ISAAC Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý
2025	J	`jnl`	Parameterized Complexity of Directed Traveling Salesman Problem. CoRR Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý
2025	B	`conf`	Polynomial-Time Recognition and Maximum Independent Set in Burling Graphs. WG Pawel Rzazewski, Bartosz Walczak
2025	B	`conf`	Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number. ISAAC Maria Chudnovsky, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Pawel Rzazewski
2025	C	`conf`	Tabular Intermediate Logics Comparison. WoLLIC Pawel Rzazewski, Michal M. Stronkowski
2025	J	`jnl`	Tabular intermediate logics comparison. CoRR Pawel Rzazewski, Michal M. Stronkowski
2024	B	`ed.`	19th International Symposium on Parameterized and Exact Computation, IPEC 2024, Royal Holloway, University of London, Egham, United Kingdom, September 4-6, 2024 IPEC Édouard Bonnet, Pawel Rzazewski
2024	J	`jnl`	An 11/6-Approximation Algorithm for Vertex Cover on String Graphs. CoRR Édouard Bonnet, Pawel Rzazewski
2024	J	`jnl`	Classifying subset feedback vertex set for H-free graphs. Theor. Comput. Sci. Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2024	J	`jnl`	Coloring squares of planar graphs with small maximum degree. Discuss. Math. Graph Theory Mateusz Krzyzinski, Pawel Rzazewski, Szymon Tur
2024	J	`jnl`	Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. ACM Trans. Algorithms Jacob Focke, Dániel Marx, Pawel Rzazewski
2024	A*	`conf`	Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. ICALP Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024	J	`jnl`	Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. CoRR Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024	J	`jnl`	Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
2024	J	`jnl`	Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. J. Comb. Theory B Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic
2024	J	`jnl`	List Covering of Regular Multigraphs with Semi-edges. Algorithmica Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
2024	A	`conf`	List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. ESA Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2024	J	`jnl`	Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ACM Trans. Comput. Theory Konrad Majewski, Tomás Masarík, Jana Masaríková, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2024	A	`conf`	Max Weight Independent Set in Sparse Graphs with No Long Claws. STACS Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski
2024	J	`jnl`	Maximum Partial List H-Coloring on P CoRR Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2024	A*	`conf`	Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2024	B	`conf`	Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
2024	J	`jnl`	Odd Cycle Transversal on P CoRR Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
2024	J	`jnl`	Polynomial-time recognition and maximum independent set in Burling graphs. CoRR Pawel Rzazewski, Bartosz Walczak
2024	A*	`conf`	Sparse induced subgraphs in SODA Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2024	J	`jnl`	Sparse induced subgraphs in P CoRR Maria Chudnovsky, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Pawel Rzazewski
2024	J	`jnl`	Taming Graphs with No Large Creatures and Skinny Ladders. SIAM J. Discret. Math. Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Masaríková, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2024	A*	`conf`	Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
2024	J	`jnl`	Towards the Chen-Raspaud conjecture. Discret. Math. Katarzyna Lyczek, Maria Nazarczuk, Pawel Rzazewski
2024	A	`conf`	Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. ESA Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
2024	J	`jnl`	Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
2023	J	`jnl`	A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. CoRR Marcin Pilipczuk, Pawel Rzazewski
2023	J	`jnl`	Clique-width: Harnessing the power of atoms. J. Graph Theory Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2023	J	`jnl`	Coloring and Recognizing Directed Interval Graphs. CoRR Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink
2023	B	`conf`	Coloring and Recognizing Mixed Interval Graphs. ISAAC Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink
2023	J	`jnl`	Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality. Discret. Comput. Geom. Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
2023	J	`jnl`	Complexity of Inf. Comput. Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
2023	J	`jnl`	Every graph is eventually Turán-good. J. Comb. Theory B Natasha Morrison, JD Nir, Sergey Norin, Pawel Rzazewski, Alexandra Wesolek
2023	J	`jnl`	Max Weight Independent Set in sparse graphs with no long claws. CoRR Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski
2023	J	`jnl`	Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2023	J	`jnl`	Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2023	J	`jnl`	Sparse induced subgraphs in P_6-free graphs. CoRR Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2023	J	`jnl`	Sparsification Lower Bounds for List ACM Trans. Comput. Theory Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2023	J	`jnl`	Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
2022	B	`conf`	Classifying Subset Feedback Vertex Set for H-Free Graphs. WG Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2022	J	`jnl`	Classifying Subset Feedback Vertex Set for H-Free Graphs. CoRR Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2022	B	`conf`	Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. ISAAC Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
2022	B	`conf`	Computing List Homomorphisms in Geometric Intersection Graphs. WG Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
2022	J	`jnl`	Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws. CoRR Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
2022	J	`jnl`	Computing list homomorphisms in geometric intersection graphs. CoRR Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
2022	J	`jnl`	Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2022	A*	`conf`	Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. SODA Jacob Focke, Dániel Marx, Pawel Rzazewski
2022	J	`jnl`	Degeneracy of J. Comb. Theory B Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
2022	J	`jnl`	Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks. Int. J. Appl. Math. Comput. Sci. Konstanty Junosza-Szaniawski, Dariusz Nogalski, Pawel Rzazewski
2022	J	`jnl`	Exact and approximation algorithms for sensor placement against DDoS attacks. CoRR Konstanty Junosza-Szaniawski, Dariusz Nogalski, Pawel Rzazewski
2022	J	`jnl`	Faster 3-Coloring of Small-Diameter Graphs. SIAM J. Discret. Math. Michal Debski, Marta Piecyk, Pawel Rzazewski
2022	J	`jnl`	Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. SIAM J. Discret. Math. Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2022	C	`conf`	List Covering of Regular Multigraphs. IWOCA Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
2022	B	`conf`	List Locally Surjective Homomorphisms in Hereditary Graph Classes. ISAAC Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk
2022	J	`jnl`	List Locally Surjective Homomorphisms in Hereditary Graph Classes. CoRR Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk
2022	J	`jnl`	List covering of regular multigraphs. CoRR Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski
2022	J	`jnl`	List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. CoRR Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski
2022	A*	`conf`	Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2022	J	`jnl`	Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
2022	J	`jnl`	Packing Directed Cycles Quarter- and Half-Integrally. Comb. Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2022	A*	`conf`	Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. SODA Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski
2022	A	`conf`	Taming Graphs with No Large Creatures and Skinny Ladders. ESA Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2022	J	`jnl`	Taming graphs with no large creatures and skinny ladders. CoRR Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2022	J	`jnl`	Tree decompositions with bounded independence number: beyond independent sets. CoRR Martin Milanic, Pawel Rzazewski
2021	A	`conf`	Complexity of the List Homomorphism Problem in Hereditary Graph Classes. STACS Karolina Okrasa, Pawel Rzazewski
2021	J	`jnl`	Constant congestion brambles in directed graphs. CoRR Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2021	J	`jnl`	Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. CoRR Jacob Focke, Dániel Marx, Pawel Rzazewski
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	A	`conf`	Faster 3-Coloring of Small-Diameter Graphs. ESA Michal Debski, Marta Piecyk, Pawel Rzazewski
2021	J	`jnl`	Faster 3-coloring of small-diameter graphs. CoRR Michal Debski, Marta Piecyk, Pawel Rzazewski
2021	B	`conf`	Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. MFCS Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2021	J	`jnl`	Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. CoRR Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2021	J	`jnl`	Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. SIAM J. Discret. Math. Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
2021	A*	`conf`	Finding large induced sparse subgraphs in STOC Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2021	J	`jnl`	Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs. SIAM J. Comput. Karolina Okrasa, Pawel Rzazewski
2021	A	`conf`	Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. STACS Marta Piecyk, Pawel Rzazewski
2021	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers WG Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski
2021	A*	`conf`	Induced subgraphs of bounded treewidth and the container method. SODA Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
2021	J	`jnl`	Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. CoRR Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski
2021	—	`conf`	Quasi-polynomial-time algorithm for Independent Set in SOSA Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2021	J	`jnl`	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2020	B	`conf`	Clique-Width: Harnessing the Power of Atoms. WG Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2020	J	`jnl`	Clique-Width: Harnessing the Power of Atoms. CoRR Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
2020	J	`jnl`	Complete colourings of hypergraphs. Discret. Math. Keith Edwards, Pawel Rzazewski
2020	J	`jnl`	Complexity of C CoRR Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
2020	J	`jnl`	Complexity of the list homomorphism problem in hereditary graph classes. CoRR Karolina Okrasa, Pawel Rzazewski
2020	J	`jnl`	Designing RNA Secondary Structures Is Hard. J. Comput. Biol. Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2020	A	`conf`	Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. ESA Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
2020	J	`jnl`	Finding large $H$-colorable subgraphs in hereditary graph classes. CoRR Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl
2020	A*	`conf`	Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. SODA Karolina Okrasa, Pawel Rzazewski
2020	J	`jnl`	Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth. CoRR Marta Piecyk, Pawel Rzazewski
2020	A	`conf`	Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. ESA Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
2020	J	`jnl`	Full complexity classification of the list homomorphism problem for bounded-treewidth graphs. CoRR Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
2020	J	`jnl`	Induced subgraphs of bounded treewidth and the container method. CoRR Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
2020	J	`jnl`	L(2, 1)-labeling of disk intersection graphs. Discret. Appl. Math. Joanna Sokól, Konstanty Junosza-Szaniawski, Pawel Rzazewski
2020	J	`jnl`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2020	B	`conf`	Parameterized Inapproximability of Independent Set in H-Free Graphs. WG Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2020	J	`jnl`	Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2020	J	`jnl`	Quasi-polynomial-time algorithm for Independent Set in P CoRR Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
2020	B	`conf`	Sparsification Lower Bounds for List H-Coloring. ISAAC Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2020	J	`jnl`	Sparsification Lower Bounds for List H-Coloring. CoRR Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2020	J	`jnl`	Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. Karolina Okrasa, Pawel Rzazewski
2019	A	`conf`	Complexity of C ESA Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
2019	J	`jnl`	Finding small-width connected path decompositions in polynomial time. Theor. Comput. Sci. Dariusz Dereniowski, Dorota Osula, Pawel Rzazewski
2019	J	`jnl`	Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. CoRR Karolina Okrasa, Pawel Rzazewski
2019	J	`jnl`	H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2019	J	`jnl`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2019	J	`jnl`	Optimality Program in Segment and String Graphs. Algorithmica Édouard Bonnet, Pawel Rzazewski
2019	A	`conf`	Packing Directed Circuits Quarter-Integrally. ESA Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2019	J	`jnl`	Packing directed circuits quarter-integrally. CoRR Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2019	A	`conf`	Representing Graphs and Hypergraphs by Touching Polygons in 3D. GD William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2019	J	`jnl`	Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2019	B	`conf`	Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. WG Karolina Okrasa, Pawel Rzazewski
2019	B	`conf`	Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2019	J	`jnl`	Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
2018	J	`jnl`	Achromatic and Harmonious Colorings of Circulant Graphs. J. Graph Theory Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2018	J	`jnl`	Complexity of Token Swapping and Its Variants. Algorithmica Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
2018	B	`conf`	Designing RNA Secondary Structures Is Hard. RECOMB Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2018	A	`conf`	Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. STACS László Egri, Dániel Marx, Pawel Rzazewski
2018	J	`jnl`	Finding small-width connected path decompositions in polynomial time. CoRR Dariusz Dereniowski, Dorota Osula, Pawel Rzazewski
2018	J	`jnl`	Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
2018	J	`jnl`	Fixing improper colorings of graphs. Theor. Comput. Sci. Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski
2018	J	`jnl`	Homothetic polygons and beyond: Maximal cliques in intersection graphs. Discret. Appl. Math. Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar
2018	J	`jnl`	Intersecting edge distinguishing colorings of hypergraphs. CoRR Karolina Okrasa, Pawel Rzazewski
2018	J	`jnl`	Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs. SIAM J. Discret. Math. Konstanty Junosza-Szaniawski, Pawel Rzazewski, Joanna Sokól, Krzysztof Wesek
2018	B	`conf`	Optimality Program in Segment and String Graphs. WG Édouard Bonnet, Pawel Rzazewski
2018	A*	`conf`	QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2018	J	`jnl`	Subexponential algorithms for variants of homomorphism problem in string graphs. CoRR Karolina Okrasa, Pawel Rzazewski
2018	B	`conf`	∀∃ℝ-Completeness and Area-Universality. WG Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
2017	A	`conf`	Complexity of Token Swapping and its Variants. STACS Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
2017	J	`jnl`	Designing RNA Secondary Structures is Hard. CoRR Édouard Bonnet, Pawel Rzazewski, Florian Sikora
2017	J	`jnl`	Erratum: Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski
2017	A*	`conf`	Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
2017	J	`jnl`	Harmonious and achromatic colorings of fragmentable hypergraphs. Eur. J. Comb. Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2017	J	`jnl`	On edge intersection graphs of paths with 2 bends. CoRR Martin Pergel, Pawel Rzazewski
2017	J	`jnl`	On edge intersection graphs of paths with 2 bends. Discret. Appl. Math. Martin Pergel, Pawel Rzazewski
2017	J	`jnl`	Optimality Program in Segment and String Graphs. CoRR Édouard Bonnet, Pawel Rzazewski
2017	J	`jnl`	Parallel algorithms constructing the cell graph. Concurr. Comput. Pract. Exp. Krzysztof Kaczmarski, Pawel Rzazewski, Albert Wolant
2017	J	`jnl`	QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2017	J	`jnl`	Sequences of radius k for complete bipartite graphs. CoRR Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2017	J	`jnl`	Sequences of radius k for complete bipartite graphs. Discret. Appl. Math. Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2017	J	`jnl`	Tight Euler tours in uniform hypergraphs - computational aspects. CoRR Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski
2017	J	`jnl`	Tight Euler tours in uniform hypergraphs - computational aspects. Discret. Math. Theor. Comput. Sci. Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski
2017	J	`jnl`	∀∃R-completeness and area-universality. CoRR Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski
2016	J	`jnl`	Complexity of Token Swapping and its Variants. CoRR Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski
2016	J	`jnl`	Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski
2016	J	`jnl`	Fixing improper colorings of graphs. CoRR Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski
2016	B	`conf`	On Edge Intersection Graphs of Paths with 2 Bends. WG Martin Pergel, Pawel Rzazewski
2016	B	`conf`	Sequences of Radius k for Complete Bipartite Graphs. WG Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2015	B	`conf`	Fixing Improper Colorings of Graphs. SOFSEM Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski
2015	J	`jnl`	Harmonious and achromatic colorings of fragmentable hypergraphs. Electron. Notes Discret. Math. Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2015	—	`conf`	Massively Parallel Construction of the Cell Graph. PPAM (1) Krzysztof Kaczmarski, Pawel Rzazewski, Albert Wolant
2015	J	`jnl`	Massively Parallel Construction of the Cell Graph. CoRR Krzysztof Kaczmarski, Pawel Rzazewski, Albert Wolant
2014	J	`jnl`	An Exact Algorithm for the Generalized List T-Coloring Problem. Discret. Math. Theor. Comput. Sci. Konstanty Junosza-Szaniawski, Pawel Rzazewski
2014	J	`jnl`	Exact algorithm for graph homomorphism and locally injective graph homomorphism. Inf. Process. Lett. Pawel Rzazewski
2014	J	`jnl`	Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. CoRR Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar
2014	—	`conf`	Improving High-Performance GPU Graph Traversal with Compression. ADBIS (2) Krzysztof Kaczmarski, Piotr Przymus, Pawel Rzazewski
2013	J	`jnl`	An Exact Algorithm for the Generalized List $T$-Coloring Problem. CoRR Konstanty Junosza-Szaniawski, Pawel Rzazewski
2013	J	`jnl`	Determining the Discret. Appl. Math. Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski
2013	J	`jnl`	Exact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism. CoRR Pawel Rzazewski
2013	J	`jnl`	Fast exact algorithm for L(2, 1)-labeling of graphs. Theor. Comput. Sci. Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
2012	B	`conf`	Beyond Homothetic Polygons: Recognition and Maximum Clique. ISAAC Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski
2012	B	`conf`	Determining the L(2, 1)-Span in Polynomial Space. WG Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski
2012	J	`jnl`	On the number of 2-packings in a connected graph. Discret. Math. Konstanty Junosza-Szaniawski, Pawel Rzazewski
2012	—	`conf`	Thrust and CUDA in Data Intensive Algorithms. ADBIS Workshops Krzysztof Kaczmarski, Pawel Rzazewski
2011	J	`jnl`	Determining L(2,1)-Span in Polynomial Space CoRR Konstanty Junosza-Szaniawski, Pawel Rzazewski
2011	C	`conf`	Fast Exact Algorithm for TAMC Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski
2011	J	`jnl`	On the complexity of exact algorithm for L(2, 1)-labeling of graphs. Inf. Process. Lett. Konstanty Junosza-Szaniawski, Pawel Rzazewski
2010	C	`conf`	On Improved Exact Algorithms for IWOCA Konstanty Junosza-Szaniawski, Pawel Rzazewski