On the public citation graph
A Dynamical Systems Approach to Weighted Graph Matching
0 signed · 35 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/11561071_75openalex-snapshot
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem
inferredcites →https://doi.org/10.1007/978-1-4471-3467-1openalex-snapshot
Optimization and Dynamical Systems
inferredcites →https://doi.org/10.1007/978-1-4757-3155-2_7openalex-snapshot
Semidefinite Programming Approaches to the Quadratic Assignment Problem
inferredcites →https://doi.org/10.1007/s002200050140openalex-snapshot
Double Bracket Equations and Geodesic Flows on Symmetric Spaces
inferredcites →https://doi.org/10.1016/0024-3795(89)90675-7openalex-snapshot
Least squares matching problems
inferredcites →https://doi.org/10.1016/0024-3795(91)90021-nopenalex-snapshot
Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
inferredcites →https://doi.org/10.1016/0362-546x(92)90157-aopenalex-snapshot
Matrix differential equations: a continuous realization process for linear algebra problems
inferredcites →https://doi.org/10.1016/j.amc.2004.08.039openalex-snapshot
Connectivity graphs as models of local interactions
inferredcites →https://doi.org/10.1109/34.491619openalex-snapshot
A graduated assignment algorithm for graph matching
inferredcites →https://doi.org/10.1109/34.6778openalex-snapshot
An eigendecomposition approach to weighted graph matching problems
inferredcites →https://doi.org/10.1109/72.548165openalex-snapshot
A Lagrangian relaxation network for graph matching.
inferredcites →https://doi.org/10.1109/acc.2007.4282420openalex-snapshot
Target assignment for robotic networks: Asymptotic performance under limited communication
inferredcites →https://doi.org/10.1109/cdc.2003.1271796openalex-snapshot
Agreement problems in networks with directed graphs and switching topology
inferredcites →https://doi.org/10.1109/cdc.2003.1272825openalex-snapshot
The multi-agent rendezvous problem
inferredcites →https://doi.org/10.1109/cdc.2005.1582595openalex-snapshot
On synchronous robotic networks Part I: Models, tasks and complexity notions
inferredcites →https://doi.org/10.1109/cdc.2007.4434527openalex-snapshot
Distributed formation control with permutation symmetries
inferredcites →https://doi.org/10.1109/tac.2003.812781openalex-snapshot
Coordination of groups of mobile autonomous agents using nearest neighbor rules
inferredcites →https://doi.org/10.1109/tac.2005.843858openalex-snapshot
On State-dependent dynamic graphs and their controllability properties
inferredcites →https://doi.org/10.1109/tac.2007.895948openalex-snapshot
Flocking in Fixed and Switching Networks
inferredcites →https://doi.org/10.1109/tro.2007.900642openalex-snapshot
Potential Fields for Maintaining Connectivity of Mobile Networks
inferredcites →https://doi.org/10.1137/0727062openalex-snapshot
The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
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-319-26706-7_15openalex-snapshot
Synergy-Based Optimal Sensing Techniques for Hand Pose Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_85openalex-snapshot
Distributed Hybrid Control for Multiple-Pursuer Multiple-Evader Games
inferred← citeshttps://doi.org/10.1007/978-3-642-22606-9_50openalex-snapshot
Assignment and Navigation Framework for Multiple Travelling Robots
inferred← citeshttps://doi.org/10.1016/j.automatica.2008.04.009openalex-snapshot
A dynamical systems approach to weighted graph matching
inferred← citeshttps://doi.org/10.1109/acc.2007.4282723openalex-snapshot
Dynamic Assignment in Distributed Motion Planning with Limited Information
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434527openalex-snapshot
Distributed formation control with permutation symmetries
inferred← citeshttps://doi.org/10.1109/crv.2010.42openalex-snapshot
Fall in! Sorting a Group of Robots with a Continuous Controller
inferred← citeshttps://doi.org/10.1109/robot.2007.363987openalex-snapshot
Sensor-Based Dynamic Assignment in Distributed Motion Planning
inferred← citeshttps://doi.org/10.1109/robot.2008.4543197openalex-snapshot
Distributed multi-robot task assignment and formation control
inferred← citeshttps://doi.org/10.1109/tro.2007.913992openalex-snapshot
Dynamic Assignment in Distributed Motion Planning With Local Coordination
inferred← citeshttps://doi.org/10.1155/2013/495653openalex-snapshot
Address Assignment in Indoor Wireless Networks Using Deterministic Channel Simulation
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.1580openalex-snapshot
A New Approach to Weighted Graph Matching
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.