Daniel Kobler

Learn More
In a graph G a matching is a set of edges in which no two edges have a common endpoint. An induced matching is a matching in which no two edges are linked by an edge of G. The maximum induced matching (abbreviated MIM) problem is to find the maximum size of an induced matching for a given graph G. This problem is known to be NP-hard even on bipartite graphs(More)
We consider three graph partitioning problems, both from the vertices and the edges point of view. These problems are dominating set, list-<i>q</i>-coloring with costs (fixed number of colors <i>q</i>) and coloring with non-fixed number of colors. They are all known to be NP-hard in general. We show that all these problems (except edge-coloring) can be(More)
Many vertex-partitioning problems can be expressed within a general framework introduced by Telle and Proskurowski. They showed that optimization problems in this framework can be solved in polynomial time on classes of graphs with bounded tree-width. In this paper, we consider a very similar framework, in relationship with more general classes of graphs:(More)
This paper shows how evolutionary algorithms can be described in a concise, yet comprehensive and accurate way. A classification scheme is introduced and presented in a tabular form called TEA (Table of Evolutionary Algorithms). It distinguishes between different classes of evolutionary algorithms (e.g., genetic algorithms, ant systems) by enumerating the(More)