受强制性开放获取政策约束的文章 - Marek Cygan了解详情
可在其他位置公开访问的文章：34 篇
On problems as hard as CNF-SAT
M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ...
ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016
强制性开放获取政策： US National Science Foundation, Netherlands Organisation for Scientific …
Fast hamiltonicity checking via bases of perfect matchings
M Cygan, S Kratsch, J Nederlof
Journal of the ACM (JACM) 65 (3), 1-46, 2018
强制性开放获取政策： Netherlands Organisation for Scientific Research, European Commission
Designing FPT algorithms for cut problems using randomized contractions
R Chitnis, M Cygan, MT Hajiaghayi, M Pilipczuk, M Pilipczuk
SIAM Journal on Computing 45 (4), 1171-1229, 2016
强制性开放获取政策： US National Science Foundation, European Commission
On problems equivalent to (min,+)-convolution
M Cygan, M Mucha, K Węgrzycki, M Włodarczyk
ACM Transactions on Algorithms (TALG) 15 (1), 1-25, 2019
强制性开放获取政策： European Commission
From gap-eth to fpt-inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
强制性开放获取政策： US National Science Foundation, Swedish Research Council, European Commission
Directed subset feedback vertex set is fixed-parameter tractable
R Chitnis, M Cygan, M Hajiaghayi, D Marx
ACM Transactions on Algorithms (TALG) 11 (4), 1-28, 2015
强制性开放获取政策： Hungarian Scientific Research Fund, European Commission
Applying deep learning to right whale photo identification
R Bogucki, M Cygan, CB Khan, M Klimek, JK Milczek, M Mucha
Conservation Biology 33 (3), 676-684, 2019
强制性开放获取政策： US National Oceanic and Atmospheric Administration
Known algorithms for edge clique cover are probably optimal
M Cygan, M Pilipczuk, M Pilipczuk
SIAM Journal on Computing 45 (1), 67-83, 2016
强制性开放获取政策： European Commission
Minimum bisection is fixed parameter tractable
M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
强制性开放获取政策： European Commission
Algorithmic applications of baur-strassen’s theorem: Shortest cycles, diameter, and matchings
M Cygan, HN Gabow, P Sankowski
Journal of the ACM (JACM) 62 (4), 1-30, 2015
强制性开放获取政策： European Commission
Parameterized complexity of Eulerian deletion problems
M Cygan, D Marx, M Pilipczuk, M Pilipczuk, I Schlotter
Algorithmica 68, 41-61, 2014
强制性开放获取政策： Hungarian Scientific Research Fund, European Commission
Clique cover and graph separation: New incompressibility results
M Cygan, S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström
ACM Transactions on Computation Theory (TOCT) 6 (2), 1-19, 2014
强制性开放获取政策： European Commission
How to sell hyperedges: The hypermatching assignment problem
M Cygan, F Grandoni, M Mastrolilli
Proceedings of the twenty-fourth annual acm-siam symposium on discrete …, 2013
强制性开放获取政策： Swiss National Science Foundation
From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
SIAM Journal on Computing 49 (4), 772-810, 2020
强制性开放获取政策： US National Science Foundation, Swedish Research Council, European Commission
Randomized contractions meet lean decompositions
M Cygan, P Komosa, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh, ...
ACM Transactions on Algorithms (TALG) 17 (1), 1-30, 2020
强制性开放获取政策： US National Science Foundation, European Commission
Algorithmic complexity of power law networks
P Brach, M Cygan, J Łącki, P Sankowski
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
强制性开放获取政策： European Commission
Parameterized complexity of firefighting
C Bazgan, M Chopin, M Cygan, MR Fellows, FV Fomin, EJ Van Leeuwen
Journal of Computer and System Sciences 80 (7), 1285-1297, 2014
强制性开放获取政策： European Commission
Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
I Bliznets, M Cygan, P Komosa, M Pilipczuk, L Mach
ACM Transactions on Algorithms (TALG) 16 (2), 1-31, 2020
强制性开放获取政策： European Commission
Tight lower bounds on graph embedding problems
M Cygan, FV Fomin, A Golovnev, AS Kulikov, I Mihajlin, J Pachocki, ...
Journal of the ACM (JACM) 64 (3), 1-22, 2017
强制性开放获取政策： US National Science Foundation
On cutwidth parameterized by vertex cover
M Cygan, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh
Algorithmica 68, 940-953, 2014
强制性开放获取政策： European Commission
出版信息和资助信息由计算机程序自动确定