— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...