Publikacje

Czasopismo: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

2022

• Meike Hatzel, Pawel 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
• Andrzej Grzesik, Tomáš Masařík , Łukasz Bożyk , Jana Novotná, Meike Hatzel, Marthe Bonamy, 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