On the public citation graph

Journal of Combinatorial Mathematics and Combinatorial Computing

https://doi.org/10.61091/jcmcc
0 signed · 237 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/jos.114openalex-snapshot
Unconstrained static scheduling with communication weights
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_5openalex-snapshot
A Survey on Clique Graphs
inferred← citeshttps://doi.org/10.1007/10722599_5openalex-snapshot
Metering Schemes for General Access Structures
inferred← citeshttps://doi.org/10.1007/10958513_10openalex-snapshot
Distributed RSA Signature Schemes for General Access Structures
inferred← citeshttps://doi.org/10.1007/11564751_23openalex-snapshot
Solving the MOLR and Social Golfers Problems
inferred← citeshttps://doi.org/10.1007/11586821_23openalex-snapshot
On Threshold Self-healing Key Distribution Schemes
inferred← citeshttps://doi.org/10.1007/11599548_32openalex-snapshot
Classification of Universally Ideal Homomorphic Secret Sharing Schemes and Ideal Black-Box Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/11602897_10openalex-snapshot
Visual Cryptographic Protocols Using the Trusted Initializer
inferred← citeshttps://doi.org/10.1007/11604686_32openalex-snapshot
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
inferred← citeshttps://doi.org/10.1007/11611257_19openalex-snapshot
Simple Algorithm for Sorting the Fibonacci String Rotations
inferred← citeshttps://doi.org/10.1007/11761679_13openalex-snapshot
Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
inferred← citeshttps://doi.org/10.1007/11761679_30openalex-snapshot
On the (Im-)Possibility of Extending Coin Toss
inferred← citeshttps://doi.org/10.1007/11787006_25openalex-snapshot
Multipartite Secret Sharing by Bivariate Interpolation
inferred← citeshttps://doi.org/10.1007/11940128_61openalex-snapshot
Politician’s Firefighting
inferred← citeshttps://doi.org/10.1007/3-540-38076-0_22openalex-snapshot
TOPPER: An Integrated Environment for Task Allocation and Execution of MPI Applications onto Parallel Architectures
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_40openalex-snapshot
Constructing General Dynamic Group Key Distribution Schemes with Decentralized User Join
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_21openalex-snapshot
Matroid Representation of Clique Complexes
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_11openalex-snapshot
Small k-Dominating Sets of Regular Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_10openalex-snapshot
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting
inferred← citeshttps://doi.org/10.1007/3-540-63371-5_47openalex-snapshot
A simple, multi-architecture, parallel procedure for generating combinations
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_741openalex-snapshot
Fault tolerant mobility planning for rapidly deployable wireless networks
inferred← citeshttps://doi.org/10.1007/978-0-8176-8092-3_3openalex-snapshot
Ramsey Numbers Involving Cycles
inferred← citeshttps://doi.org/10.1007/978-1-4020-9688-4_16openalex-snapshot
Online Job Admission
inferred← citeshttps://doi.org/10.1007/978-1-4419-9226-0_22openalex-snapshot
On automatic secret generation and sharing for Karin-Greene-Hellman scheme
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_12openalex-snapshot
Sequences of Lyndon Words
inferred← citeshttps://doi.org/10.1007/978-1-4613-0245-2_6openalex-snapshot
On Minimal Defining Sets in AG(d,3)
inferred← citeshttps://doi.org/10.1007/978-1-4613-3554-2_22openalex-snapshot
Defining Sets for Block Designs: An Update
inferred← citeshttps://doi.org/10.1007/978-1-4615-5489-9_2openalex-snapshot
On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-37853-0_5openalex-snapshot
Counting Tilings by Taking Walks in a Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-67044-3_1openalex-snapshot
Twenty Years of Network Science: A Bibliographic and Co-authorship Network Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-77983-2_4openalex-snapshot
The Threshold Dimension and Threshold Strong Dimension of a Graph: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-77983-2_5openalex-snapshot
Symmetry Parameters for Mycielskian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-77983-2_6openalex-snapshot
Reconfiguration Graphs for Dominating Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-10796-2_1openalex-snapshot
On the Number of Dot Product Chains in Finite Fields and Rings
inferred← citeshttps://doi.org/10.1007/978-3-031-21494-3_13openalex-snapshot
Latin Squares at Rothamsted in the Time of Fisher and Yates
inferred← citeshttps://doi.org/10.1007/978-3-031-62166-6_16openalex-snapshot
Geodesic Leech Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-62166-6_25openalex-snapshot
Deques on a Torus
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_26openalex-snapshot
Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_7openalex-snapshot
Leakage Resilient Proofs of Ownership in Cloud Storage, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_5openalex-snapshot
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas
inferred← citeshttps://doi.org/10.1007/978-3-319-13123-8_9openalex-snapshot
Firefighting as a Game
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_30openalex-snapshot
Online Computation of Abelian Runs
inferred← citeshttps://doi.org/10.1007/978-3-319-18720-4_50openalex-snapshot
Wiener Index on Lines of Unit Cells of the Body-Centered Cubic Grid
inferred← citeshttps://doi.org/10.1007/978-3-319-20394-2_3openalex-snapshot
Modular Sum-Defined Irregular Colorings
inferred← citeshttps://doi.org/10.1007/978-3-319-20394-2_7openalex-snapshot
Modular Sum-Defined Neighbor-Distinguishing Colorings
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_42openalex-snapshot
On the Complete Width and Edge Clique Cover Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_7openalex-snapshot
Generation of Colourings and Distinguishing Colourings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-24462-4_11openalex-snapshot
Approximate Abelian Periods to Find Motifs in Biological Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_15openalex-snapshot
How to Whack Moles
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_26openalex-snapshot
Hierarchical Threshold Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_6openalex-snapshot
On Generalized Moore Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_27openalex-snapshot
Group Oriented Cryptosystems Based on Linear Access Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-30559-0_29openalex-snapshot
Characterization and Recognition of Generalized Clique-Helly Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_6openalex-snapshot
Edge-Connection of Graphs, Digraphs, and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45126-6_21openalex-snapshot
Verifiable Secret Sharing for General Access Structures, with Application to Fully Distributed Proxy Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-74124-4_25openalex-snapshot
A Subliminal-Free Variant of ECDSA
inferred← citeshttps://doi.org/10.1007/978-3-540-75993-5_9openalex-snapshot
Secret Locking: Exploring New Approaches to Biometric Key Encapsulation
inferred← citeshttps://doi.org/10.1007/978-3-540-76969-9_16openalex-snapshot
Toward Non-parallelizable Client Puzzles
inferred← citeshttps://doi.org/10.1007/978-3-540-79549-0_53openalex-snapshot
Generalized Self-healing Key Distribution Using Vector Space Access Structure
inferred← citeshttps://doi.org/10.1007/978-3-540-92957-4_86openalex-snapshot
Weighted Threshold Secret Image Sharing
inferred← citeshttps://doi.org/10.1007/978-3-642-00563-3_4openalex-snapshot
Discovering Affinities between Perceptual Granules
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_14openalex-snapshot
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_12openalex-snapshot
Maximally Local Connectivity on Augmented Cubes
inferred← citeshttps://doi.org/10.1007/978-3-642-04070-2_67openalex-snapshot
Pseudo Invariant Line Moment to Detect the Target Region of Moving Vessels
inferred← citeshttps://doi.org/10.1007/978-3-642-04592-9_16openalex-snapshot
Tolerance Classes in Measuring Image Resemblance
inferred← citeshttps://doi.org/10.1007/978-3-642-10230-1_13openalex-snapshot
Strongly Multiplicative Hierarchical Threshold Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-642-12993-3_16openalex-snapshot
Optimal Analyses for 3×n AB Games in the Worst Case
inferred← citeshttps://doi.org/10.1007/978-3-642-13033-5_54openalex-snapshot
Pruning the Search Space for the Snake-in-the-Box Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_23openalex-snapshot
Cover Array String Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_26openalex-snapshot
Restricted LCS
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_4openalex-snapshot
A Fast Algorithm for Powerful Alliances in Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-17934-1_6openalex-snapshot
Visual Perception in Image Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-17934-1_8openalex-snapshot
Image Analysis in Poincaré-Peters Perceptual Representative Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_8openalex-snapshot
Densest k-Subgraph Approximation on Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_20openalex-snapshot
How to Cut a Graph into Many Pieces
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_29openalex-snapshot
Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_1openalex-snapshot
Leftover Hash Lemma, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-23324-1_59openalex-snapshot
On the Edge-Balance Index Sets of the Network Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-24425-4_69openalex-snapshot
Nearness of Subtly Different Digital Images
inferred← citeshttps://doi.org/10.1007/978-3-642-25243-3_11openalex-snapshot
A Probabilistic Secret Sharing Scheme for a Compartmented Access Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_17openalex-snapshot
Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet
inferred← citeshttps://doi.org/10.1007/978-3-642-30347-0_6openalex-snapshot
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye
inferred← citeshttps://doi.org/10.1007/978-3-642-33272-2_5openalex-snapshot
Combined Public-Key Schemes: The Case of ABE and ABS
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_20openalex-snapshot
Alliances and Bisection Width for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36505-8_5openalex-snapshot
Nearness of Subtly Different Digital Images
inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_27openalex-snapshot
Novel Techniques for Automorphism Group Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_13openalex-snapshot
A Survey of the Game “Lights Out!”
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_14openalex-snapshot
Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_39openalex-snapshot
On the Number of Prefix and Border Tables
inferred← citeshttps://doi.org/10.1007/978-3-642-57991-2_12openalex-snapshot
Computer Aided Design of Experiments
inferred← citeshttps://doi.org/10.1007/978-3-662-44320-0_19openalex-snapshot
The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-33-4389-4_53openalex-snapshot
Application of Fuzzy Vertex Magic Graph
inferred← citeshttps://doi.org/10.1007/bf00125202openalex-snapshot
Construction of Cartesian authentication codes from unitary geometry
inferred← citeshttps://doi.org/10.1007/bf00196772openalex-snapshot
On the classification of ideal secret sharing schemes
inferred← citeshttps://doi.org/10.1007/bf01252220openalex-snapshot
Overlarge sets and partial geometries
inferred← citeshttps://doi.org/10.1007/bf02187810openalex-snapshot
Toughness and Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf02451114openalex-snapshot
Strongly ideal secret sharing schemes
inferred← citeshttps://doi.org/10.1007/bf02582902openalex-snapshot
On the embeddings of mendelsohn triple systems
inferred← citeshttps://doi.org/10.1007/bf02677408openalex-snapshot
On (a, b)-consecutive petersen graphs
inferred← citeshttps://doi.org/10.1007/bf03192385openalex-snapshot
Computational aspects of the Helly property: a survey
inferred← citeshttps://doi.org/10.1007/bf03353010openalex-snapshot
Cycle Covers of Planar 2-Edge-Connected Graphs
inferred← citeshttps://doi.org/10.1007/bfb0023287openalex-snapshot
A nonlinear secret sharing scheme
inferred← citeshttps://doi.org/10.1007/bfb0023288openalex-snapshot
The access structure of some secret-sharing schemes
inferred← citeshttps://doi.org/10.1007/s00026-025-00765-yopenalex-snapshot
Regularity of Powers and Symbolic Powers of Edge Ideals of Cubic Circulant Graphs
inferred← citeshttps://doi.org/10.1007/s00224-023-10130-2openalex-snapshot
The Space Complexity of Sum Labelling
inferred← citeshttps://doi.org/10.1007/s00500-019-03811-zopenalex-snapshot
Roman domination problem with uncertain positioning and deployment costs
inferred← citeshttps://doi.org/10.1007/s10114-005-0672-8openalex-snapshot
Super–edge–graceful Labelings of Some Cubic Graphs
inferred← citeshttps://doi.org/10.1007/s10114-011-9075-1openalex-snapshot
Partitioning a graph into defensive k-alliances
inferred← citeshttps://doi.org/10.1007/s10472-019-09681-3openalex-snapshot
The SAT+CAS Method for Combinatorial Search with Applications to Best Matrices
inferred← citeshttps://doi.org/10.1007/s10479-009-0673-6openalex-snapshot
Variations of maximum-clique transversal sets on graphs
inferred← citeshttps://doi.org/10.1007/s10479-013-1380-xopenalex-snapshot
A trust model of cloud computing based on Quality of Service
inferred← citeshttps://doi.org/10.1007/s10479-015-1934-1openalex-snapshot
The representation of partially-concurrent open shop problems
inferred← citeshttps://doi.org/10.1007/s10479-015-2015-1openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1007/s10479-017-2712-zopenalex-snapshot
Neighborhood covering and independence on $$P_4$$P4-tidy graphs and tree-cographs
inferred← citeshttps://doi.org/10.1007/s10479-025-06571-2openalex-snapshot
Minimum-cardinality global defensive alliances in general graphs
inferred← citeshttps://doi.org/10.1007/s10587-007-0042-zopenalex-snapshot
Graphic sequences of trees and a problem of Frobenius
inferred← citeshttps://doi.org/10.1007/s10587-009-0074-7openalex-snapshot
Potentially K m — G-graphical sequences: A survey
inferred← citeshttps://doi.org/10.1007/s10601-016-9240-3openalex-snapshot
Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking
inferred← citeshttps://doi.org/10.1007/s10601-018-9294-5openalex-snapshot
Constraints for symmetry breaking in graph representation
inferred← citeshttps://doi.org/10.1007/s10623-003-1158-2openalex-snapshot
A General Approach to Robust Web Metering
inferred← citeshttps://doi.org/10.1007/s10845-010-0471-7openalex-snapshot
Heuristics for puzzle-based storage systems driven by a limited set of automated guided vehicles
inferred← citeshttps://doi.org/10.1007/s11042-021-11554-zopenalex-snapshot
Extending boolean operations-based secret image sharing to compartmented access structure
inferred← citeshttps://doi.org/10.1007/s11276-017-1601-3openalex-snapshot
An improved fair channel hopping protocol for dynamic environments in cognitive radio networks
inferred← citeshttps://doi.org/10.1007/s11277-014-1751-xopenalex-snapshot
Multipartite Secret Sharing Based on CRT
inferred← citeshttps://doi.org/10.1007/s11277-016-3619-8openalex-snapshot
Secure and Efficient Secret Sharing Scheme with General Access Structures Based on Elliptic Curve and Pairing
inferred← citeshttps://doi.org/10.1007/s11704-014-3062-5openalex-snapshot
Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
inferred← citeshttps://doi.org/10.1007/s11704-014-3469-zopenalex-snapshot
Optimal binary codes and binary construction of quantum codes
inferred← citeshttps://doi.org/10.1007/s11741-003-0050-7openalex-snapshot
Upper bounds for ramsey numbers R(m ,n ,1) and R(m ,n, l, s) with parameter
inferred← citeshttps://doi.org/10.1007/s11766-019-3512-9openalex-snapshot
Online scheduling of jobs with kind release times and deadlines on a single machine
inferred← citeshttps://doi.org/10.1007/s11771-015-2889-8openalex-snapshot
User preferences-aware recommendation for trustworthy cloud services based on fuzzy clustering
inferred← citeshttps://doi.org/10.1007/s13226-021-00082-zopenalex-snapshot
New parameter of inverse domination in graphs
inferred← citeshttps://doi.org/10.1007/s13226-025-00772-yopenalex-snapshot
On some restricted overpartition functions
inferred← citeshttps://doi.org/10.1007/s41478-018-0093-6openalex-snapshot
Complement of the generalized total graph of commutative rings
inferred← citeshttps://doi.org/10.1007/s41478-022-00404-2openalex-snapshot
Some new congruences for (j, k)-regular bipartition triples
inferred← citeshttps://doi.org/10.1007/s41478-022-00464-4openalex-snapshot
Congruences for overpartitions with $$\ell$$-regular over-lined parts
inferred← citeshttps://doi.org/10.1007/s41965-019-00030-1openalex-snapshot
Quantum solutions for densest k-subgraph problems
inferred← citeshttps://doi.org/10.1016/j.entcom.2024.100706openalex-snapshot
Piano harmony automatic adaptation system based on deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/s0129-0657(01)00059-xopenalex-snapshot
NEURAL COST FUNCTIONS AND SEARCH STRATEGIES FOR THE GENERATION OF BLOCK DESIGNS: AN EXPERIMENTAL EVALUATION
inferred← citeshttps://doi.org/10.1063/5.0045783openalex-snapshot
(a, d)-distance antimagicness of disconnected 2-regular graphs
inferred← citeshttps://doi.org/10.1063/5.0262940openalex-snapshot
Equitable chromatic number in barbell graph, butterfly graph, and double star graph
inferred← citeshttps://doi.org/10.1080/00207160412331286842openalex-snapshot
New upper bounds for the integrity of cubic graphs
inferred← citeshttps://doi.org/10.1080/00207160500069920openalex-snapshot
Distinguishing redundant parentheses by syntax
inferred← citeshttps://doi.org/10.1080/00207160512331329078openalex-snapshot
On the edge-tenacity of the middle graph of a graph
inferred← citeshttps://doi.org/10.1080/00207160701365721openalex-snapshot
Vulnerability parameters of split graphs
inferred← citeshttps://doi.org/10.1080/00207160701374376openalex-snapshot
R OMAN DOMINATION : a parameterized perspective†
inferred← citeshttps://doi.org/10.1080/00207160701455860openalex-snapshot
Vertex-neighbour-integrity of composition graphs of paths and cycles
inferred← citeshttps://doi.org/10.1080/00207219508926211openalex-snapshot
The concatenation and partitioning of linear finite state machines
inferred← citeshttps://doi.org/10.1080/00207543.2016.1220686openalex-snapshot
Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines
inferred← citeshttps://doi.org/10.1080/03081060.2014.912419openalex-snapshot
Transit coordination with heterogeneous headways
inferred← citeshttps://doi.org/10.1080/03610926.2021.2012686openalex-snapshot
Construction of circular quasi rees neighbor designs which can be converted into minimal circular balanced and strongly balanced neighbor designs
inferred← citeshttps://doi.org/10.1080/07408170008967431openalex-snapshot
Scheduling with generalized batch delivery dates and earliness penalties
inferred← citeshttps://doi.org/10.1080/09511920902810938openalex-snapshot
Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm
inferred← citeshttps://doi.org/10.1080/09720529.2003.10697965openalex-snapshot
A dual of 4-regular graph forG × C2n
inferred← citeshttps://doi.org/10.1080/09720529.2012.10698390openalex-snapshot
Self vertex switchings of connected unicyclic graphs
inferred← citeshttps://doi.org/10.1080/09720529.2014.881132openalex-snapshot
Self Vertex Switching of Connected Two-Cyclic Graphs
inferred← citeshttps://doi.org/10.1080/09720529.2014.927652openalex-snapshot
Harmonic mean labeling of disconnected graphs
inferred← citeshttps://doi.org/10.1080/09720529.2016.1266143openalex-snapshot
Spectral conditions for traceability of connected claw-free graphs
inferred← citeshttps://doi.org/10.1080/09720529.2019.1681695openalex-snapshot
Neighborhood outer split domination in graphs
inferred← citeshttps://doi.org/10.1080/09720529.2019.1689607openalex-snapshot
Construction of Halin graph with perfect k-ary tree and its independent domination number
inferred← citeshttps://doi.org/10.1080/09720529.2021.1923920openalex-snapshot
A new ideal secret sharing scheme based on a tree
inferred← citeshttps://doi.org/10.1080/10637199608915566openalex-snapshot
A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL
inferred← citeshttps://doi.org/10.1080/11663081.2012.682442openalex-snapshot
Search for syllogistic structure of semantic information
inferred← citeshttps://doi.org/10.1080/14926156.2014.903317openalex-snapshot
Duoethnography: A New Research Methodology for Mathematics Education
inferred← citeshttps://doi.org/10.1080/15427951.2015.1110542openalex-snapshot
Firefighting as a Strategic Game
inferred← citeshttps://doi.org/10.1080/17445760500355777openalex-snapshot
Listing combinatorial objects in parallel
inferred← citeshttps://doi.org/10.1080/17498430.2013.788891openalex-snapshot
The mathematician who drove Whist forward: William Henry Whitfeld (1856–1915)
inferred← citeshttps://doi.org/10.1080/18756891.2009.9727652openalex-snapshot
Anisotropic Wavelet-Based Image Nearness Measure
inferred← citeshttps://doi.org/10.1080/23311835.2015.1123340openalex-snapshot
Super edge-magic sequence of maximal outer planer graph and its characteristics
inferred← citeshttps://doi.org/10.1080/23311835.2016.1186135openalex-snapshot
Double domination in signed graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/1008/1/012037openalex-snapshot
On the modification Highly Connected Subgraphs (HCS) algorithm in graph clustering for weighted graph
inferred← citeshttps://doi.org/10.1088/1742-6596/1008/1/012039openalex-snapshot
The Construction of ${P}_{2}\vartriangleright H$-antimagic graph using smaller edge-antimagic vertex labeling
inferred← citeshttps://doi.org/10.1088/1742-6596/1116/2/022033openalex-snapshot
Talenta
inferred← citeshttps://doi.org/10.1088/1742-6596/1211/1/012008openalex-snapshot
On the total vertex irregularity strength of Cn *2 Kn graph
inferred← citeshttps://doi.org/10.1088/1742-6596/1211/1/012012openalex-snapshot
On super $(a,d)-{P}_{2}\unicode{x22B3}H$ antimagic total labeling of disjoint union of comb product graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/1722/1/012049openalex-snapshot
Infinite Family of Ramsey (K 1,2, C 4)-minimal Graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/1836/1/012013openalex-snapshot
On the sigma chromatic number of the zero-divisor graphs of the ring of integers modulo n
inferred← citeshttps://doi.org/10.1089/cmb.2014.0128openalex-snapshot
The Worst Case Complexity of Maximum Parsimony
inferred← citeshttps://doi.org/10.11113/matematika.v32.n1.782openalex-snapshot
Some Aspects of Unitary Addition Cayley Graph of Gaussian Integers Modulo n
inferred← citeshttps://doi.org/10.1137/21m1409512openalex-snapshot
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
inferred← citeshttps://doi.org/10.1142/s0129054113400017openalex-snapshot
TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING
inferred← citeshttps://doi.org/10.1142/s0129054113500056openalex-snapshot
NEIGHBOR INTEGRITY OF TRANSFORMATION GRAPHS
inferred← citeshttps://doi.org/10.1142/s012905411450021xopenalex-snapshot
TENACITY OF TOTAL GRAPHS
inferred← citeshttps://doi.org/10.1142/s0129054119400276openalex-snapshot
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info
inferred← citeshttps://doi.org/10.1142/s0129054119500023openalex-snapshot
On a Fire Fighter’s Problem
inferred← citeshttps://doi.org/10.1142/s0129054119500230openalex-snapshot
On the Domination Integrity
inferred← citeshttps://doi.org/10.1142/s0129054123500053openalex-snapshot
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength
inferred← citeshttps://doi.org/10.1142/s0129054123500077openalex-snapshot
Node and Link Vulnerability in Complete Multipartite Networks
inferred← citeshttps://doi.org/10.1142/s0129626413500102openalex-snapshot
PARALLEL ALGORITHM FOR SECOND–ORDER RESTRICTED WEAK INTEGER COMPOSITION GENERATION FOR SHARED MEMORY MACHINES
inferred← citeshttps://doi.org/10.1142/s0129626420400095openalex-snapshot
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks
inferred← citeshttps://doi.org/10.1142/s0219265910002787openalex-snapshot
4-ORDERED HAMILTONICITY FOR SOME CHORDAL RING GRAPHS
inferred← citeshttps://doi.org/10.1145/1180405.1180418openalex-snapshot
Attribute-based encryption for fine-grained access control of encrypted data
inferred← citeshttps://doi.org/10.1145/1315245.1315270openalex-snapshot
Attribute-based encryption with non-monotonic access structures
inferred← citeshttps://doi.org/10.1145/1529282.1529502openalex-snapshot
An algorithm for optimal comma free codes with isomorphism rejection
inferred← citeshttps://doi.org/10.1155/2021/5515250openalex-snapshot
Total Roman 2 -Reinforcement of Graphs
inferred← citeshttps://doi.org/10.1155/asp/2006/85685openalex-snapshot
The Finite Heisenberg-Weyl Groups in Radar and Communications
inferred← citeshttps://doi.org/10.1201/b14977-11openalex-snapshot
Authentication Codes
inferred← citeshttps://doi.org/10.1201/b16132-67openalex-snapshot
Bandwidth
inferred← citeshttps://doi.org/10.1201/b17645-4openalex-snapshot
Wiener Index of Hexagonal Chains with Segments of Equal Length
inferred← citeshttps://doi.org/10.12677/aam.2022.111036openalex-snapshot
The Firefighter Problem on Cayley Graph
inferred← citeshttps://doi.org/10.12677/aam.2024.132072openalex-snapshot
Pentavalent Symmetric Graphs of Order 14pq
showing the first 200 of 237 · page through all 237
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.