From post

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.

 

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

Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems., и . CoRR, (2023)Kernels for Global Constraints., и . IJCAI, стр. 540-545. IJCAI/AAAI, (2011)Backdoors to Acyclic SAT., и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 363-374. Springer, (2012)Turbocharging Treewidth Heuristics., , , , и . Algorithmica, 81 (2): 439-475 (2019)Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements., , , и . ISAAC, том 92 из LIPIcs, стр. 37:1-37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Backdoors to Satisfaction., и . The Multivariate Algorithmic Revolution and Beyond, том 7370 из Lecture Notes in Computer Science, стр. 287-317. Springer, (2012)Faster Algorithms for Weak Backdoors., и . AAAI, стр. 3741-3748. AAAI Press, (2022)Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract., , , и . AAMAS, стр. 1759-1761. International Foundation for Autonomous Agents and Multiagent Systems, (2020)From Matching with Diversity Constraints to Matching with Regional Quotas., , , и . AAMAS, стр. 377-385. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Strong Backdoors to Bounded Treewidth SAT., и . FOCS, стр. 489-498. IEEE Computer Society, (2013)