default search action
Robert Preis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [r1]Robert Preis, Burkhard Monien, Stefan Schamberger:
Approximation Algorithms for Multilevel Graph Partitioning. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j7]Burkhard Monien, Robert Preis:
Upper bounds on the bisection width of 3- and 4-regular graphs. J. Discrete Algorithms 4(3): 475-498 (2006) - 2005
- [j6]Michael Dellnitz, Oliver Junge, Wang Sang Koon, Francois Lekien, Martin W. Lo, Jerrold E. Marsden, Kathrin Padberg
, Robert Preis, Shane D. Ross
Transport in Dynamical Astronomy and Multibody Problems. Int. J. Bifurc. Chaos 15(3): 699-727 (2005) - [c13]Arvind Krishnamurthy, Robert Preis:
Satellite Formation, a Mobile Sensor Network in Space. IPDPS 2005 - 2004
- [j5]Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer:
Optimal Diffusion Schemes And Load Balancing On Product Graphs. Parallel Process. Lett. 14(1): 61-73 (2004) - [j4]Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich:
New spectral lower bounds on the bisection width of graphs. Theor. Comput. Sci. 320(2-3): 155-174 (2004) - 2002
- [j3]Robert Elsässer, Burkhard Monien, Robert Preis:
Diffusion Schemes for Load Balancing on Heterogeneous Networks. Theory Comput. Syst. 35(3): 305-320 (2002) - 2001
- [c12]Burkhard Monien, Robert Preis:
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. MFCS 2001: 524-536 - [c11]Michael Dellnitz, Robert Preis:
Congestion and Almost Invariant Sets in Dynamical Systems. SNSC 2001: 183-209 - 2000
- [j2]Ralf Diekmann, Robert Preis, Frank Schlimbach, Chris Walshaw
Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM. Parallel Comput. 26(12): 1555-1581 (2000) - [j1]Burkhard Monien, Robert Preis, Ralf Diekmann:
Quality matching and local improvement for multilevel graph-partitioning. Parallel Comput. 26(12): 1609-1634 (2000) - [c10]Thomas Decker, Burkhard Monien, Robert Preis:
Towards Optimal Load Balancing Topologies. Euro-Par 2000: 277-287 - [c9]Robert Elsässer, Burkhard Monien, Robert Preis:
Diffusive load balancing schemes on heterogeneous networks. SPAA 2000: 30-38 - [c8]Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich:
New Spectral Lower Bounds on the Bisection Width of Graphs. WG 2000: 23-34
1990 – 1999
- 1999
- [c7]Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis:
Optimal and Alternating-Direction Load Balancing Schemes. Euro-Par 1999: 280-290 - [c6]Robert Preis:
Analytical Methods for Multilevel Graph-Partitioning. GI Jahrestagung 1999: 223-230 - [c5]Robert Preis:
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs. STACS 1999: 259-269 - 1998
- [c4]Ralf Diekmann, Robert Preis, Frank Schlimbach, Chris Walshaw
Aspect Radio for Mesh Partitioning. Euro-Par 1998: 347-351 - 1997
- [c3]Fabrizio d'Amore, Luca Becchetti
On the Embedding of Refinements of 2-dimensional Grids. Euro-Par 1997: 950-957 - 1995
- [c2]Jürgen Schulze, Ralf Diekmann, Robert Preis:
Comparing Nested Dissection Orderings for Parallel Sparse Matrix Factorization. PDPTA 1995: 280-289 - 1994
- [c1]Ralf Diekmann, Burkhard Monien, Robert Preis:
Using helpful sets to improve graph bisections. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 57-73
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-08-05 20:26 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: