On the public citation graph
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
0 signed · 149 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/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1093/imamat/13.1.117openalex-snapshot
On the Estimation of Sparse Jacobian Matrices
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471224561.ch16openalex-snapshot
Broadcast Scheduling for TDMA in Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1002/fld.5236openalex-snapshot
Physics‐based preconditioning of Jacobian‐free Newton–Krylov solver for Navier–Stokes equations using nodal integral method
inferred← citeshttps://doi.org/10.1002/net.20154openalex-snapshot
ApproximateL(δ1,δ2,…,δt)‐coloring of trees and interval graphs
inferred← citeshttps://doi.org/10.1002/net.20257openalex-snapshot
On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
inferred← citeshttps://doi.org/10.1006/jpdc.2002.1860openalex-snapshot
Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees
inferred← citeshttps://doi.org/10.1007/11429647_7openalex-snapshot
On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/11557654_90openalex-snapshot
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
inferred← citeshttps://doi.org/10.1007/11780823_21openalex-snapshot
L(h,1,1)-Labeling of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_35openalex-snapshot
Mappings for Conflict-Free Access of Paths in Elementary Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_6openalex-snapshot
On Radiocoloring Hierarchically Specified Planar Graphs: $$ \mathcal{P}\mathcal{S}\mathcal{P}\mathcal{A}\mathcal{C}\mathcal{E} $$ -Completeness and Approximations
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_130openalex-snapshot
Parallel Distance-k Coloring Algorithms for Numerical Optimization
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_77openalex-snapshot
The file distribution problem for processor networks
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_30openalex-snapshot
Graph Domination, Coloring and Cliques in Telecommunications
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_9openalex-snapshot
Graph Theoretic Clique Relaxations and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_9-1openalex-snapshot
Degree and Distance-Based Clique Relaxations
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_15openalex-snapshot
The Complexity of L(p, q)-Edge-Labelling
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_8openalex-snapshot
On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
inferred← citeshttps://doi.org/10.1007/978-3-319-51317-1_2openalex-snapshot
Introduction to Nonlinear Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-51317-1_9openalex-snapshot
Practical Implementation Aspects of Large-Scale Optimal Control Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_21openalex-snapshot
Strong Colorings of Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_13openalex-snapshot
Channel Assignment in Honeycomb Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-71351-7_21openalex-snapshot
Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_11openalex-snapshot
On the L(h,k)-Labeling of Co-comparability Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36092-3_11openalex-snapshot
Pseudo-scheduling: A New Approach to the Broadcast Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_36openalex-snapshot
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
inferred← citeshttps://doi.org/10.1007/bf02592219openalex-snapshot
Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
inferred← citeshttps://doi.org/10.1007/bf02612334openalex-snapshot
Estimation of sparse hessian matrices and graph coloring problems
inferred← citeshttps://doi.org/10.1007/s00186-008-0261-6openalex-snapshot
L(h, 1, 1)-labeling of outerplanar graphs
inferred← citeshttps://doi.org/10.1007/s00446-007-0053-xopenalex-snapshot
Contention-free MAC protocols for asynchronous wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s00453-023-01120-4openalex-snapshot
The Complexity of L(p, q)-Edge-Labelling
inferred← citeshttps://doi.org/10.1007/s10878-022-00942-2openalex-snapshot
Further results on 2-distance coloring of graphs
inferred← citeshttps://doi.org/10.1007/s11390-005-0797-3openalex-snapshot
QoS Support in TDMA-Based Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/s13278-014-0228-yopenalex-snapshot
Coloring large complex networks
inferred← citeshttps://doi.org/10.1007/s40065-021-00311-7openalex-snapshot
The complexity of frugal colouring
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/j.comnet.2007.11.013openalex-snapshot
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks
inferred← citeshttps://doi.org/10.1016/j.dam.2004.03.001openalex-snapshot
A polynomial time algorithm for strong edge coloring of partial k-trees
inferred← citeshttps://doi.org/10.1016/j.dam.2006.07.018openalex-snapshot
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.010openalex-snapshot
Graph models and their efficient implementation for sparse Jacobian matrix determination
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.012openalex-snapshot
An 8-approximation algorithm for L ( 2 , 1 ) -labeling of unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.028openalex-snapshot
The complexity of the L(p,q) -labeling problem for bipartite planar graphs of small degree
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.02.002openalex-snapshot
On inclusionwise maximal and maximum cardinality k -clubs in graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.03.003openalex-snapshot
Optimal -labeling of eight-regular grids
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.07.026openalex-snapshot
Strong edge-colouring and induced matchings
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.06.006openalex-snapshot
Channel assignment for interference avoidance in honeycomb wireless networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.06.004openalex-snapshot
Conflict-free star-access in parallel memory systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.026openalex-snapshot
On distance constrained labeling of disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.023openalex-snapshot
Graph clustering via generalized colorings
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116262openalex-snapshot
Complexity and algorithms for subset square coloring in subclasses of chordal graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00237-2openalex-snapshot
On the computational complexity of strong edge coloring
inferred← citeshttps://doi.org/10.1017/s0962492919000035openalex-snapshot
Approximation algorithms in combinatorial scientific computing
inferred← citeshttps://doi.org/10.1017/s0963548301004965openalex-snapshot
The Chromatic Number of Graph Powers
inferred← citeshttps://doi.org/10.1023/a:1012311216333openalex-snapshot
Models and Approximation Algorithms for Channel Assignment in Radio Networks
inferred← citeshttps://doi.org/10.1023/a:1019128411323openalex-snapshot
A new model for scheduling packet radio networks
inferred← citeshttps://doi.org/10.1038/s41598-025-96645-9openalex-snapshot
Acyclic and star coloring parameters of fractal cubic networks
inferred← citeshttps://doi.org/10.1080/00207160.2016.1188922openalex-snapshot
On (s,t)-relaxed L(1,1)-labelling of trees
inferred← citeshttps://doi.org/10.1080/10556788.2011.606575openalex-snapshot
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring
inferred← citeshttps://doi.org/10.1080/10556788.2012.693927openalex-snapshot
Optimal direct determination of sparse Jacobian matrices
inferred← citeshttps://doi.org/10.1080/10556788.2018.1458849openalex-snapshot
Pattern graph for sparse Hessian matrix determination
inferred← citeshttps://doi.org/10.1080/10556789808805700openalex-snapshot
Computing a sparse Jacobian matrix by rows and columns
inferred← citeshttps://doi.org/10.1088/1751-8113/41/32/324023openalex-snapshot
Minimizing unsatisfaction in colourful neighbourhoods
inferred← citeshttps://doi.org/10.1090/s0025-5718-1984-0744925-5openalex-snapshot
Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0001openalex-snapshot
Glossary of Symbols
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0005openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0002openalex-snapshot
Sparse matrices: storage schemes and simple operations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0003openalex-snapshot
Gaussian elimination for dense matrices: the algebraic problem
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0004openalex-snapshot
Gaussian elimination for dense matrices: numerical considerations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0005openalex-snapshot
Gaussian elimination for sparse matrices: an introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0006openalex-snapshot
Reduction to block triangular form
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0007openalex-snapshot
Local pivotal strategies for sparse matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0008openalex-snapshot
Ordering sparse matrices for band solution
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0009openalex-snapshot
Orderings based on dissection
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0010openalex-snapshot
Implementing Gaussian elimination without symbolic factorize
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0011openalex-snapshot
Implementing Gaussian elimination with symbolic factorize
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0012openalex-snapshot
Gaussian elimination using trees
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0013openalex-snapshot
Graphs for symmetric and unsymmetric matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0014openalex-snapshot
The solve phase
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0015openalex-snapshot
Other sparsity-oriented issues
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0001openalex-snapshot
Matrix and vector norms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0002openalex-snapshot
Pictures of sparse matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0003openalex-snapshot
Solutions to selected exercises
inferred← citeshttps://doi.org/10.1093/comjnl/bxl018openalex-snapshot
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
inferred← citeshttps://doi.org/10.1093/comjnl/bxr037openalex-snapshot
The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography
inferred← citeshttps://doi.org/10.1109/dmcc.1991.633304openalex-snapshot
Structured Decompositions for Solving Sparse Nonlinear Systems of Equations on Parallel Computers
inferred← citeshttps://doi.org/10.1109/glocom.2014.7037294openalex-snapshot
Distributed Bayesian hybrid power state estimation with PMU synchronization errors
inferred← citeshttps://doi.org/10.1109/icci.1992.227702openalex-snapshot
On the complexity of distance-2 coloring
inferred← citeshttps://doi.org/10.1109/icpads.2006.31openalex-snapshot
Coloring the Internet: IP traceback
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016599openalex-snapshot
Channel assignment with separation for special classes of wireless networks: grids and rings
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213408openalex-snapshot
Channel assignment on strongly-simplicial graphs
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302970openalex-snapshot
Star-coloring of graphs for conflict-free access to parallel memory systems
inferred← citeshttps://doi.org/10.1109/itcc.2005.201openalex-snapshot
Mobile agent based TDMA slot assignment algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/percom.2006.45openalex-snapshot
Resource Allocation in Wireless Networks Using Directional Antennas
inferred← citeshttps://doi.org/10.1109/tpds.2003.1189581openalex-snapshot
Channel assignment with separation for interference avoidance in wireless networks
inferred← citeshttps://doi.org/10.1109/tpds.2009.171openalex-snapshot
Resource Scheduling in Wireless Networks Using Directional Antennas
inferred← citeshttps://doi.org/10.1109/tsp.2014.2332438openalex-snapshot
Distributed Hybrid Power State Estimation Under PMU Sampling Phase Errors
inferred← citeshttps://doi.org/10.1109/wcnc.2005.1424571openalex-snapshot
Exploiting processing gain in wireless ad hoc networks using synchronous collision resolution* medium access control schemes
inferred← citeshttps://doi.org/10.1109/wcnc.2005.1424854openalex-snapshot
Enhancing cellular multicast performance using ad hoc networks
inferred← citeshttps://doi.org/10.1137/040610908openalex-snapshot
Preconditioners for Generalized Saddle-Point Problems
inferred← citeshttps://doi.org/10.1137/050639879openalex-snapshot
New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
inferred← citeshttps://doi.org/10.1137/0607026openalex-snapshot
The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
inferred← citeshttps://doi.org/10.1137/080732158openalex-snapshot
Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation
inferred← citeshttps://doi.org/10.1137/0905039openalex-snapshot
Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
inferred← citeshttps://doi.org/10.1137/0905041openalex-snapshot
Sparse Matrix Methods in Optimization
inferred← citeshttps://doi.org/10.1137/s0036144504444711openalex-snapshot
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
inferred← citeshttps://doi.org/10.1137/s0895480100367950openalex-snapshot
Coloring Powers of Planar Graphs
inferred← citeshttps://doi.org/10.1142/s0129626410000028openalex-snapshot
SCHEDULING SENSORS BY TILING LATTICES
inferred← citeshttps://doi.org/10.1142/s1793830920500214openalex-snapshot
2-Distance chromatic number of some graph products
inferred← citeshttps://doi.org/10.1145/3299869.3324962openalex-snapshot
Distance-generalized Core Decomposition
inferred← citeshttps://doi.org/10.1145/345848.345853openalex-snapshot
Efficient use of radio spectrum in wireless networks with channel separation between close stations
inferred← citeshttps://doi.org/10.1145/3728460openalex-snapshot
Approximating large-scale Hessian matrices using secant equations
inferred← citeshttps://doi.org/10.1201/9781420013825.ch10openalex-snapshot
Channel Assignment in Wireless Local Area Networks
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0286openalex-snapshot
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
inferred← citeshttps://doi.org/10.1371/journal.pone.0191917openalex-snapshot
Reducing vertices in property graphs
inferred← citeshttps://doi.org/10.14778/3461535.3461542openalex-snapshot
Local algorithms for distance-generalized core decomposition over large dynamic graphs
inferred← citeshttps://doi.org/10.1504/ijmndi.2006.010813openalex-snapshot
Approximating the L(h, k)-labelling problem
inferred← citeshttps://doi.org/10.15803/ijnc.4.2_251openalex-snapshot
Algorithmic aspects of distance constrained labeling: a survey
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11588openalex-snapshot
Learning the Behavior of a Dynamical System Via a “20 Questions” Approach
inferred← citeshttps://doi.org/10.18178/jacn.2016.4.1.201openalex-snapshot
Top-Down TDMA Scheduling Algorithm in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.21236/ada421724openalex-snapshot
Incremental Negotiation and Coalition Formation for Resource-Bounded Agents
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-6openalex-snapshot
A Study of $k$-dipath Colourings of Oriented Graphs
inferred← citeshttps://doi.org/10.23860/diss-joseph-shaun-2011openalex-snapshot
RELAXATIONS OF L(1, 1)-LABELING FOR THE BROADCAST SCHEDULING PROBLEM
inferred← citeshttps://doi.org/10.2991/ijndc.2013.1.1.3openalex-snapshot
OSERENA: a Coloring Algorithm Optimized for Dense Wireless Networks
inferred← citeshttps://doi.org/10.31274/etd-180810-172openalex-snapshot
A composable approach to design of newer techniques for large-scale denial-of-service attack attribution
inferred← citeshttps://doi.org/10.3156/jfuzzy.12.5_52openalex-snapshot
An Evolutionary Algorithm for Graph Coloring Problems
inferred← citeshttps://doi.org/10.3233/jhs-1993-2405openalex-snapshot
Efficient Distributed Algorithms for Channel Assignment in Multihop Radio Networks
inferred← citeshttps://doi.org/10.3390/s90604766openalex-snapshot
Optimization-Based Channel Constrained Data Aggregation Routing Algorithms in Multi-Radio Wireless Sensor Networks
inferred← citeshttps://doi.org/10.37236/8220openalex-snapshot
Tree-Like Distance Colouring for Planar Graphs of Sufficient Girth
inferred← citeshttps://doi.org/10.3929/ethz-a-010596095openalex-snapshot
Anonymous Distributed Computing: Computability, Randomization and Checkability
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.4304/jcm.1.1.26-37openalex-snapshot
Enabling Secondary Spectrum Markets Using Ad Hoc and Mesh Networking Protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1110.1560openalex-snapshot
On the Coloring of Grid Wireless Sensor Networks: the Vector-Based Coloring Method
inferred← citeshttps://doi.org/10.48550/arxiv.1111.0855openalex-snapshot
OSERENA, an Optimized Coloring Algorithm for Dense or Large Scale Wireless Networks
inferred← citeshttps://doi.org/10.5555/338219.338619openalex-snapshot
Coloring powers of planar graphs
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.