On the public citation graph
Engineering a Combinatorial Laplacian Solver: Lessons Learned
0 signed · 56 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.1007/11823285_24openalex-snapshot
A Parallel Shape Optimizing Load Balancer
inferredcites →https://doi.org/10.1007/978-3-319-20086-6_16openalex-snapshot
Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
inferredcites →https://doi.org/10.1007/978-3-319-27261-0_3openalex-snapshot
Drawing Large Graphs by Multilevel Maxent-Stress Optimization
inferredcites →https://doi.org/10.1007/s10092-014-0123-yopenalex-snapshot
Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/j.amc.2015.08.033openalex-snapshot
Accelerated multigrid for graph Laplacian operators
inferredcites →https://doi.org/10.1016/j.cviu.2011.05.013openalex-snapshot
Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing
inferredcites →https://doi.org/10.1016/s0167-8191(99)00018-6openalex-snapshot
Efficient schemes for nearest neighbor load balancing
inferredcites →https://doi.org/10.1016/s0898-1221(98)00191-6openalex-snapshot
Efficient approximate solution of sparse linear systems
inferredcites →https://doi.org/10.1017/nws.2016.20openalex-snapshot
NetworKit: A tool suite for large-scale complex network analysis
inferredcites →https://doi.org/10.1109/focs.2008.62openalex-snapshot
Nearly Tight Low Stretch Spanning Trees
inferredcites →https://doi.org/10.1109/focs.2009.75openalex-snapshot
Faster Generation of Random Spanning Trees
inferredcites →https://doi.org/10.1109/tpami.2006.57openalex-snapshot
Isoperimetric graph partitioning for image segmentation
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/0111030openalex-snapshot
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/040611781openalex-snapshot
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
inferredcites →https://doi.org/10.1137/0612048openalex-snapshot
A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
inferredcites →https://doi.org/10.1137/080734029openalex-snapshot
Graph Sparsification by Effective Resistances
inferredcites →https://doi.org/10.1137/1.9780898718003openalex-snapshot
Iterative Methods for Sparse Linear Systems
inferredcites →https://doi.org/10.1137/1.9780898719505openalex-snapshot
A Multigrid Tutorial, Second Edition
inferredcites →https://doi.org/10.1137/1.9781611971446openalex-snapshot
Applied Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/110843563openalex-snapshot
Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
inferredcites →https://doi.org/10.1137/110845914openalex-snapshot
Approaching Optimality for Solving SDD Linear Systems
inferredcites →https://doi.org/10.1137/s0097539792224474openalex-snapshot
A Graph-Theoretic Game and Its Application to the k -Server Problem
inferredcites →https://doi.org/10.1145/1007352.1007372openalex-snapshot
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
inferredcites →https://doi.org/10.1145/1993636.1993674openalex-snapshot
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
inferredcites →https://doi.org/10.1145/2213977.2214015openalex-snapshot
Using petal-decompositions to build a low stretch spanning tree
inferredcites →https://doi.org/10.1145/2488608.2488724openalex-snapshot
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
inferredcites →https://doi.org/10.1145/2612669.2612676openalex-snapshot
Simple parallel and distributed algorithms for spectral graph sparsification
inferredcites →https://doi.org/10.1177/109434200001400303openalex-snapshot
A Portable Programming Interface for Performance Evaluation on Modern Processors
inferredcites →https://doi.org/10.2478/ijnaoe-2013-0011openalex-snapshot
OpenFOAM : Open source CFD in research and industry
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.266openalex-snapshot
Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_1openalex-snapshot
Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit
inferred← citeshttps://doi.org/10.1007/s00453-023-01154-8openalex-snapshot
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
inferred← citeshttps://doi.org/10.1017/9781316888568.003openalex-snapshot
Preliminaries: Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.005openalex-snapshot
Global Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.006openalex-snapshot
More Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.007openalex-snapshot
Minimum-Cost Circulation Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.008openalex-snapshot
Generalized Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.009openalex-snapshot
Multicommodity Flow Algorithms
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00158openalex-snapshot
GPU-LSolve: An Efficient GPU-Based Laplacian Solver for Million-Scale Graphs
inferred← citeshttps://doi.org/10.1137/16m1109965openalex-snapshot
A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations
inferred← citeshttps://doi.org/10.1137/21m1439390openalex-snapshot
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory
inferred← citeshttps://doi.org/10.1137/24m1673577openalex-snapshot
AC(\({k}\)): Robust Solution of Laplacian Equations by Randomized Approximate Cholesky Factorization
inferred← citeshttps://doi.org/10.1515/itit-2019-0032openalex-snapshot
Scaling up network centrality computations – A brief overview
inferred← citeshttps://doi.org/10.23919/date.2019.8714773openalex-snapshot
Scaling up Network Centrality Computations
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.