Author of the publication

On the Complexity of Problems on Tree-Structured Graphs.

, , , , and . IPEC, volume 249 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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

XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure., , and . CoRR, (2022)List Colouring Trees in Logarithmic Space., , and . ESA, volume 244 of LIPIcs, page 24:1-24:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs., and . WG, volume 13453 of Lecture Notes in Computer Science, page 287-299. Springer, (2022)XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure., , , , and . IPEC, volume 249 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Close Relatives (Of Feedback Vertex Set), Revisited., , , and . IPEC, volume 214 of LIPIcs, page 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the Complexity of Problems on Tree-Structured Graphs., , , , and . IPEC, volume 249 of LIPIcs, page 6:1-6:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Parameterized Complexity of Computing Tree-Partitions., , and . IPEC, volume 249 of LIPIcs, page 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A video summarization approach based on the emulation of bottom-up mechanisms of visual attention., , , and . J. Intell. Inf. Syst., 49 (2): 193-211 (2017)