Paweł Rzążewski

University of Warsaw

Poland

Research Interests

Explore related searches

Professors in Poland

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

Articles (16)

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Collaborators (8)

Konrad Dabrowski

Lecturer

Newcastle University

UNITED KINGDOM

View details

Giacomo Paesani

University of Leeds

UNITED KINGDOM

View details

Karolina Okrasa

University of Warsaw

POLAND

View details

Stéphan Thomassé

lip université de lyon lyon cedex 07 france

FRANCE

View details

Pierre Charbit

Université Paris-Saclay

FRANCE

View details

Marcin Pilipczuk

University of Warsaw

POLAND

View details

Tomáš Masařík

assistant professor

University of Warsaw

POLAND

View details

Jan Kratochvíl

Charles University

CZECH REPUBLIC

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Paweł Rzążewski

Research Interests

Explore related searches

Contact this professor

Articles (16)

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument

Induced Subgraphs of Bounded Treewidth and the Container Method

Classifying subset feedback vertex set for H-free graphs

Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds

Towards the Chen-Raspaud conjecture

List Covering of Regular Multigraphs with Semi-edges

Clique‐width: Harnessing the power of atoms

Sparsification Lower Bounds for List H -Coloring

Constant Congestion Brambles in Directed Graphs

Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs

Faster 3-Coloring of Small-Diameter Graphs

Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs

Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs

Collaborators (8)

Konrad Dabrowski

Giacomo Paesani

Karolina Okrasa

Stéphan Thomassé

Pierre Charbit

Marcin Pilipczuk

Tomáš Masařík

Jan Kratochvíl

Make your next move.