On the public citation graph
Multidimensional spectral load balancing
0 signed · 68 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpe.4330030502openalex-snapshot
Performance of dynamic load balancing algorithms for unstructured mesh calculations
inferredcites →https://doi.org/10.1007/bf02032130openalex-snapshot
A projection technique for partitioning the nodes of a graph
inferredcites →https://doi.org/10.1016/0024-3795(88)90147-4openalex-snapshot
Graph partitioning by Eigenvectors
inferredcites →https://doi.org/10.1016/0956-0521(91)90014-vopenalex-snapshot
Partitioning of unstructured problems for parallel processing
inferredcites →https://doi.org/10.1109/31.1742openalex-snapshot
An algorithm for quadrisection and its application to standard cell placement
inferredcites →https://doi.org/10.1109/dac.1982.1585498openalex-snapshot
A Linear-Time Heuristic for Improving Network Partitions
inferredcites →https://doi.org/10.1109/sfcs.1987.22openalex-snapshot
Eigenvalues and graph bisection: An average-case analysis
inferredcites →https://doi.org/10.1137/0611030openalex-snapshot
Partitioning Sparse Matrices with Eigenvectors of Graphs
inferredcites →https://doi.org/10.1145/109648.109678openalex-snapshot
Geometric algorithms for a minimum cost assignment problem
inferredcites →https://doi.org/10.1147/rd.175.0420openalex-snapshot
Lower Bounds for the Partitioning of Graphs
inferredcites →https://doi.org/10.21136/cmj.1973.101168openalex-snapshot
Algebraic connectivity of graphs
inferredcites →https://doi.org/10.21136/cmj.1975.101357openalex-snapshot
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.2491597openalex-extracted
Optimal Task Mapping for NEMO Model
inferred← citeshttps://doi.org/10.1002/9781118601181.ch2openalex-snapshot
A Partitioning Requiring Rapidity and Quality: The Multilevel Method and Partitions Refinement Algorithms
inferred← citeshttps://doi.org/10.1002/cpe.4330070103openalex-snapshot
Dynamic load‐balancing for PDE solvers on adaptive unstructured meshes
inferred← citeshttps://doi.org/10.1002/nme.1620370907openalex-snapshot
Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
inferred← citeshttps://doi.org/10.1002/nme.1620370908openalex-snapshot
Node and element resequencing using the Laplacian of a finite element graph: Part II—Implementation and numerical results
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1314openalex-snapshot
Parallel Remapping of Adaptive Problems
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1412openalex-snapshot
Adaptive Local Refinement with Octree Load Balancing for the Parallel Solution of Three-Dimensional Conservation Laws
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1445openalex-snapshot
HARP: A Dynamic Spectral Partitioner
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_23openalex-snapshot
Unstructured graph partitioning for sparse linear system solving
inferred← citeshttps://doi.org/10.1007/3-540-70734-4_18openalex-snapshot
A Local Refinement Algorithm for Data Partitioning
inferred← citeshttps://doi.org/10.1007/978-1-4612-4248-2_12openalex-snapshot
Parallel Partitioning Strategies for the Adaptive Solution of Conservation Laws
inferred← citeshttps://doi.org/10.1007/978-1-4615-2315-4_20openalex-snapshot
The Quality of Partitions Produced by an Iterative Load Balancer
inferred← citeshttps://doi.org/10.1007/978-1-4757-3155-2_10openalex-snapshot
Decomposition Algorithms for Communication Minimization in Parallel Computing
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_2openalex-snapshot
A Parallelisable Algorithm for Partitioning Unstructured Meshes
inferred← citeshttps://doi.org/10.1007/978-3-319-39812-9_7openalex-snapshot
Resilient Community Clustering: A Graph Theoretical Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-55669-7_9openalex-snapshot
Layer-by-Layer Partitioning of Finite Element Meshes for Multicore Architectures
inferred← citeshttps://doi.org/10.1007/978-3-322-89454-0_1openalex-snapshot
Dynamic Load Balancing for Parallel Adaptive Multigrid Methods on Unstructured Meshes
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_7openalex-snapshot
On Query Processing and Optimality Using Spectral Locality-Preserving Mappings
inferred← citeshttps://doi.org/10.1007/978-3-642-23178-0_24openalex-snapshot
High-Performance Reconfigurable Computer Systems
inferred← citeshttps://doi.org/10.1007/bf02141748openalex-snapshot
On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
inferred← citeshttps://doi.org/10.1007/bfb0002833openalex-snapshot
Rescheduling support for mapping dynamic scientific computation onto distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1007/bfb0018528openalex-snapshot
Partitioning sparse rectangular matrices for parallel processing
inferred← citeshttps://doi.org/10.1016/0045-7825(94)00704-qopenalex-snapshot
Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
inferred← citeshttps://doi.org/10.1016/b978-044481999-4/50153-5openalex-snapshot
Partitioning and scheduling algorithms and their implementation in FELISA - An unstructured grid euler solver
inferred← citeshttps://doi.org/10.1016/b978-1-59749-272-0.50017-7openalex-snapshot
Clustering Algorithms IV
inferred← citeshttps://doi.org/10.1016/j.cam.2003.09.036openalex-snapshot
Some aspects of adaptive grid technology related to boundary and interior layers
inferred← citeshttps://doi.org/10.1016/s0045-7825(97)00050-9openalex-snapshot
A domain-decomposition message-passing approach to transient viscous incompressible flow using explicit time integration
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00059-2openalex-snapshot
A conjugate gradient method for the spectral partitioning of graphs
inferred← citeshttps://doi.org/10.1016/s0168-9274(97)00094-9openalex-snapshot
Parallel structures and dynamic load balancing for adaptive finite element computation
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1016/s0307-904x(00)00040-8openalex-snapshot
Parallel dynamic load balancing strategies for adaptive irregular applications
inferred← citeshttps://doi.org/10.1016/s0309-1708(97)00006-7openalex-snapshot
Parallel iterative solution for h and p approximations of the shallow water equations
inferred← citeshttps://doi.org/10.1016/s0378-4754(97)00062-1openalex-snapshot
A numerical investigation of Schwarz domain decomposition techniques for elliptic problems on unstructured grids
inferred← citeshttps://doi.org/10.1016/s0928-4869(99)00014-2openalex-snapshot
Semi-automatic parallelization of object-oriented simulations
inferred← citeshttps://doi.org/10.1021/ci700023yopenalex-snapshot
A Scalable Approach to Combinatorial Library Design for Drug Discovery
inferred← citeshttps://doi.org/10.1023/a:1009763020645openalex-snapshot
Moments of Inertia and Graph Separators
inferred← citeshttps://doi.org/10.1080/104077902753540998openalex-snapshot
CURRENT VIEWS ON GRID GENERATION: SUMMARIES OF A PANEL DISCUSSION
inferred← citeshttps://doi.org/10.1080/10637199608915544openalex-snapshot
COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗
inferred← citeshttps://doi.org/10.1109/71.993202openalex-snapshot
An efficient partitioning algorithm for distributed virtual environment systems
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400533openalex-snapshot
A simulation-based method for aggregating Markov chains
inferred← citeshttps://doi.org/10.1109/hicss.1994.323237openalex-snapshot
Experience with automatic, dynamic load balancing and adaptive finite element computation
inferred← citeshttps://doi.org/10.1109/icdata58816.2023.00038openalex-snapshot
New Distributed Partitioning Approach for Large Spatial Networks
inferred← citeshttps://doi.org/10.1109/iciafs.2014.7069608openalex-snapshot
A first step towards resilient graph partitioning for electrical grids
inferred← citeshttps://doi.org/10.1109/simsym.1999.766459openalex-snapshot
Parallelization of SHIFT simulation environment
inferred← citeshttps://doi.org/10.1109/tro.2004.829480openalex-snapshot
Improving Efficiency in Mobile Robot Task Planning Through World Abstraction
inferred← citeshttps://doi.org/10.1145/169627.169638openalex-snapshot
A massively parallel adaptive finite element method with dynamic load balancing
inferred← citeshttps://doi.org/10.1145/3205289.3205304openalex-snapshot
Dynamic Load Balancing for Compressible Multiphase Turbulence
inferred← citeshttps://doi.org/10.1145/996546.996554openalex-snapshot
Experiments on the minimum linear arrangement problem
inferred← citeshttps://doi.org/10.3390/en9070543openalex-snapshot
Electricity Self-Sufficient Community Clustering for Energy Resilience
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.