Hans-Joachim Böckenhauer

Author

Also Known As

BÖCKENHAUER, Hans-Joachim, Böckenhauer, Hans-Joachim, Böckenhauer, Hans-Joachim 1970-, Hans-Joachim Bockenhauer, Hans-Joachim Böckenhauer, Juraj Hromkovič

135

Publications

1.4K

Citations

H-Index

Concepts

All Affiliations

ETH Zurich RWTH Aachen University University of L'Aquila Comenius University Bratislava Saarland University

About

Hans-Joachim Böckenhauer is an author at ETH Zurich specializing in engineering, combinatorial optimization, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	12	14	458
2	Education	2	2	60
3	Business	1	1	53
4	Medicine	1	1	13
5	Natural Sciences	1	1	13

Hans-Joachim Böckenhauer

Publications

471

Citations

H-Index

Page 1

	Year	Citations
Approximation algorithms for the TSP with sharpened triangle inequality Hans-Joachim Böckenhauer, Juraj Hromkovič, Ralf Klasing, Information Processing Letters Mathematical ProgrammingEngineeringOptimization ProblemComputational ComplexityApproximation Method	2000	64
The online knapsack problem: Advice and randomization Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič, Theoretical Computer Science Mathematical ProgrammingEngineeringOnline ProblemOnline AlgorithmCombinatorial Problem	2014	53
The string guessing problem as a method to prove lower bounds on the advice complexity Hans-Joachim Böckenhauer, Juraj Hromkovič, Dennis Komm, Theoretical Computer Science Computational Complexity TheoryEngineeringAdvice ComplexityAutomated ReasoningKolmogorov Complexity	2014	48
On the Approximability of TSP on Local Modifications of Optimally Solved Instances Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovič, Érudit (Université de Montréal) Mathematical ProgrammingLocal ModificationEngineeringδ β -TspMetric Lm-tsp	2007	43
Reoptimization of Steiner trees: Changing the terminal set Hans-Joachim Böckenhauer, Juraj Hromkovič, Richard Královič, Theoretical Computer Science Network ScienceGraph TheoryEngineeringNetwork AlgorithmStructural Graph Theory	2008	36
The Parameterized Approximability of TSP with Deadlines Hans-Joachim Böckenhauer, Juraj Hromkovič, Joachim Kneis, Theory of Computing Systems Mathematical ProgrammingParameterized ApproximabilityEngineeringScheduling ProblemNetwork Calculus	2007	36
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem Hans-Joachim Böckenhauer, Sebastian Seibert RAIRO - Theoretical Informatics and Applications Branch-and-bound AlgorithmEngineeringLinear OptimizationOptimization ProblemLower Bound	2000	35
Online algorithms with advice: The tape model Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Kráľovič, Information and Computation Artificial IntelligenceEngineeringOnline ProblemAlgorithm DesignOnline Algorithm	2017	27
Reoptimization of the Shortest Common Superstring Problem Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Algorithmica Mathematical ProgrammingEngineeringString-searching AlgorithmString ProcessingCombinatorial Pattern Matching	2010	25
Online Coloring of Bipartite Graphs with and without Advice Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovič, Algorithmica Network ScienceGraph TheoryEngineeringExtremal Graph TheoryStructural Graph Theory	2013	24

Page 1