default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim Nonner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j5]Tim Nonner:
Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs. Algorithmica 80(10): 2941-2956 (2018)- 2016
- [j4]Tim Nonner:
PTAS for Densest k-Subgraph in Interval Graphs. Algorithmica 74(1): 528-539 (2016) - [j3]Tim Nonner
:
Capacitated Max-Batching with interval graph compatibilities. Theor. Comput. Sci. 613: 79-93 (2016) - 2014
- [j2]Gero Greiner, Tim Nonner, Alexander Souza:
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling. Theory Comput. Syst. 54(1): 24-44 (2014) - [c12]Tim Nonner, Marco Laumanns:
Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments. ATMOS 2014: 15-24 - [i1]Tim Nonner, Adi Botea, Marco Laumanns:
Stochastic Travel Planning for Unreliable Public Transportation Systems. ERCIM News 2014(98) (2014) - 2013
- [c11]Tim Nonner, Maxim Sviridenko:
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem. IPCO 2013: 314-323 - 2012
- [c10]Tim Nonner, Alexander Souza:
Optimal Algorithms for Train Shunting and Relaxed List Update Problems. ATMOS 2012: 97-107 - [c9]Tim Nonner:
Polynomial-Time Approximation Schemes for Shortest Path with Alternatives. ESA 2012: 755-765 - 2011
- [c8]Tim Nonner:
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs. ICALP (1) 2011: 183-194 - [c7]Tim Nonner:
PTAS for Densest k-Subgraph in Interval Graphs. WADS 2011: 631-641 - 2010
- [b1]Tim Nonner:
Approximation in batch and multiprocessor scheduling. University of Freiburg, 2010 - [c6]Christine Chung, Tim Nonner, Alexander Souza:
SRPT is 1.86-Competitive for Completion Time Scheduling. SODA 2010: 1373-1388 - [c5]Tim Nonner:
Capacitated max -Batching with Interval Graph Compatibilities. SWAT 2010: 176-187
2000 – 2009
- 2009
- [j1]Tim Nonner, Alexander Souza:
Approximating the Joint replenishment Problem with Deadlines. Discret. Math. Algorithms Appl. 1(2): 153-174 (2009) - [c4]Tim Nonner, Alexander Souza:
Latency Constrained Aggregation in Chain Networks Admits a PTAS. AAIM 2009: 279-291 - [c3]Tim Nonner, Alexander Souza:
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines. COCOA 2009: 24-35 - [c2]Gero Greiner, Tim Nonner, Alexander Souza:
The bell is ringing in speed-scaled multiprocessor scheduling. SPAA 2009: 11-18 - 2007
- [c1]Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp:
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. OPODIS 2007: 159-173
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-25 05:49 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:
