| Publication | Date of Publication | Type |
|---|
| Rényi-Ulam games and online computation with imperfect advice | 2024-12-03 | Paper |
| Cops and robbers on 1-planar graphs | 2024-10-14 | Paper |
| Reconfiguration of multisets with applications to bin packing | 2024-07-19 | Paper |
Online computation with untrusted advice
Journal of Computer and System Sciences | 2024-07-01 | Paper |
| Lossless image compression using list update algorithms | 2024-04-19 | Paper |
Improved pyrotechnics: closer to the burning number conjecture
The Electronic Journal of Combinatorics | 2024-02-16 | Paper |
Online interval scheduling with predictions
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Contract scheduling with predictions
The Journal of Artificial Intelligence Research (JAIR) | 2023-10-23 | Paper |
| Cops and Robbers on 1-Planar Graphs | 2023-09-02 | Paper |
| Cutting stock with rotation: packing square items into square bins | 2023-03-21 | Paper |
scientific article; zbMATH DE number 7650400 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Compact representation of graphs with bounded bandwidth or treedepth
Information and Computation | 2022-06-08 | Paper |
| An improved bound on the burning number of graphs | 2021-10-03 | Paper |
Online bin covering with advice
Algorithmica | 2021-04-08 | Paper |
Randomized two-valued bounded delay online buffer management
Operations Research Letters | 2021-04-07 | Paper |
Burning two worlds
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Online bin covering with advice
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Approximation algorithms for graph burning
(available as arXiv preprint) | 2019-10-15 | Paper |
Online bin packing with advice of small size
Theory of Computing Systems | 2019-09-05 | Paper |
| Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs | 2019-09-01 | Paper |
Approximation Algorithms for Graph Burning
(available as arXiv preprint) | 2018-11-11 | Paper |
Compact representation of graphs of small clique-width
Algorithmica | 2018-07-25 | Paper |
On the list update problem with advice
Information and Computation | 2017-03-16 | Paper |
Efficient broadcast trees for weighted vertices
Discrete Applied Mathematics | 2017-03-15 | Paper |
| Online bin packing with advice | 2017-03-03 | Paper |
On the advice complexity of the \(k\)-server problem under sparse metrics
Theory of Computing Systems | 2017-01-12 | Paper |
Online bin packing with advice
Algorithmica | 2016-03-23 | Paper |
Online bin packing with advice
Algorithmica | 2016-03-23 | Paper |
All-Around Near-Optimal Solutions for the Online Bin Packing Problem
Algorithms and Computation | 2016-01-11 | Paper |
Online bin packing with advice of small size
Lecture Notes in Computer Science | 2015-10-30 | Paper |
On minimum- and maximum-weight minimum spanning trees with neighborhoods
Theory of Computing Systems | 2015-05-12 | Paper |
Efficient Online Strategies for Renting Servers in the Cloud
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Compact navigation and distance oracles for graphs with small treewidth
Algorithmica | 2014-11-19 | Paper |
On the list update problem with advice
Lecture Notes in Computer Science | 2014-03-31 | Paper |
On advice complexity of the \(k\)-server problem under sparse metrics
Structural Information and Communication Complexity | 2013-12-17 | Paper |
A Survey of Algorithms and Models for List Update
Lecture Notes in Computer Science | 2013-09-13 | Paper |
On minimum-and maximum-weight minimum spanning trees with neighborhoods
Approximation and Online Algorithms | 2013-09-13 | Paper |
Broadcasting in conflict-aware multi-channel networks
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Compact navigation and distance oracles for graphs with small treewidth
Automata, Languages and Programming | 2011-07-06 | Paper |
Optimum broadcasting in complete weighted-vertex graphs
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
