Beyond the Shannon's Bound. - Michal Farnik; Lukasz Kowalik; Arkadiusz Socala (CoRR, 2013)

The Hardness of Subgraph Isomorphism. - Marek Cygan; Jakub Pachocki; Arkadiusz Socala (CoRR, 2015)

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. - Marek Cygan; Fedor V. Fomin; Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin; Jakub Pachocki; Arkadiusz Socala (SODA, 2016)

Assigning Channels Via the Meet-in-the-Middle Approach. - Lukasz Kowalik; Arkadiusz Socala (Algorithmica, 2016)

Automatic profile generation for live Linux Memory analysis. - Arkadiusz Socala; Michael Cohen (Digit. Investig., 2016)

Tight Lower Bound for the Channel Assignment Problem. - Arkadiusz Socala (ACM Trans. Algorithms, 2016)

Linear Kernels for Outbranching Problems in Sparse Digraphs. - Marthe Bonamy; Lukasz Kowalik; Michal Pilipczuk; Arkadiusz Socala (Algorithmica, 2017)

Improving TSP tours using dynamic programming over tree decomposition. - Marek Cygan; Lukasz Kowalik; Arkadiusz Socala (CoRR, 2017)

Tight Lower Bounds on Graph Embedding Problems. - Marek Cygan; Fedor V. Fomin; Alexander Golovnev; Alexander S. Kulikov; Ivan Mihajlin; Jakub Pachocki; Arkadiusz Socala (J. ACM, 2017)

Tight Lower Bounds for List Edge Coloring. - Lukasz Kowalik; Arkadiusz Socala (SWAT, 2018)

On Directed Feedback Vertex Set Parameterized by Treewidth. - Marthe Bonamy; Lukasz Kowalik; Jesper Nederlof; Michal Pilipczuk; Arkadiusz Socala; Marcin Wrochna (WG, 2018)

Approximation and Parameterized Complexity of Minimax Approval Voting. - Marek Cygan; Lukasz Kowalik; Arkadiusz Socala; Krzysztof Sornat (J. Artif. Intell. Res., 2018)

On the Fine-Grained Complexity of Rainbow Coloring. - Lukasz Kowalik; Juho Lauri; Arkadiusz Socala (SIAM J. Discret. Math., 2018)

Improving TSP Tours Using Dynamic Programming over Tree Decompositions. - Marek Cygan; Lukasz Kowalik; Arkadiusz Socala (ACM Trans. Algorithms, 2019)

Tight Lower Bounds for the Complexity of Multicoloring. - Marthe Bonamy; Lukasz Kowalik; Michal Pilipczuk; Arkadiusz Socala; Marcin Wrochna (ACM Trans. Comput. Theory, 2019)