( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Colouring Square-Free Graphs without Long Induced Paths.

, , и . STACS, том 96 из LIPIcs, стр. 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

Claudia Gaspers

Katharina Gaspers

Lutz Gaspers

Elena Sergeyev

Hans Gaspers

 

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

Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets., и . ACM Trans. Algorithms, 13 (4): 44:1-44:36 (2017)Stable Matching with Uncertain Linear Preferences., , , , , и . Algorithmica, 82 (5): 1410-1433 (2020)Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems., и . CoRR, (2023)Making the Most of Parallel Composition in Differential Privacy., , , , , и . CoRR, (2021)Backdoors to Satisfaction., и . The Multivariate Algorithmic Revolution and Beyond, том 7370 из Lecture Notes in Computer Science, стр. 287-317. Springer, (2012)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)Turbocharging Treewidth Heuristics., , , , и . Algorithmica, 81 (2): 439-475 (2019)A note on the eternal dominating set problem., , , и . Int. J. Game Theory, 47 (2): 543-555 (2018)Backdoors to Acyclic SAT., и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 363-374. Springer, (2012)Kernels for Global Constraints., и . IJCAI, стр. 540-545. IJCAI/AAAI, (2011)