Bergen Research Foundation (BRF)

Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał and Saurabh, Saket (2014) Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014), Philadelphia, PA, 18-21 Oct 2014. Published in: Proceedings of 2014 IEEE Annual Symposium on Foundations of Computer Science pp. 186-195. ISBN 9781479965175. doi:10.1109/FOCS.2014.28 ISSN 0272-5428.

European Research Council (ERC)

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, 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.

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.

Łącki, Jakub, Oćwieja, Jakub, Pilipczuk, Marcin, Sankowski, Piotr and Zych, Anna (2015) The power of dynamic distance oracles : efficient dynamic algorithms for the Steiner tree. In: STOC '15 Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, OR, 14-17 Jun 2015. Published in: STOC '15 Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing pp. 11-20. ISBN 9781450335362. doi:10.1145/2746539.2746615

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.

Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał and Saurabh, Saket (2014) Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014), Philadelphia, PA, 18-21 Oct 2014. Published in: Proceedings of 2014 IEEE Annual Symposium on Foundations of Computer Science pp. 186-195. ISBN 9781479965175. doi:10.1109/FOCS.2014.28 ISSN 0272-5428.

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.

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, Marx, Daniel, Pilipczuk, Marcin and Pilipczuk, Michał (2014) Hitting forbidden subgraphs in graphs of bounded treewidth. In: Csuhaj-Varjú, E. and Dietzfelbinger, Martin and Ésik, Zoltán, 1951-, (eds.) Mathematical foundations of computer science 2014 : proceedings, Part II 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Lecture Notes in Computer Science (Volume 8635). Berlin ; London: Springer Verlag, pp. 189-200. ISBN 9783662444641

Cygan, Marek, Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał and Saurabh, Saket (2014) Minimum bisection is fixed parameter tractable. In: STOC '14 : 46th Annual ACM Symposium on Theory of Computing, New York, 31 May- 3 Jun 2014. Published in: STOC '14 Proceedings of the 46th Annual ACM Symposium on Theory of Computing pp. 323-332. doi:10.1145/2591796.2591852 ISSN 9781450327107.

Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Marcin and Pilipczuk, Michał (2014) A subexponential parameterized algorithm for proper interval completion. In: Wagner , Dorothea and Schulz , Andreas S., (eds.) Algorithms : ESA 2014 : Proceedings of 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Lecture Notes in Computer Science (Volume 8737). Berlin ; London: Springer-Verlag, pp. 173-184. ISBN 9783662447765

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.

European Social Fund (ESF)

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.

Fundacja na rzecz Nauki Polskiej [Foundation for Polish Science] (FNP)

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.

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.

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.

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.

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.

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.

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

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.

Google (Firm)

Łącki, Jakub, Oćwieja, Jakub, Pilipczuk, Marcin, Sankowski, Piotr and Zych, Anna (2015) The power of dynamic distance oracles : efficient dynamic algorithms for the Steiner tree. In: STOC '15 Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, OR, 14-17 Jun 2015. Published in: STOC '15 Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing pp. 11-20. ISBN 9781450335362. doi:10.1145/2746539.2746615

Max-Planck-Gesellschaft zur Förderung der Wissenschaften [Max Planck Society for the Advancement of Science]

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.

Narodowe Centrum Nauki (NCN)

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.

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.

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.

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.

Cygan, Marek, Marx, Daniel, Pilipczuk, Marcin and Pilipczuk, Michał (2014) Hitting forbidden subgraphs in graphs of bounded treewidth. In: Csuhaj-Varjú, E. and Dietzfelbinger, Martin and Ésik, Zoltán, 1951-, (eds.) Mathematical foundations of computer science 2014 : proceedings, Part II 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Lecture Notes in Computer Science (Volume 8635). Berlin ; London: Springer Verlag, pp. 189-200. ISBN 9783662444641

Cygan, Marek, Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał and Saurabh, Saket (2014) Minimum bisection is fixed parameter tractable. In: STOC '14 : 46th Annual ACM Symposium on Theory of Computing, New York, 31 May- 3 Jun 2014. Published in: STOC '14 Proceedings of the 46th Annual ACM Symposium on Theory of Computing pp. 323-332. doi:10.1145/2591796.2591852 ISSN 9781450327107.

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

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.

Narodowe Centrum Nauki [Polish National Science Center]

Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michał, van Leeuwen, Erik Jan and Wrochna, Marcin (2015) Polynomial kernelization for removing induced claws and diamonds. In: 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Munich, Germany, 17-19 Jun 2015. Published in: Graph-Theoretic Concepts in Computer Science : 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, 9224 pp. 450-455. ISBN 9783662531730.

Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Netherlands Organisation for Scientific Research] (NWO)

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.

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.

Országos Tudományos Kutatási Alapprogramok (OTKA)

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, Marx, Daniel, Pilipczuk, Marcin and Pilipczuk, Michał (2014) Hitting forbidden subgraphs in graphs of bounded treewidth. In: Csuhaj-Varjú, E. and Dietzfelbinger, Martin and Ésik, Zoltán, 1951-, (eds.) Mathematical foundations of computer science 2014 : proceedings, Part II 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Lecture Notes in Computer Science (Volume 8635). Berlin ; London: Springer Verlag, pp. 189-200. ISBN 9783662444641

Poland. Ministerstwo Nauki i Szkolnictwa Wyższego [Ministry of Science and Higher Education] (MNiSW)

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.

Russia (Federation)

Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Marcin and Pilipczuk, Michał (2014) A subexponential parameterized algorithm for proper interval completion. In: Wagner , Dorothea and Schulz , Andreas S., (eds.) Algorithms : ESA 2014 : Proceedings of 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Lecture Notes in Computer Science (Volume 8737). Berlin ; London: Springer-Verlag, pp. 173-184. ISBN 9783662447765

Seventh Framework Programme (European Commission) (FP7)

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, 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.

Łącki, Jakub, Oćwieja, Jakub, Pilipczuk, Marcin, Sankowski, Piotr and Zych, Anna (2015) The power of dynamic distance oracles : efficient dynamic algorithms for the Steiner tree. In: STOC '15 Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, OR, 14-17 Jun 2015. Published in: STOC '15 Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing pp. 11-20. ISBN 9781450335362. doi:10.1145/2746539.2746615

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.

Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał and Saurabh, Saket (2014) Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014), Philadelphia, PA, 18-21 Oct 2014. Published in: Proceedings of 2014 IEEE Annual Symposium on Foundations of Computer Science pp. 186-195. ISBN 9781479965175. doi:10.1109/FOCS.2014.28 ISSN 0272-5428.

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.

Cygan, Marek, Marx, Daniel, Pilipczuk, Marcin and Pilipczuk, Michał (2014) Hitting forbidden subgraphs in graphs of bounded treewidth. In: Csuhaj-Varjú, E. and Dietzfelbinger, Martin and Ésik, Zoltán, 1951-, (eds.) Mathematical foundations of computer science 2014 : proceedings, Part II 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Lecture Notes in Computer Science (Volume 8635). Berlin ; London: Springer Verlag, pp. 189-200. ISBN 9783662444641

Cygan, Marek, Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał and Saurabh, Saket (2014) Minimum bisection is fixed parameter tractable. In: STOC '14 : 46th Annual ACM Symposium on Theory of Computing, New York, 31 May- 3 Jun 2014. Published in: STOC '14 Proceedings of the 46th Annual ACM Symposium on Theory of Computing pp. 323-332. doi:10.1145/2591796.2591852 ISSN 9781450327107.

Bliznets, Ivan, Fomin, Fedor V., Pilipczuk, Marcin and Pilipczuk, Michał (2014) A subexponential parameterized algorithm for proper interval completion. In: Wagner , Dorothea and Schulz , Andreas S., (eds.) Algorithms : ESA 2014 : Proceedings of 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Lecture Notes in Computer Science (Volume 8737). Berlin ; London: Springer-Verlag, pp. 173-184. ISBN 9783662447765

United States. Office of Naval Research

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.

Universitetet i Bergen‏

Cygan, Marek, Lokshtanov, Daniel, Pilipczuk, Marcin, Pilipczuk, Michał and Saurabh, Saket (2014) Minimum bisection is fixed parameter tractable. In: STOC '14 : 46th Annual ACM Symposium on Theory of Computing, New York, 31 May- 3 Jun 2014. Published in: STOC '14 Proceedings of the 46th Annual ACM Symposium on Theory of Computing pp. 323-332. doi:10.1145/2591796.2591852 ISSN 9781450327107.