1

Detecting Backdoor Sets with Respect to Horn and Binary Clauses

Naomi Nishimura, Prabhakar Ragde, Stefan Szeider

On fixed-parameter tractable parameterizations of SAT

Solving a Real-World Glass Cutting Problem

Jakob Puchinger, Günther Raidl, Gabriele Koller

The Parameterized Complexity of SAT Backdoors

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

B. A. Julstrom, Günther Raidl

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

Günther Raidl, B. A. Julstrom

A Memetic Algorithm for Vertex-Biconnectivity Augmentation

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

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

B. A. Julstrom, Günther Raidl

Letting Ants Labeling Point Features

M. Schreyer, Günther Raidl

On Weight-Biased Mutation for Graph Problems

Günther Raidl, Gabriele Kodydek, Bryant Julstrom