The following pages link to Hans-Joachim Böckenhauer (Q294816):
Displaying 50 items.
- (Q198870) (redirect page) (← links)
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- Improved approximations for TSP with simple precedence constraints (Q396660) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- Online algorithms with advice: the tape model (Q529045) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- Protein folding in the HP model on grid lattices with diagonals (Q867863) (← links)
- Algorithmic aspects of bioinformatics. Translated from the German original (Q885258) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Approximation hardness of deadline-TSP reoptimization (Q1019743) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- Exploring sparse graphs with advice (extended abstract) (Q1757761) (← links)
- Call admission problems on grids with advice (extended abstract) (Q1757763) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Call admission problems on grids with advice (Q2136274) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- Call admission problems on trees with advice (extended abstract) (Q2301738) (← links)
- On the advice complexity of the \(k\)-server problem (Q2396827) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- The parameterized approximability of TSP with deadlines (Q2464332) (← links)
- Call admission problems on trees (Q2672603) (← links)
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas (Q2870016) (← links)
- On the Advice Complexity of the Knapsack Problem (Q2894454) (← links)
- Online Coloring of Bipartite Graphs with and without Advice (Q2914354) (← links)
- Improved Approximations for Ordered TSP on Near-Metric Graphs, (Q2927642) (← links)
- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem (Q2938097) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- On the Advice Complexity of the k-Server Problem (Q3012806) (← links)
- The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification (Q3060204) (← links)
- (Q3079180) (← links)
- On the Hardness of Reoptimization with Multiple Given Solutions (Q3100925) (← links)
- On the Power of Randomness versus Advice in Online Computation (Q3166941) (← links)
- On Energy-Efficient Computations With Advice (Q3196431) (← links)
- (Q3445961) (← links)
- Reoptimization of Steiner Trees (Q3512464) (← links)
- A weighted HP model for protein folding with diagonal contacts (Q3512594) (← links)
- Improved Approximations for TSP with Simple Precedence Constraints (Q3562992) (← links)
- The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality (Q3563002) (← links)
- Reoptimization of the Metric Deadline TSP (Q3599123) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← links)
- On the Advice Complexity of Online Problems (Q3652221) (← links)
