Arkadiusz Socała

Available identifiers

Publication	Date of Publication	Type
Tight Lower Bounds for List Edge Coloring	2020-08-25	Paper
Tight Lower Bounds for the Complexity of Multicoloring	2020-05-27	Paper
Improving TSP Tours Using Dynamic Programming over Tree Decompositions.	2020-05-27	Paper
Tight Lower Bounds for the Complexity of Multicoloring	2019-12-16	Paper
Improving TSP Tours Using Dynamic Programming over Tree Decompositions	2019-12-02	Paper
Approximation and Parameterized Complexity of Minimax Approval Voting	2018-11-30	Paper
On directed feedback vertex set parameterized by treewidth	2018-11-22	Paper
Tight Lower Bound for the Channel Assignment Problem	2018-11-05	Paper
On the Fine-Grained Complexity of Rainbow Coloring	2018-07-18	Paper
Tight Bounds for Graph Homomorphism and Subgraph Isomorphism	2018-07-16	Paper
Tight Lower Bounds on Graph Embedding Problems	2018-05-17	Paper
On the Fine-Grained Complexity of Rainbow Coloring	2018-03-02	Paper
Linear kernels for outbranching problems in sparse digraphs	2017-10-10	Paper
Tight lower bound for the channel assignment problem	2017-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q5363775	2017-09-29	Paper
Assigning channels via the meet-in-the-middle approach	2016-05-31	Paper
Assigning Channels via the Meet-in-the-Middle Approach	2014-09-02	Paper
Beyond the Shannon's Bound	2013-09-24	Paper

This page was built for person: Arkadiusz Socała