default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Diedrich
Person information
- affiliation: University of Kiel, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c10]Niklas Paulsen, Florian Diedrich, Klaus Jansen:
Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows. ATMOS 2015: 42-55- 2012
- [j4]Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Tight approximation algorithms for scheduling with fixed jobs and nonavailability. ACM Trans. Algorithms 8(3): 27:1-27:15 (2012) - 2010
- [j3]Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram:
Approximation Algorithms for Scheduling with Reservations. Algorithmica 58(2): 391-404 (2010)
2000 – 2009
- 2009
- [b1]Florian Diedrich:
Approximation algorithms for linear programs and geometrically constrained packing roblems (Algorithmes d'approximation pour des programmes linéaires et les problèmes de Packing avec des contraintes géometriques). Kiel University, Germany, 2009 - [c9]Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram:
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability. Algorithmics of Large and Complex Networks 2009: 50-64 - [c8]Florian Diedrich, Klaus Jansen:
Improved approximation algorithms for scheduling with fixed jobs. SODA 2009: 675-684 - 2008
- [j2]Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack. J. Comput. Sci. Technol. 23(5): 749-762 (2008) - [c7]Florian Diedrich, Britta Kehden, Frank Neumann:
Multi-objective Problems in Terms of Relational Algebra. RelMiCS 2008: 84-98 - [c6]Florian Diedrich, Frank Neumann
:
Using fast matrix multiplication in bio-inspired computation for complex optimization problems. IEEE Congress on Evolutionary Computation 2008: 3827-3832 - 2007
- [j1]Florian Diedrich, Klaus Jansen:
Faster and simpler approximation algorithms for mixed packing and covering problems. Theor. Comput. Sci. 377(1-3): 181-204 (2007) - [c5]Florian Diedrich, Klaus Jansen:
An Approximation Algorithm for the General Mixed Packing and Covering Problem. ESCAPE 2007: 128-139 - [c4]Florian Diedrich, Ulrich M. Schwarz:
A Framework for Scheduling with Online Availability. Euro-Par 2007: 205-213 - [c3]Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram:
Approximation Algorithms for Scheduling with Reservations. HiPC 2007: 297-307 - [c2]Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack. TAMC 2007: 34-45 - 2006
- [c1]Mihhail Aizatulin, Florian Diedrich, Klaus Jansen:
Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. WEA 2006: 207-218
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 23:14 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:
