Tim Nieberg

Affiliations:
  • University of Bonn, Germany


According to our database1, Tim Nieberg authored at least 23 papers between 2003 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
BonnRoute: Algorithms and data structures for fast and good VLSI routing.
ACM Trans. Design Autom. Electr. Syst., 2013

Rectilinear paths with minimum segment lengths.
Discret. Appl. Math., 2013

BonnCell: Automatic layout of leaf cells.
Proceedings of the 18th Asia and South Pacific Design Automation Conference, 2013

2012
Algorithms and data structures for fast and good VLSI routing.
Proceedings of the 49th Annual Design Automation Conference 2012, 2012

2011
Gridless pin access in detailed routing.
Proceedings of the 48th Design Automation Conference, 2011

2009
Colored Independent Sets.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks.
ACM Trans. Sens. Networks, 2008

Approximation schemes for wireless networks.
ACM Trans. Algorithms, 2008

Approximating minimum independent dominating sets in wireless networks.
Inf. Process. Lett., 2008

Local, distributed weighted matching on general and wireless topologies.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

A local approximation algorithm for maximum weight matching.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Classbased Detailed Routing in VLSI Design.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
Operating Room Manager Game.
INFORMS Trans. Educ., 2007

Energy-Efficient Data Acquisition Using a Distributed and Self-organizing Scheduling Algorithm for Wireless Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2007

2006
Independent and dominating sets in wireless communication graphs.
PhD thesis, 2006

Job-shop scheduling with limited capacity buffers.
OR Spectr., 2006

2005
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.
Proceedings of the Distributed Computing, 19th International Conference, 2005

A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Local approximation schemes for ad hoc and sensor networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

2004
Prolonging the lifetime of wireless sensor networks by cross-layer interaction.
IEEE Wirel. Commun., 2004

A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003
Distributed Algorithms in Wireless Sensor Networks.
Electron. Notes Discret. Math., 2003

Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks.
Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003


  Loading...