Publikacje

Czasopismo: SIAM Journal on Discrete Mathematics

Liczba publikacji: 27

2023

• Jesper Nederlof, Michał Pilipczuk , Celine M. F. Swennenhuis, Karol Węgrzycki, Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space, SIAM Journal on Discrete Mathematics, 37 (3) 2023, s. 1566-1586. Zobacz w PBN
• Kunal Dutta , C. R. Subramanian, On Induced Paths, Holes, and Trees in Random Graphs, SIAM Journal on Discrete Mathematics, 37 (1) 2023, s. 279-303. Zobacz w PBN
• Calum MacRury, Tomáš Masařík , Leilani Pai, Xavier Pérez-Giménez, The Phase Transition of Discrepancy in Random Hypergraphs, SIAM Journal on Discrete Mathematics, 37 (3) 2023, s. 1818-1841. Zobacz w PBN

2022

• Tomáš Masařík , Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Constant Congestion Brambles in Directed Graphs, SIAM Journal on Discrete Mathematics, 36 (2) 2022, s. 922-938. Zobacz w PBN
• Peter Bradshaw, Tomáš Masařík , Jana Masaříková , Ladislav Stacho, Robust Connectivity of Graphs on Surfaces, SIAM Journal on Discrete Mathematics, 36 (2) 2022, s. 1416-1435. Zobacz w PBN

2021

• Michał Pilipczuk , Michał T. Seweryn, Piotr Micek, Marcin Briański, Erdös-Hajnal properties for powers of sparse graphs, SIAM Journal on Discrete Mathematics, 35 (1) 2021, s. 447-464. Zobacz w PBN
• Maria Chudnovsky, Jason King, Michał Pilipczuk , Paweł Rzążewski , Sophie Spirkl, Finding Large H-Colorable Subgraphs in Hereditary Graph Classes, SIAM Journal on Discrete Mathematics, 35 (4) 2021, s. 2357-2386. Zobacz w PBN
• Wojciech Czerwiński , Wojciech Nadara , Marcin Pilipczuk , Improved Bounds for the Excluded-Minor Approximation of Treedepth, SIAM Journal on Discrete Mathematics, 35 (2) 2021, s. 934-947. Zobacz w PBN
• Archontia Giannopoulou, Michał Pilipczuk , Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Linear kernels for edge deletion problems to immersion-closed graph classes, SIAM Journal on Discrete Mathematics, 35 (1) 2021, s. 105-151. Zobacz w PBN
• Pavel Dvořák, Andreas E. Feldmann, Dušan Knop, Tomáš Masařík , Tomáš Toufar, Pavel Veselý, Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices, SIAM Journal on Discrete Mathematics, 35 (1) 2021, s. 546-574. Zobacz w PBN

2020

• Marcin Wrochna , Homomorphism Reconfiguration via Homotopy, SIAM Journal on Discrete Mathematics, 34 (1) 2020, s. 328-350. Zobacz w PBN
• Maria Chudnovsky, Marcin Pilipczuk , Michał Pilipczuk , Stéphan Thomassé, On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five, SIAM Journal on Discrete Mathematics, 34 (2) 2020, s. 1472-1483. Zobacz w PBN

2019

• Claude Tardif, Marcin Wrochna , Hedetniemi's conjecture and strongly multiplicative graphs, SIAM Journal on Discrete Mathematics, 33 (4) 2019, s. 2218-2250. Zobacz w PBN

2018

• Daniel Lokshtanov, Michał Pilipczuk , Saket Saurabh, Below All Subsets for Minimal Connected Dominating Set, SIAM Journal on Discrete Mathematics, 32 (3) 2018, s. 332--2345. Zobacz w PBN
• Łukasz Kowalik , Juho Lauri, Arkadiusz Socała, On the Fine-Grained Complexity of Rainbow Coloring, SIAM Journal on Discrete Mathematics, 32 (3) 2018, s. 1672–1705. Zobacz w PBN
• Joanna Chybowska-Sokół, Konstanty Junosza-Szaniawski, Paweł Rzążewski , Krzysztof Węsek, ONLINE COLORING AND L(2,1)-LABELING OF UNIT DISK INTERSECTION GRAPHS, SIAM Journal on Discrete Mathematics, 32 (2) 2018, s. 1335-1350. Zobacz w PBN

2017

• Andreas Björklund, Vikram Kamat, Łukasz Kowalik , Meirav Zehavi, Spotting Trees with Few Leaves, SIAM Journal on Discrete Mathematics, 31 (2) 2017, s. 687–713. Zobacz w PBN

2016

• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence, SIAM Journal on Discrete Mathematics, 2016. Zobacz w PBN

2015

• Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk , Michał Pilipczuk , A Subexponential Parameterized Algorithm for Proper Interval Completion, SIAM Journal on Discrete Mathematics, 2015. Zobacz w PBN
• Mirosław Kowaluk , Peter Floderus, Andrzej Lingas, Eva-Marta Lundell, Detecting and Counting Small Pattern Graphs, SIAM Journal on Discrete Mathematics, 29 (3) 2015, s. 1322-1339. Zobacz w PBN
• Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, SIAM Journal on Discrete Mathematics, 2015. Zobacz w PBN

2014

• Marcin Kamiński, Łukasz Kowalik , Beyond the Vizing's Bound for at Most Seven Colors, SIAM Journal on Discrete Mathematics, 2014. Zobacz w PBN

2013

• Mirosław Kowaluk , Andrzej Lingas, Eva-Marta Lundell, Counting and Detecting Small Subgraphs via Equations, SIAM Journal on Discrete Mathematics, 27 (2) 2013, s. 892-909. Zobacz w PBN
• Marek Cygan , Guy Kortsarz, Zeev Nutov, Steiner Forest Orientation Problems, SIAM Journal on Discrete Mathematics, 2013. Zobacz w PBN
• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, SIAM Journal on Discrete Mathematics, 2013. Zobacz w PBN

2008

• Łukasz Kowalik , Jean-Sebastien Sereni, Riste Skrekovski, Total colouring of plane graphs with maximum degree nine, SIAM Journal on Discrete Mathematics, 2008. Zobacz w PBN

2007

• Richard Cole, Łukasz Kowalik , Riste Skrekovski, A Generalization of Kotzig's Theorem and its Application, SIAM Journal on Discrete Mathematics, 2007. Zobacz w PBN