Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel Rzazewski
Paweł Rzążewski
Person information
- unicode name: Paweł Rzążewski
- affiliation: Warsaw University of Technology, Faculty of Mathematics and Information Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j50]Jan Bok
, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs with Semi-edges. Algorithmica 86(3): 782-807 (2024)- [j49]Katarzyna Lyczek, Maria Nazarczuk, Pawel Rzazewski:
Towards the Chen-Raspaud conjecture. Discret. Math. 347(3): 113798 (2024) - [j48]Mateusz Krzyzinski, Pawel Rzazewski, Szymon Tur:
Coloring squares of planar graphs with small maximum degree. Discuss. Math. Graph Theory 44(3): 817 (2024) - [j47]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. J. Comb. Theory B 164: 371-403 (2024) - [j46]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. 53(3): 624-647 (2024) - [j45]Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. ACM Trans. Algorithms 20(2): 11 (2024) - [j44]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Classifying subset feedback vertex set for H-free graphs. Theor. Comput. Sci. 1003: 114624 (2024) - [c50]Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. ICALP 2024: 34:1-34:17 - [c49]Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski:
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP 2024: 77:1-77:21 - [c48]Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Sparse induced subgraphs in P6-free graphs. SODA 2024: 5291-5299 - [c47]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski:
Max Weight Independent Set in Sparse Graphs with No Long Claws. STACS 2024: 4:1-4:15 - [c46]Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC 2024: 683-691 - [i57]Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. CoRR abs/2402.07331 (2024) - [i56]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Polynomial Time. CoRR abs/2402.11465 (2024) - [i55]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR abs/2402.15834 (2024) - 2023
- [j43]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica 85(4): 902-928 (2023) - [j42]Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality. Discret. Comput. Geom. 70(1): 154-188 (2023) - [j41]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. Inf. Comput. 292: 105015 (2023) - [j40]Natasha Morrison, JD Nir, Sergey Norin, Pawel Rzazewski, Alexandra Wesolek:
Every graph is eventually Turán-good. J. Comb. Theory B 162: 231-243 (2023) - [j39]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-width: Harnessing the power of atoms. J. Graph Theory 104(4): 769-810 (2023) - [c45]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink:
Coloring and Recognizing Mixed Interval Graphs. ISAAC 2023: 36:1-36:14 - [i54]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink:
Coloring and Recognizing Directed Interval Graphs. CoRR abs/2303.07960 (2023) - [i53]Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR abs/2305.15738 (2023) - [i52]Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Sparse induced subgraphs in P_6-free graphs. CoRR abs/2307.07330 (2023) - [i51]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski:
Max Weight Independent Set in sparse graphs with no long claws. CoRR abs/2309.16995 (2023) - [i50]Marcin Pilipczuk, Pawel Rzazewski:
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. CoRR abs/2310.11573 (2023) - [i49]Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski:
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR abs/2312.03859 (2023) - 2022
- [j38]Konstanty Junosza-Szaniawski, Dariusz Nogalski, Pawel Rzazewski:
Exact and Approximation Algorithms for Sensor Placement Against DDoS Attacks. Int. J. Appl. Math. Comput. Sci. 32(1): 35-49 (2022) - [j37]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Cycles Quarter- and Half-Integrally. Comb. 42(Supplement 2): 1409-1438 (2022) - [j36]Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak:
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. J. Comb. Theory B 152: 353-378 (2022) - [j35]Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. 36(2): 922-938 (2022) - [j34]Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-Coloring of Small-Diameter Graphs. SIAM J. Discret. Math. 36(3): 2205-2224 (2022) - [j33]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. SIAM J. Discret. Math. 36(4): 2453-2472 (2022) - [c44]Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza:
Taming Graphs with No Large Creatures and Skinny Ladders. ESA 2022: 58:1-58:8 - [c43]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP 2022: 93:1-93:19 - [c42]Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. ISAAC 2022: 14:1-14:16 - [c41]Pavel Dvorák, Tomás Masarík, Jana Novotná, Monika Krawczyk, Pawel Rzazewski, Aneta Zuk:
List Locally Surjective Homomorphisms in Hereditary Graph Classes. ISAAC 2022: 30:1-30:15 - [c40]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List Covering of Regular Multigraphs. IWOCA 2022: 228-242 - [c39]Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. SODA 2022: 431-458 - [c38]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski:
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. SODA 2022: 1448-1470 - [c37]Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski:
Computing List Homomorphisms in Geometric Intersection Graphs. WG 2022: 313-327 - [c36]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Classifying Subset Feedback Vertex Set for H-Free Graphs. WG 2022: 412-424 - [i48]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Classifying Subset Feedback Vertex Set for H-Free Graphs. CoRR abs/2201.00430 (2022) - [i47]Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski:
Computing list homomorphisms in geometric intersection graphs. CoRR abs/2202.08896 (2022) - [i46]Pavel Dvorák, Monika Krawczyk, Tomás Masarík, Jana Novotná, Pawel Rzazewski, Aneta Zuk:
List Locally Surjective Homomorphisms in Hereditary Graph Classes. CoRR abs/2202.12438 (2022) - [i45]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR abs/2203.04836 (2022) - [i44]Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski:
List covering of regular multigraphs. CoRR abs/2204.04280 (2022) - [i43]Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza:
Taming graphs with no large creatures and skinny ladders. CoRR abs/2205.01191 (2022) - [i42]Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws. CoRR abs/2205.13270 (2022) - [i41]Martin Milanic, Pawel Rzazewski:
Tree decompositions with bounded independence number: beyond independent sets. CoRR abs/2209.12315 (2022) - [i40]Konstanty Junosza-Szaniawski, Dariusz Nogalski, Pawel Rzazewski:
Exact and approximation algorithms for sensor placement against DDoS attacks. CoRR abs/2210.06559 (2022) - [i39]Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. CoRR abs/2210.10677 (2022) - 2021
- [j32]Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83(8): 2634-2650 (2021) - [j31]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68(2): 9:1-9:38 (2021) - [j30]Karolina Okrasa, Pawel Rzazewski:
Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs. SIAM J. Comput. 50(2): 487-508 (2021) - [j29]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. SIAM J. Discret. Math. 35(4): 2357-2386 (2021) - [c35]Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-Coloring of Small-Diameter Graphs. ESA 2021: 37:1-37:15 - [c34]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. MFCS 2021: 82:1-82:14 - [c33]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. SODA 2021: 1948-1964 - [c32]Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths. SOSA 2021: 204-209 - [c31]Karolina Okrasa, Pawel Rzazewski:
Complexity of the List Homomorphism Problem in Hereditary Graph Classes. STACS 2021: 54:1-54:17 - [c30]Marta Piecyk, Pawel Rzazewski:
Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. STACS 2021: 56:1-56:17 - [c29]Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time. STOC 2021: 330-341 - [e1]Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski:
Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12911, Springer 2021, ISBN 978-3-030-86837-6 [contents] - [i38]Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant congestion brambles in directed graphs. CoRR abs/2103.08445 (2021) - [i37]Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-coloring of small-diameter graphs. CoRR abs/2104.13860 (2021) - [i36]Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. CoRR abs/2105.02736 (2021) - [i35]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski:
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. CoRR abs/2107.05434 (2021) - [i34]Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. CoRR abs/2107.06889 (2021) - [i33]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé:
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR abs/2110.15419 (2021) - 2020
- [j28]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82(10): 2841-2866 (2020) - [j27]Joanna Sokól, Konstanty Junosza-Szaniawski, Pawel Rzazewski:
L(2, 1)-labeling of disk intersection graphs. Discret. Appl. Math. 277: 71-81 (2020) - [j26]Keith Edwards, Pawel Rzazewski:
Complete colourings of hypergraphs. Discret. Math. 343(2): 111673 (2020) - [j25]Édouard Bonnet, Pawel Rzazewski, Florian Sikora:
Designing RNA Secondary Structures Is Hard. J. Comput. Biol. 27(3): 302-316 (2020) - [j24]Karolina Okrasa, Pawel Rzazewski:
Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. 109: 126-144 (2020) - [c28]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. ESA 2020: 35:1-35:17 - [c27]Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. ESA 2020: 74:1-74:24 - [c26]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. ISAAC 2020: 58:1-58:17 - [c25]Karolina Okrasa, Pawel Rzazewski:
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. SODA 2020: 1578-1590 - [c24]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. WG 2020: 40-53 - [c23]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-Width: Harnessing the Power of Atoms. WG 2020: 119-133 - [i32]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. CoRR abs/2003.05185 (2020) - [i31]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding large $H$-colorable subgraphs in hereditary graph classes. CoRR abs/2004.09425 (2020) - [i30]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-coloring in hereditary classes of graphs. CoRR abs/2005.01824 (2020) - [i29]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-Width: Harnessing the Power of Atoms. CoRR abs/2006.03578 (2020) - [i28]Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. CoRR abs/2006.10444 (2020) - [i27]Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Full complexity classification of the list homomorphism problem for bounded-treewidth graphs. CoRR abs/2006.11155 (2020) - [i26]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. CoRR abs/2009.08353 (2020) - [i25]Marta Piecyk, Pawel Rzazewski:
Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth. CoRR abs/2009.11642 (2020) - [i24]Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Quasi-polynomial-time algorithm for Independent Set in Pt-free and C>t-free graphs via shrinking the space of connecting subgraphs. CoRR abs/2009.13494 (2020) - [i23]Karolina Okrasa, Pawel Rzazewski:
Complexity of the list homomorphism problem in hereditary graph classes. CoRR abs/2010.03393 (2020)
2010 – 2019
- 2019
- [j23]Édouard Bonnet, Pawel Rzazewski:
Optimality Program in Segment and String Graphs. Algorithmica 81(7): 3047-3073 (2019) - [j22]Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267: 184-189 (2019) - [j21]Dariusz Dereniowski, Dorota Osula, Pawel Rzazewski:
Finding small-width connected path decompositions in polynomial time. Theor. Comput. Sci. 794: 85-100 (2019) - [c22]Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong:
Complexity of Ck-Coloring in Hereditary Classes of Graphs. ESA 2019: 31:1-31:15 - [c21]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Circuits Quarter-Integrally. ESA 2019: 72:1-72:13 - [c20]William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. GD 2019: 18-32 - [c19]Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC 2019: 23:1-23:11 - [c18]Karolina Okrasa, Pawel Rzazewski:
Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. WG 2019: 1-13 - [i22]Karolina Okrasa, Pawel Rzazewski:
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. CoRR abs/1906.08371 (2019) - [i21]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing directed circuits quarter-integrally. CoRR abs/1907.02494 (2019) - [i20]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR abs/1908.00491 (2019) - [i19]William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR abs/1908.08273 (2019) - [i18]Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR abs/1910.01082 (2019) - 2018
- [j20]Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski:
Complexity of Token Swapping and Its Variants. Algorithmica 80(9): 2656-2682 (2018) - [j19]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic polygons and beyond: Maximal cliques in intersection graphs. Discret. Appl. Math. 247: 263-277 (2018) - [j18]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Achromatic and Harmonious Colorings of Circulant Graphs. J. Graph Theory 87(1): 18-34 (2018) - [j17]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. 9(2): 47-80 (2018) - [j16]Konstanty Junosza-Szaniawski, Pawel Rzazewski, Joanna Sokól, Krzysztof Wesek:
Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs. SIAM J. Discret. Math. 32(2): 1335-1350 (2018) - [j15]Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. Theor. Comput. Sci. 711: 66-78 (2018) - [c17]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG 2018: 12:1-12:15 - [c16]Édouard Bonnet, Pawel Rzazewski, Florian Sikora:
Designing RNA Secondary Structures Is Hard. RECOMB 2018: 248-250 - [c15]László Egri, Dániel Marx, Pawel Rzazewski:
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. STACS 2018: 27:1-27:15 - [c14]Édouard Bonnet, Pawel Rzazewski:
Optimality Program in Segment and String Graphs. WG 2018: 79-90 - [c13]Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
∀∃ℝ-Completeness and Area-Universality. WG 2018: 164-175 - [i17]Dariusz Dereniowski, Dorota Osula, Pawel Rzazewski:
Finding small-width connected path decompositions in polynomial time. CoRR abs/1802.05501 (2018) - [i16]Karolina Okrasa, Pawel Rzazewski:
Intersecting edge distinguishing colorings of hypergraphs. CoRR abs/1804.10470 (2018) - [i15]Karolina Okrasa, Pawel Rzazewski:
Subexponential algorithms for variants of homomorphism problem in string graphs. CoRR abs/1809.09345 (2018) - 2017
- [j14]Krzysztof Kaczmarski, Pawel Rzazewski, Albert Wolant:
Parallel algorithms constructing the cell graph. Concurr. Comput. Pract. Exp. 29(23) (2017) - [j13]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of radius k for complete bipartite graphs. Discret. Appl. Math. 225: 51-63 (2017) - [j12]Martin Pergel, Pawel Rzazewski:
On edge intersection graphs of paths with 2 bends. Discret. Appl. Math. 226: 106-116 (2017) - [j11]Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski:
Tight Euler tours in uniform hypergraphs - computational aspects. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j10]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Harmonious and achromatic colorings of fragmentable hypergraphs. Eur. J. Comb. 66: 60-80 (2017) - [j9]J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski:
Erratum: Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 31(1): 645-646 (2017) - [c12]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG 2017: 18:1-18:16 - [c11]Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski:
Complexity of Token Swapping and its Variants. STACS 2017: 16:1-16:14 - [i14]Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski:
Tight Euler tours in uniform hypergraphs - computational aspects. CoRR abs/1706.09356 (2017) - [i13]Édouard Bonnet, Pawel Rzazewski, Florian Sikora:
Designing RNA Secondary Structures is Hard. CoRR abs/1710.11513 (2017) - [i12]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of radius k for complete bipartite graphs. CoRR abs/1711.05091 (2017) - [i11]Martin Pergel, Pawel Rzazewski:
On edge intersection graphs of paths with 2 bends. CoRR abs/1711.05096 (2017) - [i10]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR abs/1712.05010 (2017) - [i9]Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski:
∀∃R-completeness and area-universality. CoRR abs/1712.05142 (2017) - [i8]Édouard Bonnet, Pawel Rzazewski:
Optimality Program in Segment and String Graphs. CoRR abs/1712.08907 (2017) - 2016
- [j8]J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski:
Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 30(1): 452-464 (2016) - [c10]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Sequences of Radius k for Complete Bipartite Graphs. WG 2016: 1-12 - [c9]Martin Pergel, Pawel Rzazewski:
On Edge Intersection Graphs of Paths with 2 Bends. WG 2016: 207-219 - [i7]Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. CoRR abs/1607.06911 (2016) - [i6]Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski:
Complexity of Token Swapping and its Variants. CoRR abs/1607.07676 (2016) - 2015
- [j7]Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Harmonious and achromatic colorings of fragmentable hypergraphs. Electron. Notes Discret. Math. 49: 309-314 (2015) - [c8]Krzysztof Kaczmarski, Pawel Rzazewski, Albert Wolant:
Massively Parallel Construction of the Cell Graph. PPAM (1) 2015: 559-569 - [c7]Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pawel Rzazewski:
Fixing Improper Colorings of Graphs. SOFSEM 2015: 266-276 - [i5]Krzysztof Kaczmarski, Pawel Rzazewski, Albert Wolant:
Massively Parallel Construction of the Cell Graph. CoRR abs/1503.06029 (2015) - 2014
- [j6]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
An Exact Algorithm for the Generalized List T-Coloring Problem. Discret. Math. Theor. Comput. Sci. 16(3): 77-94 (2014) - [j5]Pawel Rzazewski:
Exact algorithm for graph homomorphism and locally injective graph homomorphism. Inf. Process. Lett. 114(7): 387-391 (2014) - [c6]Krzysztof Kaczmarski, Piotr Przymus, Pawel Rzazewski:
Improving High-Performance GPU Graph Traversal with Compression. ADBIS (2) 2014: 201-214 - [i4]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. CoRR abs/1411.2928 (2014) - 2013
- [j4]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)L(2, 1)-span in polynomial space. Discret. Appl. Math. 161(13-14): 2052-2061 (2013) - [j3]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
Fast exact algorithm for L(2, 1)-labeling of graphs. Theor. Comput. Sci. 505: 42-54 (2013) - [i3]Pawel Rzazewski:
Exact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism. CoRR abs/1310.3341 (2013) - [i2]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
An Exact Algorithm for the Generalized List $T$-Coloring Problem. CoRR abs/1311.0603 (2013) - 2012
- [j2]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On the number of 2-packings in a connected graph. Discret. Math. 312(23): 3444-3450 (2012) - [c5]Krzysztof Kaczmarski, Pawel Rzazewski:
Thrust and CUDA in Data Intensive Algorithms. ADBIS Workshops 2012: 37-46 - [c4]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski:
Beyond Homothetic Polygons: Recognition and Maximum Clique. ISAAC 2012: 619-628 - [c3]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
Determining the L(2, 1)-Span in Polynomial Space. WG 2012: 126-137 - 2011
- [j1]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On the complexity of exact algorithm for L(2, 1)-labeling of graphs. Inf. Process. Lett. 111(14): 697-701 (2011) - [c2]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski:
Fast Exact Algorithm for L(2, 1)-Labeling of Graphs. TAMC 2011: 82-93 - [i1]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
Determining L(2,1)-Span in Polynomial Space. CoRR abs/1104.4506 (2011) - 2010
- [c1]Konstanty Junosza-Szaniawski, Pawel Rzazewski:
On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs. IWOCA 2010: 34-37
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
