| Publication | Date of Publication | Type |
|---|
Priority algorithms with advice for disjoint path allocation problems
Theoretical Computer Science | 2024-11-18 | Paper |
Zero-memory graph exploration with unknown inports
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Online knapsack with removal and recourse
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Fully Online Matching with Advice on General Bipartite Graphs and Paths
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Exploring sparse graphs with advice
Information and Computation | 2022-12-08 | Paper |
Reoptimization of parameterized problems
Acta Informatica | 2022-08-30 | Paper |
Call admission problems on trees
Theoretical Computer Science | 2022-06-13 | Paper |
Call admission problems on grids with advice
Theoretical Computer Science | 2022-05-10 | Paper |
On the advice complexity of the online dominating set problem
Theoretical Computer Science | 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
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
On the advice complexity of the \(k\)-server problem
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Online algorithms with advice: the tape model
Information and Computation | 2017-05-18 | Paper |
Approximation algorithms for the TSP with sharpened triangle inequality
Information Processing Letters | 2016-06-16 | Paper |
Online minimum spanning tree with advice (extended abstract)
Lecture Notes in Computer Science | 2016-03-10 | Paper |
On energy-efficient computations with advice
Lecture Notes in Computer Science | 2015-10-29 | Paper |
A technique to obtain hardness results for randomized online algorithms -- a survey
Computing with New Resources | 2015-09-08 | Paper |
Improved approximations for ordered TSP on near-metric graphs
RAIRO - Theoretical Informatics and Applications | 2015-04-28 | Paper |
Online coloring of bipartite graphs with and without advice
Algorithmica | 2015-01-19 | Paper |
On the power of advice and randomization for the disjoint path allocation problem
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Improved approximations for ordered TSP on near-metric graphs (extended abstract)
Lecture Notes in Computer Science | 2014-11-04 | Paper |
On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
Theoretical Computer Science | 2014-10-06 | Paper |
The string guessing problem as a method to prove lower bounds on the advice complexity
Theoretical Computer Science | 2014-10-06 | Paper |
Improved approximations for TSP with simple precedence constraints
Journal of Discrete Algorithms | 2014-08-13 | Paper |
The online knapsack problem: advice and randomization
Theoretical Computer Science | 2014-03-13 | Paper |
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas
Lecture Notes in Computer Science | 2014-01-17 | Paper |
On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
Lecture Notes in Computer Science | 2013-06-11 | Paper |
The string guessing problem as a method to prove lower bounds on the advice complexity (extended abstract)
Lecture Notes in Computer Science | 2013-06-11 | Paper |
On the power of randomness versus advice in online computation
Lecture Notes in Computer Science | 2012-11-01 | Paper |
Online coloring of bipartite graphs with and without advice
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On the advice complexity of the knapsack problem
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Steiner tree reoptimization in graphs with sharpened triangle inequality
Journal of Discrete Algorithms | 2012-05-11 | Paper |
On the Hardness of Reoptimization with Multiple Given Solutions
Fundamenta Informaticae | 2011-11-22 | Paper |
Reoptimization of the shortest common superstring problem
Algorithmica | 2011-09-20 | Paper |
On the advice complexity of the \(k\)-server problem
Automata, Languages and Programming | 2011-07-06 | Paper |
Knowing all optimal solutions does not help for TSP reoptimization
Computation, Cooperation, and Life | 2011-06-24 | Paper |
Improved approximations for hard optimization problems via problem instance classification
Lecture Notes in Computer Science | 2011-05-27 | Paper |
| scientific article; zbMATH DE number 5859273 (Why is no real title available?) | 2011-03-01 | Paper |
The uniform minimum-ones 2SAT problem and its application to haplotype classification
RAIRO - Theoretical Informatics and Applications | 2010-12-01 | Paper |
The uniform minimum-ones 2SAT problem and its application to haplotype classification
RAIRO - Theoretical Informatics and Applications | 2010-12-01 | Paper |
The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract)
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Improved approximations for TSP with simple precedence constraints (extended abstract)
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Reoptimization of the metric deadline TSP
Journal of Discrete Algorithms | 2010-02-26 | Paper |
On the Advice Complexity of Online Problems
Algorithms and Computation | 2009-12-17 | Paper |
Reoptimization of Steiner trees: changing the terminal set
Theoretical Computer Science | 2009-08-21 | Paper |
Reoptimization of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Approximation hardness of deadline-TSP reoptimization
Theoretical Computer Science | 2009-05-28 | Paper |
On \(k\)-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms | 2009-02-23 | Paper |
Reoptimization of the Metric Deadline TSP
Lecture Notes in Computer Science | 2009-02-03 | Paper |
A weighted HP model for protein folding with diagonal contacts
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
A weighted HP model for protein folding with diagonal contacts
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
A weighted HP model for protein folding with diagonal contacts
RAIRO - Theoretical Informatics and Applications | 2008-07-21 | Paper |
Reoptimization of Steiner Trees
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
On the Hardness of Reoptimization
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
| Stability of approximation algorithms or parameterization of the approximation ratio | 2008-03-06 | Paper |
The parameterized approximability of TSP with deadlines
Theory of Computing Systems | 2007-12-19 | Paper |
Efficient Algorithms for the Spoonerism Problem
Lecture Notes in Computer Science | 2007-11-15 | Paper |
On the Approximation Hardness of Some Generalizations of TSP
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Algorithmic aspects of bioinformatics. Translated from the German original
Natural Computing Series | 2007-06-08 | Paper |
| scientific article; zbMATH DE number 5162719 (Why is no real title available?) | 2007-06-08 | Paper |
Protein folding in the HP model on grid lattices with diagonals
Discrete Applied Mathematics | 2007-02-19 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 1500530 (Why is no real title available?) | 2004-01-27 | Paper |
| scientific article; zbMATH DE number 2011856 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 1985614 (Why is no real title available?) | 2003-09-25 | Paper |
| scientific article; zbMATH DE number 1954373 (Why is no real title available?) | 2003-07-28 | Paper |
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theoretical Computer Science | 2002-08-05 | Paper |
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
RAIRO - Theoretical Informatics and Applications | 2001-10-30 | Paper |
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
RAIRO - Theoretical Informatics and Applications | 2001-10-30 | Paper |
Communication in the two-way listen-in vertex-disjoint paths mode
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1507218 (Why is no real title available?) | 2001-05-28 | Paper |
| scientific article; zbMATH DE number 1262786 (Why is no real title available?) | 1999-03-15 | Paper |
