| 2008 |
|---|
| 13 | | Christian Schulte,
Tim Nieberg:
Classbased Detailed Routing in VLSI Design.
CTW 2008: 22-25 |
| 12 | | Tim Nieberg:
A local approximation algorithm for maximum weight matching.
CTW 2008: 44-47 |
| 11 | EE | Tim Nieberg:
Local, distributed weighted matching on general and wireless topologies.
DIALM-POMC 2008: 87-92 |
| 10 | EE | Tim Nieberg,
Johann Hurink,
Walter Kern:
Approximation schemes for wireless networks.
ACM Transactions on Algorithms 4(4): (2008) |
| 9 | EE | Johann Hurink,
Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks.
Inf. Process. Lett. 109(2): 155-160 (2008) |
| 8 | EE | Supriyo Chatterjea,
Tim Nieberg,
Nirvana Meratnia,
Paul J. M. Havinga:
A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks.
TOSN 4(4): (2008) |
| 2007 |
|---|
| 7 | | Johann Hurink,
Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks.
CTW 2007: 77-80 |
| 6 | EE | Supriyo Chatterjea,
Tim Nieberg,
Yang Zhang,
Paul J. M. Havinga:
Energy-Efficient Data Acquisition Using a Distributed and Self-organizing Scheduling Algorithm for Wireless Sensor Networks.
DCOSS 2007: 368-385 |
| 2005 |
|---|
| 5 | EE | Fabian Kuhn,
Tim Nieberg,
Thomas Moscibroda,
Roger Wattenhofer:
Local approximation schemes for ad hoc and sensor networks.
DIALM-POMC 2005: 97-103 |
| 4 | EE | Fabian Kuhn,
Thomas Moscibroda,
Tim Nieberg,
Roger Wattenhofer:
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.
DISC 2005: 273-287 |
| 3 | EE | Tim Nieberg,
Johann Hurink:
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs.
WAOA 2005: 296-306 |
| 2004 |
|---|
| 2 | EE | Tim Nieberg,
Johann Hurink,
Walter Kern:
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.
WG 2004: 214-221 |
| 2003 |
|---|
| 1 | EE | Tim Nieberg:
Distributed Algorithms in Wireless Sensor Networks.
Electronic Notes in Discrete Mathematics 13: 81-83 (2003) |
