| Publication | Date of Publication | Type |
|---|
| Locating evacuation centers optimally in path and cycle networks | 2024-08-13 | Paper |
| An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks | 2022-07-21 | Paper |
Optimal coteries for rings and related networks
Distributed Computing | 2020-11-30 | Paper |
Linear-time fitting of a \(k\)-step function
Discrete Applied Mathematics | 2020-05-18 | 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 |
| 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 |
Optimizing squares covering a set of points
Theoretical Computer Science | 2018-05-17 | Paper |
The \(p\)-center problem in tree networks revisited
(available as arXiv preprint) | 2017-10-17 | Paper |
Improved algorithms for computing \(k\)-sink on dynamic flow path networks
(available as arXiv preprint) | 2017-09-22 | 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 alternative proof for the equivalence of searcher and 2-searcher
Theoretical Computer Science | 2016-05-18 | Paper |
Linear-time fitting of a \(k\)-step function
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
Theoretical Computer Science | 2015-12-11 | Paper |
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
Discrete Applied Mathematics | 2015-09-21 | Paper |
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Optimizing squares covering a set of points
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
A linear time algorithm for computing minmax regret 1-median on a tree network
Algorithmica | 2015-01-19 | Paper |
Back-up 2-center on a path/tree/cycle/unicycle
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Computing minmax regret 1-median on a tree network with positive/negative vertex weights
Algorithms and Computation | 2013-03-21 | Paper |
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand
Theoretical Aspects of Computing – ICTAC 2011 | 2012-01-06 | Paper |
Finding all door locations that make a room searchable
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
Finding the minimum-distance schedule for a boundary searcher with a flashlight
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Generating asymptotically optimal broadcasting schedules to minimize average waiting time
Discrete Mathematics | 2009-12-15 | Paper |
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Generalized Fibonacci broadcasting: an efficient VOD scheme with user bandwidth limit
Discrete Applied Mathematics | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
Information Processing Letters | 2006-01-17 | Paper |
Searching for mobile intruders in a polygonal region by a group of mobile searchers
Algorithmica | 2002-03-04 | Paper |
Modeling \(k\)-coteries by well-covered graphs
Networks | 2002-01-27 | Paper |
Deadlock-Free Systems for a Bounded Number of Processes
IEEE Transactions on Computers | 1982-01-01 | Paper |
On Minimal Test Sets for Locating Single Link Failures in Networks
IEEE Transactions on Computers | 1981-01-01 | Paper |
An Approach to the Diagnosability Analysis of a System
IEEE Transactions on Computers | 1975-01-01 | Paper |
A diagnosing algorithm for networks
Information and Control | 1975-01-01 | Paper |
On the State Minimization of Nondeterministic Finite Automata
IEEE Transactions on Computers | 1970-01-01 | Paper |
