On the public citation graph

Handbook of Combinatorial Designs

https://doi.org/10.1201/9781420010541
0 signed · 1165 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.2139/ssrn.1562703openalex-extracted
Divisible Design Graphs
inferred← citeshttps://doi.org/10.2139/ssrn.993380openalex-extracted
inferred← citeshttps://doi.org/10.1002/(sici)1520-6610(2000)8:2<141::aid-jcd6>3.0.co;2-zopenalex-snapshot
A block-size bound for Steiner 6-wise balanced designs
inferred← citeshttps://doi.org/10.1002/0471667196.ess0896.pub3openalex-snapshot
Graeco‐Latin Squares
inferred← citeshttps://doi.org/10.1002/9780470061572.eqr013openalex-snapshot
L atin Squares and Related Experimental Designs
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02251openalex-snapshot
Graeco‐Latin Squares
inferred← citeshttps://doi.org/10.1002/9781118445112.stat04085openalex-snapshot
L atin Squares and Related Experimental Designs
inferred← citeshttps://doi.org/10.1002/9781119385295.ch12openalex-snapshot
Experimental Designs
inferred← citeshttps://doi.org/10.1002/9781119520252.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9783527692095.ch12openalex-snapshot
Versuchsanlagen
inferred← citeshttps://doi.org/10.1002/bip.23250openalex-snapshot
Rational design and characterization of bioplastics from Hermetia illucens prepupae proteins
inferred← citeshttps://doi.org/10.1002/env.974openalex-snapshot
Planning of factorial experiments with one control treatment in a block design with nested rows and columns for environmental research
inferred← citeshttps://doi.org/10.1002/itl2.102openalex-snapshot
Steiner system‐based topology‐transparent priority scheduling for wireless ad hoc networks
inferred← citeshttps://doi.org/10.1002/jcd.10009openalex-snapshot
On c‐Bhaskar Rao designs with block size 4
inferred← citeshttps://doi.org/10.1002/jcd.1011openalex-snapshot
A hole‐size bound for incomplete t‐wise balanced designs
inferred← citeshttps://doi.org/10.1002/jcd.20094openalex-snapshot
Restricted b‐factors in bipartite graphs and t‐designs
inferred← citeshttps://doi.org/10.1002/jcd.20155openalex-snapshot
On the existence of resolvable K4 − e designs
inferred← citeshttps://doi.org/10.1002/jcd.20157openalex-snapshot
Pair covering and other designs with block size 6
inferred← citeshttps://doi.org/10.1002/jcd.20165openalex-snapshot
Two new infinite families of extremal class‐uniformly resolvable designs
inferred← citeshttps://doi.org/10.1002/jcd.20171openalex-snapshot
Super‐simple holey Steiner pentagon systems and related designs
inferred← citeshttps://doi.org/10.1002/jcd.20173openalex-snapshot
Decomposing complete equipartite graphs into cycles of length 2p
inferred← citeshttps://doi.org/10.1002/jcd.20178openalex-snapshot
Latin squares with no small odd plexes
inferred← citeshttps://doi.org/10.1002/jcd.20180openalex-snapshot
Skew‐Hadamard matrices of orders 436, 580, and 988 exist
inferred← citeshttps://doi.org/10.1002/jcd.20182openalex-snapshot
A class of group divisible 3‐designs and their applications
inferred← citeshttps://doi.org/10.1002/jcd.20188openalex-snapshot
There are 1,132,835,421,602,062,347 nonisomorphic one‐factorizations of K14
inferred← citeshttps://doi.org/10.1002/jcd.20194openalex-snapshot
A perfect one‐factorization of K52
inferred← citeshttps://doi.org/10.1002/jcd.20196openalex-snapshot
The Hamilton—Waterloo problem: The case of triangle‐factors and one Hamilton cycle
inferred← citeshttps://doi.org/10.1002/jcd.20198openalex-snapshot
Line spreads of PG(5, 2)
inferred← citeshttps://doi.org/10.1002/jcd.20199openalex-snapshot
On perfect Γ‐decompositions of the complete graph
inferred← citeshttps://doi.org/10.1002/jcd.20216openalex-snapshot
Mutually orthogonal graph squares
inferred← citeshttps://doi.org/10.1002/jcd.20225openalex-snapshot
Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
inferred← citeshttps://doi.org/10.1002/jcd.20226openalex-snapshot
The nonexistence of a (K6‐e)‐decomposition of the complete graph K29
inferred← citeshttps://doi.org/10.1002/jcd.20231openalex-snapshot
There is no Drake/Larson linear space on 30 points
inferred← citeshttps://doi.org/10.1002/jcd.20240openalex-snapshot
Primitive symmetric designs with prime power number of points
inferred← citeshttps://doi.org/10.1002/jcd.20243openalex-snapshot
Rainbow and orthogonal paths in factorizations of Kn
inferred← citeshttps://doi.org/10.1002/jcd.20245openalex-snapshot
On the classification of Hadamard matrices of order 32
inferred← citeshttps://doi.org/10.1002/jcd.20249openalex-snapshot
Hadamard matrices of small order and Yang conjecture
inferred← citeshttps://doi.org/10.1002/jcd.20251openalex-snapshot
Mutually disjoint designs and new 5‐designs derived from groups and codes
inferred← citeshttps://doi.org/10.1002/jcd.20252openalex-snapshot
Some rigid Steiner 5‐designs
inferred← citeshttps://doi.org/10.1002/jcd.20256openalex-snapshot
Exponential bounds on the number of designs with affine parameters
inferred← citeshttps://doi.org/10.1002/jcd.20259openalex-snapshot
Perfect difference families, perfect difference matrices, and related combinatorial structures
inferred← citeshttps://doi.org/10.1002/jcd.20277openalex-snapshot
The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points
inferred← citeshttps://doi.org/10.1002/jcd.20280openalex-snapshot
An existence theory for loopy graph decompositions
inferred← citeshttps://doi.org/10.1002/jcd.20284openalex-snapshot
Geometrical constructions of class-uniformly resolvable structure
inferred← citeshttps://doi.org/10.1002/jcd.20289openalex-snapshot
Zero-sum flows in designs
inferred← citeshttps://doi.org/10.1002/jcd.20294openalex-snapshot
Alternating groups and flag-transitive 2-(v, k, 4) symmetric designs
inferred← citeshttps://doi.org/10.1002/jcd.20298openalex-snapshot
Comments on 3‐blocked designs
inferred← citeshttps://doi.org/10.1002/jcd.21297openalex-snapshot
Simple Signed Steiner Triple Systems
inferred← citeshttps://doi.org/10.1002/jcd.21304openalex-snapshot
4‐*GDD(6n)s and Related Optimal Quaternary Constant‐Weight Codes
inferred← citeshttps://doi.org/10.1002/jcd.21315openalex-snapshot
The Asymptotic Existence of Resolvable Group Divisible Designs
inferred← citeshttps://doi.org/10.1002/jcd.21319openalex-snapshot
Trinal Decompositions of Steiner Triple Systems into Triangles
inferred← citeshttps://doi.org/10.1002/jcd.21323openalex-snapshot
Hadamard Matrices of Order 32
inferred← citeshttps://doi.org/10.1002/jcd.21331openalex-snapshot
Cops and Robbers on Graphs Based on Designs
inferred← citeshttps://doi.org/10.1002/jcd.21335openalex-snapshot
Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1002/jcd.21337openalex-snapshot
Flag‐Transitive Point‐Primitive Symmetric (ν,κ,λ) Designs With λ at Most 100
inferred← citeshttps://doi.org/10.1002/jcd.21338openalex-snapshot
Large Sets of Orthogonal Arrays and Multimagic Squares
inferred← citeshttps://doi.org/10.1002/jcd.21340openalex-snapshot
The Existence and Construction of (K5∖e)‐Designs of Orders 27, 135, 162, and 216
inferred← citeshttps://doi.org/10.1002/jcd.21361openalex-snapshot
Small Uniformly Resolvable Designs for Block Sizes 3 and 4
inferred← citeshttps://doi.org/10.1002/jcd.21364openalex-snapshot
The Mendelsohn Triple Systems of Order 13
inferred← citeshttps://doi.org/10.1002/jcd.21365openalex-snapshot
The Asymptotic Existence of Group Divisible ‐Designs of Large Order with Index One
inferred← citeshttps://doi.org/10.1002/jcd.21369openalex-snapshot
Hadamard Matrices Modulo 5
inferred← citeshttps://doi.org/10.1002/jcd.21370openalex-snapshot
On the Possible Automorphism Groups of a Steiner Quintuple System of Order 21
inferred← citeshttps://doi.org/10.1002/jcd.21380openalex-snapshot
A Construction of Almost Steiner Systems
inferred← citeshttps://doi.org/10.1002/jcd.21383openalex-snapshot
On the Structure of Semiovals of Small Size
inferred← citeshttps://doi.org/10.1002/jcd.21388openalex-snapshot
On the Existence of Friendship Hypergraphs
inferred← citeshttps://doi.org/10.1002/jcd.21391openalex-snapshot
Mutually Disjoint 5‐Designs and 5‐Spontaneous Emission Error Designs from Extremal Ternary Self‐Dual Codes
inferred← citeshttps://doi.org/10.1002/jcd.21393openalex-snapshot
A Three‐Factor Product Construction for Mutually Orthogonal Latin Squares
inferred← citeshttps://doi.org/10.1002/jcd.21394openalex-snapshot
Direct Constructions for General Families of Cyclic Mutually Nearly Orthogonal Latin Squares
inferred← citeshttps://doi.org/10.1002/jcd.21400openalex-snapshot
Classification of Graeco-Latin Cubes
inferred← citeshttps://doi.org/10.1002/jcd.21403openalex-snapshot
Intersection Numbers For Subspace Designs
inferred← citeshttps://doi.org/10.1002/jcd.21405openalex-snapshot
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
inferred← citeshttps://doi.org/10.1002/jcd.21416openalex-snapshot
Partial Geometric Difference Families
inferred← citeshttps://doi.org/10.1002/jcd.21422openalex-snapshot
Cube Designs
inferred← citeshttps://doi.org/10.1002/jcd.21506openalex-snapshot
Well‐Balanced Designs for Data Placement
inferred← citeshttps://doi.org/10.1002/jcd.21520openalex-snapshot
Tight Heffter Arrays Exist for all Possible Values
inferred← citeshttps://doi.org/10.1002/jcd.21523openalex-snapshot
A Complete Solution to the Existence of ‐Cycle Frames of Type
inferred← citeshttps://doi.org/10.1002/jcd.21531openalex-snapshot
External Difference Families from Finite Fields
inferred← citeshttps://doi.org/10.1002/jcd.21535openalex-snapshot
Sylow Theory for Quasigroups II: Sectional Action
inferred← citeshttps://doi.org/10.1002/jcd.21536openalex-snapshot
Triple Systems are Eulerian
inferred← citeshttps://doi.org/10.1002/jcd.21558openalex-snapshot
Enumerating the Walecki-Type Hamiltonian Cycle Systems
inferred← citeshttps://doi.org/10.1002/jcd.21559openalex-snapshot
Partitioning 3‐arcs into Steiner Triple Systems
inferred← citeshttps://doi.org/10.1002/jcd.21585openalex-snapshot
Ramsey theory on Steiner triples
inferred← citeshttps://doi.org/10.1002/jcd.21587openalex-snapshot
Some new designs with prescribed automorphism groups
inferred← citeshttps://doi.org/10.1002/jcd.21593openalex-snapshot
Existence of magic 3‐dimensional rectangles
inferred← citeshttps://doi.org/10.1002/jcd.21597openalex-snapshot
On quasi‐orthogonal cocycles
inferred← citeshttps://doi.org/10.1002/jcd.21602openalex-snapshot
Variable strength covering arrays
inferred← citeshttps://doi.org/10.1002/jcd.21607openalex-snapshot
Group divisible designs with block size 4 and type
inferred← citeshttps://doi.org/10.1002/jcd.21626openalex-snapshot
On the Smith normal form of a skew‐symmetric d ‐optimal design of order
inferred← citeshttps://doi.org/10.1002/jcd.21630openalex-snapshot
Uniform decompositions of complete multigraphs into cycles
inferred← citeshttps://doi.org/10.1002/jcd.21638openalex-snapshot
A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares
inferred← citeshttps://doi.org/10.1002/jcd.21662openalex-snapshot
Orthogonal factor‐pair Latin squares of prime‐power order
inferred← citeshttps://doi.org/10.1002/jcd.21668openalex-snapshot
Group divisible designs with block size four and type gum1—III
inferred← citeshttps://doi.org/10.1002/jcd.21682openalex-snapshot
Infinite families of 2‐designs from a class of cyclic codes
inferred← citeshttps://doi.org/10.1002/jcd.21685openalex-snapshot
Infinite families of 3‐designs from APN functions
inferred← citeshttps://doi.org/10.1002/jcd.21688openalex-snapshot
Cyclic cycle systems of the complete multipartite graph
inferred← citeshttps://doi.org/10.1002/jcd.21708openalex-snapshot
Quasigroups constructed from perfect Mendelsohn designs with block size 4
inferred← citeshttps://doi.org/10.1002/jcd.21711openalex-snapshot
Short k‐radius sequences, k‐difference sequences and universal cycles
inferred← citeshttps://doi.org/10.1002/jcd.21747openalex-snapshot
An extension of a construction of covering arrays
inferred← citeshttps://doi.org/10.1002/jcd.21749openalex-snapshot
The last two perfect Mendelsohn designs with block size 5
inferred← citeshttps://doi.org/10.1002/jcd.21757openalex-snapshot
Sparse Steiner triple systems of order 21
inferred← citeshttps://doi.org/10.1002/jcd.21760openalex-snapshot
Quaternary complex Hadamard matrices of order 18
inferred← citeshttps://doi.org/10.1002/jcd.21761openalex-snapshot
Graph decompositions in projective geometries
inferred← citeshttps://doi.org/10.1002/jcd.21762openalex-snapshot
The localization number of designs
inferred← citeshttps://doi.org/10.1002/jcd.21776openalex-snapshot
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
inferred← citeshttps://doi.org/10.1002/jcd.21777openalex-snapshot
Maximal partial Room squares
inferred← citeshttps://doi.org/10.1002/jcd.21796openalex-snapshot
Infinite families of 2‐designs derived from affine‐invariant codes
inferred← citeshttps://doi.org/10.1002/jcd.21801openalex-snapshot
Extended near Skolem sequences Part I
inferred← citeshttps://doi.org/10.1002/jcd.21802openalex-snapshot
Perfect and nearly perfect separation dimension of complete and random graphs
inferred← citeshttps://doi.org/10.1002/jcd.21838openalex-snapshot
Constructing block designs with a prescribed automorphism group using genetic algorithm
inferred← citeshttps://doi.org/10.1002/jcd.21839openalex-snapshot
Algorithms and complexity for counting configurations in Steiner triple systems
inferred← citeshttps://doi.org/10.1002/jcd.21844openalex-snapshot
An update on the existence of Kirkman triple systems with steiner triple systems as subdesigns
inferred← citeshttps://doi.org/10.1002/jcd.21876openalex-snapshot
Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
inferred← citeshttps://doi.org/10.1002/jcd.21906openalex-snapshot
Enumerating Steiner triple systems
inferred← citeshttps://doi.org/10.1002/jcd.21908openalex-snapshot
On the existence of k $k$‐cycle semiframes for even k $k$
inferred← citeshttps://doi.org/10.1002/jcd.21921openalex-snapshot
Orthogonal cycle systems with cycle length less than 10
inferred← citeshttps://doi.org/10.1002/jcd.21922openalex-snapshot
Dual incidences and t‐designs in vector spaces
inferred← citeshttps://doi.org/10.1002/jcd.21924openalex-snapshot
On symmetric designs with flag‐transitive and point‐quasiprimitive automorphism groups
inferred← citeshttps://doi.org/10.1002/jcd.21925openalex-snapshot
Incidence‐free sets and edge domination in incidence graphs
inferred← citeshttps://doi.org/10.1002/jcd.21929openalex-snapshot
Sailing league problems
inferred← citeshttps://doi.org/10.1002/jcd.21930openalex-snapshot
New constructions for disjoint partial difference families and external partial difference families
inferred← citeshttps://doi.org/10.1002/jcd.21942openalex-snapshot
An explicit construction for large sets of infinite dimensional q $q$‐Steiner systems
inferred← citeshttps://doi.org/10.1002/jcd.21944openalex-snapshot
New results on large sets of orthogonal arrays and orthogonal arrays
inferred← citeshttps://doi.org/10.1002/jcd.21949openalex-snapshot
Mutual incidence matrix of two balanced incomplete block designs
inferred← citeshttps://doi.org/10.1002/jcd.21952openalex-snapshot
Symmetric 2‐(36,15,6) $(36,15,6)$ designs with an automorphism of order two
inferred← citeshttps://doi.org/10.1002/jcd.21957openalex-snapshot
Nestings of BIBDs with block size four
inferred← citeshttps://doi.org/10.1002/jcd.21963openalex-snapshot
New Families of Strength‐3 Covering Arrays Using Linear Feedback Shift Register Sequences
inferred← citeshttps://doi.org/10.1002/jcd.21974openalex-snapshot
More Heffter Spaces via Finite Fields
inferred← citeshttps://doi.org/10.1002/jcd.21975openalex-snapshot
Cycle Switching in Steiner Triple Systems of Order 19
inferred← citeshttps://doi.org/10.1002/jcd.21976openalex-snapshot
GDD Type Spanning Bipartite Block Designs
inferred← citeshttps://doi.org/10.1002/jcd.21982openalex-snapshot
Doubly Orthogonal Equi‐Squares and Sliced Orthogonal Arrays
inferred← citeshttps://doi.org/10.1002/jcd.21988openalex-snapshot
How to Burn a Latin Square
inferred← citeshttps://doi.org/10.1002/jcd.21995openalex-snapshot
Classification of Minimal Blocking Sets in PG(2,11) With a Nontrivial Automorphism Group
inferred← citeshttps://doi.org/10.1002/jcd.21997openalex-snapshot
A Construction for Regular‐Graph Designs
inferred← citeshttps://doi.org/10.1002/jcd.21998openalex-snapshot
Symmetric 2‐(35,17,8) Designs With an Automorphism of Order 2
inferred← citeshttps://doi.org/10.1002/jcd.22009openalex-snapshot
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
inferred← citeshttps://doi.org/10.1002/jcd.22016openalex-snapshot
Completely (Quasi‐)Uniform Nested Boolean Steiner Quadruple Systems
inferred← citeshttps://doi.org/10.1002/jcd.70006openalex-snapshot
On Regular Quaternary Hadamard Matrices
inferred← citeshttps://doi.org/10.1002/jcd.70017openalex-snapshot
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
inferred← citeshttps://doi.org/10.1002/jcd.70029openalex-snapshot
Nonexistence of a 2‐(196,6,1) Design With a Point‐Transitive Automorphism Group
inferred← citeshttps://doi.org/10.1002/jcd.70037openalex-snapshot
Exact Values and Bounds on Covering Schemes of Strength Two
inferred← citeshttps://doi.org/10.1002/jgt.21792openalex-snapshot
Induced Decompositions of Highly Dense Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22815openalex-snapshot
Ramsey numbers of large books
inferred← citeshttps://doi.org/10.1002/jgt.23251openalex-snapshot
On Tournament Inversion
inferred← citeshttps://doi.org/10.1002/mma.4820openalex-snapshot
Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers
inferred← citeshttps://doi.org/10.1002/mmce.21882openalex-snapshot
An anti‐collision algorithm based on balanced incomplete block design in RFID systems
inferred← citeshttps://doi.org/10.1002/net.20251openalex-snapshot
Lower bounds for two‐period grooming via linear programming duality
inferred← citeshttps://doi.org/10.1002/net.20252openalex-snapshot
Grooming for two‐period optical networks
inferred← citeshttps://doi.org/10.1002/net.20410openalex-snapshot
Traffic grooming in bidirectional WDM ring networks
inferred← citeshttps://doi.org/10.1002/qre.2605openalex-snapshot
Direct construction of globally D‐optimal designs for factors at two levels and main effects models
inferred← citeshttps://doi.org/10.1002/rsa.20509openalex-snapshot
A recursive construction of t -wise uniform permutations
inferred← citeshttps://doi.org/10.1002/spy2.334openalex-snapshot
Optimal key pre‐distribution schemes from affine resolvable and partially affine resolvable designs
inferred← citeshttps://doi.org/10.1002/wics.100openalex-snapshot
Optimal experimental design
inferred← citeshttps://doi.org/10.1006/jcta.1999.3005openalex-snapshot
Decompositions of Edge-Colored Complete Graphs
inferred← citeshttps://doi.org/10.1007/11874850_25openalex-snapshot
Mirrored Traveling Tournament Problem: An Evolutionary Approach
inferred← citeshttps://doi.org/10.1007/978-1-4613-0245-2_7openalex-snapshot
Hadamard Matrices, Orthogonal Designs and Construction Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-6940-7_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-030-10419-1_9openalex-snapshot
Ideal Factorization Method and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-21363-3_15openalex-snapshot
Algebraic Models for Arbitrary Strength Covering Arrays over v-ary Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-030-31154-4_45openalex-snapshot
Design and Optimization of the Thermo-Mechanical Behavior in Glass Reinforced Polyamide 6 for Automotive Application
inferred← citeshttps://doi.org/10.1007/978-3-030-43120-4_24openalex-snapshot
IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-52200-1_16openalex-snapshot
Isomorphism and Invariants of Parallelisms of Projective Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-55857-4_7openalex-snapshot
Perfect Hash Families: The Generalization to Higher Indices
inferred← citeshttps://doi.org/10.1007/978-3-030-57881-7_6openalex-snapshot
Designs from the Narrow-Sense Primitive BCH Codes $$\mathcal {C}_{(q, q^m-1, \delta _3, 1)}$$
inferred← citeshttps://doi.org/10.1007/978-3-030-64616-5_50openalex-snapshot
Enumerating the Orthogonal Diagonal Latin Squares of Small Order for Different Types of Orthogonality
inferred← citeshttps://doi.org/10.1007/978-3-030-66895-2_9openalex-snapshot
Evaluation of Efficiency of Using Simple Transformations When Searching for Orthogonal Diagonal Latin Squares of Order 10
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_2openalex-snapshot
Search for Combinatorial Objects Using Lattice Algorithms – Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-81097-9_1openalex-snapshot
A Modular First Formalisation of Combinatorial Design Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-92864-3_40openalex-snapshot
Using Mobile Devices in a Voluntary Distributed Computing Project to Solve Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-94141-3_13openalex-snapshot
Improving the Heterogeneous Computing Node Performance of the Desktop Grid When Searching for Orthogonal Diagonal Latin Squares
inferred← citeshttps://doi.org/10.1007/978-3-031-15911-4_2openalex-snapshot
Time, Privacy, Robustness, Accuracy: Trade-Offs for the Open Vote Network Protocol
inferred← citeshttps://doi.org/10.1007/978-3-031-22944-2_10openalex-snapshot
PIR Codes from Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-22944-2_9openalex-snapshot
Optimal Possibly Nonlinear 3-PIR Codes of Small Size
inferred← citeshttps://doi.org/10.1007/978-3-031-24866-5_2openalex-snapshot
From Design of Experiments to Combinatorics of Disasters: A Conceptual Framework for Disaster Exercises
inferred← citeshttps://doi.org/10.1007/978-3-031-37283-4_1openalex-snapshot
Leagues, Tournaments, and Schedules
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1openalex-snapshot
New Advances in Designs, Codes and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_14openalex-snapshot
On a Class of Optimal Constant Weight Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_16openalex-snapshot
Self-Orthogonal Latin Squares and Room Squares
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_21openalex-snapshot
Orthogonal and Strong Frame Starters: Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_9openalex-snapshot
Constructing Random Steiner Triple Systems: An Experimental Study
inferred← citeshttps://doi.org/10.1007/978-3-031-49435-2_4openalex-snapshot
Diagonalization and Canonization of Latin Squares
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_5openalex-snapshot
Resolutions for an Infinite Family of Bose Triple Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-62166-6_15openalex-snapshot
Strongly Regular Multigraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-62166-6_18openalex-snapshot
The Spectrum Problem for the 4-Uniform 4-Colorable 3-Cycles with Maximum Degree 2
inferred← citeshttps://doi.org/10.1007/978-3-031-62166-6_22openalex-snapshot
Decomposing the $$\lambda $$-Fold Complete 3-Uniform Hypergraph into the Lines of the Pasch Configuration
inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_19openalex-snapshot
Boosting Few-Pixel Robustness Verification via Covering Verification Designs
inferred← citeshttps://doi.org/10.1007/978-3-031-85604-4_6openalex-snapshot
Modeling Biological Systems: Switching in Auditory Recognition
inferred← citeshttps://doi.org/10.1007/978-3-031-96311-7_22openalex-snapshot
Point-Cyclic KTS(45)
inferred← citeshttps://doi.org/10.1007/978-3-032-08549-8_4openalex-snapshot
On Maximum Packings of the $$\lambda $$-Fold Complete 3-Uniform Hypergraph with Loose 4-Paths
inferred← citeshttps://doi.org/10.1007/978-3-032-08606-8_9openalex-snapshot
Exploring Constraint-Based Approaches for Disaster Scenario Generation
inferred← citeshttps://doi.org/10.1007/978-3-032-15635-8_30openalex-snapshot
The Traveling Tournament Problem: Valid Solutions Are Different Across Instance Sizes
inferred← citeshttps://doi.org/10.1007/978-3-032-30805-4_16openalex-snapshot
FedBIBD: Balanced Incomplete Block Design for Fair Practical Federated Learning
inferred← citeshttps://doi.org/10.1007/978-3-0348-0554-4_3openalex-snapshot
Subsets
inferred← citeshttps://doi.org/10.1007/978-3-0348-0554-4_4openalex-snapshot
Kirkman’s Ladies, A Combinatorial Design
inferred← citeshttps://doi.org/10.1007/978-3-0348-0554-4_5openalex-snapshot
Twelve
inferred← citeshttps://doi.org/10.1007/978-3-0348-0554-4_6openalex-snapshot
(9,4,3)
inferred← citeshttps://doi.org/10.1007/978-3-0348-0554-4_7openalex-snapshot
55 Chords
inferred← citeshttps://doi.org/10.1007/978-3-319-10515-4_12openalex-snapshot
Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation
inferred← citeshttps://doi.org/10.1007/978-3-319-10683-0_6openalex-snapshot
Open Problems for Polynomials over Finite Fields and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-17729-8_10openalex-snapshot
On Symmetric Designs and Binary 3-Frameproof Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-17729-8_12openalex-snapshot
Mutually Unbiased Biangular Vectors and Association Schemes
showing the first 200 of 1165 · page through all 1165
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.