Follow
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, 2656-2682, 2018
512018
Designing RNA secondary structures is hard
É Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
332020
Induced subgraphs of bounded treewidth and the container method
T Abrishami, M Chudnovsky, M Pilipczuk, P Rzążewski, P Seymour
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
292021
On edge intersection graphs of paths with 2 bends
M Pergel, P Rzążewski
Graph-Theoretic Concepts in Computer Science: 42nd International Workshop …, 2016
272016
Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time
P Gartland, D Lokshtanov, M Pilipczuk, M Pilipczuk, P Rzążewski
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
262021
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
262019
-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
262018
Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths
M Pilipczuk, M Pilipczuk, P Rzążewski
Symposium on Simplicity in Algorithms (SOSA), 204-209, 2021
252021
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree
T Abrishami, M Chudnovsky, C Dibek, S Hajebi, P Rzążewski, S Spirkl, ...
arXiv preprint arXiv:2108.01162, 2021
232021
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
232020
Representing graphs and hypergraphs by touching polygons in 3D
W Evans, P Rzążewski, N Saeedi, CS Shin, A Wolff
Graph Drawing and Network Visualization: 27th International Symposium, GD …, 2019
212019
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
202017
Exact algorithm for graph homomorphism and locally injective graph homomorphism
P Rzążewski
Information Processing Letters 114 (7), 387-391, 2014
182014
Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
K Okrasa, P Rzaͅżewski
SIAM Journal on Computing 50 (2), 487-508, 2021
172021
On cycle transversals and their connected variants in the absence of a small linear forest
KK Dabrowski, C Feghali, M Johnson, G Paesani, D Paulusma, ...
Algorithmica 82, 2841-2866, 2020
172020
Fine-grained complexity of coloring unit disks and balls
B Csaba, É Bonnet, D Marx, M Tillmann, P Rzążewski
Journal of Computational Geometry, 2018
17*2018
Improving high-performance GPU graph traversal with compression
K Kaczmarski, P Przymus, P Rzążewski
New Trends in Database and Information Systems II: Selected papers of the …, 2015
172015
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
162013
EPTAS and subexponential algorithm for maximum clique on disk and unit ball graphs
M Bonamy, É Bonnet, N Bousquet, P Charbit, P Giannopoulos, EJ Kim, ...
Journal of the ACM (JACM) 68 (2), 1-38, 2021
152021
Full complexity classification of the list homomorphism problem for bounded-treewidth graphs
K Okrasa, M Piecyk, P Rzążewski
arXiv preprint arXiv:2006.11155, 2020
152020
The system can't perform the operation now. Try again later.
Articles 1–20