( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Graph Homomorphism Features: Why Not Sample?

, , и . PKDD/ECML Workshops (1), том 1524 из Communications in Computer and Information Science, стр. 216-222. Springer, (2021)

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.

Florian Sikora

Georg Sikora

Arne Sikora

Matthias Sikora

Michael Sikora

 

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

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity., , , , и . FCT, том 11651 из Lecture Notes in Computer Science, стр. 185-200. Springer, (2019)The Longest Run Subsequence Problem: Further Complexity Results., и . CPM, том 191 из LIPIcs, стр. 14:1-14:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Generalizing Roberts' Characterization of Unit Interval Graphs., , , , и . MFCS, том 306 из LIPIcs, стр. 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Token Sliding on Split Graphs., , , , , и . STACS, том 126 из LIPIcs, стр. 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration., и . IPEC, том 115 из LIPIcs, стр. 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Longest Run Subsequence Problem: Further Complexity Results., и . CoRR, (2020)Abundant Extensions., , , , и . CIAC, том 12701 из Lecture Notes in Computer Science, стр. 3-17. Springer, (2021)Recognizing Unit Multiple Intervals Is Hard., , , и . ISAAC, том 283 из LIPIcs, стр. 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Token Sliding on Split Graphs., , , , , и . Theory Comput. Syst., 65 (4): 662-686 (2021)Graph Homomorphism Features: Why Not Sample?, , и . PKDD/ECML Workshops (1), том 1524 из Communications in Computer and Information Science, стр. 216-222. Springer, (2021)