( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Covering Regular Graphs.

, , и . J. Comb. Theory B, 71 (1): 1-16 (1997)

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.

Aulis Telle

Walter Telle

Monika Telle

Jan-Arne Gewert

Jan-Arne Sohns

 

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

Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs., , и . CoRR, (2019)Generalized H-Coloring of Graphs., и . ISAAC, том 1969 из Lecture Notes in Computer Science, стр. 456-466. Springer, (2000)Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width., , , и . IPEC, том 115 из LIPIcs, стр. 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The teaching size: computable teachers and learners for universal languages., , и . Mach. Learn., 108 (8-9): 1653-1675 (2019)Classes of intersection digraphs with good algorithmic properties., , и . CoRR, (2021)Computational Complexity of Covering Three-Vertex Multigraphs., , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 493-504. Springer, (2014)On a Combinatorial Problem Arising in Machine Teaching., , , и . ICML, OpenReview.net, (2024)Typical Sequences Revisited - Computing Width Parameters of Graphs., , и . STACS, том 154 из LIPIcs, стр. 57:1-57:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm., и . Discret. Appl. Math., 157 (12): 2737-2746 (2009)Mod-2 Independence and Domination in Graphs., , и . Int. J. Found. Comput. Sci., 11 (3): 355-363 (2000)