Publikacje

Paweł Rzążewski

Liczba publikacji: 90

2024

• Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Paweł Rzążewski , 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
• Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk , Paweł Rzążewski , Paul Seymour, Induced Subgraphs of Bounded Treewidth and the Container Method, SIAM Journal on Computing, 53 (3) 2024, s. 624-647. Zobacz w PBN
• Konrad Majewski , Tomáš Masařík , Jana Masaříková , Karolina Okrasa, Marcin Pilipczuk , Paweł Rzążewski , 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
• Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk , Paweł Rzążewski , Max Weight Independent Set in Sparse Graphs with No Long Claws, 41st International Symposium on Theoretical Aspects of Computer Science, Clermont-Ferrand, France, 12 marca 2024 - 14 marca 2024. Zobacz w PBN
• Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time, 56th Annual ACM Symposium on Theory of Computing, Vancouver, Canada, 24 czerwca 2024 - 28 czerwca 2024. Zobacz w PBN
• Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Sparse induced subgraphs in P6-free graphs, 35th 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, the United States of America, 7 stycznia 2024 - 10 stycznia 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
• Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Paweł Rzążewski , Completeness for the Complexity Class ∀ ∃ R and Area-Universality, DISCRETE & COMPUTATIONAL GEOMETRY, 70 2023, s. 154–188. Zobacz w PBN
• Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski , Sophie Spirkl, Mingxian Zhong, Complexity of C-coloring in hereditary classes of graphs, Information and Computation, 292 2023, s. 1-19. Zobacz w PBN
• Natasha Morrison, JD Nir, Sergey Norin, Paweł Rzążewski , Alexandra Wesolek, Every graph is eventually Turán-good, Journal of Combinatorial Theory. Series B, 162 2023, s. 231-243. Zobacz w PBN
• Pavel Dvořák, Andreas Emil Feldmann, Ashutosh Rai, Paweł Rzążewski , Parameterized Inapproximability of Independent Set in H-Free Graphs, Algorithmica, 85 2023, s. 902–928. Zobacz w PBN

2022

• 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
• 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
• Jacob Focke, Dániel Marx, Paweł Rzążewski , 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
• Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk, Paweł Rzążewski , Stéphan Thomassé, Bartosz Walczak, Degeneracy of P-free and C⩾-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
• Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski , 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
• Pavel Dvořák, Tomáš Masařík , Jana Masaříková , Paweł Rzążewski , Aneta Żuk, Monika Krawczyk, List Locally Surjective Homomorphisms in Hereditary Graph Classes, Leibniz International Proceedings in Informatics, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, the Republic of Korea, 18 grudnia 2022 - 20 grudnia 2022, 248 2022, s. 30:1-30:15. Zobacz w PBN
• Konrad Majewski , Tomáš Masařík , Jana Masaříková , Karolina Okrasa, Marcin Pilipczuk , Paweł Rzążewski , Marek Sokołowski , Max weight independent set in graphs with no long claws: An analog of the Gyárfás' path argument, Leibniz International Proceedings in Informatics, LIPIcs, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 lipca 2022 - 8 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
• Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Paweł Rzążewski , 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
• Jakub Gajarský , Lars Jaffke, Paloma T. Lima, Jana Masaříková , Marcin Pilipczuk , Paweł Rzążewski , Uéverton Dos Santos Souza, Taming Graphs with No Large Creatures and Skinny Ladders, 30th Annual European Symposium on Algorithms, Poczdam, Germany, 5 września 2022 - 7 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
• Joanna Chybowska-Sokół, Konstanty Junosza-Szaniawski, Paweł Rzążewski , Krzysztof Wę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

• Sebastian Czerwiński, Bartłomiej Bosek, 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