( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improving TSP Tours Using Dynamic Programming over Tree Decompositions.

, , и . ESA, том 87 из LIPIcs, стр. 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Arkadiusz Dziubek

Arkadiusz Kalicki

Arkadiusz Wudarski

Arkadiusz Russjan

Arkadiusz Miernik

 

Другие публикации лиц с тем же именем

Tight Lower Bounds for the Complexity of Multicoloring., , , , и . ESA, том 87 из LIPIcs, стр. 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Improving TSP Tours Using Dynamic Programming over Tree Decompositions., , и . ESA, том 87 из LIPIcs, стр. 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Tight Bounds for Graph Homomorphism and Subgraph Isomorphism., , , , , , и . SODA, стр. 1643-1649. SIAM, (2016)Tight Lower Bounds on Graph Embedding Problems., , , , , , и . CoRR, (2016)On the Fine-Grained Complexity of Rainbow Coloring., , и . ESA, том 57 из LIPIcs, стр. 58:1-58:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Tight lower bound for the channel assignment problem.. SODA, стр. 662-675. SIAM, (2015)Tight lower bounds for the complexity of multicoloring., , , , и . CoRR, (2016)Assigning Channels via the Meet-in-the-Middle Approach., и . SWAT, том 8503 из Lecture Notes in Computer Science, стр. 282-293. Springer, (2014)Beyond the Shannon's Bound., , и . CoRR, (2013)On Directed Feedback Vertex Set Parameterized by Treewidth., , , , , и . WG, том 11159 из Lecture Notes in Computer Science, стр. 65-78. Springer, (2018)