| 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 | 35 | 2016 |
| 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 | 28 | 2017 |
| Automatic profile generation for live Linux Memory analysis A Socała, M Cohen Digital Investigation 16, S11-S24, 2016 | 28 | 2016 |
| On directed feedback vertex set parameterized by treewidth M Bonamy, Ł Kowalik, J Nederlof, M Pilipczuk, A Socała, M Wrochna Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018 | 27 | 2018 |
| 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 | 17 | 2018 |
| On the fine-grained complexity of rainbow coloring Ł Kowalik, J Lauri, A Socała SIAM Journal on Discrete Mathematics 32 (3), 1672-1705, 2018 | 16 | 2018 |
| 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 | 14 | 2019 |
| 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 | 11 | 2019 |
| The hardness of subgraph isomorphism M Cygan, J Pachocki, A Socała arXiv preprint arXiv:1504.02876, 2015 | 7 | 2015 |
| Tight lower bounds for list edge coloring Ł Kowalik, A Socała arXiv preprint arXiv:1804.02537, 2018 | 6 | 2018 |
| Tight lower bound for the channel assignment problem A Socała ACM Transactions on Algorithms (TALG) 12 (4), 1-19, 2016 | 6 | 2016 |
| Assigning channels via the meet-in-the-middle approach Ł Kowalik, A Socała Algorithmica 74, 1435-1452, 2016 | 5 | 2016 |
| Lower bounds under strong complexity assumptions A Socała Ph. D. thesis, University of Warsaw, 2017 | 4 | 2017 |
| Beyond the Shannon's Bound M Farnik, Ł Kowalik, A Socała arXiv preprint arXiv:1309.6069, 2013 | 2 | 2013 |
| Linear kernels for outbranching problems in sparse digraphs M Bonamy, Ł Kowalik, M Pilipczuk, A Socała Algorithmica 79 (1), 159-188, 2017 | 1 | 2017 |
| Ograniczenia dolne przy silnych założeniach złożonościowych A Socała | | |
