| Publication | Date of Publication | Type |
|---|
| Priority algorithms with advice for disjoint path allocation problems | 2024-11-18 | Paper |
| Zero-memory graph exploration with unknown inports | 2024-01-11 | Paper |
| Online knapsack with removal and recourse | 2023-12-22 | Paper |
| Fully Online Matching with Advice on General Bipartite Graphs and Paths | 2023-06-30 | Paper |
| Exploring sparse graphs with advice | 2022-12-08 | Paper |
| Reoptimization of parameterized problems | 2022-08-30 | Paper |
| Call admission problems on trees | 2022-06-13 | Paper |
| Call admission problems on grids with advice | 2022-05-10 | Paper |
| On the advice complexity of the online dominating set problem | 2021-03-09 | Paper |
| Call admission problems on trees with advice (extended abstract) | 2020-02-25 | Paper |
| Exploring sparse graphs with advice (extended abstract) | 2019-01-15 | Paper |
| Call admission problems on grids with advice (extended abstract) | 2019-01-15 | Paper |
| Online Minimum Spanning Tree with Advice | 2018-07-24 | Paper |
| On the advice complexity of the \(k\)-server problem | 2017-05-26 | Paper |
| Online algorithms with advice: the tape model | 2017-05-18 | Paper |
| Approximation algorithms for the TSP with sharpened triangle inequality | 2016-06-16 | Paper |
| Online Minimum Spanning Tree with Advice | 2016-03-10 | Paper |
| On Energy-Efficient Computations With Advice | 2015-10-29 | Paper |
| A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey | 2015-09-08 | Paper |
| Improved approximations for ordered TSP on near-metric graphs | 2015-04-28 | Paper |
| Online coloring of bipartite graphs with and without advice | 2015-01-19 | Paper |
| On the Power of Advice and Randomization for the Disjoint Path Allocation Problem | 2015-01-13 | Paper |
| Improved Approximations for Ordered TSP on Near-Metric Graphs, | 2014-11-04 | Paper |
| On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles | 2014-10-06 | Paper |
| The string guessing problem as a method to prove lower bounds on the advice complexity | 2014-10-06 | Paper |
| Improved approximations for TSP with simple precedence constraints | 2014-08-13 | Paper |
| The online knapsack problem: advice and randomization | 2014-03-13 | Paper |
| On the Approximability of Splitting-SAT in 2-CNF Horn Formulas | 2014-01-17 | Paper |
| On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles | 2013-06-11 | Paper |
| The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity | 2013-06-11 | Paper |
| On the Power of Randomness versus Advice in Online Computation | 2012-11-01 | Paper |
| Online Coloring of Bipartite Graphs with and without Advice | 2012-09-25 | Paper |
| On the Advice Complexity of the Knapsack Problem | 2012-06-29 | Paper |
| Steiner tree reoptimization in graphs with sharpened triangle inequality | 2012-05-11 | Paper |
| On the Hardness of Reoptimization with Multiple Given Solutions | 2011-11-22 | Paper |
| Reoptimization of the shortest common superstring problem | 2011-09-20 | Paper |
| On the Advice Complexity of the k-Server Problem | 2011-07-06 | Paper |
| Knowing All Optimal Solutions Does Not Help for TSP Reoptimization | 2011-06-24 | Paper |
| Improved Approximations for Hard Optimization Problems via Problem Instance Classification | 2011-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3079180 | 2011-03-01 | Paper |
| The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification | 2010-12-01 | Paper |
| The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality | 2010-05-28 | Paper |
| Improved Approximations for TSP with Simple Precedence Constraints | 2010-05-28 | Paper |
| Reoptimization of the metric deadline TSP | 2010-02-26 | Paper |
| On the Advice Complexity of Online Problems | 2009-12-17 | Paper |
| Reoptimization of Steiner trees: changing the terminal set | 2009-08-21 | Paper |
| Reoptimization of the Shortest Common Superstring Problem | 2009-07-07 | Paper |
| Approximation hardness of deadline-TSP reoptimization | 2009-05-28 | Paper |
| On \(k\)-connectivity problems with sharpened triangle inequality | 2009-02-23 | Paper |
| Reoptimization of the Metric Deadline TSP | 2009-02-03 | Paper |
| A weighted HP model for protein folding with diagonal contacts | 2008-07-21 | Paper |
| Reoptimization of Steiner Trees | 2008-07-15 | Paper |
| On the Hardness of Reoptimization | 2008-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5446938 | 2008-03-06 | Paper |
| The parameterized approximability of TSP with deadlines | 2007-12-19 | Paper |
| Efficient Algorithms for the Spoonerism Problem | 2007-11-15 | Paper |
| On the Approximation Hardness of Some Generalizations of TSP | 2007-09-07 | Paper |
| Algorithmic aspects of bioinformatics. Translated from the German original | 2007-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3445961 | 2007-06-08 | Paper |
| Protein folding in the HP model on grid lattices with diagonals | 2007-02-19 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501548 | 2004-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437508 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429298 | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415244 | 2003-07-28 | Paper |
| Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. | 2002-08-05 | Paper |
| Improved Lower Bounds on the Approximability of the Traveling Salesman Problem | 2001-10-30 | Paper |
| Communication in the two-way listen-in vertex-disjoint paths mode | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503938 | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232776 | 1999-03-15 | Paper |
