Tim Nieberg

24 papers A* 2A 1B 4C 4Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
2013 — conf
BonnCell: Automatic layout of leaf cells.
ASP-DAC
Stefan Hougardy, Tim Nieberg, Jan Schneider
2013 J jnl
BonnRoute: Algorithms and data structures for fast and good VLSI routing.
ACM Trans. Design Autom. Electr. Syst.
Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen
2013 J jnl
Rectilinear paths with minimum segment lengths.
Discret. Appl. Math.
Jens Maßberg, Tim Nieberg
2012 A* conf
Algorithms and data structures for fast and good VLSI routing.
DAC
Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen
2011 A* conf
Gridless pin access in detailed routing.
DAC
Tim Nieberg
2009 C conf
Colored Independent Sets.
CTW
Jens Maßberg, Tim Nieberg
2008 J jnl
A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks.
ACM Trans. Sens. Networks
Supriyo Chatterjea, Tim Nieberg, Nirvana Meratnia, Paul J. M. Havinga
2008 C conf
A local approximation algorithm for maximum weight matching.
CTW
Tim Nieberg
2008 J jnl
Approximating minimum independent dominating sets in wireless networks.
Inf. Process. Lett.
Johann L. Hurink, Tim Nieberg
2008 J jnl
Approximation schemes for wireless networks.
ACM Trans. Algorithms
Tim Nieberg, Johann L. Hurink, Walter Kern
2008 C conf
Classbased Detailed Routing in VLSI Design.
CTW
Christian Schulte, Tim Nieberg
2008 — conf
Local, distributed weighted matching on general and wireless topologies.
DIALM-POMC
Tim Nieberg
2007 C conf
Approximating minimum independent dominating sets in wireless networks.
CTW
Johann L. Hurink, Tim Nieberg
2007 B conf
Energy-Efficient Data Acquisition Using a Distributed and Self-organizing Scheduling Algorithm for Wireless Sensor Networks.
DCOSS
Supriyo Chatterjea, Tim Nieberg, Yang Zhang, Paul J. M. Havinga
2007 J jnl
Operating Room Manager Game.
INFORMS Trans. Educ.
Erwin W. Hans, Tim Nieberg
2006 — —
Independent and dominating sets in wireless communication graphs.
Tim Nieberg
2006 J jnl
Job-shop scheduling with limited capacity buffers.
OR Spectr.
Peter Brucker, Silvia Heitmann, Johann L. Hurink, Tim Nieberg
2005 B conf
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs.
WAOA
Tim Nieberg, Johann L. Hurink
2005 A conf
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.
DISC
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer
2005 — conf
Local approximation schemes for ad hoc and sensor networks.
DIALM-POMC
Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer
2004 B conf
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.
WG
Tim Nieberg, Johann L. Hurink, Walter Kern
2004 J jnl
Prolonging the lifetime of wireless sensor networks by cross-layer interaction.
IEEE Wirel. Commun.
Lodewijk van Hoesel, Tim Nieberg, Jian Wu, Paul J. M. Havinga
2003 J jnl
Distributed Algorithms in Wireless Sensor Networks.
Electron. Notes Discret. Math.
Tim Nieberg
2003 B conf
Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks.
WCNC
Stefan Dulman, Tim Nieberg, Jian Wu, Paul J. M. Havinga