Spremljaj
Paweł Rzążewski
Paweł Rzążewski
Warsaw University of Technology, Faculty of Mathematics and Information Science
Preverjeni e-poštni naslov na mini.pw.edu.pl
Naslov
Navedeno
Navedeno
Leto
Complexity of token swapping and its variants
É Bonnet, T Miltzow, P Rzążewski
Algorithmica 80, 2656-2682, 2018
472018
On edge intersection graphs of paths with 2 bends
M Pergel, P Rzążewski
Graph-Theoretic Concepts in Computer Science: 42nd International Workshop …, 2016
282016
Designing RNA secondary structures is hard
É Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
262020
-Completeness and Area-Universality
MG Dobbins, L Kleist, T Miltzow, P Rzążewski
Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018
262018
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
252019
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
222021
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
222020
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
202021
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
192021
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
172017
Exact algorithm for graph homomorphism and locally injective graph homomorphism
P Rzążewski
Information Processing Letters 114 (7), 387-391, 2014
172014
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
152019
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
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
132021
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
132020
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
132015
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
122020
Optimality program in segment and string graphs
É Bonnet, P Rzążewski
Algorithmica 81, 3047-3073, 2019
122019
Finding list homomorphisms from bounded-treewidth graphs to reflexive graphs: a complete complexity characterization
L Egri, D Marx, P Rzazewski
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018
122018
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
122011
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20