1

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, B. Zhu, eds.), 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, Michel Habib, eds.), 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, others, eds.), 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, ed.), 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, others, eds.), 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, others, eds.), pages 1564–1569, 2002, IEEE Press.

M. Schreyer, Günther Raidl

On Weight-Biased Mutation for Graph Problems

Parallel Problem Solving from Nature – PPSN VII (J. J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas, H.-P. Schwefel, eds.), volume 2439 of LNCS, pages 204–213, 2002.

Günther Raidl, Gabriele Kodydek, Bryant Julstrom

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

Applications of Evolutionary Computing: EvoWorkshops 2001 (E. J.-W. Boers, others, eds.), volume 2037 of LNCS, pages 20–29, 2001, Springer.

I. Ljubić, Günther Raidl

NP-Completeness of Refutability by Literal-Once Resolution

IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning (R. Goré, A. Leitsch, T. Nipkow, eds.), volume 2083 of Lecture Notes in Artificial Intelligence, pages 168-181, 2001, Springer Verlag.

Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search

Proceedings of the 2001 Genetic and Evolutionary Computation Conference (L. Spector, others, eds.), pages 343–350, 2001, Morgan Kaufmann.

J. Gottlieb, B. A. Julstrom, F. Rothlauf, Günther Raidl