1

The Parameterized Complexity of SAT Backdoors

Computing: The Australasian Theory Symposium (CATS 2004) (Mike Atkinson), pages 252-261, 2004.
Note: Informal Proceedings

Validation in the Cluster Analysis of Gene Expression Data

Workshop Fuzzy-Systeme und Computational Intelligence (Mikut, R. and Reischl, M.), pages 13-32, 2004, Universitätsverlag Karlsruhe.

Jäkel, Jens, Martin Nöllenburg

A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

in 2003 Genetic and Evolutionary Computation Conference’s Workshops Proceedings, Workshop on Analysis and Design of Representations (A. Barry and F. Rothlauf and D. Thierens and others), pages 2-7, 2003.
Note: best paper award winner of the workshop

B. A. Julstrom, Günther Raidl

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem

Proceedings of the 2003 ACM Symposium on Applied Computing (G. Lamont and others), pages 747-752, 2003, ACM Press.

Günther Raidl, B. A. Julstrom

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03) (T. Warnow and B. Zhu), volume 2697 of Lecture Notes in Computer Science, pages 548-558, 2003, Springer Verlag.

The complexity of resolution with generalized symmetry rules

Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS'03) (Helmut Alt and Michel Habib), volume 2607 of Lecture Notes in Computer Science, pages 475-486, 2003.

A Memetic Algorithm for Vertex-Biconnectivity Augmentation

Applications of Evolutionary Computing: EvoWorkshops 2002 (S. Cagnoni and others), volume 2279 of LNCS, pages 102-111, 2002, Springer.

S. Kersting, Günther Raidl, I. Ljubić

Generalizations of matched CNF formulas

Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002) Cincinnati, Ohio, USA, May 6-9, 2002 (John Franco), pages 292-307, 5 2002.

Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges

Proceedings of the 2002 ACM Symposium on Applied Computing (G. Lamont and others), pages 547-552, 2002, ACM Press.

B. A. Julstrom, Günther Raidl

Letting Ants Labeling Point Features

Proceedings of the 2002 IEEE Congress on Evolutionary Computation (D. Fogel and others), pages 1564-1569, 2002, IEEE Press.

M. Schreyer, Günther Raidl