default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Tim Nieberg
University of Bonn, Germany
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 26 matches
- 2018
- Marko A. Hofmann, Silja Meyer-Nieberg:
Time to dispense with the p-value in OR? Central Eur. J. Oper. Res. 26(1): 193-214 (2018) - 2014
- Klaus Arto, Bo Hu, Armin Leopold, Silja Meyer-Nieberg, Goran Mihelcic, Jan Stutzki, Tim Tepel:
Modellbasierende Früherkennung politischer Krisen: Prototyp einer serviceorientiertenPlattform. MKWI 2014: 278-293 - 2013
- Jens Maßberg, Tim Nieberg:
Rectilinear paths with minimum segment lengths. Discret. Appl. Math. 161(12): 1769-1775 (2013) - 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) - Stefan Hougardy, Tim Nieberg, Jan Schneider:
BonnCell: Automatic layout of leaf cells. ASP-DAC 2013: 453-460 - 2012
- 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
- Tim Nieberg:
Gridless pin access in detailed routing. DAC 2011: 170-175 - 2009
- Jens Maßberg, Tim Nieberg:
Colored Independent Sets. CTW 2009: 35-39 - 2008
- Johann L. Hurink, Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks. Inf. Process. Lett. 109(2): 155-160 (2008) - Tim Nieberg, Johann L. Hurink, Walter Kern:
Approximation schemes for wireless networks. ACM Trans. Algorithms 4(4): 49:1-49:17 (2008) - 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) - Christian Schulte, Tim Nieberg:
Classbased Detailed Routing in VLSI Design. CTW 2008: 22-25 - Tim Nieberg:
A local approximation algorithm for maximum weight matching. CTW 2008: 44-47 - Tim Nieberg:
Local, distributed weighted matching on general and wireless topologies. DIALM-POMC 2008: 87-92 - 2007
- Erwin W. Hans, Tim Nieberg:
Operating Room Manager Game. INFORMS Trans. Educ. 8(1): 25-36 (2007) - Johann L. Hurink, Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks. CTW 2007: 77-80 - 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
- Tim Nieberg:
Independent and dominating sets in wireless communication graphs. University of Twente, Enschede, Netherlands, 2006 - Peter Brucker, Silvia Heitmann, Johann L. Hurink, Tim Nieberg:
Job-shop scheduling with limited capacity buffers. OR Spectr. 28(2): 151-176 (2006) - 2005
- Fabian Kuhn, Tim Nieberg, Thomas Moscibroda, Roger Wattenhofer:
Local approximation schemes for ad hoc and sensor networks. DIALM-POMC 2005: 97-103 - Tim Nieberg, Johann L. Hurink:
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. WAOA 2005: 296-306 - Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer:
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. DISC 2005: 273-287 - 2004
- 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) - Tim Nieberg, Johann L. Hurink, Walter Kern:
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. WG 2004: 214-221 - 2003
- Tim Nieberg:
Distributed Algorithms in Wireless Sensor Networks. Electron. Notes Discret. Math. 13: 81-83 (2003) - 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
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-18 20:27 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint