Arkadiusz Socala

According to our database1, Arkadiusz Socala authored at least 15 papers between 2013 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Tight Lower Bounds for the Complexity of Multicoloring.
ACM Trans. Comput. Theory, 2019

Improving TSP Tours Using Dynamic Programming over Tree Decompositions.
ACM Trans. Algorithms, 2019

2018
On the Fine-Grained Complexity of Rainbow Coloring.
SIAM J. Discret. Math., 2018

Approximation and Parameterized Complexity of Minimax Approval Voting.
J. Artif. Intell. Res., 2018

On Directed Feedback Vertex Set Parameterized by Treewidth.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Tight Lower Bounds for List Edge Coloring.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017
Tight Lower Bounds on Graph Embedding Problems.
J. ACM, 2017

Improving TSP tours using dynamic programming over tree decomposition.
CoRR, 2017

Linear Kernels for Outbranching Problems in Sparse Digraphs.
Algorithmica, 2017

2016
Tight Lower Bound for the Channel Assignment Problem.
ACM Trans. Algorithms, 2016

Automatic profile generation for live Linux Memory analysis.
Digit. Investig., 2016

Assigning Channels Via the Meet-in-the-Middle Approach.
Algorithmica, 2016

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
The Hardness of Subgraph Isomorphism.
CoRR, 2015

2013
Beyond the Shannon's Bound.
CoRR, 2013


  Loading...