Pawel Rzazewski
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
60
Venues
18
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
60 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs. | Pawel Rafal Bielinski, Marta Piecyk, Pawel Rzazewski |
| 2026 | ESA | Tree-Independence Number of P₅-Free Graphs with No Large Bicliques. | Vclav Blazej, Jochen Pascal Gollin, Toms Hons, Toms Masark, Martin Milanic, Pawel Rzazewski, Ondrej Such, Alexandra Wesolek |
| 2026 | SODA | Burling Graphs in Graphs with Large Chromatic Number. | Tara Abrishami, Marcin Brianski, James Davies, Xiying Du, Jana Masarkov, Pawel Rzazewski, Bartosz Walczak |
| 2026 | STACS | List Coloring Ordered Graphs with Forbidden Induced Subgraphs. | Marta Piecyk, Pawel Rzazewski |
| 2026 | SOFSEM | Complexity Aspects of Homomorphisms of Ordered Graphs. | Michal Certk, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski |
| 2025 | ECAI | On Approximate MMS Allocations on Restricted Graph Classes. | Vclav Blazej, Michal Debski, Zbigniew Lonc, Marta Piecyk, Pawel Rzazewski |
| 2025 | ISAAC | Parameterized Complexity of Directed Traveling Salesman Problem. | Vclav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Such |
| 2025 | ISAAC | Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number. | Maria Chudnovsky, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Pawel Rzazewski |
| 2025 | ICTAC | On Computational Aspects of Ordered Matching Problems. | Michal Certk, Andreas Emil Feldmann, Jaroslav Nesetril, Pawel Rzazewski |
| 2025 | WG | Polynomial-Time Recognition and Maximum Independent Set in Burling Graphs. | Pawel Rzazewski, Bartosz Walczak |
| 2025 | WoLLIC | Tabular Intermediate Logics Comparison. | Pawel Rzazewski, Michal M. Stronkowski |
| 2024 | ESA | List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. | Baris Can Esmer, Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2024 | ESA | Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. | Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel |
| 2024 | ICALP | Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. | Baris Can Esmer, Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2024 | ICALP | 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 |
| 2024 | MFCS | Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. | Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt |
| 2024 | SODA | Sparse induced subgraphs in | Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2024 | STOC | Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. | Peter Gartland, Daniel Lokshtanov, Toms Masark, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2024 | STACS | Max Weight Independent Set in Sparse Graphs with No Long Claws. | Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski |
| 2023 | ISAAC | Coloring and Recognizing Mixed Interval Graphs. | Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink |
| 2022 | ESA | Taming Graphs with No Large Creatures and Skinny Ladders. | Jakub Gajarsk, Lars Jaffke, Paloma T. Lima, Jana Novotn, Marcin Pilipczuk, Pawel Rzazewski, Uverton S. Souza |
| 2022 | ICALP | Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyrfs' Path Argument. | Konrad Majewski, Toms Masark, Jana Novotn, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski |
| 2022 | ISAAC | 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 |
| 2022 | ISAAC | List Locally Surjective Homomorphisms in Hereditary Graph Classes. | Pavel Dvork, Toms Masark, Jana Novotn, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk |
| 2022 | IWOCA | List Covering of Regular Multigraphs. | Jan Bok, Jir Fiala, Nikola Jedlickov, Jan Kratochvl, Pawel Rzazewski |
| 2022 | SODA | Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. | Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski |
| 2022 | SODA | Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. | Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2022 | WG | Computing List Homomorphisms in Geometric Intersection Graphs. | Sndor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski |
| 2022 | WG | Classifying Subset Feedback Vertex Set for H-Free Graphs. | Giacomo Paesani, Danil Paulusma, Pawel Rzazewski |
| 2021 | ESA | Faster 3-Coloring of Small-Diameter Graphs. | Michal Debski, Marta Piecyk, Pawel Rzazewski |
| 2021 | MFCS | Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. | Giacomo Paesani, Danil Paulusma, Pawel Rzazewski |
| 2021 | SODA | Induced subgraphs of bounded treewidth and the container method. | Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour |
| 2021 | STOC | Finding large induced sparse subgraphs in | Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2021 | STACS | Complexity of the List Homomorphism Problem in Hereditary Graph Classes. | Karolina Okrasa, Pawel Rzazewski |
| 2021 | STACS | Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. | Marta Piecyk, Pawel Rzazewski |
| 2020 | ESA | Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. | Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl |
| 2020 | ESA | Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. | Karolina Okrasa, Marta Piecyk, Pawel Rzazewski |
| 2020 | ISAAC | Sparsification Lower Bounds for List H-Coloring. | Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski |
| 2020 | SODA | Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. | Karolina Okrasa, Pawel Rzazewski |
| 2020 | WG | Clique-Width: Harnessing the Power of Atoms. | Konrad K. Dabrowski, Toms Masark, Jana Novotn, Danil Paulusma, Pawel Rzazewski |
| 2020 | WG | Parameterized Inapproximability of Independent Set in H-Free Graphs. | Pavel Dvork, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski |
| 2019 | ESA | Complexity of C | Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong |
| 2019 | ESA | Packing Directed Circuits Quarter-Integrally. | Toms Masark, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge |
| 2019 | GD | Representing Graphs and Hypergraphs by Touching Polygons in 3D. | William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff |
| 2019 | WG | Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. | Karolina Okrasa, Pawel Rzazewski |
| 2018 | RECOMB | Designing RNA Secondary Structures Is Hard. | douard Bonnet, Pawel Rzazewski, Florian Sikora |
| 2018 | STACS | Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. | Lszl Egri, Dniel Marx, Pawel Rzazewski |
| 2018 | WG | Optimality Program in Segment and String Graphs. | douard Bonnet, Pawel Rzazewski |
| 2018 | WG | ∀∃ℝ-Completeness and Area-Universality. | Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski |
| 2017 | STACS | Complexity of Token Swapping and its Variants. | douard Bonnet, Tillmann Miltzow, Pawel Rzazewski |
| 2016 | WG | Sequences of Radius k for Complete Bipartite Graphs. | Michal Debski, Zbigniew Lonc, Pawel Rzazewski |
| 2016 | WG | On Edge Intersection Graphs of Paths with 2 Bends. | Martin Pergel, Pawel Rzazewski |
| 2015 | PPAM | Massively Parallel Construction of the Cell Graph. | Krzysztof Kaczmarski, Pawel Rzazewski, Albert Wolant |
| 2015 | SOFSEM | Fixing Improper Colorings of Graphs. | Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski |
| 2014 | ADBIS | Improving High-Performance GPU Graph Traversal with Compression. | Krzysztof Kaczmarski, Piotr Przymus, Pawel Rzazewski |
| 2012 | ADBIS | Thrust and CUDA in Data Intensive Algorithms. | Krzysztof Kaczmarski, Pawel Rzazewski |
| 2012 | ISAAC | Beyond Homothetic Polygons: Recognition and Maximum Clique. | Konstanty Junosza-Szaniawski, Jan Kratochvl, Martin Pergel, Pawel Rzazewski |
| 2012 | WG | Determining the L(2, 1)-Span in Polynomial Space. | Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Pawel Rzazewski |
| 2011 | TAMC | Fast Exact Algorithm for | Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski |
| 2010 | IWOCA | On Improved Exact Algorithms for | Konstanty Junosza-Szaniawski, Pawel Rzazewski |