Publikacje

Czasopismo: Discrete Mathematics and Theoretical Computer Science

2025

• Paweł Rzążewski , Marcin Pilipczuk, A polynomial bound on the number of minimal separators and potential maximal cliques in P6-free graphs of bounded clique number, Discrete Mathematics and Theoretical Computer Science, 27 (2) 2025, s. 1-5. Zobacz w PBN
• Maël Dumas , Anthony Perez, Mathis Rocton, Ioan Todinca, Polynomial kernels for edge modification problems towards block and strictly chordal graphs, Discrete Mathematics and Theoretical Computer Science, vol. 27:2 (Discrete Algorithms) 2025. Zobacz w PBN

2022

• Meike Hatzel, Paweł Komosa, Marcin Pilipczuk , Manuel Sorge, Constant Congestion Brambles, Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 1 (Graph Theory) 2022. Zobacz w PBN
• Łukasz Bożyk , Michał Pilipczuk , On the Erdős-Pósa property for immersions and topological minors in tournaments, Discrete Mathematics and Theoretical Computer Science, 24 (1) 2022, s. #12. Zobacz w PBN
• Marthe Bonamy, Łukasz Bożyk , Andrzej Grzesik, Meike Hatzel, Tomáš Masařík , Jana Masaříková , Karolina Okrasa, Tuza's conjecture for threshold graphs, Discrete Mathematics and Theoretical Computer Science, 24 (1) 2022, s. 1-14. Zobacz w PBN

2020

• Marcin Pilipczuk , Manuel Sorge, A Double Exponential Lower Bound for the Distinct Vectors Problem, Discrete Mathematics and Theoretical Computer Science, 22 (4) 2020. Zobacz w PBN
• Paweł Parys , A Type System Describing Unboundedness, Discrete Mathematics and Theoretical Computer Science, 22 (4) 2020. Zobacz w PBN
• Lo{\"{\i}}c Dubois, Gwena{\"{e}}l Joret, Guillem Perarnau, Marcin Pilipczuk , Fran{\c{c}}ois Pitois, Two lower bounds for p-centered colorings, Discrete Mathematics and Theoretical Computer Science, 22 2020. Zobacz w PBN

2017

• Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski , Tight Euler tours in uniform hypergraphs - computational aspects, Discrete Mathematics and Theoretical Computer Science, 19 (3) 2017, s. 1-13. Zobacz w PBN

2014

• Konstanty Junosza-Szaniawski, Paweł Rzążewski , An Exact Algorithm for the Generalized List T-Coloring Problem, Discrete Mathematics and Theoretical Computer Science, 16 (3) 2014, s. 77-94. Zobacz w PBN

2013

• Marek Cygan , Marcin Pilipczuk , Riste Skrekovski, A bound on the number of perfect matchings in Klee-graphs, Discrete Mathematics and Theoretical Computer Science, 15 (1) 2013, s. 37-54. Zobacz w PBN