|
Search the dblp DataBase
Tim Nieberg:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer
Local approximation schemes for ad hoc and sensor networks. [Citation Graph (0, 0)][DBLP] DIALM-POMC, 2005, pp:97-103 [Conf]
- Tim Nieberg, Johann Hurink
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP] WAOA, 2005, pp:296-306 [Conf]
- Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. [Citation Graph (0, 0)][DBLP] DISC, 2005, pp:273-287 [Conf]
- Tim Nieberg, Johann Hurink, Walter Kern
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP] WG, 2004, pp:214-221 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] DCOSS, 2007, pp:368-385 [Conf]
Local, distributed weighted matching on general and wireless topologies. [Citation Graph (, )][DBLP]
Approximating minimum independent dominating sets in wireless networks. [Citation Graph (, )][DBLP]
Classbased Detailed Routing in VLSI Design. [Citation Graph (, )][DBLP]
A local approximation algorithm for maximum weight matching. [Citation Graph (, )][DBLP]
Colored Independent Sets. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|