New parameterized algorithms for the edge dominating set problem von Xiao, Mingyu, Kloks, Ton, Poon, Sheung-Hung

Volltext

Efficient algorithms for Roman domination on some classes of graphs von Liedloff, Mathieu, Kloks, Ton, Liu, Jiping, Peng, Sheng-Lung

Volltext

Complexity of paired domination in AT-free and planar graphs von Tripathi, Vikash, Kloks, Ton, Pandey, Arti, Paul, Kaustav, Wang, Hung-Lung

Volltext

A note on the geodetic number and the Steiner number of AT-free graphs von Hon, Wing-Kai, Kloks, Ton, Liu, Hsiang-Hsuan, Wang, Hung-Lung, Wang, Yue-Li

Volltext

Finding and counting small induced subgraphs efficiently von Kloks, Ton, Kratsch, Dieter, Müller, Haiko

Volltext

Treewidth: Computations and Approximations von Kloks, Ton

Volltext

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs von Bodlaender, Hans L., Kloks, Ton

Volltext

Semitotal Domination on AT-Free Graphs and Circle Graphs von Kloks, Ton, Pandey, Arti

Volltext

On treewidth and minimum fill-in of asteroidal triple-free graphs von Kloks, Ton, Kratsch, Dieter, Spinrad, Jeremy

Volltext

A note on the geodetic number and the Steiner number of AT-free graphs von Hon, Wing-Kai, Kloks, Ton, Liu, Hsiang-Hsuan, Wang, Hung-Lung, Wang, Yue-Li

Volltext

Computing the branchwidth of interval graphs von Kloks, Ton, Kratochvíl, Jan, Müller, Haiko

Volltext

The combinatorics of N.G. de Bruijn von Kloks, Ton, Tijdeman, Rob

Volltext

On retracts, absolute retracts, and foldings in cographs von Kloks, Ton, Wang, Yue-Li

Volltext

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences von Kloks, Ton, Müller, Haiko, Vušković, Kristina

Volltext

Edge-clique covers of the tensor product von Hon, Wing-Kai, Kloks, Ton, Liu, Hsiang-Hsuan, Wang, Yue-Li

Volltext

Complexity of Paired Domination in AT-free and Planar Graphs von Tripathi, Vikash, Kloks, Ton, Pandey, Arti, Paul, Kaustav, Wang, Hung-Lung

Volltext

Treewidth and pathwidth of permutation graphs von BODLAENDER, H. L, KLOKS, T, KRATSCH, D

Volltext

Measuring the vulnerability for classes of intersection graphs von Kratsch, Dieter, Kloks, Ton, Muller, Haiko

Volltext

On maximum independent set of categorical product and ultimate categorical ratios of graphs von Hon, Wing-Kai, Kloks, Ton, Liu, Ching-Hao, Liu, Hsiang-Hsuan, Poon, Sheung-Hung, Wang, Yue-Li

Volltext

Approximating the Bandwidth for Asteroidal Triple-Free Graphs von Kloks, Ton, Kratsch, Dieter, Müller, Haiko

Volltext