Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Rzążewski, Paweł
188  Ergebnisse:
Personensuche X
?
1

Classifying subset feedback vertex set for H-free graphs:

Paesani, Giacomo ; Paulusma, Daniël ; Rzążewski, Paweł
Theoretical Computer Science.  1003 (2024)  - p. 114624 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Towards the Chen-Raspaud conjecture:

Łyczek, Katarzyna ; Nazarczuk, Maria ; Rzążewski, Paweł
Discrete Mathematics.  347 (2024)  3 - p. 113798 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Induced Subgraphs of Bounded Treewidth and the Container Me..:

Abrishami, Tara ; Chudnovsky, Maria ; Pilipczuk, Marcin..
SIAM Journal on Computing.  53 (2024)  3 - p. 624-647 , 2024
Link: https://doi.org/10.1137/..
 
?
4

Induced subgraphs and tree decompositions II. Toward walls ..:

Abrishami, Tara ; Chudnovsky, Maria ; Dibek, Cemil...
Journal of Combinatorial Theory, Series B.  164 (2024)  - p. 371-403 , 2024
Link: https://doi.org/10.1016/..
 
?
5

Maximum Weight Independent Set in Graphs with no Long Claws..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Gartland, Peter ; Lokshtanov, Daniel ; Masařík, Tomáš... - p. 683-691 , 2024
Link: https://dl.acm.org/doi/1..
 
?
6

Counting List Homomorphisms from Graphs of Bounded Treewidt..:

Focke, Jacob ; Marx, Dániel ; Rzążewski, Paweł
ACM Transactions on Algorithms.  20 (2024)  2 - p. 1-32 , 2024
Link: https://doi.org/10.1145/..
 
?
7

Max Weight Independent Set in Graphs with No Long Claws: An..:

Majewski, Konrad ; Masařík, Tomáš ; Masaříková, Jana...
ACM Transactions on Computation Theory.  16 (2024)  2 - p. 1-18 , 2024
Link: https://doi.org/10.1145/..
 
?
8

List Covering of Regular Multigraphs with Semi-edges:

Bok, Jan ; Fiala, Jiří ; Jedličková, Nikola..
Algorithmica.  86 (2023)  3 - p. 782-807 , 2023
Link: https://doi.org/10.1007/..
 
?
9

Clique‐width: Harnessing the power of atoms:

Dabrowski, Konrad K. ; Masařík, Tomáš ; Novotná, Jana..
Journal of Graph Theory.  104 (2023)  4 - p. 769-810 , 2023
Link: https://doi.org/10.1002/..
 
?
10

Sparsification Lower Bounds for ListH-Coloring:

Chen, Hubie ; Jansen, Bart M. P. ; Okrasa, Karolina..
ACM Transactions on Computation Theory.  15 (2023)  3-4 - p. 1-23 , 2023
Link: https://doi.org/10.1145/..
 
?
11

Every graph is eventually Turán-good:

Morrison, Natasha ; Nir, JD ; Norin, Sergey..
Journal of Combinatorial Theory, Series B.  162 (2023)  - p. 231-243 , 2023
Link: https://doi.org/10.1016/..
 
?
12

Correction to: Graph-Theoretic Concepts in Computer Science:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Kowalik, Łukasz ; Pilipczuk, Michał ; Rzążewski, Paweł - p. C2-C2 , 2023
Link: https://doi.org/10.1007/..
 
?
13

Complexity of C-coloring in hereditary classes of graphs:

Chudnovsky, Maria ; Huang, Shenwei ; Rzążewski, Paweł..
Information and Computation.  292 (2023)  - p. 105015 , 2023
Link: https://doi.org/10.1016/..
 
?
14

Degeneracy of P-free and C⩾-free graphs with no large compl..:

Bonamy, Marthe ; Bousquet, Nicolas ; Pilipczuk, Michał...
Journal of Combinatorial Theory, Series B.  152 (2022)  - p. 353-378 , 2022
Link: https://doi.org/10.1016/..
 
?
15

Computing List Homomorphisms in Geometric Intersection Grap..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Kisfaludi-Bak, Sándor ; Okrasa, Karolina ; Rzążewski, Paweł - p. 313-327 , 2022
Link: https://doi.org/10.1007/..
 
1-15