B

Boral, Anudhyan, Cygan, Marek, Kociumaka, Tomasz and Pilipczuk, Marcin (2014) A fast branching algorithm for cluster vertex deletion. In: Hirsch, Edward A. and Kuznetsov, Sergei O. and Pin , Jean Eric and Vereshchagin, Nikolai Konstantinovich, 1958-, (eds.) Computer Science - Theory and Applications: Proceedings of 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Lecture Notes in Computer Science (8476). Berlin: Springer International, pp. 111-124. ISBN 9783319066851

C

Cygan, Marek, Pilipczuk, Marcin and Pilipczuk, Michał (2016) On group feedback Vertex Set parameterized by the size of the cutset. Algorithmica, 74 (2). pp. 630-642. doi:10.1007/s00453-014-9966-5 ISSN 0178-4617.

Cygan, Marek and Pilipczuk, Marcin (2015) Faster exponential-time algorithms in graphs of bounded average degree. Information and Computation, 243 . pp. 75-85. doi:10.1016/j.ic.2014.12.007 ISSN 0890-5401.

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał and Wojtaszczyk, Jakub Onufry (2015) Sitting closer to friends than enemies, revisited. Theory of Computing Systems, 56 . pp. 394-405. doi:10.1007/s00224-014-9558-4 ISSN 1432-4350.

Cygan, Marek, Marx, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał and Schlotter, Ildikó (2014) Parameterized complexity of Eulerian deletion problems. Algorithmica, Volume 68 (Number 1). pp. 41-61. doi:10.1007/s00453-012-9667-x ISSN 0178-4617.

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał and Wojtaszczyk, Jakub Onufry (2013) Solving the 2-Disjoint connected subgraphs problem faster than 2n. Algorithmica, Volume 70 (Number 2). pp. 195-207. doi:10.1007/s00453-013-9796-x ISSN 0178-4617.

F

Fomin, Fedor V., Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał and Villanger, Yngve (2014) Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Journal of Computer and System Sciences, Volume 80 (Number 7). pp. 1430-1447. doi:10.1016/j.jcss.2014.04.015 ISSN 0022-0000.

K

Kratsch, Stefan, Pilipczuk, Marcin, Pilipczuk, Michał and Wahlström, Magnus (2015) Fixed-parameter tractability of multicut in directed acyclic graphs. SIAM journal on discrete mathematics, Volume 29 (Number 1). pp. 122-144. doi:10.1137/120904202 ISSN 0895-4801.

Kociumaka, Tomasz and Pilipczuk, Marcin (2014) Faster deterministic feedback vertex set. Information Processing Letters, Volume 114 (Number 10). pp. 556-560. doi:10.1016/j.ipl.2014.05.001 ISSN 0020-0190.

M

Breast Cancer Association Consortium (Including: Muir, Kenneth (Kenneth R.), Lophatananon, Artitaya and Stewart-Brown, Sarah L.). (2015) Fine-mapping identifies two additional breast cancer susceptibility loci at 9q31.2. Human Molecular Genetics, Volume 24 (Number 10). pp. 2966-2984. Article number 2966. doi:10.1093/hmg/ddv035 ISSN 0964-6906.

Breast Cancer Association Consortium (Including: Muir, Kenneth (Kenneth R.), Lophatananon, Artitaya and Stewart-Brown, Sarah L.). (2013) FGF receptor genes and breast cancer susceptibility : results from the Breast Cancer Association Consortium. British Journal of Cancer, Volume 110 (Number 4). pp. 1088-1100. doi:10.1038/bjc.2013.769 ISSN 0007-0920.

P

Pilipczuk, Marcin, Pilipczuk, Michał, Sankowski, Piotr and Leeuwen, Erik Jan van (2014) Network sparsification for Steiner problems on planar and bounded-genus graphs. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014), Philadelphia, PA, 18-21 Oct 2014. Published in: Proceedings of 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) pp. 276-285. ISBN 9781479965175. doi:10.1109/FOCS.2014.37 ISSN 0272-5428.