Publications

Journal: Discrete Applied Mathematics

Number of publications: 20

2022

• Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomáš Masařík , Flexibility of planar graphs—Sharpening the tools to get lists of size four, Discrete Applied Mathematics, 306 2022, p. 120-132. See in PBN

2020

• Joanna Chybowska-Sokół, Konstanty Junosza-Szaniawski, Paweł Rzążewski , L(2,1)-labeling of disk intersection graphs, Discrete Applied Mathematics, 277 2020, p. 71-81. See in PBN
• Tomáš Toufar, Tomáš Masařík , Parameterized complexity of fair deletion problems, Discrete Applied Mathematics, 278 2020, p. 51-61. See in PBN

2019

• Carla Groenland, Karolina Okrasa, Paweł Rzążewski , Alex Scott, Paul Seymour, Sophie Spirkl, H-colouring P_t-free graphs in subexponential time, Discrete Applied Mathematics, 267 2019, p. 184-189. See in PBN
• Paweł Górecki , Agnieszka Mykowiecka, Jarosław Paszek , Oliver Eulenstein, Mathematical properties of the gene duplication cost, Discrete Applied Mathematics, 258 2019, p. 114-122. See in PBN

2018

• Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Sean Kafer, Jan Kratochvíl, Martin Pergel, Paweł Rzążewski , Matthew Szczepankiewicz, Joshua JoshuaTerhaarf, Homothetic polygons and beyond: Maximal cliques in intersection graphs, Discrete Applied Mathematics, 247 2018, p. 263-277. See in PBN

2017

• Marcin Pilipczuk , A tight lower bound for Vertex Planarization on graphs of bounded treewidth, Discrete Applied Mathematics, 231 2017, p. 211-216. See in PBN
• Martin Pergel, Paweł Rzążewski , On edge intersection graphs of paths with 2 bends, Discrete Applied Mathematics, 226 2017, p. 106-116. See in PBN
• Michał Dębski, Zbigniew Lonc, Paweł Rzążewski , Sequences of radius k for complete bipartite graphs, Discrete Applied Mathematics, 225 2017, p. 51-63. See in PBN

2016

• Marek Cygan , Marcin Kubica, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics, 2016. See in PBN

2014

• Marcin Piątkowski, Wojciech Rytter , Computing the number of cubic runs in standard Sturmian words., Discrete Applied Mathematics, 163 (3) 2014, p. 361-372. See in PBN
• Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski , Wojciech Rytter , Krzysztof Stencel , Tomasz Waleń , New simple efficient algorithms computing powers and runs in strings, Discrete Applied Mathematics, 2014. See in PBN

2013

• Konstanty Junosza-Szaniawski, Paweł Rzążewski , Determining the L(2,1)-span in Polynomial Space, Discrete Applied Mathematics, 161 (13/14) 2013, p. 2052-2061. See in PBN
• Łukasz Kowalik , Marcin Pilipczuk , Karol Suchan, Towards optimal kernel for connected vertex cover in planar graphs, Discrete Applied Mathematics, 2013. See in PBN

2012

• Marek Cygan , Marcin Pilipczuk , Bandwidth and distortion revisited, Discrete Applied Mathematics, 2012. See in PBN
• Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, Discrete Applied Mathematics, 2012. See in PBN
• Marcin Pilipczuk , Michał Pilipczuk , Riste Skrekovski, Some results on Vizing's conjecture and related problems, Discrete Applied Mathematics, 2012. See in PBN

2011

• Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk , Riste Skrekovski, On the Zagreb index inequality of graphs with prescribed vertex degrees, Discrete Applied Mathematics, 2011. See in PBN

2010

• Rok Erman, Łukasz Kowalik , Matjaz Krnc, Tomasz Waleń , Improved induced matchings in sparse graphs, Discrete Applied Mathematics, 2010. See in PBN

2003

• Juhani Karhumaeki, Wojciech Plandowski , Wojciech Rytter , The complexity of compressing subsegments of images described by finite automata, Discrete Applied Mathematics, 2003. See in PBN