ADIUNKT (BAD.-DYD.)

Zakład Systemów Przetwarzania Informacji

FUNKCJE WYDZIAŁOWE

  • Członek Komisji Rady Wydziału ds. Nagród i Odznaczeń
  • Członek Komisji Egzaminu Dyplomowego dla Kierunku Informatyka i Systemy Informacyjne
  • Członek Komisji Programowej dla kierunku Informatyka i Systemy Informacyjne

Dyscyplina(y) nauki

  • Matematyka

Wybrane publikacje

  • Abrishami T., Chudnovsky M., Dibek C., Hajebi S., Rzążewski P., Spirkl S., Vuskovic K., 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) str. 371-403
  • Dabrowski K., Masarik T., Novotna J., Paulusma D., Rzążewski P., Clique-width: Harnessing the power of atoms, Journal of Graph Theory 104(4) (2023) str. 769-810
  • Gutowski G., Junosza-Szaniawski K., Klesen F., Rzążewski P., Wolff A., Zink J., Coloring and Recognizing Mixed Interval Graphs, Proceedings of 34rd International Symposium on Algorithms and Computation (ISAAC 2023), Seria lipiCS, 283 (2023) str. 36:1-36:14
  • Dobbins M., Kleist L., Miltzow T., Rzążewski P., Completeness for the Complexity Class ∀∃R and Area-Universality, Discrete & Computational Geometry 70 (2023) str. 154-188
  • Chudnovsky M., Huang S., Rzążewski P., Spirkl S., Zhong M., Complexity of Ck-coloring in hereditary classes of graphs, INFORMATION AND COMPUTATION 292 (2023) str. 1-19
  • Morrison N., Nir J., Norin S., Rzążewski P., Wesolek A., Every graph is eventually Turán-good, JOURNAL OF COMBINATORIAL THEORY SERIES B 162 (2023) str. 231-243
  • Paesani G., Paulusma D., Rzążewski P., Classifying Subset Feedback Vertex Set for H-Free Graphs, WG 2022 Proceedings, Seria Lecture Notes in Computer Science, 13453 (2022) str. 412-424
  • Lonc Z., Dębski M., Okrasa K., Piecyk M., Rzążewski P., 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), Seria LIPICS, 248 (2022) str. 14:1-14:16
  • Kisfaludi‑Bak S., Okrasa K., Rzążewski P., Computing list homomorphisms in geometric intersection graphs, Lecture Notes in Computer Science 13453 (2022) str. 313-327
  • Masarik T., Pilipczuk M., Rzążewski P., Sorge M., Constant Congestion Brambles in Directed Graphs, SIAM Journal on Discrete Mathematics 36(2) (2022) str. 922-938
  • Focke J., Marx D., Rzążewski P., Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds, Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2022) str. 431-458
  • Bonamy M., Bousquet N., Pilipczuk M., Rzążewski P., Thomasse S., Walczak B., Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs, JOURNAL OF COMBINATORIAL THEORY SERIES B 152 (2022) str. 353-378
  • Junosza-Szaniawski K., Rzążewski P., Nogalski D., EXACT AND APPROXIMATION ALGORITHMS FOR SENSOR PLACEMENT AGAINST DDOS ATTACKS, International Journal of Applied Mathematics and Computer Science 32 (2022) str. 35-49
  • Dębski M., Piecyk M., Rzążewski P., Faster 3-Coloring of Small-Diameter Graphs, SIAM Journal on Discrete Mathematics 36(3) (2022) str. 2205-2224
  • Paesani G., Paulusma D., Rzążewski P., Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs, SIAM Journal on Discrete Mathematics 36(4) (2022) str. 2453-2472
  • Bok J., Fiala J., Jedlickova N., Kratochvil J., Rzążewski P., List Covering of Regular Multigraphs, IWOCA 2022 Proceedings, Seria Lecture Notes in Computer Science, 13270 (2022) str. 228-242
  • Dvorak P., Masarik T., Novotna J., Krawczyk M., Rzążewski P., Żuk A., List Locally Surjective Homomorphisms in Hereditary Graph Classes, ISAAC 2022 Proceedings, Seria Leibniz International Proceedings in Informatics, 248 (2022) str. 30:1-30:15
  • Majewski K., Masarik T., Novotna J., Okrasa K., Pilipczuk M., Rzążewski P., Sokołowski M., 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) Proceedings, Seria Leibniz International Proceedings in Informatics (LIPIcs), (2022) str. 93:1-93:19
  • Masarik T., Muzi I., Pilipczuk M., Rzążewski P., Sorge M., Packing Directed Cycles Quarter- and Half-Integrally, COMBINATORICA 42 (2022) str. 1409-1438
  • Dvorak P., Feldmann A., Rai A., Rzążewski P., Parameterized Inapproximability of Independent Set in H-Free Graphs, ALGORITHMICA 85 (2022) str. 902-928
  • Abrishami T., Chudnovsky M., Dibek C., Rzążewski P., Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws, Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2022) str. 1448-1470
  • Gajarský J., Jaffke L., Lima P., Pilipczuk M., Rzążewski P., Souza U., Taming Graphs with No Large Creatures and Skinny Ladders, ESA 2022 Proceedings, Seria Leibniz International Proceedings in Informatics, 244 (2022) str. 58:1-58:8
  • Okrasa K., Rzążewski P., Complexity of the List Homomorphism Problem in Hereditary Graph Classes, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), Seria Leibniz International Proceedings in Informatics (LIPIcs), 187 (2021) str. 54:1-54:17
  • Bonamy M., Bonnet E., Bousquet N., Charbit P., Giannopoulos P., Kim E., Rzążewski P., Sikora F., Thomasse S., EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs, JOURNAL OF THE ACM 68(2) (2021) str. 1-38
  • Dębski M., Piecyk M., Rzążewski P., Faster 3-Coloring of Small-Diameter Graphs, 29th Annual European Symposium on Algorithms (ESA 2021), Seria LIPIcs, 204 (2021) str. 37:1-37:15
  • Paesani G., Paulusma D., Rzążewski P., Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Seria LIPIcs, 202 (2021) str. 82:1-82:14
  • Chudnovsky M., King J., Pilipczuk M., Rzążewski P., Spirkl S., Finding large H-colorable subgraphs in hereditary graph classes, SIAM Journal on Discrete Mathematics 35 (2021) str. 2357-2386
  • Gartland P., Lokshtanov D., Pilipczuk M., Pilipczuk M., Rzążewski P., Finding large induced sparse subgraphs in C>t -free graphs in quasipolynomial time, STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) str. 330-341
  • Okrasa K., Rzążewski P., Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs, SIAM Journal on Computing 50(2) (2021) str. 487-508
  • Piecyk M., Rzążewski P., Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), Seria Leibniz International Proceedings in Informatics (LIPIcs), 187 (2021) str. 56:1-56:17
  • Abrishami T., Chudnovsky M., Pilipczuk M., Rzążewski P., Seymour P., Induced subgraphs of bounded treewidth and the container method, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (2021) str. 1948-1964
  • Kowalik Ł., Pilipczuk M., Rzążewski P., Preface, 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, Seria LNCS, 12911 (2021) str. v-vi
  • Pilipczuk M., Pilipczuk M., Rzążewski P., Quasi-polynomial-time algorithm for Independent Set in P_t-free graphs via shrinking the space of induced paths, Proceedings of Symposium on Simplicity in Algorithms 2021 (2021) str. 204-209
  • Novotna J., Okrasa K., Pilipczuk M., Rzążewski P., van Leeuwen E., Walczak B., Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs, ALGORITHMICA 83 (2021) str. 2634-2650
  • Dabrowski K., Masarik T., Novotna J., Paulusma D., Rzążewski P., Clique-Width: Harnessing the Power of Atoms, International Workshop on Graph-Theoretic Concepts in Computer Science, Seria LNCS, 12301 (2020) str. 119-133
  • Bosek B., Czerwiński S., Dębski M., Grytczuk J., Lonc Z., Rzążewski P., Coloring Chain Hypergraphs, 20 Years of the Faculty of Mathematics and Information Science. A colletion of research papers in mathematics (2020) str. 41-53
  • Edwards K., Rzążewski P., Complete colourings of hypergraphs, Discrete Mathematics 343(2) (2020) str. 111673-111673
  • Bonnet E., Rzążewski P., Sikora F., Designing RNA Secondary Structures is Hard, JOURNAL OF COMPUTATIONAL BIOLOGY 27 (3) (2020) str. 302-316
  • Chudnovsky M., King J., Pilipczuk M., Rzążewski P., Spirkl S., Finding Large H-Colorable Subgraphs in Hereditary Graph Classes, 28th Annual European Symposium on Algorithms (ESA 2020), Seria Leibniz International Proceedings in Informatics (LIPIcs), 173 (2020) str. 35:1-35:17
  • Rzążewski P., Okrasa K., Fine-grained complexity of graph homomorphism problem forbounded-treewidth graphs, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (2020) str. 1578-1590
  • Okrasa K., Piecyk M., Rzążewski P., Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs, 28th Annual European Symposium on Algorithms (ESA 2020), Seria Leibniz International Proceedings in Informatics (LIPIcs), 173 (2020) str. 74:1-74:24
  • Chybowska-Sokół J., Junosza-Szaniawski K., Rzążewski P., L(2,1)-labeling of disk intersection graphs, Discrete Applied Mathematics 277 (2020) str. 71-81
  • Dabrowski K., Feghali C., Johnson M., Paesani G., Paulusma D., Rzążewski P., On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest, ALGORITHMICA 82 (2020) str. 2841-2866
  • Rzążewski P., Dvorak P., Feldmann A., Rai A., Parameterized Inapproximability of Independent Set in H-Free Graphs, International Workshop on Graph-Theoretic Concepts in Computer Science, Seria LNCS, 12301 (2020) str. 40-53
  • Rzążewski P., Chen H., Jansen B., Okrasa K., Pieterse A., Sparsification Lower Bounds for List H-Coloring, 31st International Symposium on Algorithms and Computation (ISAAC 2020), Seria Leibniz International Proceedings in Informatics (LIPIcs), 181 (2020) str. 58:1-58:17
  • Rzążewski P., Okrasa K., Subexponential algorithms for variants of homomorphism problem in string graphs, Lecture Notes in Computer Science 11789 (2020) str. 1-13
  • Okrasa K., Rzążewski P., Subexponential algorithms for variants of the homomorphism problem in string graphs, JOURNAL OF COMPUTER AND SYSTEM SCIENCES 109 (2020) str. 126-144
  • Chudnovsky M., Huang S., Rzążewski P., Spirkl S., Zhong M., Complexity of C_k-Coloring in Hereditary Classes of Graphs, 27th Annual European Symposium on Algorithms (ESA 2019), Seria LIPIcs, 144 (2019) str. 31:1-31:15
  • Rzążewski P., Osula D., Dereniowski D., Finding small-width connected path decompositions in polynomial time, Theoretical Computer Science 794 (2019) str. 85-100
  • Rzążewski P., Okrasa K., Scott A., Groenland C., Spirkl S., Seymour P., H-colouring P_t-free graphs in subexponential time, Discrete Applied Mathematics 267 (2019) str. 184-189
  • Bonnet E., Rzążewski P., Optimality Program in Segment and String Graphs, ALGORITHMICA 81(7) (2019) str. 3047-3073
  • Masarik T., Muzi I., Pilipczuk M., Rzążewski P., Sorge M., Packing Directed Circuits Quarter-Integrally, 27th Annual European Symposium on Algorithms (ESA 2019), Seria LIPIcs, 144 (2019) str. 72:1-72:13
  • Evans W., Rzążewski P., Saeedi N., Shin C., Wolff A., Representing Graphs and Hypergraphs by Touching Polygons in 3D, Graph Drawing and Network Visualization, Seria Lecture Notes in Computer Science, 11904 (2019) str. 18-32
  • Novotna J., Okrasa K., Pilipczuk M., Rzążewski P., van Leeuwen E., Walczak B., Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Seria LIPIcs, 148 (2019) str. 23:1-23:11
  • Bonnet E., Miltzow T., Rzążewski P., Complexity of Token Swapping and Its Variants, ALGORITHMICA 80(9) (2018) str. 2656-2682
  • Rzążewski P., Bonnet E., Sikora F., Designing RNA Secondary Structures Is Hard, Lecture Notes in Computer Science, Seria Lecture Notes in Bioinformatics, 10812 (2018) str. 248-250
  • Rzążewski P., Egri L., Marx D., Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization, Leibniz International Proceedings in Informatics 96 (2018) str. 27:1-27:15
  • Biro C., Bonnet E., Marx D., Miltzow T., Rzążewski P., Fine-grained complexity of coloring unit disks and balls, Journal of Computational Geometry 9(2) (2018) str. 47-80
  • Garnero V., Junosza-Szaniawski K., Liedloff M., Montealegre P., Rzążewski P., Fixing improper colorings of graphs, Theoretical Computer Science 711 (2018) str. 66-78
  • Junosza-Szaniawski K., Kratochvil J., Rzążewski P., Pergel M., Brimkov V., Kafer S., Szczepankiewicz M., Terhaar J., Homothetic polygons and beyond: Maximal cliques in intersection graphs, Discrete Applied Mathematics 247 (2018) str. 263-277
  • Junosza-Szaniawski K., Rzążewski P., Węsek K., Chybowska-Sokół J., ONLINE COLORING AND L(2,1)-LABELING OF UNIT DISK INTERSECTION GRAPHS, SIAM Journal on Discrete Mathematics 32(2) (2018) str. 1335-1350
  • Rzążewski P., Bonnet E., Optimality Program in Segment and String Graphs, Lecture Notes in Computer Science 11159 (2018) str. 79-90
  • Rzążewski P., Bonnet E., Sikora F., Giannopoulos P., Kim E., QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs, Leibniz International Proceedings in Informatics 99 (2018) str. 12:1-12:15
  • Dobbins M., Kleist L., Miltzow T., Rzążewski P., ∀∃R -Completeness and Area-Universality, Graph-Theoretic Concepts in Computer Science. WG 2018, Seria Lecture Notes in Computer Science, 11159 (2018) str. 164-175
  • Rzążewski P., Dębski M., Lonc Z., Achromatic and Harmonious Colorings of Circulant Graphs, Journal of Graph Theory 87(1) (2017) str. 18-34
  • Miltzow T., Bonnet E., Rzążewski P., Complexity of Token Swapping ands its Variant, Leibniz International Proceedings in Informatics 66 (2017) str. 16:1-16:14
  • Rzążewski P., Bonnet E., Miltzow T., Biro C., Marx D., Fine-Grained Complexity of Coloring Unit Disks and Balls, Leibniz International Proceedings in Informatics, Seria Leibniz International Proceedings in Informatics (LIPIcs), 77 (2017) str. 18-1-18-16
  • Dębski M., Rzążewski P., Lonc Z., Harmonious and achromatic colorings of fragmentable hypergraphs, European Journal of Combinatorics 66 (2017) str. 60-80
  • Pergel M., Rzążewski P., On edge intersection graphs of paths with 2 bends, Discrete Applied Mathematics 226 (2017) str. 106-116
  • Kaczmarski K., Rzążewski P., Wolant A., Parallel algorithms constructing the cell graph, Concurrency and Computation: Practice and Experience 29(23) (2017) str. 1-17
  • Rzążewski P., Dębski M., Lonc Z., Sequences of radius k for complete bipartite graphs, Discrete Applied Mathematics 225 (2017) str. 51-63
  • Rzążewski P., Naroski P., Lonc Z., Tight Euler tours in uniform hypergraphs – computational aspects, Discrete Mathematics and Theoretical Computer Science 19(3) (2017) str. 1-13
  • Lonc Z., Rzążewski P., Bondy A., Constructing optimal k-radius sequences, SIAM Journal on Discrete Mathematics 30(1) (2016) str. 452-464
  • Grytczuk J., Rzążewski P., Bosek B., Czerwiński S., Harmonious Coloring of Uniform Hypergraphs, Applicable Analysis and Discrete Mathematics 10(1) (2016) str. 73-87
  • Kaczmarski K., Rzążewski P., Wolant A., Massively Parallel Construction of the Cell Graph, Lecture Notes in Computer Science, Seria Lecture Notes in Computer Science, 9573 (2016) str. 559-569
  • Rzążewski P., Pergel M., On Edge Intersection Graphs of Paths with 2 Bends, Lecture Notes in Computer Science, Seria Lecture Notes in Computer Science, 9941 (2016) str. 207-219
  • Lonc Z., Rzążewski P., Dębski M., Sequences of Radius k for Complete Bipartite Graphs, Lecture Notes in Computer Science, Seria Lecture Notes in Computer Science, 9941 (2016) str. 1-12
  • Junosza-Szaniawski K., Rzążewski P., Liedloff M., Fixing Improper Colorings of Graphs, Lecture Notes in Computer Science, Seria Lecture Notes in Computer Science, 8939 (2015) str. 266-276
  • Lonc Z., Rzążewski P., Dębski M., Harmonious and achromatic colorings of fragmentable hypergraphs, Electronic Notes in Discrete Mathematics 49 (2015) str. 309-314
  • Kaczmarski K., Rzążewski P., Przymus P., Improving High-Performance GPU Graph Traversal with Compression, Advances in Intelligent Systems and Computing, Seria Advances in Intelligent Systems and Computing, 312 (2015) str. 201-214
  • Junosza-Szaniawski K., Rzążewski P., An Exact Algorithm for the Generalized List T-Coloring Problem, Discrete Mathematics and Theoretical Computer Science 16(3) (2014) str. 77-94
  • Rzążewski P., Exact algorithm for graph homomorphism and locally injective graph homomorphism, Information Processing Letters 114(7) (2014) str. 387-391
  • Junosza-Szaniawski K., Kratochvil J., Rzążewski P., Liedloff M., Determining the L(2,1)-span in Polynomial Space, Discrete Applied Mathematics 161(13/14) (2013) str. 2052-2061
  • Junosza-Szaniawski K., Kratochvil J., Rzążewski P., Liedloff M., Rossmanith P., Fast exact algorithm for L(2,1)-labeling of graphs, Theoretical Computer Science 505 (2013) str. 42-54
  • Kaczmarski K., Rzążewski P., Thrust and CUDA in data intensive algorithms, New Trends in Databases and Information Systems, Seria Advances in Intelligent Systems and Computing, 185 (2013) str. 37-46
  • Junosza-Szaniawski K., Kratochvil J., Rzążewski P., Pergel M., Beyond Homothetic Polygons: Recognition and Maximum Clique, Algorithms and Computation, Seria Lecture Notes in Computer Science, 7676 (2012) str. 619-628
  • Junosza-Szaniawski K., Kratochvil J., Rzążewski P., Liedloff M., Determining the L(2,1)-Span in Polynomial Space, Graph-Theoretic Concepts in Computer Science, Seria Lecture Notes in Computer Science, 7551 (2012) str. 126-137
  • Rzążewski P., Junosza-Szaniawski K., On the number of 2-packings in a connected graph, Discrete Mathematics 312 (2012) str. 3444-3450
  • Kratochvil J., Liedloff M., Rossmanith P., Junosza-Szaniawski K., Rzążewski P., Fast Exact Algorithm for L(2,1)-Labeling of Graph, Lecture Notes in Computer Science, Seria Lecture Notes in Computer Science, 6648 (2011) str. 82-93
  • Junosza-Szaniawski K., Rzążewski P., On Improved Exact Algorithms for L(2,1)-Labeling of Graphs, Proceedings of IWOCA 2010, Lecture Notes in Computer Science, Seria Lecture Notes in Computer Science, 6460 (2011) str. 34-37
  • Junosza-Szaniawski K., Rzążewski P., On the complexity of exact algorithm for L(2,1)-labeling of graphs, Information Processing Letters 111(14) (2011) str. 697-701

Funkcje w redakcjach czasopism naukowych

  • Członek Komitetu Redakcyjnego w czasopiśmie Graphs and Combinatorics

Kontakt
Pokój: Kampus Główny PW, Gmach MiNI, pok. 515
Telefon służbowy: (22)234 7056
Email: pawel(kropka)rzazewski(aciek)pw(kropka)edu(kropka)pl
Własna strona www pracownika : zobacz

Ostatnia aktualizacja strony 2024-03-01 o godz. 16:36:01.