![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Joachim Gehweiler
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2011
- [b1]Joachim Gehweiler:
Peer-to-peer based parallel web computing. University of Paderborn, 2011, pp. 1-200
Journal Articles
- 2014
- [j4]Joachim Gehweiler, Christiane Lammersen, Christian Sohler
:
A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. Algorithmica 68(3): 643-670 (2014) - 2010
- [j3]Bastian Degener, Joachim Gehweiler, Christiane Lammersen:
Kinetic Facility Location. Algorithmica 57(3): 562-584 (2010) - 2006
- [j2]Joachim Gehweiler, Christiane Lammersen, Christian Sohler
:
A Distributed Algorithm for the Facility Location Problem. Electron. Notes Discret. Math. 25: 91 (2006) - [j1]Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer auf der Heide:
A Web Computing Environment for Parallel Algorithms in Java. Scalable Comput. Pract. Exp. 7(2) (2006)
Conference and Workshop Papers
- 2011
- [c7]Joachim Gehweiler, Peter Kling
, Friedhelm Meyer auf der Heide:
An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. PPAM (2) 2011: 31-40 - 2010
- [c6]Joachim Gehweiler, Henning Meyerhenke
:
A distributed diffusive heuristic for clustering a virtual P2P supercomputer. IPDPS Workshops 2010: 1-8 - 2008
- [c5]Bastian Degener, Joachim Gehweiler, Christiane Lammersen:
The Kinetic Facility Location Problem. SWAT 2008: 378-389 - 2006
- [c4]Joachim Gehweiler, Gunnar Schomaker:
Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. DS-RT 2006: 51-62 - [c3]Joachim Gehweiler, Christiane Lammersen, Christian Sohler
:
A distributed O(1)-approximation algorithm for the uniform facility location problem. SPAA 2006: 237-243 - 2005
- [c2]Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer auf der Heide:
A Web Computing Environment for Parallel Algorithms in Java. PPAM 2005: 801-808 - [c1]Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer auf der Heide:
Load Balancing Strategies in a Web Computing Environment. PPAM 2005: 839-846
Parts in Books or Collections
- 2011
- [p2]Joachim Gehweiler, Friedhelm Meyer auf der Heide:
Bin Packing - How Do I Get My Stuff into the Boxes. Algorithms Unplugged 2011: 367-374 - 2008
- [p1]Joachim Gehweiler, Friedhelm Meyer auf der Heide:
Bin Packing oder "Wie bekomme ich die Klamotten in die Kisten?". Taschenbuch der Algorithmen 2008: 395-403
Informal and Other Publications
- 2010
- [i1]Henning Meyerhenke, Joachim Gehweiler:
On Dynamic Graph Partitioning and Graph Clustering using Diffusion. Algorithm Engineering 2010
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint