Personal information

Activities

Works (50 of 107)

Items per page:
Page 1 of 3

Online facility location with deletions

Leibniz International Proceedings in Informatics, LIPIcs
2018 | Conference paper
EID:

2-s2.0-85052499070

Contributors: Cygan, M.; Czumaj, A.; Mucha, M.; Sankowski, P.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Approximation and parameterized complexity of minimax approval voting

31st AAAI Conference on Artificial Intelligence, AAAI 2017
2017 | Conference paper
EID:

2-s2.0-85030478589

Contributors: Cygan, M.; Kowalik, Ł.; Socała, A.; Sornat, K.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

From Gap-ETH to FPT-inapproximability: Clique, dominating set, and more

Annual Symposium on Foundations of Computer Science - Proceedings
2017 | Conference paper
EID:

2-s2.0-85041136063

Contributors: Chalermsook, P.; Cygan, M.; Kortsarz, G.; Laekhanukit, B.; Manurangsi, P.; Nanongkai, D.; Trevisan, L.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Hitting forbidden subgraphs in graphs of bounded treewidth

Information and Computation
2017 | Journal article
EID:

2-s2.0-85020104199

Contributors: Cygan, M.; Marx, D.; Pilipczuk, M.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Improving TSP tours using dynamic programming over tree decompositions

Leibniz International Proceedings in Informatics, LIPIcs
2017 | Conference paper
EID:

2-s2.0-85030529540

Contributors: Cygan, M.; Kowalik, Ł.; Socała, A.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

On problems equivalent to (min, +)-convolution

Leibniz International Proceedings in Informatics, LIPIcs
2017 | Conference paper
EID:

2-s2.0-85027260180

Contributors: Cygan, M.; Mucha, M.; Wegrzycki, K.; Włodarczyk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Polynomial Kernelization for Removing Induced Claws and Diamonds

Theory of Computing Systems
2017 | Journal article
EID:

2-s2.0-84976293654

Contributors: Cygan, M.; Pilipczuk, M.; Pilipczuk, M.; van Leeuwen, E.J.; Wrochna, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Tight Kernel bounds for problems on graphs with small degeneracy

ACM Transactions on Algorithms
2017 | Journal article
EID:

2-s2.0-85028546128

Contributors: Cygan, M.; Grandoni, F.; Hermelin, D.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Tight lower bounds on graph embedding problems

Journal of the ACM
2017 | Journal article
EID:

2-s2.0-85021152171

Contributors: Cygan, M.; Fomin, F.V.; Golovnev, A.; Kulikov, A.S.; Mihajlin, I.; Pachocki, J.; Socała, A.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

A Fast Branching Algorithm for Cluster Vertex Deletion

Theory of Computing Systems
2016 | Journal article
EID:

2-s2.0-84954398433

Contributors: Boral, A.; Cygan, M.; Kociumaka, T.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Algorithmic complexity of power law networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2016 | Conference paper
EID:

2-s2.0-84963660206

Contributors: Brach, P.; Cygan, M.; Lacki, J.; Sankowski, P.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Designing FPT algorithms for cut problems using randomized contractions

SIAM Journal on Computing
2016 | Journal article
EID:

2-s2.0-84991010767

Contributors: Chitnis, R.; Cygan, M.; Hajiaghayi, M.; Pilipczuk, M.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Erratum to: Foreword: Special Issue on IPEC 2014 (Algorithmica, DOI 10.1007/s00453-016-0151-x)

Algorithmica
2016 | Journal article
EID:

2-s2.0-84966489842

Contributors: Cygan, M.; Heggernes, P.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Foreword: Special Issue on IPEC 2014

Algorithmica
2016 | Journal article
EID:

2-s2.0-84964253187

Contributors: Cygan, M.; Heggernes, P.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Hardness of approximation for H-Free edge modification problems

Leibniz International Proceedings in Informatics, LIPIcs
2016 | Conference paper
EID:

2-s2.0-84990866126

Contributors: Bliznets, I.; Cygan, M.; Komosa, P.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Known algorithms for edge clique cover are probably optimal

SIAM Journal on Computing
2016 | Journal article
EID:

2-s2.0-84960383914

Contributors: Cygan, M.; Pilipczuk, M.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Lower bounds for approximation schemes for closest string

Leibniz International Proceedings in Informatics, LIPIcs
2016 | Conference paper
EID:

2-s2.0-85012004486

Contributors: Cygan, M.; Lokshtanov, D.; Pilipczuk, M.; Pilipczuk, M.; Saurabh, S.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2016 | Conference paper
EID:

2-s2.0-84963686450

Contributors: Bliznets, I.; Cygan, M.; Komosa, P.; Mach, L.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

On Group Feedback Vertex Set Parameterized by the Size of the Cutset

Algorithmica
2016 | Journal article
EID:

2-s2.0-84955656479

Contributors: Cygan, M.; Pilipczuk, M.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

On problems as hard as CNF-SAT

ACM Transactions on Algorithms
2016 | Journal article
EID:

2-s2.0-84973862703

Contributors: Cygan, M.; Dell, H.; Lokshtanov, D.; Marx, D.; Nederlof, J.; Okamoto, Y.; Paturi, R.; Saurabh, S.; Wahlström, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Online Knapsack Revisited

Theory of Computing Systems
2016 | Journal article
EID:

2-s2.0-84952975971

Contributors: Cygan, M.; Jeż, Ł.; Sgall, J.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Online pricing with impatient Bidders

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2016 | Conference paper
EID:

2-s2.0-84962808596

Contributors: Cygan, M.; Mucha, M.; Sankowski, P.; Zhang, Q.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Polynomial kernelization for removing induced claws and diamonds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2016 | Book
EID:

2-s2.0-84981489565

Contributors: Cygan, M.; Pilipczuk, M.; Pilipczuk, M.; Van Leeuwen, E.J.; Wrochna, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Polynomial-time approximation algorithms for weighted LCS problem

Discrete Applied Mathematics
2016 | Journal article
EID:

2-s2.0-84949058038

Contributors: Cygan, M.; Kubica, M.; Radoszewski, J.; Rytter, W.; Waleń, T.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Tight bounds for graph homomorphism and subgraph isomorphism

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2016 | Conference paper
EID:

2-s2.0-84963585179

Contributors: Cygan, M.; Fomin, F.V.; Golovnev, A.; Kulikov, A.S.; Mihajlin, I.; Pachocki, J.; Socala, A.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Algorithmic applications of Baur-Strassen's theorem: Shortest cycles, diameter, and matchings

Journal of the ACM
2015 | Journal article
EID:

2-s2.0-84942053838

Contributors: Cygan, M.; Gabow, H.N.; Sankowski, P.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Approximating upper degree-constrained partial orientations

Leibniz International Proceedings in Informatics, LIPIcs
2015 | Conference paper
EID:

2-s2.0-84958549564

Contributors: Cygan, M.; Kociumaka, T.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

Information and Computation
2015 | Journal article
EID:

2-s2.0-84938206927

Contributors: Bodlaender, H.L.; Cygan, M.; Kratsch, S.; Nederlof, J.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable

ACM Transactions on Algorithms
2015 | Journal article
EID:

2-s2.0-84928235454

Contributors: Chitnis, R.; Cygan, M.; Hajiaghayi, M.; Marx, D.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Faster exponential-time algorithms in graphs of bounded average degree

Information and Computation
2015 | Journal article
EID:

2-s2.0-84938150387

Contributors: Cygan, M.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Kernelization lower bound for Permutation Pattern Matching

Information Processing Letters
2015 | Journal article
EID:

2-s2.0-84923233696

Contributors: Bliznets, I.; Cygan, M.; Komosa, P.; Mach, L.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

A fast branching algorithm for cluster vertex deletion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
EID:

2-s2.0-84958544318

Contributors: Boral, A.; Cygan, M.; Kociumaka, T.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Clique cover and graph separation: New incompressibility results

ACM Transactions on Computation Theory
2014 | Journal article
EID:

2-s2.0-84902511377

Contributors: Cygan, M.; Kratsch, S.; Pilipczuk, M.; Pilipczuk, M.; Wahlström, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Constant factor approximation for capacitated κ-center with outliers

Leibniz International Proceedings in Informatics, LIPIcs
2014 | Book
EID:

2-s2.0-84907816447

Contributors: Cygan, M.; Kociumaka, T.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Hitting forbidden subgraphs in graphs of bounded treewidth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
EID:

2-s2.0-84906241996

Contributors: Cygan, M.; Marx, D.; Pilipczuk, M.; Pilipczuk, M.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Minimum bisection is fixed parameter tractable

Proceedings of the Annual ACM Symposium on Theory of Computing
2014 | Conference paper
EID:

2-s2.0-84904333940

Contributors: Cygan, M.; Lokshtanov, D.; Pilipczuk, M.; Pilipczuk, M.; Saurabh, S.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

On cutwidth parameterized by vertex cover

Algorithmica
2014 | Journal article
EID:

2-s2.0-84894531858

Contributors: Cygan, M.; Lokshtanov, D.; Pilipczuk, M.; Pilipczuk, M.; Saurabh, S.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

On the Hardness of Losing Width

Theory of Computing Systems
2014 | Journal article
EID:

2-s2.0-84893724443

Contributors: Cygan, M.; Lokshtanov, D.; Pilipczuk, M.; Pilipczuk, M.; Saurabh, S.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Online knapsack revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
EID:

2-s2.0-84903589755

Contributors: Cygan, M.; Jez, Ł.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Parameterized and Exact Computation: 9th International Symposium, IPEC 2014 Wroclaw, Poland, September 10-12, 2014 Revised Selected Papers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
EID:

2-s2.0-84919968685

Contributors: Cygan, M.; Heggernes, P.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Parameterized complexity of eulerian deletion problems

Algorithmica
2014 | Journal article
EID:

2-s2.0-84891886336

Contributors: Cygan, M.; Pilipczuk, M.; Marx, D.; Pilipczuk, M.; Schlotter, I.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Parameterized complexity of firefighting

Journal of Computer and System Sciences
2014 | Journal article
EID:

2-s2.0-84901761766

Contributors: Bazgan, C.; Chopin, M.; Cygan, M.; Fellows, M.R.; Fomin, F.V.; Van Leeuwen, E.J.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Preface

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
EID:

2-s2.0-84920025944

Contributors: Cygan, M.; Heggernes, P.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Scheduling partially ordered jobs faster than 2<sup>n</sup>

Algorithmica
2014 | Journal article
EID:

2-s2.0-84897661462

Contributors: Cygan, M.; Pilipczuk, M.; Pilipczuk, M.; Wojtaszczyk, J.O.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Sitting Closer to Friends than Enemies, Revisited

Theory of Computing Systems
2014 | Journal article
EID:

2-s2.0-84922834537

Contributors: Cygan, M.; Pilipczuk, M.; Pilipczuk, M.; Wojtaszczyk, J.O.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Solving the 2-disjoint connected subgraphs problem faster than 2<sup>n</sup>

Algorithmica
2014 | Journal article
EID:

2-s2.0-84905447396

Contributors: Pilipczuk, M.; Cygan, M.; Pilipczuk, M.; Wojtaszczyk, J.O.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

A bound on the number of perfect matchings in Klee-graphs

Discrete Mathematics and Theoretical Computer Science
2013 | Journal article
EID:

2-s2.0-84876901098

Contributors: Cygan, M.; Pilipczuk, M.; Škrekovski, R.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Catch them if you can: How to serve impatient users

ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science
2013 | Conference paper
EID:

2-s2.0-84873393341

Contributors: Cygan, M.; Englert, M.; Gupta, A.; Mucha, M.; Sankowski, P.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013 | Book
EID:

2-s2.0-84880291042

Contributors: Bodlaender, H.L.; Cygan, M.; Kratsch, S.; Nederlof, J.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier

Fast hamiltonicity checking via bases of perfect matchings

Proceedings of the Annual ACM Symposium on Theory of Computing
2013 | Conference paper
EID:

2-s2.0-84879829534

Contributors: Cygan, M.; Kratsch, S.; Nederlof, J.
Source: Self-asserted source
Marek Cygan via Scopus - Elsevier
Items per page:
Page 1 of 3

Peer review (1 review for 1 publication/grant)

Review activity for Mammalian biology. (1)