Author of the publication

The teaching size: computable teachers and learners for universal languages.

, , and . Mach. Learn., 108 (8-9): 1653-1675 (2019)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Generalized H-Coloring of Graphs., and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 456-466. Springer, (2000)Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs., , and . CoRR, (2019)Classes of intersection digraphs with good algorithmic properties., , and . CoRR, (2021)Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width., , , and . IPEC, volume 115 of LIPIcs, page 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The teaching size: computable teachers and learners for universal languages., , and . Mach. Learn., 108 (8-9): 1653-1675 (2019)Typical Sequences Revisited - Computing Width Parameters of Graphs., , and . STACS, volume 154 of LIPIcs, page 57:1-57:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Computational Complexity of Covering Three-Vertex Multigraphs., , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 493-504. Springer, (2014)Generalized H-coloring and H-covering of Trees., , , and . Nord. J. Comput., 10 (3): 206-223 (2003)Recognition of Linear and Star Variants of Leaf Powers is in P., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 70-83. Springer, (2022)Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm., and . Discret. Appl. Math., 157 (12): 2737-2746 (2009)