( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs.

, и . CoRR, (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.

Claudia Gaspers

Katharina Gaspers

Lutz Gaspers

Elena Sergeyev

Hans Gaspers

 

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

Turbocharging Treewidth Heuristics., , , , и . Algorithmica, 81 (2): 439-475 (2019)Backdoors into Heterogeneous Classes of SAT and CSP., , , , и . CoRR, (2015)Linearly χ-bounding (P6, C4)-free graphs., и . J. Graph Theory, 92 (3): 322-342 (2019)Kernels for Global Constraints., и . IJCAI, стр. 540-545. IJCAI/AAAI, (2011)Enumeration of Preferred Extensions in Almost Oriented Digraphs., и . MFCS, том 138 из LIPIcs, стр. 74:1-74:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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)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)