( en | de | ru )

 

Disambiguation of "Telle, Jan Arne"

Author of the publication

copydeleteadd this publication to your clipboard
Boolean-width of graphs.

, , and . Theor. Comput. Sci., 412 (39): 5187-5204 (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. You can also use the button next to the name to display some publications already assigned to the person.

Aulis Telle

Walter Telle

Monika Telle

Jan-Arne Gewert

Jan-Arne Sohns

 

Other publications of authors with the same name

Computational Complexity of Covering Three-Vertex Multigraphs., , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 493-504. Springer, (2014)Classes of intersection digraphs with good algorithmic properties., , and . CoRR, (2021)Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs., , and . CoRR, (2019)Generalized H-Coloring of Graphs., and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 456-466. Springer, (2000)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)On a Combinatorial Problem Arising in Machine Teaching., , , and . ICML, OpenReview.net, (2024)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)Between Treewidth and Clique-Width., and . WG, volume 8747 of Lecture Notes in Computer Science, page 396-407. Springer, (2014)Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms., , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 340-351. Springer, (2005)