| Publication | Date of Publication | Type |
|---|
| Improving the bounds of the online dynamic power management problem | 2024-09-11 | Paper |
Polynomial-time combinatorial algorithm for general max-min fair allocation
Algorithmica | 2024-01-25 | Paper |
Online Predictions for Online TSP on the Line
International Journal of Foundations of Computer Science | 2023-11-16 | Paper |
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries
International Journal of Computational Geometry & Applications | 2023-07-21 | Paper |
| General max-min fair allocation | 2023-03-30 | Paper |
Tight competitive analyses of online car-sharing problems
Theoretical Computer Science | 2022-10-24 | Paper |
Approximating dynamic weighted vertex cover with soft capacities
Algorithmica | 2022-02-01 | Paper |
An \(o(1)\)-approximation algorithm for dynamic weighted vertex cover with soft capacity
(available as arXiv preprint) | 2021-08-04 | Paper |
Approximating the Canadian traveller problem with online randomization
Algorithmica | 2021-04-19 | Paper |
Online buffer management for transmitting packets with processing cycles
Theoretical Computer Science | 2018-04-04 | Paper |
Hybrid search for the optimal PMU placement problem on a power grid
European Journal of Operational Research | 2016-10-06 | Paper |
Approximation algorithms on consistent dynamic map labeling
Theoretical Computer Science | 2016-07-05 | Paper |
Power domination with bounded time constraints
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Generalized Canadian traveller problems
Journal of Combinatorial Optimization | 2015-05-11 | Paper |
Approximation Algorithms on Consistent Dynamic Map Labeling
Frontiers in Algorithmics | 2014-09-02 | Paper |
New lower bounds for the three-dimensional orthogonal bin packing problem
European Journal of Operational Research | 2014-07-27 | Paper |
Canadians should travel randomly
Automata, Languages, and Programming | 2014-07-01 | Paper |
The covering Canadian traveller problem
Theoretical Computer Science | 2014-03-27 | Paper |
Approximating the spanning \(k\)-tree forest problem
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
The Canadian traveller problem revisited
Algorithms and Computation | 2013-03-21 | Paper |
Power domination in circular-arc graphs
Algorithmica | 2013-03-05 | Paper |
Capacitated domination problem
Algorithmica | 2011-05-10 | Paper |
Approximating the Spanning k-Tree Forest Problem
Frontiers in Algorithmics | 2009-07-14 | Paper |
\(k\)-tuple domination in graphs
Information Processing Letters | 2009-04-28 | Paper |
Maximizing the Number of Independent Labels in the Plane
Frontiers in Algorithmics | 2009-03-10 | Paper |
Capacitated Domination Problem
Algorithms and Computation | 2008-05-27 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
LABELING POINTS ON A SINGLE LINE
International Journal of Computational Geometry & Applications | 2005-10-18 | Paper |
Algorithmic aspect of \(k\)-tuple domination in graphs.
Taiwanese Journal of Mathematics | 2002-01-01 | Paper |
