Arkadiusz Socala

31 papers A* 3A 3B 2Journal 21Unranked 2
YearRankTypeTitle / Venue / Authors
2019 J jnl
Improving TSP Tours Using Dynamic Programming over Tree Decompositions.
ACM Trans. Algorithms
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala
2019 J jnl
Tight Lower Bounds for the Complexity of Multicoloring.
ACM Trans. Comput. Theory
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2018 J jnl
Approximation and Parameterized Complexity of Minimax Approval Voting.
J. Artif. Intell. Res.
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat
2018 B conf
On Directed Feedback Vertex Set Parameterized by Treewidth.
WG
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2018 J jnl
On the Fine-Grained Complexity of Rainbow Coloring.
SIAM J. Discret. Math.
Lukasz Kowalik, Juho Lauri, Arkadiusz Socala
2018 — conf
Tight Lower Bounds for List Edge Coloring.
SWAT
Lukasz Kowalik, Arkadiusz Socala
2018 J jnl
Tight Lower Bounds for List Edge Coloring.
CoRR
Lukasz Kowalik, Arkadiusz Socala
2017 A* conf
Approximation and Parameterized Complexity of Minimax Approval Voting.
AAAI
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat
2017 A conf
Improving TSP Tours Using Dynamic Programming over Tree Decompositions.
ESA
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala
2017 J jnl
Improving TSP tours using dynamic programming over tree decomposition.
CoRR
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala
2017 J jnl
Linear Kernels for Outbranching Problems in Sparse Digraphs.
Algorithmica
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2017 J jnl
On Directed Feedback Vertex Set parameterized by treewidth.
CoRR
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2017 A conf
Tight Lower Bounds for the Complexity of Multicoloring.
ESA
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2017 J jnl
Tight Lower Bounds on Graph Embedding Problems.
J. ACM
Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala
2016 J jnl
Approximation and Parameterized Complexity of Minimax Approval Voting.
CoRR
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat
2016 J jnl
Assigning Channels Via the Meet-in-the-Middle Approach.
Algorithmica
Lukasz Kowalik, Arkadiusz Socala
2016 J jnl
Automatic profile generation for live Linux Memory analysis.
Digit. Investig.
Arkadiusz Socala, Michael Cohen
2016 A conf
On the Fine-Grained Complexity of Rainbow Coloring.
ESA
Lukasz Kowalik, Juho Lauri, Arkadiusz Socala
2016 J jnl
On the fine-grained complexity of rainbow coloring.
CoRR
Lukasz Kowalik, Juho Lauri, Arkadiusz Socala
2016 A* conf
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.
SODA
Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala
2016 J jnl
Tight Lower Bound for the Channel Assignment Problem.
ACM Trans. Algorithms
Arkadiusz Socala
2016 J jnl
Tight Lower Bounds on Graph Embedding Problems.
CoRR
Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala
2016 J jnl
Tight lower bounds for the complexity of multicoloring.
CoRR
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2015 B conf
Linear Kernels for Outbranching Problems in Sparse Digraphs.
IPEC
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2015 J jnl
Linear kernels for outbranching problems in sparse digraphs.
CoRR
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
2015 J jnl
The Hardness of Subgraph Isomorphism.
CoRR
Marek Cygan, Jakub Pachocki, Arkadiusz Socala
2015 A* conf
Tight lower bound for the channel assignment problem.
SODA
Arkadiusz Socala
2014 — conf
Assigning Channels via the Meet-in-the-Middle Approach.
SWAT
Lukasz Kowalik, Arkadiusz Socala
2014 J jnl
Assigning channels via the meet-in-the-middle approach.
CoRR
Lukasz Kowalik, Arkadiusz Socala
2014 J jnl
Tight lower bound for the channel assignment problem.
CoRR
Arkadiusz Socala
2013 J jnl
Beyond the Shannon's Bound.
CoRR
Michal Farnik, Lukasz Kowalik, Arkadiusz Socala