On the public citation graph

The robust minimal controllability and observability problem

0 signed · 49 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rnc.3798openalex-snapshot
Controllability of multi‐agent systems under directed topology
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-3-030-58653-9_43openalex-snapshot
Decentralized Control for Multi-agent Missions Based on Flocking Rules
inferredcites →https://doi.org/10.1007/s00493-016-3363-4openalex-snapshot
Random matrices have simple spectrum
inferredcites →https://doi.org/10.1016/0016-0032(72)90146-9openalex-snapshot
Modern control engineering
inferredcites →https://doi.org/10.1016/j.amc.2014.04.077openalex-snapshot
Distributed consensus for sampled-data control multi-agent systems with missing control inputs
inferredcites →https://doi.org/10.1016/j.automatica.2016.12.011openalex-snapshot
Stochastic and deterministic fault detection for randomized gossip algorithms
inferredcites →https://doi.org/10.1016/j.automatica.2017.04.053openalex-snapshot
The robust minimal controllability problem
inferredcites →https://doi.org/10.1016/j.neucom.2017.10.008openalex-snapshot
A survey on recent advances in distributed sampled-data cooperative control of multi-agent systems
inferredcites →https://doi.org/10.1016/j.physleta.2014.04.070openalex-snapshot
Emergent collective behaviors on coopetition networks
inferredcites →https://doi.org/10.1016/j.sysconle.2020.104842openalex-snapshot
Node and network resistance to bribery in multi-agent systems
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6200-9openalex-snapshot
Decentralized Control of Complex Systems
inferredcites →https://doi.org/10.1080/00207179.2017.1408922openalex-snapshot
Controllability and observability of switched multi-agent systems
inferredcites →https://doi.org/10.1080/00207179.2018.1475751openalex-snapshot
Controllability and observability of multi-agent systems with heterogeneous and switching topologies
inferredcites →https://doi.org/10.1080/00207179.2020.1861331openalex-snapshot
General resilient consensus algorithms
inferredcites →https://doi.org/10.1109/allerton.2013.6736631openalex-snapshot
A model checking framework for linear time invariant switching systems using structural systems analysis
inferredcites →https://doi.org/10.1109/cdc.2004.1428782openalex-snapshot
On the controllability of nearest neighbor interconnections
inferredcites →https://doi.org/10.1109/cdc.2008.4739071openalex-snapshot
Controllability and observability of leader-based multi-agent systems
inferredcites →https://doi.org/10.1109/ecc.2015.7331082openalex-snapshot
Analysis and design of electric power grids with p-robustness guarantees using a structural hybrid system approach
inferredcites →https://doi.org/10.1109/mcs.2012.2195411openalex-snapshot
Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
inferredcites →https://doi.org/10.1109/med48518.2020.9183093openalex-snapshot
A Rendezvous Algorithm for Multi-agent Systems in Disconnected Network Topologies
inferredcites →https://doi.org/10.1109/tac.2011.2168912openalex-snapshot
On the Reachability and Observability of Path and Cycle Graphs
inferredcites →https://doi.org/10.1109/tac.2013.2241493openalex-snapshot
Controllability and Observability of Grid Graphs via Reduction and Symmetries
inferredcites →https://doi.org/10.1109/tac.2015.2437525openalex-snapshot
A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
inferredcites →https://doi.org/10.1109/tcbb.2013.106openalex-snapshot
A Two-Phase Bio-NER System Based on Integrated Classifiers and Multiagent Strategy
inferredcites →https://doi.org/10.1109/tcns.2014.2337974openalex-snapshot
Minimal Controllability Problems
inferredcites →https://doi.org/10.1109/tcns.2018.2839341openalex-snapshot
Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies
inferredcites →https://doi.org/10.1137/060674909openalex-snapshot
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
inferredcites →https://doi.org/10.1145/2390176.2390185openalex-snapshot
On the set multicover problem in geometric settings
inferredcites →https://doi.org/10.23919/acc.2018.8431919openalex-snapshot
The robust minimal controllability problem for switched linear continuous-time systems
inferredcites →https://doi.org/10.23919/ecc.2019.8796178openalex-snapshot
An Unknown Input Multi-Observer Approach for Estimation, Attack Isolation, and Control of LTI Systems under Actuator Attacks
inferredcites →https://doi.org/10.5643/9781606503027openalex-snapshot
Robust Control System Networks: How to Achieve Reliable Control After Stuxnet

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rnc.70469openalex-snapshot
Controllability of Discrete‐time Bilinear Systems With Uncertainties
inferred← citeshttps://doi.org/10.1007/978-3-030-99584-3_14openalex-snapshot
Efficient Restoration of Structural Controllability Under Malicious Edge Attacks for Complex Networks
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111668openalex-snapshot
Minimum jointly structural input and output selection
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.2026.101573openalex-snapshot
Dynamics augmentation for robust structural controllability of bidirected networks
inferred← citeshttps://doi.org/10.1016/j.isatra.2026.03.018openalex-snapshot
Optimal actuator and sensor attack strategies against controllability and observability
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2026.108930openalex-snapshot
Minimum-cost parameter blocking attacks on cyber-physical systems
inferred← citeshttps://doi.org/10.1016/j.sysconle.2022.105204openalex-snapshot
Minimal observability of Boolean control networks
inferred← citeshttps://doi.org/10.1080/00207179.2025.2494122openalex-snapshot
Sensitivity analysis for uncertain linear systems: a set-membership approach
inferred← citeshttps://doi.org/10.1109/ascc70886.2026.11702308openalex-snapshot
Critical Sensor Identification via Reduced-Order Observability Analysis in Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1109/tac.2023.3278797openalex-snapshot
Observability and Detectability of Stochastic Labeled Graphs
inferred← citeshttps://doi.org/10.1109/tac.2023.3295698openalex-snapshot
Observability Robustness Under Sensor Failures: A Computational Perspective
inferred← citeshttps://doi.org/10.1109/tase.2026.3728184openalex-snapshot
Graph-Theoretic Optimization of Actuator Attack Strategies Targeting Power Systems Controllability
inferred← citeshttps://doi.org/10.1109/tcns.2024.3457582openalex-snapshot
Leaky Forcing in Graphs for Resilient Controllability in Networks
inferred← citeshttps://doi.org/10.1109/tcyb.2024.3464642openalex-snapshot
A Nonaugmented Method for the Minimal Observability of Boolean Networks
inferred← citeshttps://doi.org/10.23919/acc55779.2023.10155834openalex-snapshot
Resilient Strong Structural Controllability in Networks using Leaky Forcing in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2111.13449openalex-snapshot
Minimum jointly structural input and output selection for strongly connected networks
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.