Marek Cygan
Orcid: 0000-0003-2472-2975Affiliations:
- University of Warsaw, Faculty of Mathematics, Informatics, and Mechanics, Poland
According to our database1,
Marek Cygan
authored at least 112 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on mimuw.edu.pl
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous control.
CoRR, 2024
Overestimation, Overfitting, and Plasticity in Actor-Critic: the Bitter Lesson of Reinforcement Learning.
CoRR, 2024
Polite Teacher: Semi-Supervised Instance Segmentation With Mutual Learning and Pseudo-Label Thresholding.
IEEE Access, 2024
2023
Proceedings of the International Conference on Machine Learning, 2023
2022
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020).
SIAM J. Comput., June, 2022
ACM Trans. Algorithms, 2022
2021
n-CPS: Generalising Cross Pseudo Supervision to n networks for Semi-Supervised Semantic Segmentation.
CoRR, 2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.
ACM Trans. Algorithms, 2020
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More.
SIAM J. Comput., 2020
Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020
2019
ACM Trans. Algorithms, 2019
2018
ACM Trans. Comput. Theory, 2018
J. Artif. Intell. Res., 2018
On subexponential running times for approximating directed Steiner tree and related problems.
CoRR, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
ACM Trans. Algorithms, 2017
Theory Comput. Syst., 2017
Dagstuhl Reports, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
SIAM J. Comput., 2016
Discret. Appl. Math., 2016
Algorithmica, 2016
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the Approximation, 2016
2015
ACM Trans. Algorithms, 2015
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings.
J. ACM, 2015
Inf. Process. Lett., 2015
Inf. Comput., 2015
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth.
Inf. Comput., 2015
Proceedings of the Approximation, 2015
2014
ACM Trans. Comput. Theory, 2014
Algorithmica, 2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
2013
SIAM J. Discret. Math., 2013
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms.
Inf. Process. Lett., 2013
Discret. Math. Theor. Comput. Sci., 2013
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Innovations in Theoretical Computer Science, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract).
Proceedings of the Algorithms - ESA 2013, 2013
2012
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More).
SIAM J. Comput., 2012
Discret. Appl. Math., 2012
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
CoRR, 2012
Algorithmica, 2012
Proceedings of the Algorithm Theory - SWAT 2012, 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
Proceedings of the Algorithms - ESA 2012, 2012
2011
Theor. Comput. Sci., 2011
J. Discrete Algorithms, 2011
Inf. Process. Lett., 2011
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem).
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
2010
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
Proceedings of the Algorithm Theory, 2010
Proceedings of the Algorithms, 2010
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
2009
2008
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008