ZAKŁAD SYSTEMÓW PRZETWARZANIA INFORMACJI

Funkcje pełnione na MiNI

  • 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

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


Wybrane publikacje

  • 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
  • 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
  • Sokół J., Junosza-Szaniawski K., Rzążewski P., L(2,1)-labeling of disk intersection graphs, Discrete Applied Mathematics 277 (2020) str. 71-81
  • 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., Scott A., Groenland C., Spirkl S., Seymour P., Okrasa K., H-colouring P_t-free graphs in subexponential time, Discrete Applied Mathematics 267 (2019) str. 184-189
  • Rzążewski P., Bonnet E., 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
  • Rzążewski P., Okrasa K., Subexponential algorithms for variants of homomorphism problem in string graphs, Lecture Notes in Computer Science 11789 (2019) str. 1-13
  • 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
  • Rzążewski P., Brimkov V., Junosza-Szaniawski K., Kafer S., Kratochvil J., Pergel M., 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., 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., Giannopoulos P., Kim E., Sikora F., 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., Biro C., Bonnet E., Marx D., Miltzow T., 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
  • Rzążewski P., Pergel M., 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
  • Junosza-Szaniawski K., Rzążewski P., On the number of 2-packings in a connected graph, Discrete Mathematics 312 (2012) str. 3444-3450
  • Junosza-Szaniawski K., Kratochvil J., Rzążewski P., Liedloff M., Rossmanith 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

Ostatnia aktualizacja strony 2020-10-21 o godz. 13:48:59 przez SZOK.