Hans-Joachim Böckenhauer

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Zero-Memory Graph Exploration with Unknown Inports.

[BibT_eX]

[DOI]

David Wehner

Proceedings of the Structural Information and Communication Complexity, 2023

Online Knapsack with Removal and Recourse.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Call admission problems on grids with advice.

[BibT_eX]

[DOI]

Raphael Wegner

Theor. Comput. Sci., 2022

Call admission problems on trees.

[BibT_eX]

[DOI]

Nina Corvelo Benz

Theor. Comput. Sci., 2022

Exploring sparse graphs with advice.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Priority Algorithms with Advice for Disjoint Path Allocation Problems.

[BibT_eX]

[DOI]

Silvan Horvath

CoRR, 2022

Reoptimization of parameterized problems.

[BibT_eX]

[DOI]

Elisabet Burjons

Martin Raszyk

Acta Informatica, 2022

Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract).

[BibT_eX]

[DOI]

Silvan Horvath

Proceedings of the New Trends in Computer Technologies and Applications, 2022

2021

On the advice complexity of the online dominating set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Online Simple Knapsack with Reservation Costs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020

Advice for Online Knapsack With Removable Items.

[BibT_eX]

[DOI]

Jan Dreier

CoRR, 2020

2019

An Elementary Approach Towards Teaching Dynamic Programming.

[BibT_eX]

[DOI]

Tobias Kohn

Giovanni Serafini

Bull. EATCS, 2019

Call Admission Problems on Trees with Advice - (Extended Abstract).

[BibT_eX]

[DOI]

Nina Corvelo Benz

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Online Minimum Spanning Tree with Advice.

[BibT_eX]

[DOI]

Tatjana Brülisauer

Beatrice Palano

Int. J. Found. Comput. Sci., 2018

The Graph Exploration Problem with Advice.

[BibT_eX]

[DOI]

CoRR, 2018

Call Admission Problems on Grids with Advice (Extended Abstract).

[BibT_eX]

[DOI]

Raphael Wegner

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Exploring Sparse Graphs with Advice (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Fully Online Matching with Advice on General Bipartite Graphs and Paths.

[BibT_eX]

[DOI]

Lucia Di Caro

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

Stability of Approximation.

[BibT_eX]

[DOI]

Sebastian Seibert

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Reoptimization of Hard Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

On the advice complexity of the k-server problem.

[BibT_eX]

[DOI]

Rastislav Královic

Richard Královic

J. Comput. Syst. Sci., 2017

Online algorithms with advice: The tape model.

[BibT_eX]

[DOI]

Inf. Comput., 2017

2016

Online Exploration of Rectangular Grids.

[BibT_eX]

[DOI]

Ulla Karhumäki

CoRR, 2016

Online Minimum Spanning Tree with Advice - (Extended Abstract).

[BibT_eX]

[DOI]

Tatjana Brülisauer

Beatrice Palano

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015

On Energy-Efficient Computations With Advice.

[BibT_eX]

[DOI]

Richard J. B. Dobson

Kathleen Steinhöfel

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

The online knapsack problem: Advice and randomization.

[BibT_eX]

[DOI]

Richard Královic

Theor. Comput. Sci., 2014

The string guessing problem as a method to prove lower bounds on the advice complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles.

[BibT_eX]

[DOI]

Björn Steffen

Theor. Comput. Sci., 2014

Improved approximations for ordered TSP on near-metric graphs.

[BibT_eX]

[DOI]

Monika Steinová

RAIRO Theor. Informatics Appl., 2014

Online Coloring of Bipartite Graphs with and without Advice.

[BibT_eX]

[DOI]

Lucia Keller

Algorithmica, 2014

On the Power of Advice and Randomization for the Disjoint Path Allocation Problem.

[BibT_eX]

[DOI]

Kfir Barhum

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

2013

Improved approximations for TSP with simple precedence constraints.

[BibT_eX]

[DOI]

Monika Steinová

J. Discrete Algorithms, 2013

On the Approximability of Splitting-SAT in 2-CNF Horn Formulas.

[BibT_eX]

[DOI]

Lucia Keller

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.

[BibT_eX]

[DOI]

Björn Steffen

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Steiner tree reoptimization in graphs with sharpened triangle inequality.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On the Advice Complexity of the Knapsack Problem.

[BibT_eX]

[DOI]

Richard Královic

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

On the Power of Randomness versus Advice in Online Computation.

[BibT_eX]

[DOI]

Proceedings of the Languages Alive, 2012

2011

On the Hardness of Reoptimization with Multiple Given Solutions.

[BibT_eX]

[DOI]

Andreas Sprock

Fundam. Informaticae, 2011

Reoptimization of the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Davide Bilò

Algorithmica, 2011

Knowing All Optimal Solutions Does Not Help for TSP Reoptimization.

[BibT_eX]

[DOI]

Andreas Sprock

Proceedings of the Computation, 2011

Improved Approximations for Hard Optimization Problems via Problem Instance Classification.

[BibT_eX]

[DOI]

Proceedings of the Rainbow of Computer Science, 2011

2010

Reoptimization of the metric deadline TSP.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

Improved Approximations for TSP with Simple Precedence Constraints.

[BibT_eX]

[DOI]

Ralf Klasing

Monika Steinová

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Approximation hardness of deadline-TSP reoptimization.

[BibT_eX]

[DOI]

Joachim Kneis

Joachim Kupke

Theor. Comput. Sci., 2009

Reoptimization of Steiner trees: Changing the terminal set.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the Advice Complexity of Online Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

On k-connectivity problems with sharpened triangle inequality.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

A Local Move Set for Protein Folding in Triangular Lattice Models.

[BibT_eX]

[DOI]

Abu Zafer M. Dayem Ullah

Leonidas Kapsokalivas

Kathleen Steinhöfel

Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Reoptimization of Steiner Trees.

[BibT_eX]

[DOI]

Davide Bilò

Proceedings of the Algorithm Theory, 2008

On the Hardness of Reoptimization.

[BibT_eX]

[DOI]

Peter Widmayer

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007

Stability of Approximation.

[BibT_eX]

[DOI]

Sebastian Seibert

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

The Parameterized Approximability of TSP with Deadlines.

[BibT_eX]

[DOI]

Joachim Kneis

Joachim Kupke

Theory Comput. Syst., 2007

A weighted HP model for protein folding with diagonal contacts.

[BibT_eX]

[DOI]

Dirk Bongartz

RAIRO Theor. Informatics Appl., 2007

Protein folding in the HP model on grid lattices with diagonals.

[BibT_eX]

[DOI]

Dirk Bongartz

Discret. Appl. Math., 2007

On the Approximability of TSP on Local Modifications of Optimally Solved Instances.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2007

Efficient Algorithms for the Spoonerism Problem.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006

On the Approximation Hardness of Some Generalizations of TSP.

[BibT_eX]

[DOI]

Joachim Kneis

Joachim Kupke

Proceedings of the Algorithm Theory, 2006

Reusing Optimal TSP Solutions for Locally Modified Input Instances.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract).

[BibT_eX]

[DOI]

Dirk Bongartz

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

2001

Communication in the two-way listen-in vertex-disjoint paths mode.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

2000

Improved lower bounds on the approximability of the Traveling Salesman Problem.

[BibT_eX]

[DOI]

Sebastian Seibert

RAIRO Theor. Informatics Appl., 2000

Approximation algorithms for the TSP with sharpened triangle inequality.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.

[BibT_eX]

[DOI]