On the public citation graph
Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation
0 signed · 51 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/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2openalex-snapshot
Scalable parallel graph coloring algorithms
inferredcites →https://doi.org/10.1007/11557654_90openalex-snapshot
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
inferredcites →https://doi.org/10.1007/3-540-45706-2_130openalex-snapshot
Parallel Distance-k Coloring Algorithms for Numerical Optimization
inferredcites →https://doi.org/10.1007/bf01759077openalex-snapshot
Heuristics for rapidly four-coloring large planar graphs
inferredcites →https://doi.org/10.1007/bf02592052openalex-snapshot
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
inferredcites →https://doi.org/10.1007/bf02612334openalex-snapshot
Estimation of sparse hessian matrices and graph coloring problems
inferredcites →https://doi.org/10.1016/0167-8191(94)90004-3openalex-snapshot
Scalable iterative solution of sparse linear systems
inferredcites →https://doi.org/10.1016/j.jpdc.2007.08.002openalex-snapshot
A framework for scalable greedy coloring on distributed-memory parallel computers
inferredcites →https://doi.org/10.1023/a:1012311216333openalex-snapshot
Models and Approximation Algorithms for Channel Assignment in Radio Networks
inferredcites →https://doi.org/10.1093/imamat/13.1.117openalex-snapshot
On the Estimation of Sparse Jacobian Matrices
inferredcites →https://doi.org/10.1109/5992.988653openalex-snapshot
Zoltan data management services for parallel dynamic applications
inferredcites →https://doi.org/10.1109/71.780863openalex-snapshot
Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication
inferredcites →https://doi.org/10.1137/050639879openalex-snapshot
New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
inferredcites →https://doi.org/10.1137/0716078openalex-snapshot
On the Estimation of Sparse Hessian Matrices
inferredcites →https://doi.org/10.1137/0720013openalex-snapshot
Estimation of Sparse Jacobian Matrices and Graph Coloring Problems
inferredcites →https://doi.org/10.1137/0917054openalex-snapshot
ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
inferredcites →https://doi.org/10.1137/s003614450342480openalex-snapshot
The Structure and Function of Complex Networks
inferredcites →https://doi.org/10.1137/s0036144504444711openalex-snapshot
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
inferredcites →https://doi.org/10.1137/s0895479899358194openalex-snapshot
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
inferredcites →https://doi.org/10.1137/s0895480100367950openalex-snapshot
Coloring Powers of Planar Graphs
inferredcites →https://doi.org/10.1137/s1064827500376193openalex-snapshot
A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1065895.1065899openalex-snapshot
Metrics and models for reordering transformations
inferredcites →https://doi.org/10.1287/ijoc.1080.0286openalex-snapshot
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
inferredcites →https://doi.org/10.5860/choice.42-1605openalex-snapshot
Parallel scientific computation: a structured approach using BSP and MPI
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-030-39219-2_1openalex-snapshot
Complexity of Restricted Variant of Star Colouring
inferred← citeshttps://doi.org/10.1007/978-3-642-23397-5_24openalex-snapshot
New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures
inferred← citeshttps://doi.org/10.1007/s10589-018-00057-7openalex-snapshot
A framework for parallel second order incremental optimization algorithms for solving partially separable problems
inferred← citeshttps://doi.org/10.1007/s11227-022-04894-6openalex-snapshot
High-performance and balanced parallel graph coloring on multicore platforms
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.015openalex-snapshot
The complexity of restricted star colouring
inferred← citeshttps://doi.org/10.1016/j.dam.2022.09.020openalex-snapshot
A characterization of graphs with regular distance-2 graphs
inferred← citeshttps://doi.org/10.1016/j.parco.2012.07.001openalex-snapshot
Graph coloring algorithms for multi-core and massively multithreaded architectures
inferred← citeshttps://doi.org/10.1016/j.parco.2017.12.004openalex-snapshot
A distributed-memory hierarchical solver for general sparse linear systems
inferred← citeshttps://doi.org/10.1080/00295639.2024.2344956openalex-snapshot
A Parallel Coloring Newton-Krylov Method for Multiphysics Coupling System in Nuclear Reactors
inferred← citeshttps://doi.org/10.1109/ia351965.2020.00013openalex-snapshot
Distributed Memory Graph Coloring Algorithms for Multiple GPUs
inferred← citeshttps://doi.org/10.1109/icpp.2017.59openalex-snapshot
Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures
inferred← citeshttps://doi.org/10.1109/ipdps.2012.64openalex-snapshot
ShyLU: A Hybrid-Hybrid Solver for Multicore Platforms
inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00019openalex-snapshot
Parallel Louvain Algorithms with Convergence Guarantee
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00103openalex-snapshot
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
inferred← citeshttps://doi.org/10.1137/120881452openalex-snapshot
Hierarchical Probing for Estimating the Trace of the Matrix Inverse on Toroidal Lattices
inferred← citeshttps://doi.org/10.1145/3399732openalex-snapshot
A Recursive Algebraic Coloring Technique for Hardware-efficient Symmetric Sparse Matrix-vector Multiplication
inferred← citeshttps://doi.org/10.1155/2012/713587openalex-snapshot
The Zoltan and Isorropia Parallel Toolkits for Combinatorial Scientific Computing: Partitioning, Ordering and Coloring
inferred← citeshttps://doi.org/10.1201/b11644-14openalex-snapshot
Parallel Partitioning, Coloring and Ordering in Scientific Computing
inferred← citeshttps://doi.org/10.12681/eadd/52494openalex-snapshot
Accelerating irregular applications via efficient synchronization and data access techniques
inferred← citeshttps://doi.org/10.2514/1.j062802openalex-snapshot
An Assessment of the Laminar Hypersonic Double-Cone Experiments in the LENS-XX Tunnel
inferred← citeshttps://doi.org/10.2514/6.2023-0856openalex-snapshot
An Assessment of the Laminar Hypersonic Double-Cone Experiments in the LENS-XX Tunnel
inferred← citeshttps://doi.org/10.26083/tuprints-00017951openalex-snapshot
Irregularity mitigation and portability abstractions for accelerated sparse matrix factorization
inferred← citeshttps://doi.org/10.4018/978-1-7998-7156-9.ch005openalex-snapshot
Paradigms for Effective Parallelization of Inherently Sequential Graph Algorithms on Multi-Core Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1205.3809openalex-snapshot
Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1509.01698openalex-snapshot
HAMSI: A Parallel Incremental Optimization Algorithm Using Quadratic Approximations for Solving Partially Separable Problems
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.