On the public citation graph
Input addition and leader selection for the controllability of graph-based systems
0 signed · 116 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-3-642-61586-3openalex-snapshot
Systems Analysis by Graphs and Matroids
inferredcites →https://doi.org/10.1016/j.automatica.2009.03.011openalex-snapshot
State and input observability recovering by additional sensor implementation: A graph-theoretic approach
inferredcites →https://doi.org/10.1016/j.automatica.2011.02.051openalex-snapshot
Leader localization in multi-agent systems subject to failure: A graph-theoretic approach
inferredcites →https://doi.org/10.1016/s0005-1098(03)00104-3openalex-snapshot
Generic properties and control of linear structured systems: a survey
inferredcites →https://doi.org/10.1038/nature10011openalex-snapshot
Controllability of complex networks
inferredcites →https://doi.org/10.1109/cdc.2005.1583321openalex-snapshot
Observability recovering by additional sensor implementation in linear structured systems
inferredcites →https://doi.org/10.1109/cdc.2011.6161347openalex-snapshot
Topological conditions for wireless control networks
inferredcites →https://doi.org/10.1109/icca.2013.6564892openalex-snapshot
Input addition for the controllability of graph-based systems
inferredcites →https://doi.org/10.1109/tac.2008.928307openalex-snapshot
Observability Preservation Under Sensor Failure
inferredcites →https://doi.org/10.1109/tac.2010.2088690openalex-snapshot
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
inferredcites →https://doi.org/10.1137/060674909openalex-snapshot
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
inferredcites →https://doi.org/10.3182/20130204-3-fr-2033.00120openalex-snapshot
Controllability through input addition for graph-based systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/oca.2337openalex-snapshot
Key‐nodes selection problem for minimum cost control of directed networks
inferred← citeshttps://doi.org/10.1002/rnc.3379openalex-snapshot
Any dynamical system is fully accessible through one single actuator and related problems
inferred← citeshttps://doi.org/10.1007/978-3-662-47824-0_13openalex-snapshot
Towards Structural Controllability of Temporal Complex Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-48365-7_42openalex-snapshot
Strong Structural Controllability and Leader Selection for Multi-agent Systems with Unidirectional Topology
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.10.121openalex-snapshot
On the controllability and observability of networked dynamic systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2015.06.022openalex-snapshot
On the complexity of the constrained input selection problem for structural linear systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2016.02.005openalex-snapshot
Minimum cost input/output design for large-scale linear structural systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2016.07.021openalex-snapshot
Nodes selection strategy in cooperative tracking problem
inferred← citeshttps://doi.org/10.1016/j.automatica.2018.04.027openalex-snapshot
Minimal inputs/outputs for subsystems in a networked system
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.05.002openalex-snapshot
Approximating constrained minimum cost input–output selection for generic arbitrary pole placement in structured systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2020.108900openalex-snapshot
Characterizing controllable subspace and herdability of signed weighted networks via graph partition
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110229openalex-snapshot
An overview of structural systems theory
inferred← citeshttps://doi.org/10.1016/j.automatica.2022.110334openalex-snapshot
Leader selection in networks under switching topologies with antagonistic interactions
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111308openalex-snapshot
On polynomially solvable constrained input selections for fixed and switched linear structured systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111507openalex-snapshot
Controllability of networked multiagent systems based on linearized Turing’s model
inferred← citeshttps://doi.org/10.1016/j.automatica.2026.113074openalex-snapshot
On the NP-hardness of the robust minimal structural controllability problem
inferred← citeshttps://doi.org/10.1016/j.ejcon.2024.101077openalex-snapshot
Output null controllability for linear time-invariant structured discrete-time systems: A graph theoretic condition
inferred← citeshttps://doi.org/10.1016/j.ejcon.2026.101573openalex-snapshot
Dynamics augmentation for robust structural controllability of bidirected networks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.10.309openalex-snapshot
Complexity of the Minimum Input Selection Problem for Structural Controllability
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.10.321openalex-snapshot
Sparsest Minimum Multiple-Cost Structural Leader Selection
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.1410openalex-snapshot
A driver node selection strategy for minimizing the control energy in complex networks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.1549openalex-snapshot
Topological aspects of controlling large scale networks with unilateral inputs
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.1552openalex-snapshot
Minimum energy control for networks of coupled harmonic oscillators
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.2078openalex-snapshot
Identification of critical node clusters for consensus in large-scale spatial networks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.10.166openalex-snapshot
Application of multi-agent consistency analysis based on finite state machine in driverless vehicles formation control
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.06.179openalex-snapshot
Port selection for optimal charging/discharging and external communication in single-integrator graphs networks
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2025.107838openalex-snapshot
A distributed framework for the minimum cost problem based on graph decomposition
inferred← citeshttps://doi.org/10.1016/j.sysconle.2015.03.010openalex-snapshot
The single-input Minimal Controllability Problem for structured systems
inferred← citeshttps://doi.org/10.1016/j.sysconle.2017.01.002openalex-snapshot
On the fixed controllable subspace in linear structured systems
inferred← citeshttps://doi.org/10.1016/j.sysconle.2018.06.008openalex-snapshot
On structural behavioural controllability of linear discrete time systems with delays
inferred← citeshttps://doi.org/10.1038/s41598-017-01846-6openalex-snapshot
Controllability of complex networks with unilateral inputs
inferred← citeshttps://doi.org/10.1038/s41598-024-57181-0openalex-snapshot
The impact of input node placement in the controllability of structural brain networks
inferred← citeshttps://doi.org/10.1063/1.5119974openalex-snapshot
Toward optimizing control signal paths in functional brain networks
inferred← citeshttps://doi.org/10.1080/00207179.2015.1110756openalex-snapshot
Controllability of heterogeneous multi-agent systems under directed and weighted topology
inferred← citeshttps://doi.org/10.1080/00207179.2019.1610909openalex-snapshot
Controllable containment control of multi-agent systems based on hierarchical clustering
inferred← citeshttps://doi.org/10.1103/physreve.94.032316openalex-snapshot
Controllability of multiplex, multi-time-scale networks
inferred← citeshttps://doi.org/10.1109/acc.2015.7171040openalex-snapshot
Minimal actuator placement with optimal control constraints
inferred← citeshttps://doi.org/10.1109/acc.2015.7171062openalex-snapshot
Minimum input selection for structural controllability
inferred← citeshttps://doi.org/10.1109/acc.2015.7171858openalex-snapshot
On the controllability of networked dynamic systems with bounded inputs
inferred← citeshttps://doi.org/10.1109/acc.2015.7171972openalex-snapshot
Minimum cost constrained input-output and control configuration co-design problem: A structural systems approach
inferred← citeshttps://doi.org/10.1109/acc.2016.7526685openalex-snapshot
Controllability of Networked Dynamic Systems with Autonomous Subsystems
inferred← citeshttps://doi.org/10.1109/access.2020.2975894openalex-snapshot
Stabilizability and Bipartite Containment Control of Multi-Agent Systems Over Signed Directed Graphs
inferred← citeshttps://doi.org/10.1109/cac.2017.8243620openalex-snapshot
Improving network stability via edge removal
inferred← citeshttps://doi.org/10.1109/ccdc.2017.7979466openalex-snapshot
A neuroendocrine inspired dynamic leader selection model in formation control for multi-robot system
inferred← citeshttps://doi.org/10.1109/ccdc.2018.8407785openalex-snapshot
Research on consensus problems with second-order sliding mode algorithm in multi-agent systems
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039593openalex-snapshot
Design of communication networks for distributed computation with privacy guarantees
inferred← citeshttps://doi.org/10.1109/cdc.2014.7040261openalex-snapshot
A linear time algorithm to verify strong structural controllability
inferred← citeshttps://doi.org/10.1109/cdc.2015.7401997openalex-snapshot
Distributed leader selection
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029413openalex-snapshot
On the Computation of the Distance-based Lower Bound on Strong Structural Controllability in Networks
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029637openalex-snapshot
Characterizing Herdability of Signed Networks via Graph Walks
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304092openalex-snapshot
Leader Group Selection for Herdability of Structurally Balanced Signed Networks
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683002openalex-snapshot
Actuator Placement for Structural Controllability beyond Strong Connectivity and towards Robustness
inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9992974openalex-snapshot
On Constrained Input Selections for Structured Systems: Polynomially Solvable Cases
inferred← citeshttps://doi.org/10.1109/chicc.2015.7260694openalex-snapshot
Algorithms for determining networks' feasible control schemes
inferred← citeshttps://doi.org/10.1109/chicc.2015.7260703openalex-snapshot
A reinvestigation on the controllability and observability of networked dynamic systems
inferred← citeshttps://doi.org/10.1109/chicc.2015.7260776openalex-snapshot
Controllability of heterogeneous multi-agent systems
inferred← citeshttps://doi.org/10.1109/ecc.2016.7810390openalex-snapshot
Positive controllability of large-scale networks
inferred← citeshttps://doi.org/10.1109/icca.2017.8003140openalex-snapshot
Scheduling algorithm of observation and controlling for multi-agent systems to guarantee structural controllability
inferred← citeshttps://doi.org/10.1109/jas.2023.123504openalex-snapshot
Input Structure Design for Structural Controllability of Complex Networks
inferred← citeshttps://doi.org/10.1109/jsyst.2019.2956501openalex-snapshot
Minimal Driver Nodes for Structural Controllability of Large-Scale Dynamical Systems: Node Classification
inferred← citeshttps://doi.org/10.1109/lcsys.2017.2711787openalex-snapshot
Minimal Inputs/Outputs for a Networked System
inferred← citeshttps://doi.org/10.1109/lcsys.2020.3008325openalex-snapshot
Centrality Measures and the Role of Non-Normality for Network Control Energy Reduction
inferred← citeshttps://doi.org/10.1109/smc.2015.64openalex-snapshot
A Dynamic Leader-Follower Strategy for Multi-robot Systems
inferred← citeshttps://doi.org/10.1109/smc.2017.8122844openalex-snapshot
The functional regions in structural controllability of human functional brain networks
inferred← citeshttps://doi.org/10.1109/tac.2015.2437525openalex-snapshot
A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
inferred← citeshttps://doi.org/10.1109/tac.2018.2886181openalex-snapshot
A Classification of Nodes for Structural Controllability
inferred← citeshttps://doi.org/10.1109/tac.2019.2944381openalex-snapshot
Structural Controllability of Networks With Dynamical Structured Nodes
inferred← citeshttps://doi.org/10.1109/tac.2020.2973774openalex-snapshot
Approximate Supermodularity of Kalman Filter Sensor Selection
inferred← citeshttps://doi.org/10.1109/tac.2020.3017739openalex-snapshot
Energy-Related Controllability of Signed Complex Networks With Laplacian Dynamics
inferred← citeshttps://doi.org/10.1109/tac.2020.3028840openalex-snapshot
Characterizing Energy-Related Controllability of Composite Complex Networks via Graph Product
inferred← citeshttps://doi.org/10.1109/tac.2022.3160682openalex-snapshot
Computation of the Distance-Based Bound on Strong Structural Controllability in Networks
inferred← citeshttps://doi.org/10.1109/tac.2026.3698015openalex-snapshot
Minimal Controllability of Sphere and Torus Grid Graphs
inferred← citeshttps://doi.org/10.1109/tcns.2015.2444031openalex-snapshot
Minimal Actuator Placement With Bounds on Control Effort
inferred← citeshttps://doi.org/10.1109/tcns.2018.2867415openalex-snapshot
Analysis and Design of Actuation–Sensing–Communication Interconnection Structures Toward Secured/Resilient LTI Closed-Loop Systems
inferred← citeshttps://doi.org/10.1109/tcns.2019.2951665openalex-snapshot
Strongly Uncontrollable Network Topologies
inferred← citeshttps://doi.org/10.1109/tcns.2021.3059836openalex-snapshot
Structural Controllability of Directed Signed Networks
inferred← citeshttps://doi.org/10.1109/tcns.2023.3331379openalex-snapshot
Dilation Choice Sets, Dulmage–Mendelsohn Decomposition, and Structural Controllability
inferred← citeshttps://doi.org/10.1109/tcyb.2016.2602358openalex-snapshot
Boundary Constraints for Minimum Cost Control of Directed Networks
inferred← citeshttps://doi.org/10.1109/tcyb.2018.2868470openalex-snapshot
Controllability Ensured Leader Group Selection on Signed Multiagent Networks
inferred← citeshttps://doi.org/10.1109/tcyb.2018.2868507openalex-snapshot
Minimum Cost Control of Directed Networks With Selectable Control Inputs
inferred← citeshttps://doi.org/10.1109/tkde.2023.3331318openalex-snapshot
Network Controllability Perspectives on Graph Representation
inferred← citeshttps://doi.org/10.1109/tnse.2019.2937404openalex-snapshot
Functional Target Controllability of Networks: Structural Properties and Efficient Algorithms
inferred← citeshttps://doi.org/10.1109/tnse.2019.2946535openalex-snapshot
Structural Accessibility and Structural Observability of Nonlinear Networked Systems
inferred← citeshttps://doi.org/10.1109/tnse.2021.3074037openalex-snapshot
Observability of Heterogeneous Multi-Agent Systems
inferred← citeshttps://doi.org/10.1371/journal.pone.0170584openalex-snapshot
Structural Controllability of Temporal Networks with a Single Switching Controller
inferred← citeshttps://doi.org/10.23919/chicc.2019.8865233openalex-snapshot
Configuration Design of Bilinear Networked Systems with Minimum Cost Constraints
inferred← citeshttps://doi.org/10.23919/chicc.2019.8866330openalex-snapshot
Guaranteed Structural Controllability for Networked Systems with Minimum Input/Edge Addition
inferred← citeshttps://doi.org/10.23919/ecc.2018.8550254openalex-snapshot
A Randomized Algorithm for Minimum Cost Constrained Input Selection for State Space Structural Controllability
inferred← citeshttps://doi.org/10.23919/ecc.2019.8795867openalex-snapshot
Combining centrality measures for control energy reduction in network controllability problems
inferred← citeshttps://doi.org/10.23919/sice.2018.8492603openalex-snapshot
On Minimum Cost Sparsest Input-Connectivity for Controllability of Linear Systems
inferred← citeshttps://doi.org/10.32657/10356/74223openalex-snapshot
Minimum-cost control of directed complex networks
inferred← citeshttps://doi.org/10.3384/diss.diva-165258openalex-snapshot
Controllability of Complex Networks at Minimum Cost
inferred← citeshttps://doi.org/10.3384/lic.diva-150886openalex-snapshot
Methods and algorithms for control input placement in complex networks
inferred← citeshttps://doi.org/10.3390/en10122019openalex-snapshot
Global Feedback Control for Coordinated Linear Switched Reluctance Machines Network with Full-State Observation and Internal Model Compensation
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2884openalex-snapshot
Minimum Input Selection for Structural Controllability
inferred← citeshttps://doi.org/10.48550/arxiv.1507.07205openalex-snapshot
Minimum Sensor Placement for Robust Observability of Structured Complex Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1511.02963openalex-snapshot
Analysis and Design of Actuation-Sensing-Communication Interconnection Structures towards Secured/Resilient Closed-loop Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1704.04608openalex-snapshot
Approximating Constrained Minimum Input Selection for State Space Structural Controllability
inferred← citeshttps://doi.org/10.48550/arxiv.1707.05502openalex-snapshot
Positive controllability of networks under relative actuation
inferred← citeshttps://doi.org/10.48550/arxiv.1802.06479openalex-snapshot
Optimal leader selection and demotion in leader-follower multi-agent systems
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04449openalex-snapshot
Herding Positive, Complex Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2008.11223openalex-snapshot
Structural Systems Theory: an overview of the last 15 years
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.