| Publication | Date of Publication | Type |
|---|
Constructing red-black spanners for mixed-charging vehicular networks
Theoretical Computer Science | 2024-12-12 | Paper |
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
Sink location problems in dynamic flow grid networks
Theoretical Computer Science | 2024-11-06 | Paper |
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
Journal of Combinatorial Optimization | 2024-10-21 | Paper |
A note on the 2-colored rectilinear crossing number of random point sets in the unit square
Acta Mathematica Hungarica | 2024-09-19 | Paper |
| Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges | 2024-09-16 | Paper |
| The line-constrained maximum coverage facility location problem | 2024-09-16 | Paper |
| Sink location problems in dynamic flow grid networks | 2024-08-22 | Paper |
| Red-black spanners for mixed-charging vehicular networks | 2024-08-22 | Paper |
| Locating evacuation centers optimally in path and cycle networks | 2024-08-13 | Paper |
| On computing a center persistence diagram | 2024-05-29 | Paper |
| A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square | 2023-12-04 | Paper |
| Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs | 2023-03-30 | Paper |
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
Combinatorial Optimization and Applications | 2023-03-21 | Paper |
| An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks | 2022-07-21 | Paper |
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
(available as arXiv preprint) | 2021-10-04 | Paper |
Minimum point-overlap labelling*
Optimization Methods & Software | 2021-07-06 | Paper |
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
Theoretical Computer Science | 2021-06-22 | Paper |
Minsum \(k\)-sink problem on path networks
Theoretical Computer Science | 2020-01-16 | Paper |
| Minmax-regret evacuation planning for cycle networks | 2019-10-15 | Paper |
The mixed evacuation problem
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
| Minsum \(k\)-sink problem on dynamic flow path networks | 2018-09-06 | Paper |
Minimax regret 1-median problem in dynamic path networks
Theory of Computing Systems | 2018-08-03 | Paper |
Improved algorithms for computing \(k\)-sink on dynamic flow path networks
(available as arXiv preprint) | 2017-09-22 | Paper |
Minimum point-overlap labeling
Lecture Notes in Computer Science | 2017-07-21 | Paper |
The mixed evacuation problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Geometric \(p\)-center problems with centers constrained to two lines
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Minimax regret 1-median problem in dynamic path networks
Lecture Notes in Computer Science | 2016-09-29 | Paper |
An inductive construction of minimally rigid body-hinge simple graphs
Theoretical Computer Science | 2016-06-27 | Paper |
Optimally bracing grid frameworks with holes
Theoretical Computer Science | 2015-12-11 | Paper |
Multiple sink location problems in dynamic path networks
Theoretical Computer Science | 2015-12-08 | Paper |
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
Information Processing Letters | 2015-12-01 | Paper |
Optimally bracing grid frameworks with holes
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Minimax regret 1-sink location problem in dynamic path networks
Theoretical Computer Science | 2015-06-11 | Paper |
Multiple sink location problems in dynamic path networks
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Minimax regret sink location problem in dynamic tree networks with uniform capacity
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Online graph exploration algorithms for cycles and trees by multiple searchers
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
Algorithms and Computation | 2014-02-18 | Paper |
An inductive construction of minimally rigid body-hinge simple graphs
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Minimax regret 1-sink location problems in dynamic path networks
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Online exploration of all vertices in a simple polygon
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
