( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.

, , , и . Log. Methods Comput. Sci., (2019)

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.

Dusan Dobias

Helena Dusanek

Dusan Hanidziar

Dusan Baciak

Dusan Sovilj

 

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

Complexity of the Steiner Network Problem with Respect to the Number of Terminals., , , и . STACS, том 126 из LIPIcs, стр. 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Voting and Bribing in Single-Exponential Time., , и . STACS, том 66 из LIPIcs, стр. 46:1-46:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Scheduling Kernels via Configuration LP., и . CoRR, (2020)Integer Programming and Incidence Treedepth., , , , , и . CoRR, (2020)Multidimensional Stable Roommates with Master List., , , и . WINE, том 12495 из Lecture Notes in Computer Science, стр. 59-73. Springer, (2020)High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming., , , и . EC, стр. 505-523. ACM, (2019)Bribery Can Get Harder in Structured Multiwinner Approval Election., , , , и . AAMAS, стр. 1725-1733. ACM, (2023)Evaluating and Tuning n-fold Integer Programming., , и . SEA, том 103 из LIPIcs, стр. 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations., , , , , и . ESA, том 244 из LIPIcs, стр. 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Aggregation of Continuous Preferences in One Dimension., , , , и . IJCAI, стр. 2748-2756. ijcai.org, (2024)