Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks. - Stefan Dulman; Tim Nieberg; Jian Wu 018; Paul J. M. Havinga (WCNC, 2003)

Distributed Algorithms in Wireless Sensor Networks. - Tim Nieberg (Electron. Notes Discret. Math., 2003)

A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. - Tim Nieberg; Johann L. Hurink; Walter Kern (WG, 2004)

Prolonging the lifetime of wireless sensor networks by cross-layer interaction. - Lodewijk van Hoesel; Tim Nieberg; Jian Wu 018; Paul J. M. Havinga (IEEE Wirel. Commun., 2004)

Local approximation schemes for ad hoc and sensor networks. - Fabian Kuhn; Tim Nieberg; Thomas Moscibroda; Roger Wattenhofer (DIALM-POMC, 2005)

A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. - Tim Nieberg; Johann L. Hurink (WAOA, 2005)

Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. - Fabian Kuhn; Thomas Moscibroda; Tim Nieberg; Roger Wattenhofer (DISC, 2005)

Job-shop scheduling with limited capacity buffers. - Peter Brucker; Silvia Heitmann; Johann L. Hurink; Tim Nieberg (OR Spectr., 2006)

Independent and dominating sets in wireless communication graphs. - Tim Nieberg (2006)

Energy-Efficient Data Acquisition Using a Distributed and Self-organizing Scheduling Algorithm for Wireless Sensor Networks. - Supriyo Chatterjea; Tim Nieberg; Yang Zhang 004; Paul J. M. Havinga (DCOSS, 2007)

Operating Room Manager Game. - Erwin W. Hans; Tim Nieberg (INFORMS Trans. Educ., 2007)

Classbased Detailed Routing in VLSI Design. - Christian Schulte 002; Tim Nieberg (CTW, 2008)

A local approximation algorithm for maximum weight matching. - Tim Nieberg (CTW, 2008)

Local, distributed weighted matching on general and wireless topologies. - Tim Nieberg (DIALM-POMC, 2008)

Approximating minimum independent dominating sets in wireless networks. - Johann L. Hurink; Tim Nieberg (Inf. Process. Lett., 2008)

Approximation schemes for wireless networks. - Tim Nieberg; Johann L. Hurink; Walter Kern (ACM Trans. Algorithms, 2008)

A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks. - Supriyo Chatterjea; Tim Nieberg; Nirvana Meratnia; Paul J. M. Havinga (ACM Trans. Sens. Networks, 2008)

Colored Independent Sets. - Jens Maßberg; Tim Nieberg (CTW, 2009)

Gridless pin access in detailed routing. - Tim Nieberg (DAC, 2011)

Algorithms and data structures for fast and good VLSI routing. - Michael Gester; Dirk Müller 003; Tim Nieberg; Christian Panten; Christian Schulte 002; Jens Vygen (DAC, 2012)

BonnCell: Automatic layout of leaf cells. - Stefan Hougardy; Tim Nieberg; Jan Schneider 002 (ASP-DAC, 2013)

Rectilinear paths with minimum segment lengths. - Jens Maßberg; Tim Nieberg (Discret. Appl. Math., 2013)

BonnRoute: Algorithms and data structures for fast and good VLSI routing. - Michael Gester; Dirk Müller 003; Tim Nieberg; Christian Panten; Christian Schulte 002; Jens Vygen (ACM Trans. Design Autom. Electr. Syst., 2013)