1

Detecting Backdoor Sets with Respect to Horn and Binary Clauses
Proceedings of SAT 2004 (Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May, 2004, Vancouver, BC, Canada), pages 96-103, 2004.
PDF bib
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets
1st International Workshop on Parameterized and Exact Computation (IWPEC 2004) (Rod Downey, Michael Fellows, Frank Dehne, eds.), volume 3162 of Lecture Notes in Computer Science, pages 223-234, 2004, Springer.
bib
On fixed-parameter tractable parameterizations of SAT
Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers (Enrico Giunchiglia, Armando Tacchella, eds.), volume 2919 of Lecture Notes in Computer Science, pages 188-202, 2004, Springer Verlag.
PDF bib
Solving a Real-World Glass Cutting Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2004 (Jens Gottlieb, Günther R. Raidl, eds.), volume 3004 of LNCS, pages 162–173, 2004, Springer.
PDF bib
The Parameterized Complexity of SAT Backdoors
Computing: The Australasian Theory Symposium (CATS 2004) (Mike Atkinson, ed.), pages 252-261, 2004.
Note: Informal Proceedings
bib
Validation in the Cluster Analysis of Gene Expression Data
Workshop Fuzzy-Systeme und Computational Intelligence (R. Mikut, M. Reischl, eds.), pages 13-32, 2004, Universitätsverlag Karlsruhe.
PDF bib
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, F. Rothlauf, D. Thierens, others, eds.), pages 2–7, 2003.
Note: best paper award winner of the workshop
PDF bib
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, others, eds.), pages 747–752, 2003, ACM Press.
PDF bib
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.
bib
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.
bib