| Publication | Date of Publication | Type |
|---|
| Finding geometric facilities with location privacy | 2023-12-13 | Paper |
| Constrained square-center problems | 2022-12-09 | Paper |
| Geometric Applications of Posets | 2022-08-19 | Paper |
| Finding bounded diameter minimum spanning tree in general graphs | 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 | 2020-10-21 | Paper |
| Sensor network topology design and analysis for efficient data gathering by a mobile mule | 2020-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240127 | 2019-10-24 | Paper |
| Explicit Communication Among Stigmergic Robots | 2019-06-24 | Paper |
| Locating battery charging stations to facilitate almost shortest paths | 2019-02-08 | Paper |
| Covering a set of points by two axis-parallel boxes | 2016-06-16 | Paper |
| Enumerating longest increasing subsequences and patience sorting | 2016-06-16 | Paper |
| Enclosing \(k\) points in the smallest axis parallel rectangle | 2016-06-09 | Paper |
| Message and time efficient multi-broadcast schemes | 2015-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934664 | 2014-12-18 | Paper |
| Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing | 2014-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414600 | 2014-05-06 | Paper |
| Scheduling problems in transportation networks of line topology | 2014-04-30 | Paper |
| The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition | 2014-03-25 | Paper |
| The euclidean bottleneck steiner path problem | 2014-03-24 | Paper |
| Improved algorithms for placing undesirable facilities | 2013-03-25 | Paper |
| Space and speed tradeoffs in TCAM hierarchical packet classification | 2013-02-21 | Paper |
| Centdian Computation in Cactus Graphs | 2012-12-04 | Paper |
| Improved approximation algorithms for maximum lifetime problems in wireless networks | 2012-10-11 | Paper |
| Improved competitive performance bounds for CIOQ switches | 2012-04-26 | Paper |
| Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing | 2012-02-06 | Paper |
| On bounded leg shortest paths problems | 2011-03-30 | Paper |
| Centdian Computation for Sensor Networks | 2010-06-17 | Paper |
| Real-time data gathering in sensor networks | 2010-05-05 | Paper |
| Fast algorithm for multicast and data gathering in wireless networks | 2010-04-19 | Paper |
| Maximizing the number of obnoxious facilities to locate within a bounded region | 2009-10-16 | Paper |
| Low complexity algorithms for optimal consumer push-pull partial covering in the plane | 2009-04-30 | Paper |
| Improved Competitive Performance Bounds for CIOQ Switches | 2008-11-25 | Paper |
| Best Effort and Priority Queuing Policies for Buffered Crossbar Switches | 2008-07-10 | Paper |
| Computing closest and farthest points for a query segment | 2008-04-15 | Paper |
| Selecting distances in arrangements of hyperplanes spanned by points. | 2007-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024786 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024790 | 2005-07-04 | Paper |
| Geographic quorum system approximations | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4661876 | 2005-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825540 | 2004-10-28 | Paper |
| Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree | 2004-09-22 | Paper |
| Planar maximum box problem | 2004-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472527 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449249 | 2004-02-08 | Paper |
| Maintenance of a piercing set for intervals with applications | 2003-08-19 | Paper |
| Lower bounds for covering problems | 2003-04-27 | Paper |
| Efficient algorithms for centers and medians in interval and circular-arc graphs | 2002-07-01 | Paper |
| Fast algorithms for approximating distances | 2002-06-17 | Paper |
| OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS | 2002-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779372 | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753927 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708487 | 2001-08-26 | Paper |
| Obnoxious facility location: complete service with minimal harm | 2001-04-17 | Paper |
| Discrete rectilinear 2-center problems | 2000-05-08 | Paper |
| ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS | 2000-05-07 | Paper |
| Geometric applications of posets | 1999-02-02 | Paper |
