Suivre
Hans-Joachim Böckenhauer
Hans-Joachim Böckenhauer
Departement Informatik, ETH Zürich
Adresse e-mail validée de inf.ethz.ch
Titre
Citée par
Citée par
Année
On the advice complexity of online problems
HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke
Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009
1662009
On the hardness of reoptimization
HJ Böckenhauer, J Hromkovič, T Mömke, P Widmayer
SOFSEM 2008: Theory and Practice of Computer Science: 34th Conference on …, 2008
1052008
Algorithmic aspects of bioinformatics
HJ Böckenhauer, D Bongartz
Springer Science & Business Media, 2007
1012007
On the advice complexity of the k-server problem
HJ Böckenhauer, D Komm, R Královič, R Královič
International Colloquium on Automata, Languages, and Programming, 207-218, 2011
942011
The online knapsack problem: Advice and randomization
HJ Böckenhauer, D Komm, R Královič, P Rossmanith
Theoretical Computer Science 527, 61-72, 2014
752014
On the approximability of TSP on local modifications of optimally solved instances
HJ Böckenhauer, L Forlizzi, J Hromkovič, J Kneis, J Kupke, G Proietti, ...
Algorithmic Operations Research 2 (2), 83-93, 2007
742007
The string guessing problem as a method to prove lower bounds on the advice complexity
HJ Böckenhauer, J Hromkovič, D Komm, S Krug, J Smula, A Sprock
Theoretical Computer Science 554, 95-108, 2014
732014
A local move set for protein folding in triangular lattice models
HJ Böckenhauer, AZM Dayem Ullah, L Kapsokalivas, K Steinhöfel
Algorithms in Bioinformatics: 8th International Workshop, WABI 2008 …, 2008
702008
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
HJ Böckenhauer, J Hromkovič, R Klasing, S Seibert, W Unger
Theoretical Computer Science 285 (1), 3-24, 2002
692002
Approximation algorithms for the TSP with sharpened triangle inequality
HJ Böckenhauer, J Hromkovič, R Klasing, S Seibert, W Unger
Information Processing Letters 75 (3), 133-138, 2000
662000
Reoptimization of Steiner trees
D Bilò, HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Widmayer, ...
Algorithm Theory–SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory …, 2008
602008
Online coloring of bipartite graphs with and without advice
MP Bianchi, HJ Böckenhauer, J Hromkovič, L Keller
Algorithmica 70 (1), 92-111, 2014
522014
Reoptimization of Steiner trees: Changing the terminal set
HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Rossmanith
Theoretical computer science 410 (36), 3428-3435, 2009
522009
An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality
HJ Böckenhauer, J Hromkovič, R Klasing, S Seibert, W Unger
Annual Symposium on Theoretical Aspects of Computer Science, 382-394, 2000
522000
The parameterized approximability of TSP with deadlines
HJ Bockenhauer, J Hromkovic, J Kneis, J Kupke
Theory of Computing Systems 41, 431-444, 2007
512007
On the advice complexity of the knapsack problem
HJ Böckenhauer, D Komm, R Královič, P Rossmanith
Latin American Symposium on Theoretical Informatics, 61-72, 2012
502012
Reoptimization of the shortest common superstring problem
D Bilò, HJ Böckenhauer, D Komm, R Královič, T Mömke, S Seibert, A Zych
Algorithmica 61, 227-251, 2011
492011
Reoptimization of the metric deadline TSP
HJ Böckenhauer, D Komm
Journal of Discrete Algorithms 8 (1), 87-100, 2010
472010
Reusing optimal TSP solutions for locally modified input instances
HJ Böckenhauer, L Forlizzi, J Hromkovič, J Kneis, J Kupke, G Proietti, ...
Fourth IFIP International Conference on Theoretical Computer Science-TCS …, 2006
472006
Algorithmische Grundlagen der Bioinformatik: Modelle, Methoden und Komplexität
HJ Böckenhauer, D Bongartz
Springer-Verlag, 2013
412013
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20