Sledovat
Paweł Rzążewski
Paweł Rzążewski
Warsaw University of Technology, Faculty of Mathematics and Information Science
E-mailová adresa ověřena na: mini.pw.edu.pl
Název
Citace
Citace
Rok
Complexity of token swapping and its variants
É Bonnet, T Miltzow, P Rzążewski
Algorithmica 80, 2656-2682, 2018
622018
Designing RNA secondary structures is hard
É Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
452020
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
412021
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
382021
Induced subgraphs of bounded treewidth and the container method
T Abrishami, M Chudnovsky, M Pilipczuk, P Rzążewski, P Seymour
SIAM Journal on Computing 53 (3), 624-647, 2024
372024
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
302021
-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
292018
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
282020
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
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
272019
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, ...
Journal of Combinatorial Theory, Series B 164, 371-403, 2024
262024
Fine-grained complexity of coloring unit disks and balls
B Csaba, É Bonnet, D Marx, M Tillmann, P Rzążewski
Journal of Computational Geometry, 2018
24*2018
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
232021
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
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
232019
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
222018
Optimality program in segment and string graphs
É Bonnet, P Rzążewski
Algorithmica 81, 3047-3073, 2019
202019
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
202014
Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws
T Abrishami, M Chudnovsky, C Dibek, P Rzążewski
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
192022
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20