Publikacje

Czasopismo: Discrete Applied Mathematics

Liczba publikacji: 14

2017

• Marcin Pilipczuk, A tight lower bound for Vertex Planarization on graphs of bounded treewidth, Discrete Applied Mathematics 231 2017, s. 211–216.zobacz w PBN

2016

• Marek Adam Cygan, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter i Tomasz Waleń, Polynomial-time approximation algorithms for weighted LCS problem, Discrete Applied Mathematics 204 2016, s. 38–48.zobacz w PBN

2015

• Marcin Peczarski i Gerold Jäger, The worst case number of questions in generalized AB game with and without white-peg answers, Discrete Applied Mathematics (184) 2015, s. 20–31.zobacz w PBN
• Marcin Kamiński i Martin Milanic, On the complexity of the identifiable subgraph problem, Discrete Applied Mathematics 182 2015, s. 25–33.zobacz w PBN

2014

• Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Jan Radoszewski, Wojciech Rytter, Krzysztof Stencel i Tomasz Waleń, New simple efficient algorithms computing powers and runs in strings, Discrete Applied Mathematics 163 2014, s. 258–267.zobacz w PBN

2013

• Łukasz Kowalik, Marcin Pilipczuk i Karol Suchan, Towards optimal kernel for connected vertex cover in planar graphs, Discrete Applied Mathematics 161 2013, s. 1154–1161.zobacz w PBN
• Remy Belmonte, Pim van 't Hof, Marcin Kamiński, Daniel Paulusma i Dimitrios M. Thilikos, Characterizing graphs of small carving-width, Discrete Applied Mathematics 161 (13-14) 2013, s. 1888–1893.zobacz w PBN
• Chính T. Hoàng, Marcin Kamiński, Joe Sawada i R. Sritharan, Finding and listing induced paths and cycles, Discrete Applied Mathematics 161 (4-5) 2013, s. 633–641.zobacz w PBN

2012

• Marek Cygan i Marcin Pilipczuk, Bandwidth and distortion revisited, Discrete Applied Mathematics 160 (4-5) 2012, s. 494–504.zobacz w PBN
• Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk i Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, Discrete Applied Mathematics 160 (15) 2012, s. 2131–2141.zobacz w PBN
• Marcin Pilipczuk, Michał Pilipczuk i Riste Skrekovski, Some results on Vizing's conjecture and related problems, Discrete Applied Mathematics 160 (16-17) 2012, s. 2484–2490.zobacz w PBN

2011

• Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk i Riste Skrekovski, On the Zagreb index inequality of graphs with prescribed vertex degrees, Discrete Applied Mathematics 159 (8) 2011, s. 852–858.zobacz w PBN

2010

• Rok Erman, Łukasz Kowalik, Matjaz Krnc i Tomasz Waleń, Improved induced matchings in sparse graphs, Discrete Applied Mathematics 158 (18) 2010, s. 1994–2003.zobacz w PBN

2003

• Juhani Karhumaeki, Wojciech Plandowski i Wojciech Rytter, The complexity of compressing subsegments of images described by finite automata, Discrete Applied Mathematics 125 (2-3) 2003, s. 235–254.zobacz w PBN