Loading...
 

DR INŻ. PAWEŁ RZĄŻEWSKI - adiunkt


Zakład Systemów Przetwarzania Informacji


FUNKCJE WYDZIAŁOWE

  • Członek Komisji Programowej dla Kierunku Informatyka
  • Pełnomocnik Dziekana ds. Studenckich Programów Międzynarodowych__

Dane kontaktowe

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 : http://www.mini.pw.edu.pl/~rzazewsk


Wybrane publikacje

  • Dębski M., Lonc Z., Rzążewski P., Achromatic and Harmonious Colorings of Circulant Graphs, Journal of Graph Theory 87 (1) (2017 ) str. 18—34
  • Bonnet E., Miltzow T., Rzążewski P., Complexity of Token Swapping and Its Variants, ALGORITHMICA (2017 ) str. 1—27
  • Bonnet E., Miltzow T., Rzążewski P., Complexity of Token Swapping ands its Variant, Leibniz International Proceedings in Informatics 66 (2017 ) str. 16:1—16:14
  • Biro C., Bonnet E., Marx D., Miltzow T., Rzążewski P., Fine-Grained Complexity of Coloring Unit Disks and Balls, Leibniz International Proceedings in Informatics, Seria Leibniz International Proceedings in Informatics (LIPIcs), 77 (2017 ) str. 1—16
  • Dębski M., Lonc Z., Rzążewski P., 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. 0—0
  • Dębski M., Lonc Z., Rzążewski P., Sequences of radius k for complete bipartite graphs, Discrete Applied Mathematics 225 (2017 ) str. 51—63
  • Lonc Z., Naroski P., Rzążewski P., Tight Euler tours in uniform hypergraphs - computational aspects, Discrete Mathematics and Theoretical Computer Science 19(3) (2017 ) str. 1—13
  • Bondy A., Lonc Z., Rzążewski P., Constructing optimal k-radius sequences, SIAM Journal on Discrete Mathematics 30(1) (2016 ) str. 452—464
  • Bosek B., Czerwiński S., Grytczuk J., Rzążewski P., 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
  • Pergel M., Rzążewski P., 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
  • Dębski M., Lonc Z., Rzążewski P., 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., Liedloff M., Rzążewski P., Fixing Improper Colorings of Graphs, Lecture Notes in Computer Science, Seria Lecture Notes in Computer Science, 8939 (2015 ) str. 266—276
  • Dębski M., Lonc Z., Rzążewski P., Harmonious and achromatic colorings of fragmentable hypergraphs, Electronic Notes in Discrete Mathematics 49 (2015 ) str. 309—314
  • Kaczmarski K., Przymus P., Rzążewski 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., Liedloff M., Rzążewski P., Determining the L(2,1)-span in Polynomial Space, Discrete Applied Mathematics 161(13/14) (2013 ) str. 2052—2061
  • Junosza-Szaniawski K., Kratochvil J., Liedloff M., Rossmanith P., Rzążewski 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., Pergel M., Rzążewski P., 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., Liedloff M., Rzążewski P., 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., Liedloff M., Rossmanith P., 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


Page last modified on Wtorek 02 Styczeń, 2018 14:40:29 CET