On the public citation graph

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications

https://doi.org/10.1007/b106672
0 signed · 109 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199912)32:4<340::aid-jgt3>3.0.co;2-ropenalex-snapshot
Intersection representation of digraphs in trees with few leaves
inferred← citeshttps://doi.org/10.1002/jgt.10085openalex-snapshot
Nowhere‐zero 3‐flows in locally connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.10121openalex-snapshot
Partitioning a graph into two isomorphic pieces
inferred← citeshttps://doi.org/10.1002/jgt.21681openalex-snapshot
Circular‐Arc Bigraphs and Its Subclasses
inferred← citeshttps://doi.org/10.1002/jgt.22897openalex-snapshot
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
inferred← citeshttps://doi.org/10.1002/qre.2176openalex-snapshot
A graph‐based postoptimization approach for covering arrays
inferred← citeshttps://doi.org/10.1007/11970125_17openalex-snapshot
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_25openalex-snapshot
Recent Developments in Circular Colouring of Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_136openalex-snapshot
Domination Analysis in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_253openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-030-23756-1_5openalex-snapshot
A Study on Vulnerability Parameters of Signed Fuzzy Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_136-1openalex-snapshot
Domination Analysis in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_27openalex-snapshot
Exact and Parameterized Algorithms for the Independent Cutset Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30502-6_26openalex-snapshot
Graph Theoretic Models for Reasoning About Time
inferred← citeshttps://doi.org/10.1007/978-3-540-79124-9_6openalex-snapshot
A Logic-Based Approach to Combinatorial Testing with Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-05258-3_35openalex-snapshot
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength
inferred← citeshttps://doi.org/10.1007/978-3-642-14156-0_8openalex-snapshot
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
inferred← citeshttps://doi.org/10.1007/978-3-642-16773-7_33openalex-snapshot
MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-16952-6_58openalex-snapshot
A Heuristic Approach for Constructing Ternary Covering Arrays Using Trinomial Coefficients
inferred← citeshttps://doi.org/10.1007/978-3-642-37798-3_12openalex-snapshot
A Post-optimization Strategy for Combinatorial Testing: Test Suite Reduction through the Identification of Wild Cards and Merge of Rows
inferred← citeshttps://doi.org/10.1007/978-3-642-39742-4_27openalex-snapshot
An Approach to Test Set Generation for Pair-Wise Testing Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/s00371-011-0576-9openalex-snapshot
Visualizing combinatorial auctions
inferred← citeshttps://doi.org/10.1007/s00453-010-9460-7openalex-snapshot
Fast Algorithms for max independent set
inferred← citeshttps://doi.org/10.1007/s00454-008-9081-yopenalex-snapshot
Cores of Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/s00521-019-04563-5openalex-snapshot
Domination integrity and efficient fuzzy graphs
inferred← citeshttps://doi.org/10.1007/s10489-022-03802-yopenalex-snapshot
On the solution of the graph bandwidth problem by means of search methods
inferred← citeshttps://doi.org/10.1007/s10623-008-9235-1openalex-snapshot
Covering arrays of strength 3 and 4 from holey difference matrices
inferred← citeshttps://doi.org/10.1007/s10700-008-9029-yopenalex-snapshot
On the resolution and optimization of a system of fuzzy relational equations with sup-T composition
inferred← citeshttps://doi.org/10.1007/s10700-011-9099-0openalex-snapshot
Set covering-based surrogate approach for solving sup- $${\mathcal{T}}$$ equation constrained optimization problems
inferred← citeshttps://doi.org/10.1007/s10732-007-9033-3openalex-snapshot
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1007/s10817-010-9171-4openalex-snapshot
A Formal Logic Approach to Constrained Combinatorial Testing
inferred← citeshttps://doi.org/10.1007/s12293-008-0001-8openalex-snapshot
A selection of useful theoretical tools for the design and analysis of optimization heuristics
inferred← citeshttps://doi.org/10.1016/b978-0-443-29654-3.00007-7openalex-snapshot
Graph data science: Applications and future
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126122openalex-snapshot
Covering array EXtender
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.11.029openalex-snapshot
Application of Particle Swarm Optimization to uniform and variable strength covering array construction
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106219openalex-snapshot
Extracting Combinatorial Test parameters and their values using model checking and evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2011.01.012openalex-snapshot
The open capacitated arc routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2011.10.014openalex-snapshot
GRASP with evolutionary path-relinking for the capacitated arc routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2017.09.020openalex-snapshot
Hybrid genetic algorithm for the open capacitated arc routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2020.105004openalex-snapshot
Optimization for drone and drone-truck combined operations: A review of the state of the art and future directions
inferred← citeshttps://doi.org/10.1016/j.cor.2025.106977openalex-snapshot
Ultrametric location and parsimonious representation
inferred← citeshttps://doi.org/10.1016/j.dam.2006.02.010openalex-snapshot
Domination analysis for minimum multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.dam.2009.02.003openalex-snapshot
Some results related to the tenacity and existence of k -trees
inferred← citeshttps://doi.org/10.1016/j.dam.2010.11.008openalex-snapshot
Tenacity of a graph with maximum connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2013.06.016openalex-snapshot
A note on “Tenacity of a graph with maximum connectivity”
inferred← citeshttps://doi.org/10.1016/j.dam.2014.02.021openalex-snapshot
Vulnerability of nearest neighbor graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.03.010openalex-snapshot
Tower of covering arrays
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.027openalex-snapshot
On the first-order edge tenacity of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.017openalex-snapshot
A generalization of Fan’s results: Distribution of cycle lengths in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.004openalex-snapshot
Locating–dominating codes in paths
inferred← citeshttps://doi.org/10.1016/j.disc.2011.10.027openalex-snapshot
A special antidilation problem for meshes and Hamming graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.040openalex-snapshot
Constructing new covering arrays from LFSR sequences over finite fields
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113689openalex-snapshot
Automorphism group of 2-token graph of the Hamming graph
inferred← citeshttps://doi.org/10.1016/j.dss.2013.11.006openalex-snapshot
Can knowledge be more accessible in a virtual network?: Collective dynamics of knowledge transfer in a virtual knowledge organization network
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.003openalex-snapshot
N -separators in planar graphs
inferred← citeshttps://doi.org/10.1016/j.ejco.2023.100080openalex-snapshot
A parameterized lower bounding method for the open capacitated arc routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.01.005openalex-snapshot
An approach to the asymmetric multi-depot capacitated arc routing problem
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105202openalex-snapshot
Detecting arrays for effects of multiple interacting factors
inferred← citeshttps://doi.org/10.1016/j.infsof.2006.03.004openalex-snapshot
Prioritized interaction testing for pair-wise coverage with seeding and constraints
inferred← citeshttps://doi.org/10.1016/j.infsof.2015.11.007openalex-snapshot
Practical minimization of pairwise-covering test configurations using constraint programming
inferred← citeshttps://doi.org/10.1016/j.ins.2011.09.020openalex-snapshot
New bounds for binary covering arrays using simulated annealing
inferred← citeshttps://doi.org/10.1016/j.ins.2017.02.051openalex-snapshot
Nature-inspired metaheuristic optimization in least squares support vector regression for obtaining bridge scour information
inferred← citeshttps://doi.org/10.1016/j.ins.2018.10.048openalex-snapshot
A greedy algorithm to construct covering arrays using a graph representation
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103598openalex-snapshot
Exact and parameterized algorithms for the independent cutset problem
inferred← citeshttps://doi.org/10.1016/j.jcta.2009.06.002openalex-snapshot
Constructions of new orthogonal arrays and covering arrays of strength three
inferred← citeshttps://doi.org/10.1016/j.jss.2014.08.005openalex-snapshot
PROW: A Pairwise algorithm with constRaints, Order and Weight
inferred← citeshttps://doi.org/10.1016/j.jss.2022.111353openalex-snapshot
CIT-daily: A combinatorial interaction testing-based daily build process
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.035openalex-snapshot
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.031openalex-snapshot
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
inferred← citeshttps://doi.org/10.1016/j.watres.2025.124424openalex-snapshot
Optimising and evaluating centralised infrastructure transitions: A case study of wastewater treatment plants consolidations in the UK
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00188-2openalex-snapshot
The asymptotic number of claw-free cubic graphs
inferred← citeshttps://doi.org/10.1016/s0065-2458(10)80003-8openalex-snapshot
Advances in Automated Model-Based System Testing of Software Applications with a GUI Front-End
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00062-9openalex-snapshot
Basic Structures of Some Interconnection Networks
inferred← citeshttps://doi.org/10.1080/00029890.2008.11920596openalex-snapshot
κ-Dependence and Domination in Kings Graphs
inferred← citeshttps://doi.org/10.1080/09720529.2007.10698106openalex-snapshot
Fundamentals of coding type problems
inferred← citeshttps://doi.org/10.1080/09728600.2006.12088803openalex-snapshot
Unsolved Algorithmic Problems on Trees
inferred← citeshttps://doi.org/10.1098/rsta.2009.0117openalex-snapshot
Identifying graph clusters using variational inference and links to covariance parametrization
inferred← citeshttps://doi.org/10.1109/ares.2010.22openalex-snapshot
Configuration Fuzzing for Software Vulnerability Detection
inferred← citeshttps://doi.org/10.1109/globecom38437.2019.9013441openalex-snapshot
Proactive Replication Scheme for Resilient Content Delivery in Software Defined Networks
inferred← citeshttps://doi.org/10.1109/hicss.2010.250openalex-snapshot
Knowledge Transfer in a Multiple Virtual Communities Network
inferred← citeshttps://doi.org/10.1109/icc.2018.8422185openalex-snapshot
A Graph Theoretic Approach to Localization under Uncertainty
inferred← citeshttps://doi.org/10.1109/icecce52056.2021.9514163openalex-snapshot
Improved Model of Internet Pricing Incentive Mechanism based on Multi bottleneck Links in Multi QoS Networks
inferred← citeshttps://doi.org/10.1109/icst.2012.141openalex-snapshot
CITLAB: A Laboratory for Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/icstw.2011.79openalex-snapshot
Calculating Prioritized Interaction Test Sets with Constraints Using Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1109/icstw.2018.00066openalex-snapshot
Migrating Combinatorial Interaction Test Modeling and Generation to the Web
inferred← citeshttps://doi.org/10.1109/nabic.2013.6617844openalex-snapshot
Evolving and reusing Bin Packing heuristic through Grammatical Differential Evolution
inferred← citeshttps://doi.org/10.1109/phosst.2019.8795068openalex-snapshot
A Graph-based Design and Programming Strategy for Reconfigurable Photonic Circuits
inferred← citeshttps://doi.org/10.1109/tnsm.2018.2829661openalex-snapshot
Capacity-Aware and Delay-Guaranteed Resilient Controller Placement for Software-Defined WANs
inferred← citeshttps://doi.org/10.1142/s1793830917500781openalex-snapshot
hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
inferred← citeshttps://doi.org/10.1142/s1793830919500678openalex-snapshot
Extremal trees with respect to the Steiner Wiener index
inferred← citeshttps://doi.org/10.1145/1185448.1185463openalex-snapshot
Chessboard domination on programmable graphics hardware
inferred← citeshttps://doi.org/10.1145/1401890.1401929openalex-snapshot
Banded structure in binary matrices
inferred← citeshttps://doi.org/10.1145/2001420.2001451openalex-snapshot
Using binary decision diagrams for combinatorial test design
inferred← citeshttps://doi.org/10.11606/d.55.2016.tde-04102016-162035openalex-snapshot
Modelos matemáticos para um problema de caminho de corte
inferred← citeshttps://doi.org/10.1201/b16132-47openalex-snapshot
Genus Distributions
inferred← citeshttps://doi.org/10.1201/b17645-5openalex-snapshot
Metric-Extremal Graphs
inferred← citeshttps://doi.org/10.1287/ijds.2021.0043openalex-snapshot
Conjecturing-Based Discovery of Patterns in Data
inferred← citeshttps://doi.org/10.1287/inte.1060.0227openalex-snapshot
Book Reviews
inferred← citeshttps://doi.org/10.12988/ijcms.2013.39112openalex-snapshot
1-Mother vertex general-graphs and some applications
inferred← citeshttps://doi.org/10.1371/journal.pone.0166150openalex-snapshot
Optimum Design of PIλDμ Controller for an Automatic Voltage Regulator System Using Combinatorial Test Design
inferred← citeshttps://doi.org/10.22215/etd/2017-11952openalex-snapshot
An Analysis and Extension of Category Partition Testing in the Presence of Constraints
inferred← citeshttps://doi.org/10.2991/iccsee.2013.180openalex-snapshot
Deadlock Detection Based on the Parallel Graph Theory Algorithm
inferred← citeshttps://doi.org/10.3390/su12031142openalex-snapshot
Locating Battery Swapping Stations for a Smart e-Bus System
inferred← citeshttps://doi.org/10.3923/jas.2013.572.579openalex-snapshot
Improved Models of Internet Charging Scheme of Single Bottleneck Link in Multi QoS Networks
inferred← citeshttps://doi.org/10.4018/jsse.2010070103openalex-snapshot
CONFU
inferred← citeshttps://doi.org/10.4171/jems/705openalex-snapshot
A semi-algebraic version of Zarankiewicz's problem
inferred← citeshttps://doi.org/10.48550/arxiv.2009.02945openalex-snapshot
A Simpler NP-Hardness Proof for Familial Graph Compression
inferred← citeshttps://doi.org/10.7763/ijcte.2011.v3.340openalex-snapshot
Prim Algorithm Approach to Improving Local Access Network in Rural Areas
inferred← citeshttps://doi.org/10.7939/r3rv0db2qopenalex-snapshot
Probabilistic Localization of Underwater Sensor 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.