Informatikwissenschaften
FB IV - Wirtschafts- und Sozialwissenschaften, Mathematik, Informatikwissenschaften / Universität Trier
- 0651/
- 0651/
Brankovic, Ljiljana; Fernau, Henning
Parameterized Approximation Algorithms for Hitting Set.WAOA. 2011 S. 63 - 76
Minor, Mirjam; Bergmann, Ralph; Görg, Sebastian et al.
Reasoning on Business Processes to Support Change Reuse.CEC. 2011 S. 18 - 25
Bergmann, Ralph; Gil, Yolanda
Retrieval of Semantic Workflows with Knowledge Intensive Similarity Measures.ICCBR. 2011 S. 17 - 31
Bogon, Tjorben; Poursanidis, Georgios; D. Lattner, Andreas et al.
Setting Up Particle Swarm Optimization by Decision Tree Learning Out of Function Features.ICAART (Revised Selected Papers). 2011 S. 72 - 85
Binkele-Raible, Daniel; Fernau, Henning
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.CSR. 2010 S. 328 - 339
N. Abu-Khzam, Faisal; Fernau, Henning; A. Langston, Michael et al.
A Fixed-Parameter Algorithm for String-to-String Correction.CATS. 2010 S. 31 - 38
D. Lattner, Andreas; Bogon, Tjorben; Lorion, Yann et al.
A knowledge-based approach to automated simulation model adaptation.SpringSim. 2010 S. 153
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