default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim Nieberg
Person information
- affiliation: University of Bonn, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j9]Jens Maßberg, Tim Nieberg:
Rectilinear paths with minimum segment lengths. Discret. Appl. Math. 161(12): 1769-1775 (2013)- [j8]Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen:
BonnRoute: Algorithms and data structures for fast and good VLSI routing. ACM Trans. Design Autom. Electr. Syst. 18(2): 32:1-32:24 (2013) - [c14]Stefan Hougardy, Tim Nieberg, Jan Schneider:
BonnCell: Automatic layout of leaf cells. ASP-DAC 2013: 453-460 - 2012
- [c13]Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen:
Algorithms and data structures for fast and good VLSI routing. DAC 2012: 459-464 - 2011
- [c12]Tim Nieberg:
Gridless pin access in detailed routing. DAC 2011: 170-175
2000 – 2009
- 2009
- [c11]Jens Maßberg, Tim Nieberg:
Colored Independent Sets. CTW 2009: 35-39 - 2008
- [j7]Johann L. Hurink
, Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks. Inf. Process. Lett. 109(2): 155-160 (2008) - [j6]Tim Nieberg, Johann L. Hurink, Walter Kern:
Approximation schemes for wireless networks. ACM Trans. Algorithms 4(4): 49:1-49:17 (2008) - [j5]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. ACM Trans. Sens. Networks 4(4): 20:1-20:41 (2008) - [c10]Christian Schulte, Tim Nieberg:
Classbased Detailed Routing in VLSI Design. CTW 2008: 22-25 - [c9]Tim Nieberg:
A local approximation algorithm for maximum weight matching. CTW 2008: 44-47 - [c8]Tim Nieberg:
Local, distributed weighted matching on general and wireless topologies. DIALM-POMC 2008: 87-92 - 2007
- [j4]Erwin W. Hans, Tim Nieberg:
Operating Room Manager Game. INFORMS Trans. Educ. 8(1): 25-36 (2007) - [c7]Johann L. Hurink, Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks. CTW 2007: 77-80 - [c6]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 - 2006
- [b1]Tim Nieberg:
Independent and dominating sets in wireless communication graphs. University of Twente, Enschede, Netherlands, 2006 - [j3]Peter Brucker, Silvia Heitmann, Johann L. Hurink, Tim Nieberg:
Job-shop scheduling with limited capacity buffers. OR Spectr. 28(2): 151-176 (2006) - 2005
- [c5]Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer:
Local approximation schemes for ad hoc and sensor networks. DIALM-POMC 2005: 97-103 - [c4]Tim Nieberg, Johann L. Hurink:
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. WAOA 2005: 296-306 - [c3]Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer:
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. DISC 2005: 273-287 - 2004
- [j2]Lodewijk van Hoesel, Tim Nieberg, Jian Wu, Paul J. M. Havinga:
Prolonging the lifetime of wireless sensor networks by cross-layer interaction. IEEE Wirel. Commun. 11(6): 78-86 (2004) - [c2]Tim Nieberg, Johann L. Hurink, Walter Kern:
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. WG 2004: 214-221 - 2003
- [j1]Tim Nieberg:
Distributed Algorithms in Wireless Sensor Networks. Electron. Notes Discret. Math. 13: 81-83 (2003) - [c1]Stefan Dulman, Tim Nieberg, Jian Wu, Paul J. M. Havinga:
Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks. WCNC 2003: 1918-1922
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
