Paweł Rzążewski
Paweł Rzążewski
Warsaw University of Technology, Faculty of Mathematics and Information Science
Verifisert e-postadresse på mini.pw.edu.pl
Tittel
Sitert av
Sitert av
År
Complexity of token swapping and its variants
É Bonnet, T Miltzow, P Rzążewski
Algorithmica 80 (9), 2656-2682, 2018
392018
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
262016
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
212019
Designing RNA secondary structures is hard
É Bonnet, P Rzążewski, F Sikora
Journal of Computational Biology 27 (3), 302-316, 2020
172020
-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
172018
Exact algorithm for graph homomorphism and locally injective graph homomorphism
P Rzążewski
Information Processing Letters 114 (7), 387-391, 2014
152014
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
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
122021
Fine-grained complexity of coloring unit disks and balls
B Csaba, É Bonnet, D Marx, M Tillmann, P Rzążewski
Journal of Computational Geometry, 2018
11*2018
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
102020
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
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
92019
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 (10), 2841-2866, 2020
82020
Optimality program in segment and string graphs
É Bonnet, P Rzążewski
Algorithmica 81 (7), 3047-3073, 2019
82019
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
82018
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
82016
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
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20