Arkadiusz Socała

zbMath Opensocala.arkadiuszMaRDI QIDQ289930

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	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

Research outcomes over time

This page was built for person: Arkadiusz Socała