| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5091004 | 2022-07-21 | Paper |
| Optimal coteries for rings and related networks | 2020-11-30 | Paper |
| Linear-time fitting of a \(k\)-step function | 2020-05-18 | Paper |
| Minsum \(k\)-sink problem on path networks | 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 | 2018-08-03 | Paper |
| Optimizing squares covering a set of points | 2018-05-17 | Paper |
| The $p$-Center Problem in Tree Networks Revisited | 2017-10-17 | Paper |
| Improved algorithms for computing \(k\)-sink on dynamic flow path networks | 2017-09-22 | Paper |
| Geometric p-Center Problems with Centers Constrained to Two Lines | 2017-02-01 | Paper |
| Minimax regret 1-median problem in dynamic path networks | 2016-09-29 | Paper |
| An alternative proof for the equivalence of searcher and 2-searcher | 2016-05-18 | Paper |
| Linear-Time Fitting of a k-Step Function | 2016-03-23 | Paper |
| Improved algorithms for computing minmax regret sinks on dynamic path and tree networks | 2015-12-11 | Paper |
| Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks | 2015-09-21 | Paper |
| Optimizing Squares Covering a Set of Points | 2015-09-11 | Paper |
| Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network | 2015-09-11 | Paper |
| A linear time algorithm for computing minmax regret 1-median on a tree network | 2015-01-19 | Paper |
| Back-Up 2-Center on a Path/Tree/Cycle/Unicycle | 2014-09-26 | Paper |
| Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles | 2014-03-31 | Paper |
| Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights | 2013-03-21 | Paper |
| A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree | 2012-09-25 | Paper |
| Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand | 2012-01-06 | Paper |
| FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE | 2010-05-28 | Paper |
| Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight | 2010-04-27 | Paper |
| Generating asymptotically optimal broadcasting schedules to minimize average waiting time | 2009-12-15 | Paper |
| A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable | 2008-05-27 | Paper |
| Generalized Fibonacci broadcasting: an efficient VOD scheme with user bandwidth limit | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Bushiness and a tight worst-case upper bound on the search number of a simple polygon. | 2006-01-17 | Paper |
| ModelingK-coteries by well-covered graphs | 2002-01-27 | Paper |
| Deadlock-Free Systems for a Bounded Number of Processes | 1982-01-01 | Paper |
| On Minimal Test Sets for Locating Single Link Failures in Networks | 1981-01-01 | Paper |
| A diagnosing algorithm for networks | 1975-01-01 | Paper |
| An Approach to the Diagnosability Analysis of a System | 1975-01-01 | Paper |
| On the State Minimization of Nondeterministic Finite Automata | 1970-01-01 | Paper |
