Hans-Joachim Böckenhauer
Orcid: 0000-0001-9164-3674
According to our database1,
Hans-Joachim Böckenhauer
authored at least 71 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
2
1
1
5
1
1
1
2
2
1
5
1
1
2
2
2
1
4
1
1
1
2
1
2
1
1
1
3
1
1
2
2
2
2
2
1
3
1
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
2023
Proceedings of the Structural Information and Communication Complexity, 2023
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
2022
Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract).
Proceedings of the New Trends in Computer Technologies and Applications, 2022
2021
Theor. Comput. Sci., 2021
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
2020
2019
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019
2018
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
2016
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016
2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
2014
The string guessing problem as a method to prove lower bounds on the advice complexity.
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
RAIRO Theor. Informatics Appl., 2014
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014
Proceedings of the Computing with New Resources, 2014
2013
J. Discrete Algorithms, 2013
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013
On the Advice Complexity of the Online <i>L</i>(2, 1)-Coloring Problem on Paths and Cycles.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
J. Discrete Algorithms, 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Proceedings of the Languages Alive, 2012
2011
Fundam. Informaticae, 2011
Proceedings of the Computation, 2011
Improved Approximations for Hard Optimization Problems via Problem Instance Classification.
Proceedings of the Rainbow of Computer Science, 2011
2010
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification.
RAIRO Theor. Informatics Appl., 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
2009
Theor. Comput. Sci., 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
J. Discrete Algorithms, 2008
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
RAIRO Theor. Informatics Appl., 2007
Discret. Appl. Math., 2007
Algorithmic Oper. Res., 2007
Proceedings of the Fun with Algorithms, 4th International Conference, 2007
2006
Proceedings of the Algorithm Theory, 2006
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006
2004
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci., 2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theor. Comput. Sci., 2002
2001
Theor. Comput. Sci., 2001
2000
RAIRO Theor. Informatics Appl., 2000
Inf. Process. Lett., 2000
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
Proceedings of the STACS 2000, 2000