Arkadiusz Socała

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Tight lower bounds for list edge coloring (available as arXiv preprint)	2020-08-25	Paper
Tight lower bounds for the complexity of multicoloring (available as arXiv preprint)	2020-05-27	Paper
Improving TSP tours using dynamic programming over tree decompositions (available as arXiv preprint)	2020-05-27	Paper
Tight lower bounds for the complexity of multicoloring ACM Transactions on Computation Theory	2019-12-16	Paper
Improving TSP Tours Using Dynamic Programming over Tree Decompositions ACM Transactions on Algorithms	2019-12-02	Paper
Approximation and parameterized complexity of minimax approval voting Journal of Artificial Intelligence Research	2018-11-30	Paper
On directed feedback vertex set parameterized by treewidth (available as arXiv preprint)	2018-11-22	Paper
Tight lower bound for the channel assignment problem ACM Transactions on Algorithms	2018-11-05	Paper
On the fine-grained complexity of rainbow coloring SIAM Journal on Discrete Mathematics	2018-07-18	Paper
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Tight lower bounds on graph embedding problems Journal of the ACM	2018-05-17	Paper
On the fine-grained complexity of rainbow coloring (available as arXiv preprint)	2018-03-02	Paper
Linear kernels for outbranching problems in sparse digraphs Algorithmica	2017-10-10	Paper
Tight lower bound for the channel assignment problem Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
scientific article; zbMATH DE number 6784970 (Why is no real title available?) (available as arXiv preprint)	2017-09-29	Paper
Assigning channels via the meet-in-the-middle approach Algorithmica	2016-05-31	Paper
Assigning channels via the meet-in-the-middle approach Algorithm Theory – SWAT 2014	2014-09-02	Paper
Beyond the Shannon's Bound	2013-09-24	Paper
Beyond the Shannon's Bound (available as arXiv preprint)	2013-01-01	Paper

Research outcomes over time

This page was built for person: Arkadiusz Socała