On the public citation graph
The theory of graphs and its applications
0 signed · 136 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/aic.690120613openalex-snapshot
Design variable selection to simplify process calculations
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1966.tb01713.xopenalex-snapshot
Topology of Thin Film RC Circuits
inferred← citeshttps://doi.org/10.1002/nav.3800180103openalex-snapshot
Optimal interdiction policy for a flow network
inferred← citeshttps://doi.org/10.1007/978-88-470-2571-4_1openalex-snapshot
Combining Game Theory and Graph Theory to Model Interactions between Cells in the Tumor Microenvironment
inferred← citeshttps://doi.org/10.1007/s11067-019-09466-5openalex-snapshot
Application of Complex Networks Theory in Urban Traffic Network Researches
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90009-6openalex-snapshot
Paths in graphs and minimal π-sequences in semigroups
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90145-6openalex-snapshot
A note on total domination
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90640-2openalex-snapshot
Matching theory—a sampler: from Dénes König to the present
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90288-5openalex-snapshot
The sequence of upper and lower domination, independence and irredundance numbers of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(96)00106-9openalex-snapshot
De Bruijn sequences, irreducible codes and cyclotomy
inferred← citeshttps://doi.org/10.1016/0020-0255(75)90045-6openalex-snapshot
On the connectivity of clusters
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90038-3openalex-snapshot
“Global” graph problems tend to be intractable
inferred← citeshttps://doi.org/10.1016/0022-247x(66)90106-5openalex-snapshot
Systems of representatives
inferred← citeshttps://doi.org/10.1016/0022-247x(69)90209-1openalex-snapshot
The Konigsberg bridges problem generalized
inferred← citeshttps://doi.org/10.1016/0022-247x(71)90234-4openalex-snapshot
On the theory of the elimination process
inferred← citeshttps://doi.org/10.1016/0022-2496(78)90034-2openalex-snapshot
Constructing blockmodels: How and why
inferred← citeshttps://doi.org/10.1016/0022-2569(68)90018-9openalex-snapshot
An extension of Manolescu's classification of planar kinematic chains and mechanisms of mobility M ⩾ 1, using graph theory
inferred← citeshttps://doi.org/10.1016/0026-2714(73)90589-1openalex-snapshot
Reliability optimization of a system by zero-one programming
inferred← citeshttps://doi.org/10.1016/0041-5553(67)90026-2openalex-snapshot
Determining the time characteristics in network planning with random evaluations of the length of operations
inferred← citeshttps://doi.org/10.1016/0041-5553(68)90148-1openalex-snapshot
The parametric problem of shortest distances
inferred← citeshttps://doi.org/10.1016/0041-5553(79)90139-3openalex-snapshot
A generalized “wave” method for solving extremal problems on graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(76)90050-2openalex-snapshot
Extremal graphs of diameter 4
inferred← citeshttps://doi.org/10.1016/0097-3165(72)90013-1openalex-snapshot
A characterization of separating distinguished collections containing the maximum number of sets
inferred← citeshttps://doi.org/10.1016/0166-218x(79)90012-xopenalex-snapshot
Complexity of problems in games, graphs and algebraic equations
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90017-0openalex-snapshot
On some counting polynomials in chemistry
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90160-0openalex-snapshot
An experimental comparison of three heuristics for the WVCP
inferred← citeshttps://doi.org/10.1016/0888-613x(90)90003-kopenalex-snapshot
Probabilistic inference in multiply connected belief networks using loop cutsets
inferred← citeshttps://doi.org/10.1016/b978-0-12-571812-7.50011-5openalex-snapshot
The Energy Principle in the Stability of Interfaces
inferred← citeshttps://doi.org/10.1016/b978-1-4832-3187-7.50011-8openalex-snapshot
A GRAPH-THEORETIC PROGRAMMING LANGUAGE
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2020.08.001openalex-snapshot
The mathematical foundations of physical systems modeling languages
inferred← citeshttps://doi.org/10.1016/j.cities.2025.105858openalex-snapshot
Advancing in-neighborhood micromobility networks: Decarbonizing car-centric urbanization through a multimodal network planning framework
inferred← citeshttps://doi.org/10.1016/j.comcom.2021.12.020openalex-snapshot
Survival backup strategy for controller placement problem in Software Defined Networking
inferred← citeshttps://doi.org/10.1016/j.dam.2009.03.010openalex-snapshot
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.023openalex-snapshot
The complexity of dissociation set problems in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.016openalex-snapshot
The probabilistic minimum dominating set problem
inferred← citeshttps://doi.org/10.1016/j.dam.2024.02.010openalex-snapshot
A note on bounds for the broadcast domination number of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.029openalex-snapshot
Extremal graphs for a new upper bound on domination parameters in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.039openalex-snapshot
Total restrained domination in graphs with minimum degree two
inferred← citeshttps://doi.org/10.1016/j.disc.2008.02.048openalex-snapshot
A survey of stratified domination in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.05.026openalex-snapshot
On the domination number of generalized Petersen graphs P(n,2)
inferred← citeshttps://doi.org/10.1016/j.disc.2012.06.016openalex-snapshot
Upper bounds on the broadcast function using minimum dominating sets
inferred← citeshttps://doi.org/10.1016/j.ecoser.2020.101176openalex-snapshot
Using graph theory and social media data to assess cultural ecosystem services in coastal areas: Method development and application
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.05.004openalex-snapshot
The adjacency graphs of FSRs with a class of affine characteristic functions
inferred← citeshttps://doi.org/10.1016/j.jda.2014.11.003openalex-snapshot
Small k-pyramids and the complexity of determining k
inferred← citeshttps://doi.org/10.1016/j.jmateco.2025.103094openalex-snapshot
Cycle conditions for “Luce rationality”
inferred← citeshttps://doi.org/10.1016/j.ocecoaman.2023.106854openalex-snapshot
Understanding socioecological interaction networks in Marine Protected Areas to inform management
inferred← citeshttps://doi.org/10.1016/j.physa.2019.123340openalex-snapshot
Identification of key nodes and vital edges in aviation network based on minimum connected dominating set
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.007openalex-snapshot
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114314openalex-snapshot
Self-stabilizing 2-minimal dominating set algorithms based on loop composition
inferred← citeshttps://doi.org/10.1016/s0009-2509(02)00282-8openalex-snapshot
A mathematical model and decision-support framework for material recovery, recycling and cascaded use
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00184-5openalex-snapshot
On the equality of the partial Grundy and upper ochromatic numbers of graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00244-xopenalex-snapshot
An upper bound for the minimum number of queens covering the n×n chessboard
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71033-1openalex-snapshot
Chessboard Domination Problems
inferred← citeshttps://doi.org/10.1016/s0925-5273(99)00045-6openalex-snapshot
A cooperative production planning method in the field of continuous process plants
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)69406-0openalex-snapshot
An expert system used to prevent the disclosure of sensitive information at the united states environmental protection agency
inferred← citeshttps://doi.org/10.1017/s0001867800041057openalex-snapshot
Combinatorial properties of a queueing system by limited availability
inferred← citeshttps://doi.org/10.1017/s0013091500009809openalex-snapshot
Sufficient conditions for matchings
inferred← citeshttps://doi.org/10.1017/s0033583500000081openalex-snapshot
Network thermodynamics: dynamic modelling of biophysical systems
inferred← citeshttps://doi.org/10.1029/wr006i006p01674openalex-snapshot
Topological and Geometrical Properties of Braided Streams
inferred← citeshttps://doi.org/10.1080/0025570x.2001.11953070openalex-snapshot
An Application of the Marriage Lemma
inferred← citeshttps://doi.org/10.1080/01621459.1976.10480961openalex-snapshot
A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering
inferred← citeshttps://doi.org/10.1090/qam/265210openalex-snapshot
Properties of the distance matrix of a tree
inferred← citeshttps://doi.org/10.1090/qam/99871openalex-snapshot
The neuron as a Lie group germ and a Lie product
inferred← citeshttps://doi.org/10.1090/s0002-9904-1970-12365-5openalex-snapshot
Matching theorems for combinatorial geometries
inferred← citeshttps://doi.org/10.1090/s0002-9939-1964-0169230-9openalex-snapshot
Short Proof of a Theorem of Rado on Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9939-1968-0218261-2openalex-snapshot
On minimal separating collections
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0340082-2openalex-snapshot
Effective matchmaking and 𝑘-chromatic graphs
inferred← citeshttps://doi.org/10.1090/s0025-5718-68-99654-3openalex-snapshot
Reviews and Descriptions of Tables and Books
inferred← citeshttps://doi.org/10.1108/eb005294openalex-snapshot
SELECT PROPERTIES OF THE GRAPH MODEL OF A GENERAL AUTOMATON
inferred← citeshttps://doi.org/10.1109/43.594833openalex-snapshot
On optimal board-level routing for FPGA-based logic emulation
inferred← citeshttps://doi.org/10.1109/access.2018.2883028openalex-snapshot
Independent Roman Domination Stable and Vertex-Critical Graphs
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7364032openalex-snapshot
Efficient approximation algorithms to determine minimum partial dominating sets in social networks
inferred← citeshttps://doi.org/10.1109/fareastcon.2019.8933846openalex-snapshot
The Definition of Berge Graph by Incidentor Matrix
inferred← citeshttps://doi.org/10.1109/focs.2006.5openalex-snapshot
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/iccceee.2018.8515828openalex-snapshot
On Three Polynomials of Cyclic Silicate Networks
inferred← citeshttps://doi.org/10.1109/icnc.2007.205openalex-snapshot
An Improved Ant Colony Optimization for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1109/icsmc.1988.754387openalex-snapshot
Intelligent Database Query Translation
inferred← citeshttps://doi.org/10.1109/isvd.1991.185104openalex-snapshot
A novel VLSI solution to a difficult graph problem
inferred← citeshttps://doi.org/10.1109/iwqos.1999.766481openalex-snapshot
On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann
inferred← citeshttps://doi.org/10.1109/padsw.2018.8644642openalex-snapshot
A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence
inferred← citeshttps://doi.org/10.1109/pgec.1966.264498openalex-snapshot
Relations Between P n Cycles and Stable Feedback Shift Registers
inferred← citeshttps://doi.org/10.1109/robot.2001.933166openalex-snapshot
Toward multiview registration in frame space
inferred← citeshttps://doi.org/10.1109/smart55829.2022.10047073openalex-snapshot
Duality of Graph and Its Application in Electric Circuit
inferred← citeshttps://doi.org/10.1109/t-c.1975.224182openalex-snapshot
Detection oF Pattern-Sensitive Faults in Random-Access Memories
inferred← citeshttps://doi.org/10.1109/tac.1967.1098540openalex-snapshot
Signal flow graphs of sampled-data systems: A new formulation
inferred← citeshttps://doi.org/10.1109/tc.1968.226911openalex-snapshot
Programming-Language-Oriented Instruction Streams
inferred← citeshttps://doi.org/10.1109/tcom.1978.1094227openalex-snapshot
Protocol Validation by Duologue-Matrix Analysis
inferred← citeshttps://doi.org/10.1109/tcs.1974.1083809openalex-snapshot
An indirect method for minimal essential sets
inferred← citeshttps://doi.org/10.1109/tct.1967.1082661openalex-snapshot
Notes on a Minimum Feedback Arc Set
inferred← citeshttps://doi.org/10.1109/tct.1968.1082832openalex-snapshot
On the Smallest Disconnecting Set in a Graph
inferred← citeshttps://doi.org/10.1109/tct.1969.1082889openalex-snapshot
An Algorithm for Finding the Reachability Matrix of a Directed Linear Graph
inferred← citeshttps://doi.org/10.1109/tct.1971.1083332openalex-snapshot
A note on minimal essential sets
inferred← citeshttps://doi.org/10.1109/tct.1973.1083681openalex-snapshot
A graph optimization-synthesis formulation for cable-communications systems
inferred← citeshttps://doi.org/10.1109/te.1969.4320513openalex-snapshot
Instrumentation of a NASAP Subroutine
inferred← citeshttps://doi.org/10.1109/tit.1968.1054190openalex-snapshot
Graph theoretic error-correcting codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2361522openalex-snapshot
A Class of de Bruijn Sequences
inferred← citeshttps://doi.org/10.1109/tpami.2004.49openalex-snapshot
Multiview registration of 3D scenes by minimizing error between coordinate frames
inferred← citeshttps://doi.org/10.1109/tse.1979.234184openalex-snapshot
Detection of Data Flow Anomaly Through Program Instrumentation
inferred← citeshttps://doi.org/10.1109/tsmc.1979.4310106openalex-snapshot
A New Ranking Method Based on Relative Position Estimate and Its Extensions
inferred← citeshttps://doi.org/10.1109/tssc.1969.300204openalex-snapshot
Constraint Theory, Part II: Model Graphs and Regular Relations
inferred← citeshttps://doi.org/10.1112/s0025579300008500openalex-snapshot
Properties and characterizations of k ‐trees
inferred← citeshttps://doi.org/10.1137/0114052openalex-snapshot
The Structure of Powers of Nonnegative Matrices I. The Index of Convergence
inferred← citeshttps://doi.org/10.1137/0114065openalex-snapshot
A Graph-Theoretic Approach to a Communications Problem
inferred← citeshttps://doi.org/10.1137/0128011openalex-snapshot
Maximum Matching and the Rank of a Matrix
inferred← citeshttps://doi.org/10.1137/0204005openalex-snapshot
Faithful Representation of a Family of Sets by a Set of Intervals
inferred← citeshttps://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.1137/0217077openalex-snapshot
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
inferred← citeshttps://doi.org/10.1137/0605040openalex-snapshot
On the Algorithmic Complexity of Total Domination
inferred← citeshttps://doi.org/10.1137/0715006openalex-snapshot
On the Application of the Minimum Degree Algorithm to Finite Element Systems
inferred← citeshttps://doi.org/10.1137/0715069openalex-snapshot
An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
inferred← citeshttps://doi.org/10.1137/0717062openalex-snapshot
An Automatic One-Way Dissection Algorithm for Irregular Finite Element Problems
inferred← citeshttps://doi.org/10.1137/1111047openalex-snapshot
On the Speed of Convergence of the Convolution of Identical Distributions Defined on a Finite Group
inferred← citeshttps://doi.org/10.1142/s0219498817501213openalex-snapshot
On the line graphs of zero-divisor graphs of posets
inferred← citeshttps://doi.org/10.1142/s0219498820500747openalex-snapshot
Some properties about the zero-divisor graphs of quasi-ordered sets
inferred← citeshttps://doi.org/10.1145/365559.366069openalex-snapshot
An undergraduate program in computer science—preliminary recommendations
inferred← citeshttps://doi.org/10.1177/104687818101200204openalex-snapshot
Gaming Simulation as a Tool of Management Planning
inferred← citeshttps://doi.org/10.18280/mmep.100527openalex-snapshot
Examining Captive and Inverse Captive Domination in Selected Graphs and Their Complements
inferred← citeshttps://doi.org/10.21123/bsj.15.4.466-471openalex-snapshot
Tadpole Domination in Graphs
inferred← citeshttps://doi.org/10.21123/bsj.2021.18.1(suppl.).0797openalex-snapshot
Variant Domination Types for a Complete h-ary Tree
inferred← citeshttps://doi.org/10.21136/cmj.1972.101098openalex-snapshot
Chromatic index of finite and infinite graphs
inferred← citeshttps://doi.org/10.22147/jusps-a/340501openalex-snapshot
Further Results on Maximal Domination in Graphs
inferred← citeshttps://doi.org/10.3182/20130911-3-br-3021.00127openalex-snapshot
PATHFIND: Minimizing the Logistics Costs in Urban Centers
inferred← citeshttps://doi.org/10.3390/app132111957openalex-snapshot
Situation Assessment of Air Traffic Based on Complex Network Theory and Ensemble Learning
inferred← citeshttps://doi.org/10.4153/cjm-1966-026-4openalex-snapshot
The Number of Circular Patterns Compatible with a Pseudo-Symmetric Connected Graph
inferred← citeshttps://doi.org/10.4153/cjm-1969-088-3openalex-snapshot
The Exponents of Strongly Connected Graphs
inferred← citeshttps://doi.org/10.4153/cjm-1970-003-9openalex-snapshot
Counting Paths, Circuits, Chains, and Cycles in Graphs: a Unified Approach
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.