| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Martin Gairing, Burkhard Monien, Karsten Tiemann |
Routing (un-) splittable flow in games with player-specific affine latency functions.  |
ACM Transactions on Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann |
Exact Price of Anarchy for Polynomial Congestion Games.  |
SIAM J. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Ulf-Peter Schroeder |
Preface.  |
Theory Comput. Syst.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
Computing Nash Equilibria for Scheduling on Restricted Parallel Links.  |
Theory Comput. Syst.  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner |
Local Search: Simple, Successful, But Sometimes Sluggish.  |
ICALP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Tobias Tscheuschner |
On the Power of Nodes of Degree Four in the Local Max-Cut Problem.  |
CIAC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Meyerhenke, Burkhard Monien, Stefan Schamberger |
Graph partitioning and disturbed diffusion.  |
Parallel Computing  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald |
A new diffusion-based multilevel algorithm for computing graph partitions.  |
J. Parallel Distrib. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yvonne Bleischwitz, Burkhard Monien |
Fair cost-sharing methods for scheduling jobs on parallel machines.  |
J. Discrete Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Marios Mavronicolas, Burkhard Monien |
Nash Equilibria for Voronoi Games on Transitive Graphs.  |
WINE  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominic Dumrauf, Burkhard Monien, Karsten Tiemann |
MultiProcessor Scheduling is PLS-Complete.  |
HICSS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Grothklags, Ulf Lorenz, Burkhard Monien |
From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future.  |
Algorithmics of Large and Complex Networks ![In: Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126], pp. 140-165, 2009, Springer, 978-3-642-02093-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
A new model for selfish routing.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou |
How Many Attackers Can Selfish Defenders Catch?  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Gairing, Burkhard Monien, Karsten Tiemann |
Selfish Routing with Incomplete Information.  |
Theory Comput. Syst.  |
2008 |
DBLP DOI BibTeX RDF |
Bayesian Nash equilibria, Coordination ratio, Incomplete information, Selfish routing |
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
Nash equilibria in discrete routing games with convex latency functions.  |
J. Comput. Syst. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Ulf Lorenz, Daniel Warner |
Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?.  |
Taschenbuch der Algorithmen  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominic Dumrauf, Burkhard Monien |
On the Road to -Completeness: 8 Agents in a Singleton Congestion Game.  |
WINE  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald |
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality.  |
IPDPS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann |
Voronoi Games on Cycle Graphs.  |
MFCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou |
How Many Attackers Can Selfish Defenders Catch?  |
HICSS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Ulf-Peter Schroeder (eds.) |
Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings  |
SAGT  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Gairing, Burkhard Monien, Andreas Woclaw |
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner |
Weighted Boolean Formula Games.  |
WINE  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann |
To Be or Not to Be (Served).  |
WINE  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann |
Congestion Games with Player-Specific Constants.  |
MFCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann |
The Power of Two Prices: Beyond Cross-Monotonicity.  |
MFCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Karsten Tiemann |
Routing and Scheduling with Incomplete Information.  |
DISC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
The price of anarchy for polynomial social cost.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Decker, Thomas Lücking, Burkhard Monien |
A 5/4-approximation algorithm for scheduling identical malleable tasks.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Guang Gao, Horst Simon, Paul G. Spirakis, Per Stenström |
Introduction.  |
J. Parallel Distrib. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
The Price of Anarchy for Restricted Parallel Links.  |
Parallel Processing Letters  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Burkhard Monien, Stefan Schamberger |
Distributing Unit Size Workload Packages in Heterogeneous Networks.  |
J. Graph Algorithms Appl.  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Burkhard Monien, Robert Preis |
Upper bounds on the bisection width of 3- and 4-regular graphs.  |
J. Discrete Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann |
Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic.  |
WINE  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Burkhard Monien, Karsten Tiemann |
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.  |
ICALP  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Meyerhenke, Burkhard Monien, Stefan Schamberger |
Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid.  |
IPDPS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann |
Exact Price of Anarchy for Polynomial Congestion Games.  |
STACS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Andreas Woclaw |
Scheduling Unrelated Parallel Machines Computational Results.  |
WEA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien |
Selfish Routing in Networks.  |
SOFSEM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yvonne Bleischwitz, Burkhard Monien |
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines.  |
CIAC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis |
Structure and complexity of extreme Nash equilibria.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Abderezak Touzene, Khaled Day, Burkhard Monien |
Edge-disjoint spanning trees for the generalized butterfly networks and their applications.  |
J. Parallel Distrib. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.  |
WINE  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann |
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.  |
ICALP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Burkhard Monien, Andreas Woclaw |
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines.  |
ICALP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
The Price of Anarchy for Polynomial Social Cost.  |
Computing and Markets  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Martin Gairing, Burkhard Monien, Karsten Tiemann |
Selfish routing with incomplete information.  |
SPAA  |
2005 |
DBLP DOI BibTeX RDF |
coordination ratio, incomplete information, nash equilibria, selfish routing, bayesian game |
| 1 | Ulf Lorenz, Burkhard Monien |
Error analysis in minimax trees.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer |
Optimal Diffusion Schemes And Load Balancing On Product Graphs.  |
Parallel Processing Letters  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Imrich Vrto |
Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs.  |
Parallel Processing Letters  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Burkhard Monien, Stefan Schamberger |
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks.  |
ESA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
Nash Equilibria in Discrete Routing Games with Convex Latency Functions.  |
ICALP  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
The Price of Anarchy for Polynomial Social Cost.  |
MFCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode |
A New Model for Selfish Routing.  |
STACS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Stefan Schamberger |
Graph Partitioning with the Party Library: Helpful-Sets in Practice.  |
SBAC-PAD  |
2004 |
DBLP DOI BibTeX RDF |
Heuristic Graph Partitioning, Helpful-Sets, Recursive bisection |
| 1 | Robert Elsässer, Burkhard Monien, Stefan Schamberger |
Load Balancing in Dynamic Networks.  |
ISPAN  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien |
Computing Nash equilibria for scheduling on restricted parallel links.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, Nash equilibria, selfish routing, unsplittable flow, machine scheduling |
| 1 | Robert Elsässer, Rastislav Kralovic, Burkhard Monien |
Sparse topologies with small spectrum size.  |
Theor. Comput. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode |
Selfish Routing in Non-Cooperative Networks: A Survey.  |
Bulletin of the EATCS  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Robert Elsässer, Thomas Lücking, Burkhard Monien |
On Spectral Bounds for the k-Partitioning of Graphs.  |
Theory Comput. Syst.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich |
Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques.  |
FPL  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis |
Extreme Nash Equilibria.  |
ICTCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode |
Nashification and the Coordination Ratio for a Selfish Routing Game.  |
ICALP  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto |
Which Is the Worst-Case Nash Equilibrium?  |
MFCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode |
Selfish Routing in Non-cooperative Networks: A Survey.  |
MFCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Burkhard Monien |
Load balancing of unit size tokens and expansion properties of graphs.  |
SPAA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien |
SAT-Based Techniques in System Synthesis.  |
DATE  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien |
The Aircraft Sequencing Problem.  |
Computer Science in Perspective  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Decker, Thomas Lücking, Burkhard Monien |
A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks.  |
WAOA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Burkhard Monien, Robert Preis |
Diffusion Schemes for Load Balancing on Heterogeneous Networks.  |
Theory Comput. Syst.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Rainer Feldmann (eds.) |
Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings  |
Euro-Par  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger |
Toward Optimal Diffusion Matrices. (PDF / PS)  |
IPDPS  |
2002 |
DBLP DOI BibTeX RDF |
FOS, load balancing, hypercubic networks, diffusion, eigenvalues, SOS |
| 1 | Thomas Lücking, Burkhard Monien, Manuel Rode |
On the Problem of Scheduling Flows on Distributed Networks.  |
MFCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulf Lorenz, Burkhard Monien |
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations.  |
STACS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Viktor K. Prasanna, Sriram Vajapeyam (eds.) |
High Performance Computing - HiPC 2001, 8th International Conference, Hyderabad, India, December, 17-20, 2001, Proceedings  |
HiPC  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Burkhard Monien, Robert Preis |
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.  |
MFCS  |
2001 |
DBLP DOI BibTeX RDF |
local improvement, graph partitioning, regular graphs, bisection width |
| 1 | Robert Elsässer, Rastislav Kralovic, Burkhard Monien |
Scalable Sparse Topologies with Small Spectrum.  |
STACS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Thomas Lücking, Burkhard Monien |
New spectral bounds on k-partitioning of graphs.  |
SPAA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Robert Preis, Ralf Diekmann |
Quality matching and local improvement for multilevel graph-partitioning.  |
Parallel Computing  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Decker, Burkhard Monien, Robert Preis |
Towards Optimal Load Balancing Topologies.  |
Euro-Par  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Burkhard Monien, Robert Preis |
Diffusive load balancing schemes on heterogeneous networks.  |
SPAA  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Feldmann, Burkhard Monien, Stefan Schamberger |
A Distributed Algorithm to Evaluate Quantified Boolean Formulae.  |
AAAI/IAAI  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Ralf Diekmann, Andreas Frommer, Burkhard Monien |
Efficient schemes for nearest neighbor load balancing.  |
Parallel Computing  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis |
Optimal and Alternating-Direction Load Balancing Schemes.  |
Euro-Par  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Diekmann, Derk Meyer, Burkhard Monien |
Parallel Decomposition of Unstructured FEM-Meshes.  |
Concurrency - Practice and Experience  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Klasing, Reinhard Lüling, Burkhard Monien |
Compressing cube-connected cycles and butterfly networks.  |
Networks  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Brune, Jörn Gehring, Axel Keller, Burkhard Monien, Friedhelm Ramme, Alexander Reinefeld |
Specifying Resources and Services in Metacomputing Environments.  |
Parallel Computing  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger |
Optimal Embedding of Complete Binary Trees into Lines and Grids.  |
J. Parallel Distrib. Comput.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung |
Embedding ladders and caterpillars into the hypercube.  |
Discrete Applied Mathematics  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Diekmann, Andreas Frommer, Burkhard Monien |
Nearest Neighbor Load Balancing on Graphs.  |
ESA  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Alois Knoll, Christian Altenschmidt, Joachim Biskup, Hans-Martin Blüthgen, Ingo Glöckner, Sven Hartrumpf, Hermann Helbig, Christiane Henning, Reinhard Lüling, Burkhard Monien, Thomas Noll, Norbert Sensen |
An Integrated Approach to Semantic Evaluation and Content-Based Retrieval of Multimedia Documents.  |
ECDL  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Ralf Diekmann, Reinhard Lüling |
The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320).  |
Int. J. Found. Comput. Sci.  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke |
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract).  |
STACS  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Jürgen Schulze |
Parallel Sparse Cholesky Factorization.  |
IRREGULAR  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Petra Berenbrink, Reinhard Lüling, Marco Riedel |
Online Scheduling of Continuous Media Streams.  |
Foundations of Computer Science: Potential - Theory - Cognition  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Ralf Diekmann |
A Local Graph Partitioning Heuristic Meeting Bisection Bounds.  |
PPSC  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spräner |
Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem.  |
Parallel Algorithms Appl.  |
1996 |
DBLP DOI BibTeX RDF |
|