On the public citation graph
Maximizing the smallest eigenvalue of a symmetric matrix: A submodular optimization approach
0 signed · 48 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/bf02579435openalex-snapshot
An analysis of the greedy algorithm for the submodular set covering problem
inferredcites →https://doi.org/10.1016/0024-3795(77)90073-8openalex-snapshot
M-matrix characterizations.I—nonsingular M-matrices
inferredcites →https://doi.org/10.1016/j.automatica.2016.06.022openalex-snapshot
Behaviors of networks with antagonistic interactions and switching topologies
inferredcites →https://doi.org/10.1016/j.laa.2011.11.021openalex-snapshot
Submodular spectral functions of principal submatrices of a hermitian matrix, extensions and applications
inferredcites →https://doi.org/10.1016/j.laa.2012.01.020openalex-snapshot
Normalized graph Laplacians for directed graphs
inferredcites →https://doi.org/10.1016/s0024-3795(97)00067-0openalex-snapshot
Bounds for eigenvalues using the trace and determinant
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1038/nature10011openalex-snapshot
Controllability of complex networks
inferredcites →https://doi.org/10.1093/biomet/48.3-4.419openalex-snapshot
Computing the Distribution of Quadratic Forms in Normal Variables
inferredcites →https://doi.org/10.1109/acc.2013.6580126openalex-snapshot
Opinion dynamics in social networks: A local interaction game with stubborn agents
inferredcites →https://doi.org/10.1109/acc.2014.6859421openalex-snapshot
Spectral properties of the grounded Laplacian matrix with applications to consensus in the presence of stubborn agents
inferredcites →https://doi.org/10.1109/cdc.2004.1428782openalex-snapshot
On the controllability of nearest neighbor interconnections
inferredcites →https://doi.org/10.1109/cdc.2014.7039832openalex-snapshot
Submodularity of energy related controllability metrics
inferredcites →https://doi.org/10.1109/cdc.2014.7039834openalex-snapshot
On the definiteness of the weighted Laplacian and its connection to effective resistance
inferredcites →https://doi.org/10.1109/cdc.2016.7798396openalex-snapshot
Characterizing the positive semidefiniteness of signed Laplacians via Effective Resistances
inferredcites →https://doi.org/10.1109/mcs.2007.384125openalex-snapshot
Estimation on graphs from relative measurements
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.2013.2281473openalex-snapshot
A Supermodular Optimization Framework for Leader Selection Under Link Noise in Linear Multi-Agent Systems
inferredcites →https://doi.org/10.1109/tac.2014.2303236openalex-snapshot
Minimizing Convergence Error in Multi-Agent Systems Via Leader Selection: A Supermodular Optimization Approach
inferredcites →https://doi.org/10.1109/tac.2015.2444191openalex-snapshot
On the Smallest Eigenvalue of Grounded Laplacian Matrices
inferredcites →https://doi.org/10.1109/tcns.2015.2453711openalex-snapshot
On Submodularity and Controllability in Complex Dynamical Networks
inferredcites →https://doi.org/10.1109/tcns.2015.2485458openalex-snapshot
On the Robustness of Uncertain Consensus Networks
inferredcites →https://doi.org/10.1137/060674909openalex-snapshot
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
inferredcites →https://doi.org/10.23919/acc.2017.7963139openalex-snapshot
A submodular optimization approach to leader-follower consensus in networks with negative edges
inferredcites →https://doi.org/10.48550/arxiv.1207.0560openalex-snapshot
Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10898-025-01470-zopenalex-snapshot
Maximizing the smallest eigenvalue of grounded Laplacian matrix
inferred← citeshttps://doi.org/10.1007/s11424-021-1218-6openalex-snapshot
Multi-Agent Control: A Graph-Theoretic Perspective
inferred← citeshttps://doi.org/10.1016/j.automatica.2020.109340openalex-snapshot
A randomized approach to sensor placement with observability assurance
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.2025.112238openalex-snapshot
Maximizing the smallest eigenvalue of grounded Laplacian matrices via edge addition
inferred← citeshttps://doi.org/10.1016/j.ifacol.2023.10.618openalex-snapshot
Spectral Properties of Grounded Laplacian Matrices for Multiplex Networks*
inferred← citeshttps://doi.org/10.1016/j.neucom.2021.12.105openalex-snapshot
Peer selection in opinion dynamics on signed social networks with stubborn individuals
inferred← citeshttps://doi.org/10.1016/j.physa.2018.05.101openalex-snapshot
Structural balance of multiplex signed networks: A distributed data-driven approach
inferred← citeshttps://doi.org/10.1016/j.sysconle.2024.105945openalex-snapshot
Spectrum computation and optimization for controllability Gramian of networked Laplacian systems with limited control placement
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114220openalex-snapshot
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
inferred← citeshttps://doi.org/10.1109/access.2024.3359421openalex-snapshot
A Multi-Agent Model Based on Rooted Leadership Structure and General Dynamics and Self-Adaptive Mechanism
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304102openalex-snapshot
Submodular Input Selection for Synchronization in Kuramoto Networks
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383869openalex-snapshot
Motion Planning for The Estimation of Functions*
inferred← citeshttps://doi.org/10.1109/icc54714.2021.9703184openalex-snapshot
Optimizing controllability metrics for target controllability
inferred← citeshttps://doi.org/10.1109/jsyst.2021.3130591openalex-snapshot
Determining Redundant Links of Multiagent Systems in Keeping or Improving Consensus Convergence Rates
inferred← citeshttps://doi.org/10.1109/lra.2019.2928208openalex-snapshot
Randomized Sensor Selection for Nonlinear Systems With Application to Target Localization
inferred← citeshttps://doi.org/10.1109/tac.2023.3246425openalex-snapshot
Distributed Neighbor Selection in Multiagent Networks
inferred← citeshttps://doi.org/10.1109/tase.2026.3719071openalex-snapshot
Recovering Consensus for Multi-Agent Systems With Failed Follower via Topology Reconstruction
inferred← citeshttps://doi.org/10.1109/tcns.2019.2908341openalex-snapshot
Sensor Placement for Optimal Control of Infinite-Dimensional Systems
inferred← citeshttps://doi.org/10.1109/tsmc.2025.3614239openalex-snapshot
Optimizing Superdiffusion of Multiplex Networks Based on Spectral Graph Theory
inferred← citeshttps://doi.org/10.1109/yac59482.2023.10401720openalex-snapshot
Distributed Neighbor Selection on Matrix-weighted Networks
inferred← citeshttps://doi.org/10.23919/acc60939.2024.10644956openalex-snapshot
Distributed Neighbor Selection for Second-order Semi-Autonomous Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2110.12576openalex-snapshot
Maximizing the Smallest Eigenvalue of Grounded Laplacian Matrix
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.