default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Schamberger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j3]Henning Meyerhenke
, Burkhard Monien, Stefan Schamberger:
Graph partitioning and disturbed diffusion. Parallel Comput. 35(10-11): 544-569 (2009)- 2007
- [r1]Robert Preis, Burkhard Monien, Stefan Schamberger:
Approximation Algorithms for Multilevel Graph Partitioning. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [b1]Stefan Schamberger:
Shape optimized graph partitioning. University of Paderborn, Germany, 2006, pp. 1-138 - [j2]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Distributing Unit Size Workload Packages in Heterogeneous Networks. J. Graph Algorithms Appl. 10(1): 51-68 (2006) - [c17]Henning Meyerhenke, Stefan Schamberger:
A Parallel Shape Optimizing Load Balancer. Euro-Par 2006: 232-242 - [c16]Henning Meyerhenke, Burkhard Monien, Stefan Schamberger:
Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. IPDPS 2006 - 2005
- [j1]Stefan Schamberger, Jens-Michael Wierum:
Partitioning finite element meshes using space-filling curves. Future Gener. Comput. Syst. 21(4): 759-766 (2005) - [c15]Henning Meyerhenke, Stefan Schamberger:
Balancing Parallel Adaptive FEM Computations by Solving Systems of Linear Equations. Euro-Par 2005: 209-219 - [c14]Stefan Schamberger:
A Shape Optimizing Load Distribution Heuristic for Parallel Adaptive FEM Computations. PaCT 2005: 263-277 - [c13]Stefan Schamberger:
FE Mesh Partitioning based on Multigraph Diffusion. Parallel and Distributed Computing and Networks 2005: 663-668 - [c12]Oliver Marquardt, Stefan Schamberger:
Open Benchmarks for Load Balancing Heuristics in Parallel Adaptive Finite Element Computations. PDPTA 2005: 685-691 - 2004
- [c11]Stefan Schamberger, Jens-Michael Wierum:
A Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves. PDCS 2004: 51-57 - [c10]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. ESA 2004: 640-651 - [c9]Stefan Schamberger:
On Partitioning FEM Graphs Using Diffusion. IPDPS 2004 - [c8]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Load Balancing in Dynamic Networks. ISPAN 2004: 193-200 - [c7]Burkhard Monien, Stefan Schamberger:
Graph Partitioning with the Party Library: Helpful-Sets in Practice. SBAC-PAD 2004: 198-205 - 2003
- [c6]Stefan Schamberger:
Improvements to the Helpful-Set Algorithm and a New Evaluation Scheme for Graph-Partitioners. ICCSA (3) 2003: 49-59 - [c5]Stefan Schamberger, Jens-Michael Wierum:
Graph Partitioning in Scientific Simulations: Multilevel Schemes versus Space-Filling Curves. PaCT 2003: 165-179 - [c4]Stefan Schamberger:
Heuristic Graph Bisection with Less Restrictive Balance Constraints. PDPTA 2003: 649-655 - 2002
- [c3]Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger:
Toward Optimal Diffusion Matrices. IPDPS 2002 - 2001
- [c2]Torsten Fahle, Stefan Schamberger, Meinolf Sellmann:
Symmetry Breaking. CP 2001: 93-107 - 2000
- [c1]Rainer Feldmann, Burkhard Monien, Stefan Schamberger:
A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI/IAAI 2000: 285-290
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:59 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:
