Informatikwissenschaften
FB IV - Wirtschafts- und Sozialwissenschaften, Mathematik, Informatikwissenschaften / Universität Trier
- 0651/
- 0651/
Binkele-Raible, Daniel; Fernau, Henning
A new upper bound for Max-2-SAT: A graph-theoretic approach.J. Discrete Algorithms. Bd. 8. H. 4. 2010 S. 388 - 401
Binkele-Raible, Daniel; Brankovic, Ljiljana; Fernau, Henning et al.
A Parameterized Route to Exact Puzzles: Breaking the 2-Barrier for Irredundance.CIAC. 2010 S. 311 - 322
Fernau, Henning
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set.Algorithmica. Bd. 57. H. 1. 2010 S. 97 - 118
Bogon, Tjorben; D. Lattner, Andreas; Lorion, Yann et al.
An Agent-based Approach for Dynamic Combination and Adaptation of Metaheuristics.MKWI. 2010 S. 2345 - 2358
Raible, Daniel; Fernau, Henning
An Amortized Search Tree Analysis for -Leaf Spanning Tree.SOFSEM. 2010 S. 672 - 684
Bogon, Tjorben; Poursanidis, Georgios; D. Lattner, Andreas et al.
Automatic Parameter Configuration of Particle Swarm Optimization by Classification of Function Features.ANTS Conference. 2010 S. 554 - 555
Brankovic, Ljiljana; Fernau, Henning
Combining Two Worlds: Parameterised Approximation for Vertex Cover.ISAAC (1). 2010 S. 390 - 402
Fernau, Henning; Kaufmann, Michael; Poths, Mathias
Comparing trees via crossing minimization.J. Comput. Syst. Sci. Bd. 76. H. 7. 2010 S. 593 - 608
Binkele-Raible, Daniel; Fernau, Henning
Enumerate and Measure: Improving Parameter Budget Management.IPEC. 2010 S. 38 - 49
Binkele-Raible, Daniel; Fernau, Henning; Gaspers, Serge et al.
Exact exponential-time algorithms for finding bicliques.Inf. Process. Lett. Bd. 111. H. 2. 2010 S. 64 - 67