| Publication | Date of Publication | Type |
|---|
Finding geometric facilities with location privacy
Algorithmica | 2023-12-13 | Paper |
Constrained square-center problems
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Geometric applications of posets
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Finding bounded diameter minimum spanning tree in general graphs
Computers & Operations Research | 2022-06-22 | Paper |
On piercing sets of axis-parallel rectangles and rings
| 2021-12-20 | Paper |
Covering users by a connected swarm efficiently
| 2021-07-08 | Paper |
Improved solution to data gathering with mobile mule
Algorithmica | 2020-10-21 | Paper |
Sensor network topology design and analysis for efficient data gathering by a mobile mule
Algorithmica | 2020-10-12 | Paper |
scientific article; zbMATH DE number 7121835 (Why is no real title available?)
| 2019-10-24 | Paper |
Explicit communication among stigmergic robots
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Locating battery charging stations to facilitate almost shortest paths
Discrete Applied Mathematics | 2019-02-08 | Paper |
Covering a set of points by two axis-parallel boxes
Information Processing Letters | 2016-06-16 | Paper |
Enumerating longest increasing subsequences and patience sorting
Information Processing Letters | 2016-06-16 | Paper |
Enclosing \(k\) points in the smallest axis parallel rectangle
Information Processing Letters | 2016-06-09 | Paper |
Message and time efficient multi-broadcast schemes
Theoretical Computer Science | 2015-01-28 | Paper |
On bounded leg shortest paths problems
| 2014-12-18 | Paper |
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Best effort and priority queuing policies for buffered crossbar switches
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Scheduling problems in transportation networks of line topology
Optimization Letters | 2014-04-30 | Paper |
The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
Discrete & Computational Geometry | 2014-03-25 | Paper |
The Euclidean bottleneck Steiner path problem
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Improved algorithms for placing undesirable facilities
Computers & Operations Research | 2013-03-25 | Paper |
Space and speed tradeoffs in TCAM hierarchical packet classification
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Centdian computation in cactus graphs
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science | 2012-10-11 | Paper |
Improved competitive performance bounds for CIOQ switches
Algorithmica | 2012-04-26 | Paper |
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
Distributed Computing | 2012-02-06 | Paper |
On bounded leg shortest paths problems
Algorithmica | 2011-03-30 | Paper |
Centdian Computation for Sensor Networks
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Real-time data gathering in sensor networks
Discrete Applied Mathematics | 2010-05-05 | Paper |
Fast algorithm for multicast and data gathering in wireless networks
Information Processing Letters | 2010-04-19 | Paper |
Maximizing the number of obnoxious facilities to locate within a bounded region
Computers & Operations Research | 2009-10-16 | Paper |
Low complexity algorithms for optimal consumer push-pull partial covering in the plane
European Journal of Operational Research | 2009-04-30 | Paper |
Improved Competitive Performance Bounds for CIOQ Switches
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Computing closest and farthest points for a query segment
Theoretical Computer Science | 2008-04-15 | Paper |
Selecting distances in arrangements of hyperplanes spanned by points.
Journal of Discrete Algorithms | 2007-04-25 | Paper |
scientific article; zbMATH DE number 2185621 (Why is no real title available?)
| 2005-07-04 | Paper |
scientific article; zbMATH DE number 2185624 (Why is no real title available?)
| 2005-07-04 | Paper |
Geographic quorum system approximations
Algorithmica | 2005-04-29 | Paper |
scientific article; zbMATH DE number 2149349 (Why is no real title available?)
| 2005-03-30 | Paper |
scientific article; zbMATH DE number 2111731 (Why is no real title available?)
| 2004-10-28 | Paper |
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
Algorithmica | 2004-09-22 | Paper |
Planar maximum box problem
JMMA. Journal of Mathematical Modelling and Algorithms | 2004-08-20 | Paper |
scientific article; zbMATH DE number 2080276 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2038782 (Why is no real title available?)
| 2004-02-08 | Paper |
Maintenance of a piercing set for intervals with applications
Algorithmica | 2003-08-19 | Paper |
Lower bounds for covering problems
JMMA. Journal of Mathematical Modelling and Algorithms | 2003-04-27 | Paper |
Efficient algorithms for centers and medians in interval and circular-arc graphs
Networks | 2002-07-01 | Paper |
Fast algorithms for approximating distances
Algorithmica | 2002-06-17 | Paper |
OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
International Journal of Computational Geometry & Applications | 2002-06-02 | Paper |
scientific article; zbMATH DE number 1728311 (Why is no real title available?)
| 2002-04-15 | Paper |
scientific article; zbMATH DE number 1670650 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1588326 (Why is no real title available?)
IJMA. International Journal of Mathematical Algorithms | 2001-08-26 | Paper |
Obnoxious facility location: complete service with minimal harm
International Journal of Computational Geometry & Applications | 2001-04-17 | Paper |
Discrete rectilinear 2-center problems
Computational Geometry | 2000-05-08 | Paper |
ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS
International Journal of Computational Geometry & Applications | 2000-05-07 | Paper |
Geometric applications of posets
Computational Geometry | 1999-02-02 | Paper |
