Ostatnia aktualizacja:
June 13. 2019 08:06:20
Aktualności / News > List of papers

List of papers

Journal papers

  1. K. Junosza-Szaniawski, P. Rzążewski, On the Complexity of Exact Algorithm for L(2,1)-labeling of Graphs, Information Processing Letters 111, pp. 697-701, 2011 (DOI: 10.1016/j.ipl.2011.04.010)
  2. K. Junosza-Szaniawski, P. Rzążewski, On the number of 2-packings in a connected graph, Discrete Mathematics 312, pp. 3444–3450, 2012 (DOI: 10.1016/j.disc.2012.02.005)
  3. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rossmanith, P. Rzążewski, Fast Exact Algorithm for L(2,1)-Labeling of Graphs, Theoretical Computer Science 505, pp. 42-54, 2013  (DOI: 10.1016/j.tcs.2012.06.037)
  4. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rzążewski, Determining the L(2,1)-span in Polynomial Space, Discrete Applied Mathematics 161, pp. 2052-2061, 2013 (DOI: 10.1016/j.dam.2013.03.027)
  5. P. Rzążewski, Exact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism, Information Processing Letters 114, pp. 387-391, 2014 (DOI: 10.1016/j.ipl.2014.02.012)
  6. K. Junosza-Szaniawski, P. Rzążewski, An Exact Algorithm for the Generalized List T-Coloring Problem, Discrete Mathematics and Theoretical Computer Science 16:3, pp. 77–94, 2014
  7. J.A. Bondy, Z. Lonc, P. Rzążewski, Constructing optimal k-radius sequences, SIAM J. Discrete Mathematics 30, pp. 452-464, 2016 (DOI: 10.1137/15M1023506)
    Erratum: J.A. Bondy, Z. Lonc, P. Rzążewski, Erratum: Constructing optimal k-radius sequences, SIAM J. Discrete Mathematics 31, pp. 645-646, 2017 (DOI: 10.1137/16M108505X)
  8. B. Bosek, S. Czerwiński, J. Grytczuk, P. Rzążewski, Harmonious coloring of uniform hypergraphs, Applicable Analysis and Discrete Mathematics 10, pp. 73-87, 2016 (DOI:  10.2298/AADM160411008B)
  9. K. Kaczmarski, P. Rzążewski, A. Wolant, Parallel algorithms constructing the cell graph, Concurrency and Computation: Practice and Experience 29, 2017 (DOI: 10.1002/cpe.3943)
  10. M. Dębski, Z. Lonc, P. Rzążewski, Achromatic and harmonious colorings of circulant graphs, Journal of Graph Theory 87, pp. 1097-1118, 2017 (DOI: 10.1002/jgt.22137)
  11. M. Dębski, Z. Lonc, P. Rzążewski, Sequences of radius k for complete bipartite graphs, Discrete Applied Mathematics 225, pp. 51--63, 2017 (DOI: 10.1016/j.dam.2017.03.017)
  12. M. Pergel, P. Rzążewski, On edge intersection graphs of paths with 2 bends, Discrete Applied Mathematics 226, pp. 106--116, 2017 (DOI: 10.1016/j.dam.2017.04.023)
  13. M. Dębski, Z. Lonc, P. Rzążewski, Harmonious and achromatic colorings of fragmentable hypergraphs, European Journal of Combinatorics, 66, pp. 60-80, 2017 (DOI: 10.1016/j.ejc.2017.06.013)
  14. Z. Lonc, P. Naroski, P. Rzążewski, Tight Euler tours in uniform hypergraphs - computational aspects, Discrete Mathematics and Theoretical Computer Science 19:3, #2, 2017
  15. É. Bonnet, T. Miltzow, P. Rzążewski, Complexity of token swapping and its vartiants, Algorithmica 80, pp. 2656--2682, 2018 (DOI: 10.1007/s00453-017-0387-0)
  16. V. Garnero, K. Junosza-Szaniawski, M. Liedloff, P. Montealegre, P. Rzążewski, Fixing improper colorings of graphs, Theoretical Computer Science 711C, pp. 66-78 2018 (DOI: 10.1016/j.tcs.2017.11.013)
  17. K. Junosza-Szaniawski, P. Rzążewski, J. Sokół, K. Węsek, Online coloring and L(2,1)-labeling of unit disk intersection graphs, SIAM J. Discrete Mathematics 32, pp. 1335-1350 (DOI: 10.1137/16M1097821)
  18. V.E. Brimkov, K. Junosza-Szaniawski, S. Kafer, J. Kratochvil, M. Pergel, P. Rzążewski, M. Szczepankiewicz, J. Terhaar, Homothetic Polygons and Beyond: Maximal Cliques in Intersection Graphs, Discrete Applied Mathematics 247, pp. 263-277, 2018 (DOI: 10.1016/j.dam.2018.03.046)
  19. Cs. Biró, É. Bonnet, D. Marx, T. Miltzow, P. Rzążewski, Fine-grained complexity of coloring unit disks and balls, Journal of Computational Geometry 9, pp. 47-80, 2018 (DOI: 10.20382/jocg.v9i2a4)
  20. E. Bonnet, P. Rzążewski, Optimality program in string and segment graphs, Algorithmica, 81(7), pp. 3047-3073,2019 (DOI: 10.1007/s00453-019-00568-7)
  21. D. Dereniowski, D. Osula, P. Rzążewski, Finding small-width connected path decompositions in polynomial time, Theoretical Computer Science (available online)
  22. C. Groenland, K. Okrasa, P. Rzążewski, A. Scott, P. Seymour, S. Spirkl, H-colouring Pt-free graphs in subexponential time (available online)

Reviewed conference proceedings

  1. K. Junosza-Szaniawski, P. Rzążewski, On Improved Exact Algorithms for L(2,1)-labeling of Graphs, IWOCA 2010 Proc., LNCS 6460, pp. 34–37, 2011 (DOI: 10.1007/978-3-642-19222-7)
  2. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rossmanith, P. Rzążewski, Fast Exact Algorithm for L(2,1)-Labeling of Graphs, TAMC 2011 Proc., LNCS 6648, pp. 82-93 (DOI: 10.1007/978-3-642-20877-5)
  3. K. Junosza-Szaniawski, J. Kratochvil, M. Liedloff, P. Rzążewski, Determining the L(2,1)-span in Polynomial Space, WG 2012 Proc., LNCS  7551, pp. 126-137, 2012
  4. K. Kaczmarski, P. Rzążewski, Thrust and CUDA in data intensive algorithms, GID 2012 Proc., AISC 185, pp. 37-46, 2012
  5. K. Junosza-Szaniawski, J. Kratochvil, M. Pergel, P. Rzążewski, Beyond homothetic polygons: recognition and maximum clique, ISAAC 2012 Proc., LNCS 7676, pp. 619-628, 2012
  6. K. Kaczmarski, P. Przymus, P. Rzążewski, Improving High-Performance GPU Graph Traversal with Compression, GID 2014 Proc., AISC 312, pp. 201-214, 2015
  7. K. Junosza-Szaniawski, M. Liedloff, P. Rzążewski, Fixing improper coloring of graphs, SOFSEM 2015 Proc., LNCS 8939, pp. 266-276, 2015
  8. M. Dębski, Z. Lonc, P. Rzążewski, Harmonious and achromatic colorings of fragmentable hypergraphs, EuroComb 2015 Proc., ENDM 49, pp. 309-314, 2015
  9. K. Kaczmarski, P. Rzążewski, A. Wolant, Massively parallel construction of the cell graph, PPAM 2015 Proc., Part I, LNCS 9573, pp. 559-569, 2016
  10. M. Dębski, Z. Lonc, P. Rzążewski, Sequences of radius k for complete bipartite graphs, WG 2016 Proc., LNCS 9941, pp. 1-12, 2016
  11. M. Pergel, P. Rzążewski, On edge intersection graphs of paths with 2 bends, WG 2016 Proc., LNCS 9941, pp. 207-219, 2016 (DOI: 10.1007/978-3-662-53536-3_18)
  12. É. Bonnet, T. Miltzow, P. Rzążewski, Complexity of Token Swapping and its Variants, STACS 2017 Proc. 16:1-16:14, 2017 (DOI: 10.4230/LIPIcs.STACS.2017.16)
  13. Cs. Biró, É. Bonnet, D. Marx, T. Miltzow, P. Rzążewski, Fine-grained complexity of coloring unit disks and balls, SOCG 2017 Proc. 18:1-18:16, 2017 (DOI: 10.4230/LIPIcs.SoCG.2017.18)
  14. L. Egri, D. Marx, P. Rzążewski, Finding list homomorphisms from bounded-treewidth graphs to reflexive graphs: a complete complexity characterization, STACS 2018 Proc. LIPIcs 96, 27:1--27:15, 2018 (DOI: 10.4230/LIPIcs.STACS.2018.27)
  15. É. Bonnet, P. Rzążewski, F. Sikora, Designing RNA Secondary structures is Hard, RECOMB 2018 Proc. LNBI 10812, pp. 248--250
  16. É. Bonnet, P. Giannopoulos, E. J. Kim, P. Rzążewski, F. Sikora, QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs, SoCG 2018 Proc., 12:1--12:15, 2018 (DOI: 10.4230/LIPIcs.SoCG.2018.12)
  17. É. Bonnet, P. Rzążewski, Optimality Program in String and Segment Graphs, WG 2018 Proc., LNCS 11159, pp. 164-175, 2018 (DOI: 10.1007/978-3-030-00256-5_14)
  18. M.G. Dobbins, L. Kleist, T. Milltozw, P. Rzążewski, R-completeness and area-universality, WG 2018 Proc., LNCS 11159, pp. 79-90, 2018 (DOI: 10.1007/978-3-030-00256-5_7)
  19. K. Okrasa, P. Rzążewski, Subexponential algorithms for variants of homomorphism problem in string graphs (accepted to WG 2019)

Preprints and informal proceedings

  1. K. Junosza-Szaniawski, P. Rzążewski, On the number of 2-packings in a connected graph, KAM Series 2010, 991
  2. K. Junosza-Szaniawski, P. Rzążewski, On the Complexity of Exact Algorithm for L(2,1)-labeling of Graphs, KAM Series 2010, 992
  3. K. Junosza-Szaniawski, P. Rzążewski, Determining L(2,1)-span in Polynomial Space, arXiv:1104.4506 [cs.DM]
  4. P. Rzążewski, Exact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism, arXiv:1310.3341 [cs.DM]
  5. K. Junosza-Szaniawski, P. Rzążewski, An Exact Algorithm for the Generalized List T-Coloring Problem, arXiv:1311.0603 [cs.DM]
  6. V.E. Brimkov, K. Junosza-Szaniawski, S. Kafer, J. Kratochvil, M. Pergel, P. Rzążewski, M. Szczepankiewicz, J. Terhaar, Homothetic Polygons and Beyond: Intersection Graphs, Recognition, Maximum Clique, arXiv:1411.2928 [cs.DM]
  7. K. Kaczmarski, P. Rzążewski, A. Wolant, Massively Parallel Construction of the Cell Graph, arXiv:1503.06029 [cs.DC]
  8. K. Junosza-Szaniawski, P. Rzążewski, J. Sokół, K. Węsek, Coloring and L(2,1)-labeling of unit disk intersection graphs, EuroCG 2016 proc.
  9. V. Garnero, K. Junosza-Szaniawski, M. Liedloff, P. Montealegre, P. Rzążewski, Fixing improper colorings of graphsarXiv:1607.06911 [cs.DM]
  10. É. Bonnet, T. Miltzow, P. Rzążewski, Complexity of Token Swapping and its Variants, arXiv:1607.07676 [cs.CC]
  11. Cs. Biró, É. Bonnet, D. Marx, T. Miltzow, P. Rzążewski, Fine-grained complexity of coloring unit disks and balls, EuroCG 2017 Proc., pp. 189-192
  12. L. Kleist, T. Milltozw, P. Rzążewski, Is Area Universality R-complete?, EuroCG 2017 Proc., pp. 181-184
  13. Z. Lonc, P. Naroski, P. Rzążewski, Tight Euler tours in uniform hypergraphs - computational aspects, arXiv:1706.09356 [cs.CC]
  14. É. Bonnet, P. Rzążewski, F. Sikora, Designing RNA Secondary Structures is Hard, arXiv:1710.11513 [cs.DS]
  15. M. Dębski, Z. Lonc, P. Rzążewski, Sequences of radius k for complete bipartite graphs, arXiv:1711.05091 [cs.DM]
  16. M. Pergel, P. Rzążewski, On edge intersection graphs of paths with 2 bends, arXiv:1711.05096 [cs.DM]
  17. M.G. Dobbins, L. Kleist, T. Milltozw, P. Rzążewski, R-completeness and area-universality, arXiv:1712.05142 [cs.CG]
  18. É. Bonnet, P. Giannopoulos, E. J. Kim, P. Rzążewski, F. Sikora, QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs, arXiv:1712.05010 [cs.CG]
  19. É. Bonnet, P. Rzążewski, Optimality Program in String and Segment Graphs, arXiv:1712.08907 [cs.CG]
  20. É. Bonnet, P. Giannopoulos, E. J. Kim, P. Rzążewski, F. Sikora, QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs, EuroCG 2018 Proc.
  21. D. Dereniowski, D. Osula, P. Rzążewski, Finding small-width connected path decompositions in polynomial time, arXiv:a1802.0550 [cs.DS]
  22. K. Okrasa, P. Rzążewski, Intersecting edge distinguishing colorings of hypergraphs, arXiv:1804.10470 [cs.DM]
  23. Carla Groenland, Karolina Okrasa, Pawel Rzążewski, Alex Scott, Paul Seymour, Sophie Spirkl, H-colouring Pt-free graphs in subexponential time, arXiv:1803.05396 [cs.DM]
  24. K. Okrasa, P. Rzążewski, Subexponential algorithms for variants of homomorphism problem in string graphs, arXiv: 1809.09345 [cs.CC]

Manuscripts

  1. K. Edwards, P. Rzążewski, Complete colourings of hypergraphs (submitted)
  2. K. Junosza-Szaniawski, P. Rzążewski, J. Sokół, L(2,1)-labeling of disk intersection graphs (submitted)
  3. M.G. Dobbins, L. Kleist, T. Milltzow, P. Rzążewski, R-completeness and area-universality (submitted)
  4. M. Bonamy, E. Bonnet, N. Bousquet, O. Charbit, P. Giannopoulos, E-J. Kim, P. Rzążewski, F. Sikora, S. Thomasse - EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs (submitted)
  5. M. Chudnovsky, S. Huang, P. Rzążewski, S. Spirkl, M. Zhong, Complexity of Ck-coloring in hereditary classes of graphs (submitted)
  6. S. Kreutzer, T. Masarik, I. Muzi, Ma. Pilipczuk, P. Rzążewski, M. Sorge, Packing directed circuits quarter-integrally (submitted)
  7. J. Novotná, K. Okrasa, Mi. Pilipczuk, P. Rzążewski, E.J. van Leeuwen, B. Walczak, Subexponential-time algorithms for finding large induced sparse subgraphs (submitted)
  8. W. Evans, P. Rzążewski, N. Saeedi, C.-S. Shin, A. Wolff, Representing Graphs and Hypergraphs by Touching Polygons in 3d (submitted)

Popular Science

  1. I. Herburt, P. Rzążewski, Interpolacja fraktalna, czyli dwukrotne fałszerstwo na zamówienie, Delta 07/2011 (446), pp. 14-15

My dblp webpage