Arkadiusz Socala

According to our database, Arkadiusz Socala authored at least 15 papers between 2013 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

On Directed Feedback Vertex Set Parameterized by Treewidth.

Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Tight Lower Bounds for List Edge Coloring.

Lukasz Kowalik, Arkadiusz Socala

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

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

Improving TSP tours using dynamic programming over tree decomposition.

Marek Cygan, Lukasz Kowalik, Arkadiusz Socala

CoRR, 2017

Improving TSP Tours Using Dynamic Programming over Tree Decompositions.

Marek Cygan, Lukasz Kowalik, Arkadiusz Socala

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Tight Lower Bounds for the Complexity of Multicoloring.

Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Approximation and Parameterized Complexity of Minimax Approval Voting.

Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Automatic profile generation for live Linux Memory analysis.

Arkadiusz Socala, Michael Cohen

Digit. Investig., 2016

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.

Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On the Fine-Grained Complexity of Rainbow Coloring.

Lukasz Kowalik, Juho Lauri, Arkadiusz Socala

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

The Hardness of Subgraph Isomorphism.

Marek Cygan, Jakub Pachocki, Arkadiusz Socala

CoRR, 2015

Tight lower bound for the channel assignment problem.

Arkadiusz Socala

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Linear Kernels for Outbranching Problems in Sparse Digraphs.

Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

Assigning Channels via the Meet-in-the-Middle Approach.

Lukasz Kowalik, Arkadiusz Socala

Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013

Beyond the Shannon's Bound.

Michal Farnik, Lukasz Kowalik, Arkadiusz Socala

CoRR, 2013