Arkadiusz Socała
Arkadiusz Socała
Verifisert e-postadresse på mimuw.edu.pl
Tittel
Sitert av
Sitert av
År
Tight bounds for graph homomorphism and subgraph isomorphism
M Cygan, FV Fomin, A Golovnev, AS Kulikov, I Mihajlin, J Pachocki, ...
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
222016
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
202017
Approximation and parameterized complexity of minimax approval voting
M Cygan, Ł Kowalik, A Socała, K Sornat
Journal of Artificial Intelligence Research 63, 495-513, 2018
172018
On directed feedback vertex set parameterized by treewidth
M Bonamy, Ł Kowalik, J Nederlof, M Pilipczuk, A Socała, M Wrochna
International Workshop on Graph-Theoretic Concepts in Computer Science, 65-78, 2018
142018
Automatic profile generation for live Linux Memory analysis
A Socała, M Cohen
Digital Investigation 16, S11-S24, 2016
112016
Improving TSP tours using dynamic programming over tree decompositions
M Cygan, Ł Kowalik, A Socała
ACM Transactions on Algorithms (TALG) 15 (4), 1-19, 2019
82019
On the fine-grained complexity of rainbow coloring
Ł Kowalik, J Lauri, A Socała
SIAM Journal on Discrete Mathematics 32 (3), 1672-1705, 2018
82018
Tight lower bounds for the complexity of multicoloring
M Bonamy, Ł Kowalik, M Pilipczuk, A Socała, M Wrochna
ACM Transactions on Computation Theory (TOCT) 11 (3), 1-19, 2019
72019
The hardness of subgraph isomorphism
M Cygan, J Pachocki, A Socała
arXiv preprint arXiv:1504.02876, 2015
72015
Assigning channels via the meet-in-the-middle approach
Ł Kowalik, A Socała
Algorithmica 74 (4), 1435-1452, 2016
52016
Tight lower bound for the channel assignment problem
A Socała
ACM Transactions on Algorithms (TALG) 12 (4), 1-19, 2016
42016
Tight lower bounds for list edge coloring
Ł Kowalik, A Socała
arXiv preprint arXiv:1804.02537, 2018
32018
Lower Bounds Under Strong Complexity Assumptions
A Socała
32017
Beyond the Shannon's Bound
M Farnik, Ł Kowalik, A Socała
arXiv preprint arXiv:1309.6069, 2013
22013
Linear kernels for outbranching problems in sparse digraphs
M Bonamy, Ł Kowalik, M Pilipczuk, A Socała
Algorithmica 79 (1), 159-188, 2017
12017
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS
J Balogh, J Békési, G Dósa, L Epstein, A Levin, A Becker, PN Klein, ...
2017
Ograniczenia dolne przy silnych założeniach złożonościowych
A Socała
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–17