( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Kernels for Global Constraints.

, и . IJCAI, стр. 540-545. IJCAI/AAAI, (2011)

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

Ulf Gaspers

 

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

A Moderately Exponential Time Algorithm for Full Degree Spanning Tree., , и . TAMC, том 4978 из Lecture Notes in Computer Science, стр. 479-489. Springer, (2008)Strong Backdoors to Nested Satisfiability., и . SAT, том 7317 из Lecture Notes in Computer Science, стр. 72-85. Springer, (2012)Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs., и . CoRR, (2017)Cluster Editing with Vertex Splitting., , , , и . ISCO, том 10856 из Lecture Notes in Computer Science, стр. 1-13. Springer, (2018)Turbocharging Treewidth Heuristics., , , , и . IPEC, том 63 из LIPIcs, стр. 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Colouring Square-Free Graphs without Long Induced Paths., , и . STACS, том 96 из LIPIcs, стр. 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)From Matching with Diversity Constraints to Matching with Regional Quotas., , , и . CoRR, (2020)Blockchain-Enabled Private and Secure Task Allocation Framework., , , и . COMSNETS, стр. 666-670. IEEE, (2024)Don't Be Strict in Local Search!, , , , и . AAAI, стр. 486-492. AAAI Press, (2012)A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set., и . Discret. Math. Theor. Comput. Sci., 14 (1): 29-42 (2012)