( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complete Edge-Colored Permutation Graphs.

, , , , , и . CoRR, (2020)

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.

Agnes Bannach

Winfried Bannach

Klaus Bannach

Oliver Bannach

Klaus Bannach

 

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

Computing Kernels in Parallel: Lower and Upper Bounds., и . IPEC, том 115 из LIPIcs, стр. 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Descriptive Complexity of Color Coding., и . STACS, том 126 из LIPIcs, стр. 11:1-11:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Computing Hitting Set Kernels By AC^0-Circuits., и . STACS, том 96 из LIPIcs, стр. 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Descriptive Complexity of Color Coding., и . Algorithms, 14 (3): 96 (2021)Solving Packing Problems with Few Small Items Using Rainbow Matchings., , , , , , и . MFCS, том 170 из LIPIcs, стр. 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Existential Second-Order Logic over Graphs: Parameterized Complexity., , и . IPEC, том 285 из LIPIcs, стр. 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications., , и . J. Mach. Learn. Res., (2023)Parallel Multivariate Meta-Theorems., и . IPEC, том 63 из LIPIcs, стр. 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Complete edge-colored permutation graphs., , , , , и . Adv. Appl. Math., (2022)Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs., , и . CoRR, (2020)