Publikacje

Paweł Rzążewski

Liczba publikacji: 110

2025

• Paweł Rzążewski , Marcin Pilipczuk, A polynomial bound on the number of minimal separators and potential maximal cliques in P6-free graphs of bounded clique number, Discrete Mathematics and Theoretical Computer Science, 27 (2) 2025, s. 1-5. Zobacz w PBN
• Paweł Rzążewski , Edouard Bonnet, An 11/6-Approximation Algorithm for Vertex Cover on String Graphs, 41st International Symposium on Computational Geometry (SoCG 2025), Kanazawa, Japan, 22 czerwca 2025 - 26 czerwca 2025. Zobacz w PBN
• Paweł Rzążewski , Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Bartosz Walczak, Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth, SIAM JOURNAL ON DISCRETE MATHEMATICS, 39 (2) 2025, s. 1189 – 1200. Zobacz w PBN
• Paweł Rzążewski , Akanksha Agrawal, Paloma Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Odd Cycle Transversal on P5-free Graphs in Polynomial Time, ACM Transactions on Algorithms, 21 (2) 2025, s. 1-14. Zobacz w PBN
• Michał Dębski, Zbigniew Lonc, Marta Piecyk, Paweł Rzążewski , Václav Blažej, On Approximate MMS Allocations on Restricted Graph Classes, 28th European Conference on Artificial Intelligence (ECAI 2025), Bolonia, Italy, 24 października 2025 - 29 października 2025. Zobacz w PBN

2024

• Paweł Rzążewski , Giacomo Paesani, Daniël Paulusma, Classifying subset feedback vertex set for H-free graphs, Theoretical Computer Science, 1003 2024, s. 1-12. Zobacz w PBN
• Paweł Rzążewski , Mateusz Krzyziński, Szymon Tur, Coloring squares of planar graphs with small maximum degree, Discussiones Mathematicae - Graph Theory, 44 (3) 2024, s. 817-835. Zobacz w PBN
• Paweł Rzążewski , Jacob Focke, Dániel Marx, Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds, ACM Transactions on Algorithms, 20 (2) 2024, s. 1-32. Zobacz w PBN
• Paweł Rzążewski , Baris Can Esmer, Jacob Focke, Dániel Marx, Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness, 51st International Colloquium on Automata, Languages, and Programming, Tallinn, Estonia, 7 lipca 2024 - 11 lipca 2024. Zobacz w PBN
• Paweł Rzążewski , Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Sophie Spirkl, Kristina Vušković, Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree, Journal of Combinatorial Theory. Series B, 164 2024, s. 371-403. Zobacz w PBN
• Paweł Rzążewski , Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paul Seymour, Induced Subgraphs of Bounded Treewidth and the Container Method, SIAM JOURNAL ON COMPUTING, 53 (3) 2024, s. 624—647. Zobacz w PBN
• Paweł Rzążewski , Jan Bok, Jiri Fiala, Nicola Jedlickova, Jan Kratochvil, List Covering of Regular Multigraphs with Semi-edges, Algorithmica, 86 2024, s. 782–807. Zobacz w PBN
• Paweł Rzążewski , Baris Can Esmer, Jacob Focke, Dániel Marx, List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs, 32nd Annual European Symposium on Algorithms, Londyn, the United Kingdom of Great Britain and Northern Ireland, 1 września 2024 - 3 września 2024. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Konrad Majewski, Tomáš Masařík, Jana Masaříková, Marek Sokołowski, Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás′ path argument, ACM Transactions on Computation Theory, 16 (2) 2024, s. 1-18. Zobacz w PBN
• Paweł Rzążewski , Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Max Weight Independent Set in Sparse Graphs with No Long Claws, 41st International Symposium on Theoretical Aspects of Computer Science, Clermont-Ferrand, France, 11 marca 2024 - 13 marca 2024. Zobacz w PBN
• Paweł Rzążewski , Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Michał Pilipczuk, Marcin Pilipczuk, Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time, 56th Annual ACM Symposium on Theory of Computing, Vancouver, Canada, 23 czerwca 2024 - 27 czerwca 2024. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Jan Goedgebeur, Jorik Jooken, Oliver Schaudt, Minimal Obstructions to C5-Coloring in Hereditary Graph Classes, 49th International Symposium on Mathematical Foundations of Computer Science, Bratysława, Slovakia, 25 sierpnia 2024 - 29 sierpnia 2024. Zobacz w PBN
• Paweł Rzążewski , Maria Chudnovsky, McCarty Rose, Michał Pilipczuk, Marcin Pilipczuk, Sparse induced subgraphs in P_6-free graphs, ACM-SIAM Symposium on Discrete Algorithms (SODA24), Alexandria, the United States of America, 6 stycznia 2024 - 9 stycznia 2024. Zobacz w PBN
• Paweł Rzążewski , Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Uéverton S. Souza, Taming graphs with no large creatures and skinny ladders, SIAM JOURNAL ON DISCRETE MATHEMATICS, 38 (4) 2024, s. 3140 - 3149. Zobacz w PBN
• Paweł Rzążewski , Katarzyna Łyczek, Maria Nazarczuk, Towards the Chen-Raspaud conjecture, Discrete Mathematics, 347 (3) 2024, s. 1-9. Zobacz w PBN
• Paweł Rzążewski , Marta Piecyk, Carla Groenland, Isja Mannens, Jesper Nederlof, Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters, 51st International Colloquium on Automata, Languages, and Programming, Tallinn, Estonia, 7 lipca 2024 - 11 lipca 2024. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Paloma Lima, Martin Milanič, Peter Muršič, Kenny Štorgel, Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set, 32nd Annual European Symposium on Algorithms, Londyn, the United Kingdom of Great Britain and Northern Ireland, 1 września 2024 - 3 września 2024. Zobacz w PBN

2023

• Paweł Rzążewski , Konrad K. Dabrowski, Tomáš Masařík, Jana Novotná, Daniël Paulusma, Clique‐width: Harnessing the power of atoms, Journal of Graph Theory, 104 (4) 2023, s. 769-810. Zobacz w PBN
• Konstanty Junosza-Szaniawski, Paweł Rzążewski , Grzegorz Gutowski, Felix Klesen, Alexander Wolff, Johannes Zink, Coloring and Recognizing Mixed Interval Graphs, 34th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, 2 grudnia 2023 - 5 grudnia 2023. Zobacz w PBN
• Paweł Rzążewski , Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Completeness for the Complexity Class ∀ ∃ R and Area-Universality, DISCRETE & COMPUTATIONAL GEOMETRY, 70 2023, s. 154–188. Zobacz w PBN
• Paweł Rzążewski , Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong, Complexity of C-coloring in hereditary classes of graphs, Information and Computation, 292 2023, s. 1-19. Zobacz w PBN
• Paweł Rzążewski , Natasha Morrison, JD Nir, Sergey Norin, Alexandra Wesolek, Every graph is eventually Turán-good, Journal of Combinatorial Theory. Series B, 162 2023, s. 231-243. Zobacz w PBN
• Paweł Rzążewski , Pavel Dvořák, Andreas Emil Feldmann, Ashutosh Rai, Parameterized Inapproximability of Independent Set in H-Free Graphs, Algorithmica, 85 2023, s. 902–928. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Hubie Chen, Bart M. P. Jansen, Astrid Pieterse, Sparsification Lower Bounds for List H-Coloring, ACM Transactions on Computation Theory, 15 (3-4) 2023, s. 1-23. Zobacz w PBN

2022

• Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski , Classifying Subset Feedback Vertex Set for H-Free Graphs, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tuebingen, Germany, 22 czerwca 2022 - 24 czerwca 2022. Zobacz w PBN
• Michał Dębski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Paweł Rzążewski , Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, the Republic of Korea, 18 grudnia 2022 - 20 grudnia 2022. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Sándor Kisfaludi-Bak, Computing List Homomorphisms in Geometric Intersection Graphs, 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022), Tübingen, Germany, 21 czerwca 2022 - 23 czerwca 2022. Zobacz w PBN
• Paweł Rzążewski , Tomáš Masařík, Marcin Pilipczuk, Manuel Sorge, Constant Congestion Brambles in Directed Graphs, SIAM JOURNAL ON DISCRETE MATHEMATICS, 36 (2) 2022, s. 922-938. Zobacz w PBN
• Paweł Rzążewski , Jacob Focke, Dániel Marx, Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds, Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria (Virginia), the United States of America, 8 stycznia 2022 - 11 stycznia 2022. Zobacz w PBN
• Paweł Rzążewski , Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk, Stéphan Thomassé, Bartosz Walczak, Degeneracy of P_t-free and C_{>= t}-free graphs with no large complete bipartite subgraphs, Journal of Combinatorial Theory. Series B, 152 2022, s. 353-378. Zobacz w PBN
• Konstanty Junosza-Szaniawski, Paweł Rzążewski , Dariusz Nogalski, Exact and approximation algorithms for sensor placement against DDoS attacks, International Journal of Applied Mathematics and Computer Science, 32 (1) 2022, s. 35-49. Zobacz w PBN
• Michał Dębski, Marta Piecyk, Paweł Rzążewski , Faster 3-Coloring of Small-Diameter Graphs, SIAM JOURNAL ON DISCRETE MATHEMATICS, 36 (3) 2022, s. 2205—2224. Zobacz w PBN
• Paweł Rzążewski , Giacomo Paesani, Daniël Paulusma, Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs, SIAM JOURNAL ON DISCRETE MATHEMATICS, 36 (4) 2022, s. 2453-2472. Zobacz w PBN
• Paweł Rzążewski , Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvil, List Covering of Regular Multigraphs, 33rd International Workshop on Combinatorial Algorithms (IWOCA 2022), Trier, Germany, 6 czerwca 2022 - 8 czerwca 2022. Zobacz w PBN
• Paweł Rzążewski , Pavel Dvořák, Tomáš Masařík, Jana Novotná, Monika Krawczyk, Aneta Żuk, List Locally Surjective Homomorphisms in Hereditary Graph Classes, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, the Republic of Korea, 18 grudnia 2022 - 20 grudnia 2022. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Konrad Majewski, Tomáš Masařík, Jana Novotná, Marcin Pilipczuk, M Sokołowski, Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument, 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022), Paris, France, 3 lipca 2022 - 7 lipca 2022. Zobacz w PBN
• Paweł Rzążewski , Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge, Packing Directed Cycles Quarter- and Half-Integrally, Combinatorica, 42 2022, s. 1409–1438. Zobacz w PBN
• Paweł Rzążewski , Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws, Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria (Virginia), the United States of America, 8 stycznia 2022 - 11 stycznia 2022. Zobacz w PBN
• Paweł Rzążewski , Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Uéverton S. Souza, Taming Graphs with No Large Creatures and Skinny Ladders, 30th Annual European Symposium on Algorithms (ESA 2022), Potsdam, Germany, 4 września 2022 - 8 września 2022. Zobacz w PBN

2021

• Karolina Okrasa, Paweł Rzążewski , Complexity of the List Homomorphism Problem in Hereditary Graph Classes, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 16 marca 2021 - 19 marca 2021. Zobacz w PBN
• Paweł Rzążewski , Complexity of the List Homomorphism Problem in Hereditary II, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 15 marca 2021 - 18 marca 2021. Zobacz w PBN
• Tomáš Masařík , Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Constant Congestion Brambles in Directed Graphs, European Conference on Combinatorics, Graph Theory and Appliations 2021, Barcelona, Spain, 6 września 2021 - 10 września 2021. Zobacz w PBN
• Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski , Florian Sikora, Stéphan Thomassé, EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs, JOURNAL OF THE ACM, 68 (2) 2021, s. 1-38. Zobacz w PBN
• Paweł Rzążewski , Michał Dębski, Marta Piecyk, Faster 3-Coloring of Small-Diameter Graphs, 29th Annual European Symposium on Algorithms (ESA 2019), Lizbona, Portugal, 5 września 2021 - 7 września 2021. Zobacz w PBN
• Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski , Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs, 46th International Symposium on Mathematical Foundations of Computer Science, tallin, Estonia, 22 sierpnia 2021 - 26 sierpnia 2021. Zobacz w PBN
• Maria Chudnovsky, Jason King, Michał Pilipczuk , Paweł Rzążewski , Sophie Spirkl, Finding Large H-Colorable Subgraphs in Hereditary Graph Classes, SIAM JOURNAL ON DISCRETE MATHEMATICS, 35 (4) 2021, s. 2357-2386. Zobacz w PBN
• Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Finding large induced sparse subgraphs in C>t -free graphs in quasipolynomial time, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 21 czerwca 2021 - 25 czerwca 2021. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs, SIAM JOURNAL ON COMPUTING, 50 (2) 2021, s. 487-508. Zobacz w PBN
• Paweł Rzążewski , Marta Piecyk, Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 15 marca 2021 - 18 marca 2021. Zobacz w PBN
• Łukasz Kowalik , Michał Pilipczuk , Paweł Rzążewski , Graph-Theoretic Concepts in Computer Science : 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, 47th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2021, Warszawa, Poland, 23 czerwca 2021 - 25 czerwca 2021. Zobacz w PBN
• Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk , Paweł Rzążewski , Paul Seymour, Induced subgraphs of bounded treewidth and the container method, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 stycznia 2021 - 13 stycznia 2021. Zobacz w PBN
• Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths, 4th Symposium on Simplicity in Algorithms, Alexandria, VA, the United States of America, 11 stycznia 2021 - 12 stycznia 2021. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Jana Novotná, Michał Pilipczuk, Erik Jan van Leeuwen, Bartosz Walczak, Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs, Algorithmica, 83 2021, s. 2634–2650. Zobacz w PBN

2020

• Konrad Dabrowski, Tomáš Masařík , Jana Masaříková , Daniël Paulusma, Paweł Rzążewski , Clique-Width: Harnessing the Power of Atoms, 46th International Workshop, {WG} 2020, Leeds, the United Kingdom of Great Britain and Northern Ireland, 24 czerwca 2020 - 26 czerwca 2020. Zobacz w PBN
• Keith Edwards, Paweł Rzążewski , Complete colourings of hypergraphs, Discrete Mathematics, 343 (2) 2020, s. 111673-111673. Zobacz w PBN
• Édouard Bonnet, Paweł Rzążewski , Florian Sikora, Designing RNA Secondary Structures Is Hard, Journal of Computational Biology, 27 (3) 2020, s. 302-316. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs, 31st ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, the United States of America, 5 stycznia 2020 - 8 stycznia 2020. Zobacz w PBN
• Paweł Rzążewski , Marta Piecyk, Karolina Okrasa, Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs, 28th Annual European Symposium on Algorithms (ESA 2019), Piza, Italy, 6 września 2020 - 8 września 2020. Zobacz w PBN
• Joanna Chybowska-Sokół, Konstanty Junosza-Szaniawski, Paweł Rzążewski , L(2,1)-labeling of disk intersection graphs, DISCRETE APPLIED MATHEMATICS, 277 2020, s. 71-81. Zobacz w PBN
• Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski , On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest, Algorithmica, 82 2020, s. 2841-2866. Zobacz w PBN
• Pavel Dvořák, Andreas Emil Feldmann, Ashutosh Rai, Paweł Rzążewski , Parameterized Inapproximability of Independent Set in H-Free Graphs, 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Leeds, the United Kingdom of Great Britain and Northern Ireland, 23 czerwca 2020 - 25 czerwca 2020. Zobacz w PBN
• Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Paweł Rzążewski , Sparsification Lower Bounds for List H-Coloring, 31st International Symposium on Algorithms and Computation (ISAAC), Hong Kong, China, 13 grudnia 2020 - 17 grudnia 2020. Zobacz w PBN
• Paweł Rzążewski , Karolina Okrasa, Subexponential algorithms for variants of the homomorphism problem in string graphs, Journal of Computer and System Sciences, 109 2020, s. 126-144. Zobacz w PBN

2019

• Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski , Sophie Spirkl, Mingxian Zhong, Complexity of C_k-Coloring in Hereditary Classes of Graphs, Leibniz International Proceedings in Informatics, LIPIcs, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 września 2019 - 13 września 2019. Zobacz w PBN
• Dorota Osula, Paweł Rzążewski , Dariusz Dereniowski, Finding small-width connected path decompositions in polynomial time, Theoretical Computer Science, 794 2019, s. 85 - 100. Zobacz w PBN
• Carla Groenland, Karolina Okrasa, Paweł Rzążewski , Alex Scott, Paul Seymour, Sophie Spirkl, H-colouring P_t-free graphs in subexponential time, DISCRETE APPLIED MATHEMATICS, 267 2019, s. 184-189. Zobacz w PBN
• Édouard Bonnet, Paweł Rzążewski , Optimality Program in Segment and String Graphs, Algorithmica, 81 (7) 2019, s. 3047-3073. Zobacz w PBN
• Tomáš Masařík , Irene Muzi, Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Packing Directed Circuits Quarter-Integrally, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 września 2019 - 13 września 2019. Zobacz w PBN
• William Evans, Paweł Rzążewski , Noushin Saeedi, Chan-Su Shin, Alexander Wolff, Representing Graphs and Hypergraphs by Touching Polygons in 3D, 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), Praga, Czechia, 17 września 2019 - 20 września 2019. Zobacz w PBN
• Paweł Rzążewski , Karolina Okrasa, Subexponential algorithms for variants of homomorphism problem in string graphs, Lecture Notes in Computer Science, 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019), Vall de Núria, Spain, 19 czerwca 2019 - 21 czerwca 2019. Zobacz w PBN
• Jana Novotna, Karolina Okrasa, Michał Pilipczuk , Paweł Rzążewski , Erik Jan van Leeuwen, Bartosz Walczak, Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Monachium, Germany, 11 września 2019 - 13 września 2019. Zobacz w PBN

2018

• Michał Dębski, Zbigniew Lonc, Paweł Rzążewski , Achromatic and Harmonious Colorings of Circulant Graphs, Journal of Graph Theory, 87 (1) 2018, s. 18-34. Zobacz w PBN
• Édouard Bonnet, Tillmann Miltzow, Paweł Rzążewski , Complexity of Token Swapping and its Variants, Algorithmica, 80 (9) 2018, s. 2656-2682. Zobacz w PBN
• Edouard Bonnet, Paweł Rzążewski , Florian Sikora, Designing RNA Secondary Structures Is Hard, 22nd Annual International Conference on Research in Computational Molecular Biology, Paris, France, 21 kwietnia 2018 - 24 kwietnia 2018. Zobacz w PBN
• Paweł Rzążewski , Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization, Leibniz International Proceedings in Informatics, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, Caen, France, 28 lutego 2018 - 3 marca 2018. Zobacz w PBN
• Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Paweł Rzążewski , Fine-Grained Complexity of Coloring Unit Disks and Balls, Journal of Computational Geometry, 9 (2) 2018, s. 47-80. Zobacz w PBN
• Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloffa, Pedro Montealegre, Paweł Rzążewski , Fixing improper colorings of graphs, Theoretical Computer Science, 711 2018, s. 66-78. Zobacz w PBN
• Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Sean Kafer, Jan Kratochvíl, Martin Pergel, Paweł Rzążewski , Matthew Szczepankiewicz, Joshua JoshuaTerhaarf, Homothetic polygons and beyond: Maximal cliques in intersection graphs, DISCRETE APPLIED MATHEMATICS, 247 2018, s. 263-277. Zobacz w PBN
• Konstanty Junosza-Szaniawski, Paweł Rzążewski , Joanna Chybowska-Sokół, Krzysztof Weͅsek, ONLINE COLORING AND L(2,1)-LABELING OF UNIT DISK INTERSECTION GRAPHS, SIAM JOURNAL ON DISCRETE MATHEMATICS, 32 (2) 2018, s. 1335-1350. Zobacz w PBN
• Édouard Bonnet, Paweł Rzążewski , Optimality Program in Segment and String Graphs, 44th International Workshop on Graph-Theoretic Concepts in Computer, Cottbus, Germany, 27 czerwca 2018 - 29 czerwca 2018. Zobacz w PBN
• Paweł Rzążewski , QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs, Leibniz International Proceedings in Informatics, 34th International Symposium on Computational Geometry, Budapest, Hungary, 11 czerwca 2018 - 14 czerwca 2018. Zobacz w PBN
• Paweł Rzążewski , Michael Gene Dobbins, Linda Kleist, Tillmanm Miltzow, ∀∃R -Completeness and Area-Universality, 44th International Workshop on Graph-Theoretic Concepts in Computer, Cottbus, Germany, 27 czerwca 2018 - 29 czerwca 2018. Zobacz w PBN

2017

• Édouard Bonnet, Tillmann Miltzow, Paweł Rzążewski , Complexity of Token Swapping and its Variants, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN
• Adrian Bondy, Zbigniew Lonc, Paweł Rzążewski , Erratum: Constructing Optimal $k$-Radius Sequences, SIAM JOURNAL ON DISCRETE MATHEMATICS, 31 (1) 2017, s. 645-646. Zobacz w PBN
• Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Paweł Rzążewski , Fine-Grained Complexity of Coloring Unit Disks and Balls, Leibniz International Proceedings in Informatics, 33rd International Symposium on Computational Geometry, Brisbane, Australia, 4 lipca 2017 - 7 lipca 2017. Zobacz w PBN
• Michał Dębski, Zbigniew Lonc, Paweł Rzążewski , Harmonious and achromatic colorings of fragmentable hypergraphs, European Journal of Combinatorics, 66 2017, s. 60-80. Zobacz w PBN
• Martin Pergel, Paweł Rzążewski , On edge intersection graphs of paths with 2 bends, DISCRETE APPLIED MATHEMATICS, 226 2017, s. 106-116. Zobacz w PBN
• Krzysztof Kaczmarski, Paweł Rzążewski , Albert Wolant, Parallel algorithms constructing the cell graph, Concurrency Computation Practice and Experience, 29 (23) 2017, s. 1-17. Zobacz w PBN
• Michał Dębski, Zbigniew Lonc, Paweł Rzążewski , Sequences of radius k for complete bipartite graphs, DISCRETE APPLIED MATHEMATICS, 225 2017, s. 51-63. Zobacz w PBN
• Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski , Tight Euler tours in uniform hypergraphs - computational aspects, Discrete Mathematics and Theoretical Computer Science, 19 (3) 2017, s. 1-13. Zobacz w PBN

2016

• Zbigniew Lonc, Paweł Rzążewski , Constructing optimal k-radius sequences, SIAM JOURNAL ON DISCRETE MATHEMATICS, 30 (1) 2016, s. 452-464. Zobacz w PBN
• Krzysztof Kaczmarski, Paweł Rzążewski , Albert Wolant, Massively Parallel Construction of the Cell Graph, Lecture Notes in Computer Science, PPAM 2015, Kraków, Poland, 6 września 2015 - 9 września 2015, 9573 2016, s. 559-569. Zobacz w PBN
• Paweł Rzążewski , On Edge Intersection Graphs of Paths with 2 Bends, Lecture Notes in Computer Science, 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Stambuł, Turkey, 22 czerwca 2016 - 24 czerwca 2016, 9941 2016, s. 207-219. Zobacz w PBN
• Zbigniew Lonc, Paweł Rzążewski , Sequences of Radius k for Complete Bipartite Graphs, Lecture Notes in Computer Science, 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2016), Stambuł, Turkey, 22 czerwca 2016 - 24 czerwca 2016, 9941 2016, s. 1-12. Zobacz w PBN

2015

• Konstanty Junosza-Szaniawski, Paweł Rzążewski , Fixing Improper Colorings of Graphs, Lecture Notes in Computer Science, 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015), Pec pod Sněžkou, Czechia, 24 stycznia 2015 - 29 stycznia 2015, 8939 2015, s. 266-276. Zobacz w PBN
• Michał Dębski, Zbigniew Lonc, Paweł Rzążewski , Harmonious and achromatic colorings of fragmentable hypergraphs, Electronic Notes in Discrete Mathematics, The Eight European Conference on Combinatorics, Graph Theory and Applications, 2015. Zobacz w PBN
• Krzysztof Kaczmarski, Paweł Rzążewski , Improving High-Performance GPU Graph Traversal with Compression, Advances in Intelligent Systems and Computing, 18th East European Conference on Advances in Databases and Information Systems and Associated Satellite Events (ADBIS) (ADBIS workshop on GPUs in Databases GID 2014), Ohrid, Republic of North Macedonia, 7 września 2014 - 10 września 2014, 312 2015, s. 201-214. Zobacz w PBN

2014

• Konstanty Junosza-Szaniawski, Paweł Rzążewski , An Exact Algorithm for the Generalized List T-Coloring Problem, Discrete Mathematics and Theoretical Computer Science, 16 (3) 2014, s. 77-94. Zobacz w PBN
• Paweł Rzążewski , Exact algorithm for graph homomorphism and locally injective graph homomorphism, INFORMATION PROCESSING LETTERS, 114 (7) 2014, s. 387-391. Zobacz w PBN

2013

• Konstanty Junosza-Szaniawski, Paweł Rzążewski , Determining the L(2,1)-span in Polynomial Space, DISCRETE APPLIED MATHEMATICS, 161 (13/14) 2013, s. 2052-2061. Zobacz w PBN
• Konstanty Junosza-Szaniawski, Paweł Rzążewski , Fast exact algorithm for L(2,1)-labeling of graphs, Theoretical Computer Science, 505 2013, s. 42-54. Zobacz w PBN
• Krzysztof Kaczmarski, Paweł Rzążewski , Thrust and CUDA in data intensive algorithms, 23rd European Conference on Advances in Databases and Information Systems, ADBIS 2019, Bled, Slovenia, 7 września 2019 - 10 września 2019. Zobacz w PBN

Inne

• Bartłomiej Bosek , Sebastian Czerwiński, Michał Dębski, Jarosław Grytczuk, Zbigniew Lonc, Paweł Rzążewski , Coloring chain hypergraphs, 20 Years of the Faculty of Mathematics and Information Science. A collection of research papers in mathematics, , s. 41--53. Zobacz w PBN
• Edouard Bonnet, Paweł Rzążewski , Optimality Program in Segment and String Graphs, Graph-Theoretic Concepts in Computer Science. WG 2018, , s. 79-90. Zobacz w PBN
• Michael Dobbins, Linda Kleist, Tillmann Miltzow, Paweł Rzążewski , ∀∃R -Completeness and Area-Universality, Graph-Theoretic Concepts in Computer Science. WG 2018, , s. 164-175. Zobacz w PBN