Paweł Rzążewski
Paweł Rzążewski
Warsaw University of Technology, Faculty of Mathematics and Information Science
Verified email at mini.pw.edu.pl
Title
Cited by
Cited by
Year
Complexity of token swapping and its variants
É Bonnet, T Miltzow, P Rzążewski
Algorithmica 80 (9), 2656-2682, 2018
302018
On edge intersection graphs of paths with 2 bends
M Pergel, P Rzążewski
International Workshop on Graph-Theoretic Concepts in Computer Science, 207-219, 2016
222016
H-colouring Pt-free graphs in subexponential time
C Groenland, K Okrasa, P Rzążewski, A Scott, P Seymour, S Spirkl
Discrete Applied Mathematics 267, 184-189, 2019
182019
Designing RNA secondary structures is hard
É Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
152020
Fast exact algorithm for L (2, 1)-labeling of graphs
K Junosza-Szaniawski, J Kratochvíl, M Liedloff, P Rossmanith, ...
Theoretical Computer Science 505, 42-54, 2013
152013
On the complexity of exact algorithm for L (2, 1)-labeling of graphs
K Junosza-Szaniawski, P Rzążewski
Information Processing Letters 111 (14), 697-701, 2011
132011
On improved exact algorithms for L (2, 1)-labeling of graphs
K Junosza-Szaniawski, P Rzążewski
International Workshop on Combinatorial Algorithms, 34-37, 2010
132010
Exact algorithm for graph homomorphism and locally injective graph homomorphism
P Rzążewski
Information Processing Letters 114 (7), 387-391, 2014
122014
Fine-grained complexity of coloring unit disks and balls
C Biró, É Bonnet, D Marx, T Miltzow, P Rzazewski
Journal of Computational Geometry 9 (2), 47-87, 2018
112018
Homothetic polygons and beyond: Maximal cliques in intersection graphs
VE Brimkov, K Junosza-Szaniawski, S Kafer, J Kratochvíl, M Pergel, ...
Discrete Applied Mathematics 247, 263-277, 2018
10*2018
QPTAS and subexponential algorithm for maximum clique on disk graphs
É Bonnet, P Giannopoulos, EJ Kim, P Rzążewski, F Sikora
arXiv preprint arXiv:1712.05010, 2017
102017
-Completeness and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
International Workshop on Graph-Theoretic Concepts in Computer Science, 164-175, 2018
92018
On the number of 2-packings in a connected graph
K Junosza-Szaniawski, P Rzążewski
Discrete Mathematics 312 (23), 3444-3450, 2012
92012
Improving high-performance GPU graph traversal with compression
K Kaczmarski, P Przymus, P Rzążewski
New Trends in Database and Information Systems II, 201-214, 2015
82015
Subexponential algorithms for variants of the homomorphism problem in string graphs
K Okrasa, P Rzążewski
Journal of Computer and System Sciences 109, 126-144, 2020
72020
Induced subgraphs of bounded treewidth and the container method
T Abrishami, M Chudnovsky, M Pilipczuk, P Rzążewski, P Seymour
arXiv preprint arXiv:2003.05185, 2020
72020
Optimality program in segment and string graphs
É Bonnet, P Rzążewski
Algorithmica 81 (7), 3047-3073, 2019
72019
Harmonious coloring of uniform hypergraphs
B Bosek, S Czerwiński, J Grytczuk, P Rzążewski
Applicable Analysis and Discrete Mathematics 10 (1), 73-87, 2016
72016
Determining the L (2, 1)-span in polynomial space
K Junosza-Szaniawski, J Kratochvíl, M Liedloff, P Rzążewski
Discrete Applied Mathematics 161 (13-14), 2052-2061, 2013
72013
Representing graphs and hypergraphs by touching polygons in 3D
W Evans, P Rzążewski, N Saeedi, CS Shin, A Wolff
International Symposium on Graph Drawing and Network Visualization, 18-32, 2019
62019
The system can't perform the operation now. Try again later.
Articles 1–20