| Publication | Date of Publication | Type |
|---|
| A 23 log 3-competitive algorithm for the counterfeit coin problem | 2023-12-12 | Paper |
| Gaussian downlink user selection subject to access limit, power budget, and rate demands | 2022-09-01 | Paper |
| Asymptotic Critical Transmission Radius for $k$-Connectivity in Wireless Ad Hoc Networks | 2017-07-27 | Paper |
| Connected dominating set. Theory and applications | 2012-07-30 | Paper |
| Tighter approximation bounds for minimum CDS in unit disk graphs | 2011-12-14 | Paper |
| New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs | 2011-01-28 | Paper |
| Approximations for node-weighted Steiner tree in unit disk graphs | 2010-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579442 | 2010-08-06 | Paper |
| ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS | 2010-05-19 | Paper |
| Greedy approximations for minimum submodular cover with submodular cost | 2010-03-19 | Paper |
| Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks | 2010-03-01 | Paper |
| Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks | 2010-02-26 | Paper |
| Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks | 2009-12-17 | Paper |
| A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs | 2009-07-07 | Paper |
| ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS | 2009-06-23 | Paper |
| On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs | 2009-05-04 | Paper |
| Construction of strongly connected dominating sets in asymmetric multihop wireless networks | 2009-03-17 | Paper |
| Algorithms for Minimum m-Connected k-Dominating Set Problem | 2009-03-03 | Paper |
| Coverage by randomly deployed wireless sensor networks | 2008-12-21 | Paper |
| OVSF-CDMA code assignment in wireless ad hoc networks | 2008-02-18 | Paper |
| On ring grooming in optical networks | 2007-10-12 | Paper |
| Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem | 2007-09-03 | Paper |
| Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks | 2006-10-10 | Paper |
| On optimal placement of relay nodes for reliable connectivity in wireless sensor networks | 2006-08-14 | Paper |
| SEPARATING POINTS BY AXIS-PARALLEL LINES | 2006-03-13 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS | 2005-10-19 | Paper |
| A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS | 2005-10-19 | Paper |
| Power assignment for \(k\)-connectivity in wireless ad hoc networks | 2005-06-08 | Paper |
| Traffic partition in WDM/SONET rings to minimize SONET ADMs | 2003-06-09 | Paper |
| Minimum-energy broadcasting in static ad hoc wireless networks | 2003-02-19 | Paper |
| A Radio Coloring of a Hypercube | 2002-12-11 | Paper |
| On the design, development, deployment, and network survivability analysis of the dynamic routing system protocol | 2002-08-20 | Paper |
| Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs | 2002-07-15 | Paper |
| Optimal routing based on super topology in optical parallel interconnect | 2002-01-27 | Paper |
| Minimizing drop cost for SONET/WDM networks with ? wavelength requirements | 2001-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2716085 | 2001-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506269 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250415 | 1999-06-17 | Paper |
| Thek-Steiner Ratio in the Rectilinear Plane | 1999-03-07 | Paper |
| Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs | 1999-01-12 | Paper |
| TWDM multichannel lightwave hypercube networks | 1998-08-13 | Paper |
| A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem | 1998-07-22 | Paper |
| The Steiner ratio for the dual normed plane | 1998-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247455 | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4363167 | 1997-12-18 | Paper |
| Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network | 1997-10-20 | Paper |
| A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem | 1997-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883383 | 1996-10-13 | Paper |
| Minimum Steiner trees in normed planes | 1993-06-16 | Paper |
