| Publication | Date of Publication | Type |
|---|
Online interval selection on a simple chain
Theoretical Computer Science | 2026-09-29 | Paper |
| Online drone coverage of targets on a line | 2026-09-29 | Paper |
On the online weighted non-crossing matching problem
Information and Computation | 2026-06-11 | Paper |
Online Interval Selection on a Simple Chain
(available as arXiv preprint) | 2026-01-01 | Paper |
Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections
Procedia Computer Science | 2025-12-11 | Paper |
| On the online weighted non-crossing matching problem | 2025-12-02 | Paper |
| Random ( n)-CNFs are hard for cutting planes | 2025-08-06 | Paper |
| Temporal separators with deadlines | 2025-07-24 | Paper |
Renting servers in the cloud: the case of equal duration jobs
Discrete Applied Mathematics | 2025-01-06 | Paper |
Exploration of High-Dimensional Grids by Finite State Machines
Algorithmica | 2024-04-24 | Paper |
scientific article; zbMATH DE number 7788630 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Advice complexity of adaptive priority algorithms
Theoretical Computer Science | 2024-01-02 | Paper |
Online Domination: The Value of Getting to Know All Your Neighbors.
(available as arXiv preprint) | 2023-08-08 | Paper |
An Experimental Study of Algorithms for Online Bipartite Matching
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes
Journal of the ACM | 2023-04-27 | Paper |
Advice complexity of online non-crossing matching
Computational Geometry | 2023-01-09 | Paper |
Exploration of High-Dimensional Grids by Finite Automata
(available as arXiv preprint) | 2022-07-21 | Paper |
Online coloring and a new type of adversary for online graph problems
Algorithmica | 2022-05-03 | Paper |
Graph exploration by energy-sharing mobile agents
(available as arXiv preprint) | 2022-03-22 | Paper |
Online coloring and a new type of adversary for online graph problems
Approximation and Online Algorithms | 2022-03-22 | Paper |
The bike sharing problem
(available as arXiv preprint) | 2021-10-04 | Paper |
Greedy bipartite matching in random type Poisson arrival model
(available as arXiv preprint) | 2021-08-04 | Paper |
Stabbing planes
(available as arXiv preprint) | 2021-06-15 | Paper |
Advice complexity of priority algorithms
Theory of Computing Systems | 2020-06-02 | Paper |
On conceptually simple algorithms for variants of online bipartite matching
Theory of Computing Systems | 2019-12-19 | Paper |
A simple PTAS for the dual bin packing problem and advice complexity of its online version
(available as arXiv preprint) | 2019-10-25 | Paper |
Advice complexity of priority algorithms
Lecture Notes in Computer Science | 2019-01-15 | Paper |
On conceptually simple algorithms for variants of online bipartite matching
Lecture Notes in Computer Science | 2018-06-22 | Paper |
Information lower bounds via self-reducibility
Theory of Computing Systems | 2017-01-18 | Paper |
From information to exact communication
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Information Lower Bounds via Self-reducibility
Computer Science – Theory and Applications | 2013-06-14 | Paper |
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
