World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
7243
World Ranking
13380
National Ranking
36

Overview

Marek Cygan is affiliated with the University of Warsaw in Poland. Their research primarily spans the field of Computer Science, with a focus on several subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Computer Networks and Communications, and Control and Systems Engineering.

The scientist has contributed extensively to topics such as Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Cryptography and Data Security, Machine Learning and Algorithms, Image and Object Detection Techniques, Machine Learning and Data Classification, and Advanced Neural Network Applications.

Notable recent publications include:

  • Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, 2022, ACM Transactions on Algorithms
  • From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More, 2020, SIAM Journal on Computing
  • Polite Teacher: Semi-Supervised Instance Segmentation With Mutual Learning and Pseudo-Label Thresholding, 2024, IEEE Access
  • n-CPS: Generalising Cross Pseudo Supervision to n Networks for Semi-Supervised Semantic Segmentation, 2021, arXiv (Cornell University)
  • Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems, 2020, ACM Transactions on Algorithms

Frequent publication venues for the scientist include:

  • arXiv (Cornell University)
  • ACM Transactions on Algorithms
  • SIAM Journal on Computing
  • IEEE Access
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Marek Cygan has collaborated regularly with several co-authors, among whom are Michał Nauman, Guy Kortsarz, Piotr Tempczyk, Michał Pilipczuk, and Dominik Filipiak, reflecting a network of partnerships primarily in algorithmic and theoretical computer science research.

Best Publications

  • Parameterized Algorithms

    Marek Cygan;Fedor V. Fomin;Lukasz Kowalik;Daniel Lokshtanov

  • Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

    Marek Cygan;Jesper Nederlof;Marcin Pilipczuk;Michal Pilipczuk

  • Lower bounds based on the Exponential Time Hypothesis

    Daniel Lokshtanov;Dániel Marx;Saket Saurabh

  • Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

    Hans L. Bodlaender;Marek Cygan;Stefan Kratsch;Jesper Nederlof

  • On Problems as Hard as CNF-SAT

    Marek Cygan;Holger Dell;Daniel Lokshtanov;Dániel Marx

  • On multiway cut parameterized above lower bounds

    Marek Cygan;Marcin Pilipczuk;Michał Pilipczuk;Jakub Onufry Wojtaszczyk

  • On Problems as Hard as CNF-SAT

    Marek Cygan;Holger Dell;Daniel Lokshtanov;D'niel Marx

  • Exponential-time approximation of weighted set cover

    Marek Cygan;Łukasz Kowalik;Mateusz Wykurz

  • Designing FPT Algorithms for Cut Problems Using Randomized Contractions

    Rajesh Chitnis;Marek Cygan;MohammadTaghi Hajiaghayi;Marcin Pilipczuk

  • Fast Hamiltonicity Checking Via Bases of Perfect Matchings

    Marek Cygan;Stefan Kratsch;Jesper Nederlof

  • Minimum Bisection Is Fixed-Parameter Tractable

    Marek Cygan;Daniel Lokshtanov;Marcin Pilipczuk;Michał Pilipczuk

  • Exact and approximate bandwidth

    Marek Cygan;Marcin Pilipczuk

  • From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

    Parinya Chalermsook;Marek Cygan;Guy Kortsarz;Bundit Laekhanukit

  • Subset Feedback Vertex Set Is Fixed-Parameter Tractable

    Marek Adam Cygan;Marcin Łukasz Pilipczuk;Michał Pilipczuk;Jakub Onufry Wojtaszczyk

  • Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search

    Marek Cygan

  • Solving connectivity problems parameterized by treewidth in single exponential time

    Marek Cygan;Jesper Nederlof;Marcin Pilipczuk;Michał Pilipczuk

  • Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

    Unknown

  • LP Rounding for k-Centers with Non-uniform Hard Capacities

    Marek Cygan;MohammadTaghi Hajiaghayi;Samir Khuller

  • Known Algorithms for Edge Clique Cover are Probably Optimal

    Marek Cygan;Marcin Pilipczuk;Michał Pilipczuk

  • A Fast Branching Algorithm for Cluster Vertex Deletion

    Anudhyan Boral;Marek Cygan;Tomasz Kociumaka;Marcin Pilipczuk

  • Kernelization hardness of connectivity problems in d-degenerate graphs

    Marek Cygan;Marcin Pilipczuk;Michał Pilipczuk;Jakub Onufry Wojtaszczyk

  • Applying deep learning to right whale photo identification.

    Robert Bogucki;Marek Cygan;Christin Brangwynne Khan;Maciej Klimek

  • The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable

    Marek Cygan;Daniel Marx;Marcin Pilipczuk;Michal Pilipczuk

  • On Problems Equivalent to (min,+)-Convolution

    Marek Cygan;Marcin Mucha;Karol Węgrzycki;Michał Włodarczyk

Frequent Co-Authors

Michał Pilipczuk
Michał Pilipczuk University of Warsaw
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Dániel Marx
Dániel Marx Saarland University
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Fabrizio Grandoni
Fabrizio Grandoni Dalle Molle Institute for Artificial Intelligence Research
Guy Kortsarz
Guy Kortsarz Rutgers, The State University of New Jersey
MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi University of Maryland, College Park
Harold N. Gabow
Harold N. Gabow University of Colorado Boulder
Luca Trevisan
Luca Trevisan Bocconi University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up a range of related educational and career options you can pursue online. For those interested in working with big data, there are data science programs that offer affordable paths to lucrative careers. These programs focus on hands-on skills and in-demand tools in today’s technology-driven economy.

If your interests overlap with engineering, consider checking electrical engineering degree online admissions. Top universities now provide comprehensive online programs that allow you to advance your technical expertise without needing to relocate or pause your career.

Looking for fast-tracked options? There are quick certifications that pay well, allowing you to upgrade your skills and boost earning potential in a short time.

For those seeking advanced degrees, explore the shortest masters degree programs online. These programs are designed for flexibility and speed, letting you climb higher in your field without a lengthy commitment.

Best Scientists Citing Marek Cygan

Trending Scientists

Recently Published Articles