2024
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions.
SN Comput. Sci., 2024
Guaranteeing anonymity in attribute-based authorization.
J. Inf. Secur. Appl., 2024
Detecting arrays for effects of multiple interacting factors.
Inf. Comput., 2024
Sets of mutually orthogoval projective and affine planes.
Comb. Theory, 2024
2023
The spectrum of resolvable Bose triple systems.
Discret. Math., July, 2023
Algorithmic methods for covering arrays of higher index.
J. Comb. Optim., 2023
Summary of In-Parameter-Order strategies for covering perfect hash families.
Proceedings of the IEEE International Conference on Software Testing, Verification and Validation, ICST 2023, 2023
2022
Mixed covering arrays on graphs of small treewidth.
Discret. Math. Algorithms Appl., 2022
Egalitarian Steiner quadruple systems of doubly even order.
Discret. Math., 2022
In-Parameter-Order strategies for covering perfect hash families.
Appl. Math. Comput., 2022
Balanced and Swap-Robust Trades for Dynamical Distributed Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2022
2021
Network reliability: Heading out on the highway.
Networks, 2021
Egalitarian Edge Orderings of Complete Graphs.
Graphs Comb., 2021
Egalitarian Steiner triple systems for data popularity.
Des. Codes Cryptogr., 2021
2020
Set-Codes with Small Intersections and Small Discrepancies.
SIAM J. Discret. Math., 2020
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019).
Theory Comput. Syst., 2020
New bounds on the maximum size of Sperner partition systems.
Eur. J. Comb., 2020
Access balancing in storage systems by labeling partial Steiner systems.
Des. Codes Cryptogr., 2020
Algorithms for Constructing Anonymizing Arrays.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
Popularity Block Labelling for Steiner Systems.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020
2019
Distributing hash families with few rows.
Theor. Comput. Sci., 2019
Constructions of optimal orthogonal arrays with repeated rows.
Discret. Math., 2019
Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation.
Comput. Commun., 2019
Robustness of Recovery in Locating Array-Based Screening Experiments.
Proceedings of the 2019 Spring Simulation Conference, 2019
Partitioned Search with Column Resampling for Locating Array Construction.
Proceedings of the 2019 IEEE International Conference on Software Testing, 2019
Genetic algorithms for affine transformations to existential <i>t</i>-restrictions.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019
Detecting Arrays for Main Effects.
Proceedings of the Algebraic Informatics - 8th International Conference, 2019
2018
Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing.
IEEE Trans. Reliab., 2018
Partial Covering Arrays: Algorithms and Asymptotics.
Theory Comput. Syst., 2018
On a Combinatorial Framework for Fault Characterization.
Math. Comput. Sci., 2018
Improved Strength Four Covering Arrays with Three Symbols.
Graphs Comb., 2018
Fractal Perfect Hash Families (Extended Abstract).
Electron. Notes Discret. Math., 2018
Asymptotic and constructive methods for covering perfect hash families and covering arrays.
Des. Codes Cryptogr., 2018
A hierarchical framework for recovery in compressive sensing.
Discret. Appl. Math., 2018
Subspace restrictions and affine composition for covering perfect hash families.
Art Discret. Appl. Math., 2018
Testbed Evaluation of Optimized REACT over Multi-hop Paths.
Proceedings of the Wired/Wireless Internet Communications, 2018
Separating Interaction Effects Using Locating and Detecting Arrays.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
Analysis of large-scale experimental data from wireless networks.
Proceedings of the IEEE INFOCOM 2018, 2018
Counting Subwords and Regular Languages.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018
2017
Compressed Sensing With Combinatorial Designs: Theory and Simulations.
IEEE Trans. Inf. Theory, 2017
Upper Bounds on the Size of Covering Arrays.
SIAM J. Discret. Math., 2017
Steiner Triple Systems with High Chromatic Index.
SIAM J. Discret. Math., 2017
Variable-weight topology-transparent scheduling.
Comput. Networks, 2017
2016
Disjoint Spread Systems and Fault Location.
SIAM J. Discret. Math., 2016
Two-stage algorithms for covering array construction.
CoRR, 2016
Screening interacting factors in a wireless network testbed using locating arrays.
Proceedings of the IEEE Conference on Computer Communications Workshops, 2016
Coverage, Location, Detection, and Measurement.
Proceedings of the Ninth IEEE International Conference on Software Testing, 2016
2015
A Discrete Particle Swarm Optimization for Covering Array Generation.
IEEE Trans. Evol. Comput., 2015
Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems.
ACM SIGOPS Oper. Syst. Rev., 2015
Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm.
J. Comput. Sci. Technol., 2015
Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures.
Inf. Softw. Technol., 2015
Augmentation of Covering Arrays of Strength Two.
Graphs Comb., 2015
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses.
Des. Codes Cryptogr., 2015
Compressed sensing and designs: theory and simulations.
CoRR, 2015
Steiner loops satisfying Moufang's theorem.
Australas. J Comb., 2015
2014
ATLAS: Adaptive Topology- andLoad-Aware Scheduling.
IEEE Trans. Mob. Comput., 2014
Covering arrays, augmentation, and quilting arrays.
Discret. Math. Algorithms Appl., 2014
f-vectors of pure complexes and pure multicomplexes of rank three.
Discret. Math., 2014
Hierarchical Recovery in Compressive Sensing.
CoRR, 2014
Sequence Covering Arrays and Linear Extensions.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014
2013
Topological Persistence for Medium Access Control.
IEEE Trans. Mob. Comput., 2013
Sequence Covering Arrays.
SIAM J. Discret. Math., 2013
Covering and packing for pairs.
J. Comb. Theory A, 2013
The BioIntelligence Framework: a new computational platform for biomedical knowledge computing.
J. Am. Medical Informatics Assoc., 2013
The Existence of (K 2 × K 6)-Designs.
Graphs Comb., 2013
Randomized post-optimization of covering arrays.
Eur. J. Comb., 2013
ATLAS: Adaptive Topology- and Load-Aware Scheduling
CoRR, 2013
Empirically Identifying the Best Greedy Algorithm for Covering Array Generation.
Proceedings of the Sixth IEEE International Conference on Software Testing, 2013
Test algebra for combinatorial testing.
Proceedings of the 8th International Workshop on Automation of Software Test, 2013
Adaptive Fault Detection for Testing Tenant Applications in Multi-tenancy SaaS Systems.
Proceedings of the 2013 IEEE International Conference on Cloud Engineering, 2013
Randomized Post-optimization for t-Restrictions.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013
Other combinatorial structures.
Proceedings of the Handbook of Finite Fields., 2013
Proceedings of the Handbook of Finite Fields., 2013
2012
Strengthening hash families and compressive sensing.
J. Discrete Algorithms, 2012
Cover starters for covering arrays of strength two.
Discret. Math., 2012
Grooming traffic to minimize load.
Discret. Math., 2012
Trails of triples in partial triple systems.
Des. Codes Cryptogr., 2012
Variable Weight Sequences for Adaptive Scheduled Access in MANETs.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012
2011
Covering arrays and hash families.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011
Compressive Sensing Matrices and Hash Families.
IEEE Trans. Commun., 2011
Grooming Traffic to Maximize Throughput in SONET Rings.
JOCN, 2011
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19.
Discret. Math., 2011
Optical grooming with grooming ratio nine.
Discret. Math., 2011
Efficient Conditional Expectation Algorithms for Constructing Hash Families.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
Finding Interaction Faults Adaptively Using Distance-Based Strategies.
Proceedings of the 18th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, 2011
2010
A combinatorial approach to X-tolerant compaction circuits.
IEEE Trans. Inf. Theory, 2010
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4.
SIAM J. Discret. Math., 2010
Covering arrays from cyclotomy.
Des. Codes Cryptogr., 2010
Covering and radius-covering arrays: Constructions and classification.
Discret. Appl. Math., 2010
Properties of the Steiner Triple Systems of Order 19.
Electron. J. Comb., 2010
Apples and oranges: comparing schedule- and contention-based medium access control.
Proceedings of the 13th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2010
Frameproof codes and compressive sensing.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010
Boolean Aspects of Network Reliability.
Proceedings of the Boolean Models and Methods in Mathematics, 2010
2009
A density-based greedy algorithm for higher strength covering arrays.
Softw. Test. Verification Reliab., 2009
A recursive construction for perfect hash families.
J. Math. Cryptol., 2009
Multi-Terminal Network Connectedness on Series-Parallel Networks.
Discret. Math. Algorithms Appl., 2009
Minimum embedding of Steiner triple systems into (K<sub>4</sub>-e)-designs II.
Discret. Math., 2009
Graph designs for the eight-edge five-vertex graphs.
Discret. Math., 2009
Chip firing and all-terminal network reliability bounds.
Discret. Optim., 2009
Linear hash families and forbidden configurations.
Des. Codes Cryptogr., 2009
Merging covering arrays and compressing multiple sequence alignments.
Discret. Appl. Math., 2009
Optical grooming with grooming ratio eight.
Discret. Appl. Math., 2009
Small stopping sets in Steiner triple systems.
Cryptogr. Commun., 2009
Randomized Postoptimization of Covering Arrays.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
Multiterminal measures for network reliability and resilience.
Proceedings of the 7th International Workshop on Design of Reliable Communication Networks, 2009
Binary Covering Arrays and Existentially Closed Graphs.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009
2008
Rateless forward error correction for topology-transparent scheduling.
IEEE/ACM Trans. Netw., 2008
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven.
SIAM J. Discret. Math., 2008
Grooming for two-period optical networks.
Networks, 2008
Lower bounds for two-period grooming via linear programming duality.
Networks, 2008
Locating and detecting arrays for interaction faults.
J. Comb. Optim., 2008
Directed complete bipartite graph decompositions: Indirect constructions.
Discret. Math., 2008
Minimum embedding of Steiner triple systems into (K<sub>4</sub>-e)-designs I.
Discret. Math., 2008
Fully gated graphs: Recognition and convex operations.
Discret. Math., 2008
Strength two covering arrays: Existence tables and projection.
Discret. Math., 2008
Constructing strength three covering arrays with augmented annealing.
Discret. Math., 2008
2007
Ternary Schedules for Energy-Limited Sensor Networks.
IEEE Trans. Inf. Theory, 2007
The density algorithm for pairwise interaction testing.
Softw. Test. Verification Reliab., 2007
Multiterminal resilience for series-parallel networks.
Networks, 2007
Perfect Hash Families: Constructions and Existence.
J. Math. Cryptol., 2007
Failed disk recovery in double erasure RAID arrays.
J. Discrete Algorithms, 2007
Transport schemes for topology-transparent scheduling.
J. Comb. Optim., 2007
Biased covering arrays for progressive ranking and composition of Web Services.
Int. J. Simul. Process. Model., 2007
Lower bounds on multiple sequence alignment using exact 3-way alignment.
BMC Bioinform., 2007
A carrier sense multiple access protocol with power backoff (CSMA/PB).
Ad Hoc Networks, 2007
Just-in-Time Online Scheduling for WDM EPONs.
Proceedings of IEEE International Conference on Communications, 2007
One-test-at-a-time heuristic search for interaction test suites.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007
2006
The effects of synchronization on topology-transparent scheduling.
Wirel. Networks, 2006
Prioritized interaction testing for pair-wise coverage with seeding and constraints.
Inf. Softw. Technol., 2006
Detecting and Locating Interaction Faults.
Electron. Notes Discret. Math., 2006
Roux-type constructions for covering arrays of strengths three and four.
Des. Codes Cryptogr., 2006
On constant composition codes.
Discret. Appl. Math., 2006
Slot synchronized topology-transparent scheduling for sensor networks.
Comput. Commun., 2006
Topology-Transparent Schedules for Energy Limited Ad hoc Networks.
Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006
Optimal memoryless encoding for low power off-chip data buses.
Proceedings of the 2006 International Conference on Computer-Aided Design, 2006
2005
Optimal frequency-hopping sequences via cyclotomy.
IEEE Trans. Inf. Theory, 2005
Test prioritization for pairwise interaction coverage.
ACM SIGSOFT Softw. Eng. Notes, 2005
A Recursive Construction For Regular Difference Triangle Sets.
SIAM J. Discret. Math., 2005
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio <i>C</i> = 6.
SIAM J. Discret. Math., 2005
Embedding path designs into kite systems.
Discret. Math., 2005
Ovals and hyperovals in nets.
Discret. Math., 2005
Software performance testing using covering arrays: efficient screening designs with categorical factors.
Proceedings of the Fifth International Workshop on Software and Performance, 2005
Progressive Ranking and Composition of Web Services Using Covering Arrays.
Proceedings of the 10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2005), 2005
Constructing interaction test suites with greedy algorithms.
Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), 2005
A framework of greedy methods for constructing interaction test suites.
Proceedings of the 27th International Conference on Software Engineering (ICSE 2005), 2005
2004
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares.
IEEE Trans. Inf. Theory, 2004
Sequence designs for ultra-wideband impulse radio with optimal correlation properties.
IEEE Trans. Inf. Theory, 2004
Optimal (<i>n</i>, 4, 2)-OOC of small orders.
Discret. Math., 2004
Grooming in unidirectional rings: <i>K</i><sub>4</sub>-<i>e</i> designs.
Discret. Math., 2004
Cover-Free Families and Topology-Transparent Scheduling for MANETs.
Des. Codes Cryptogr., 2004
Constructions for Permutation Codes in Powerline Communications.
Des. Codes Cryptogr., 2004
Ladder orderings of pairs and RAID performance.
Discret. Appl. Math., 2004
Dynamic spectrum utilization in ad hoc networks.
Comput. Networks, 2004
Experimental designs in software engineering: d-optimal designs and covering arrays.
Proceedings of the ACM Workshop on Interdisciplinary Software Engineering Research, 2004
Securing dynamic spectrum use.
Proceedings of the 60th IEEE Vehicular Technology Conference, 2004
Scheduled persistence for medium access control in sensor networks.
Proceedings of the 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004
Topology Transparent Scheduling, Synchronization, and Maximum Delay.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004
A deterministic density algorithm for pairwise interaction coverage.
Proceedings of the IASTED International Conference on Software Engineering, 2004
2003
Optimal and pessimal orderings of Steiner triple systems in disk arrays.
Theor. Comput. Sci., 2003
Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index.
Graphs Comb., 2003
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs.
Discret. Math., 2003
Resolving P(v, 3, λ) designs into regular P<sub>3</sub>-configurations.
Australas. J Comb., 2003
On Quaternary MacDonald Codes.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003
Augmenting Simulated Annealing to Build Interaction Test Suites.
Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 2003
Constructing Test Suites for Interaction Testing.
Proceedings of the 25th International Conference on Software Engineering, 2003
Topology-transparent scheduling for MANETs using orthogonal arrays.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003
Variable Strength Interaction Testing of Components.
Proceedings of the 27th International Computer Software and Applications Conference (COMPSAC 2003): Design and Assessment of Trustworthy Software-Based Systems, 2003
Steiner Systems for Topology-Transparent Access Control in MANETs.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003
2002
Kirkman triple systems of order 21 with nontrivial automorphism group.
Math. Comput., 2002
Preface: In Honour of Ronald C. Mullin.
Des. Codes Cryptogr., 2002
The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs.
Des. Codes Cryptogr., 2002
Projective planes and congestion-free networks.
Discret. Appl. Math., 2002
Construction of optimal quality control for oligo arrays.
Bioinform., 2002
NS1D0 Sequences and Anti-Pasch Steiner Triple Systems.
Ars Comb., 2002
2001
Equireplicate Balanced Binary Codes for Oligo Arrays.
SIAM J. Discret. Math., 2001
Minimizing drop cost for SONET/WDM networks with wavelength requirements.
Networks, 2001
Quorum Systems Constructed from Combinatorial Designs.
Inf. Comput., 2001
Triangulations and a generalization of Bose's method.
Discret. Math., 2001
(M, S)-optimal designs with block size three.
Australas. J Comb., 2001
Ordering disks for double erasure codes.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Cluttered Orderings for the Complete Graph.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs.
J. Graph Theory, 2000
Transversal Designs in Classical Planes and Spaces.
J. Comb. Theory A, 2000
Quorums from difference covers.
Inf. Process. Lett., 2000
Modified group divisible designs with block size four.
Discret. Math., 2000
Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-User Communication Systems.
Des. Codes Cryptogr., 2000
Coding, Cryptography, and Computer Security - Preface.
Discret. Appl. Math., 2000
Asymptotically optimal erasure-resilient codes for large disk arrays.
Discret. Appl. Math., 2000
Multiple Access Communications Using Combinatorial Designs.
Proceedings of the Theoretical Aspects of Computer Science, 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Kirkman school project designs.
Discret. Math., 1999
Covering Arrays of Strength Three.
Des. Codes Cryptogr., 1999
Bicoloring Steiner Triple Systems.
Electron. J. Comb., 1999
Balanced sampling plans with block size four excluding contiguous units.
Australas. J Comb., 1999
1998
A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges.
Theor. Comput. Sci., 1998
Completing the spectrum of rotational Mendelsohn triple systems.
Discret. Math., 1998
Tight 4-factor orthogonal main effect plans.
Discret. Math., 1998
Point Code Minimum Steiner Triple Systems.
Des. Codes Cryptogr., 1998
Deleting Lines in Projective Planes.
Ars Comb., 1998
On Directed Incomplete Transversal Designs with Block Size Five.
Ars Comb., 1998
1997
Constructions for difference triangle sets.
IEEE Trans. Inf. Theory, 1997
Wang Tilings and Distributed Verification on Anonymous Torus Networks.
Theory Comput. Syst., 1997
Pairwise Balanced Designs with Block Sizes 8, 9, and 10.
J. Comb. Theory A, 1997
Balanced Steiner Triple Systems.
J. Comb. Theory A, 1997
Complete Arcs in Steiner Triple Systems.
J. Comb. Theory A, 1997
Pairwise Balanced Designs with Consecutive Block Sizes.
Des. Codes Cryptogr., 1997
Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda.
Des. Codes Cryptogr., 1997
1996
Cohen-Macaulay Rings in Network Reliability.
SIAM J. Discret. Math., 1996
Equitable Embeddings of Steiner Triple Systems.
J. Comb. Theory A, 1996
Two Algorithms for Unranking Arborescences.
J. Algorithms, 1996
Transversal Designs of Block Size Eight and Nine.
Eur. J. Comb., 1996
Existence of three HMOLS of types h<sup>n</sup> and 2<sup>n</sup>3<sup>1</sup>.
Discret. Math., 1996
Concerning Difference Matrices.
Des. Codes Cryptogr., 1996
N(n), v(n): Similarities and Differences.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
1995
Consecutive cuts and paths, and bounds on <i>k</i>-terminal reliability.
Networks, 1995
Partial Steiner Triple Systems with Equal-Sized Holes.
J. Comb. Theory A, 1995
Thwarts in Transversal Designs.
Des. Codes Cryptogr., 1995
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.
Discret. Appl. Math., 1995
The Complexity of Computing the Tutte Polynomial on Transversal Matroids.
Comb., 1995
Existence of six incomplete MOLS.
Australas. J Comb., 1995
Orthogonal resolutions of triple systems.
Australas. J Comb., 1995
1994
Anti-mitre steiner triple systems.
Graphs Comb., 1994
Concerning difference families with block size four.
Discret. Math., 1994
Network reliability and the probabilistic estimation of damage from fire spread.
Ann. Oper. Res., 1994
Conflict-free access to constant-perimeter, rectangular, subarrays.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994
1993
Evaluating performability: Most probable states and bounds.
Telecommun. Syst., 1993
Transformations on channel graphs.
IEEE Trans. Commun., 1993
Assessing Reliability of Multistage Interconnection Networks.
IEEE Trans. Computers, 1993
Renormalization of two - terminal reliability.
Networks, 1993
Network transformations and bounding network reliability.
Networks, 1993
ZOR Methods Model. Oper. Res., 1993
Support sizes of sixfold triple systems.
Discret. Math., 1993
Reliable assignments of processors to tasks and factoring on matroids.
Discret. Math., 1993
The Spectrum of Maximal Partial Steiner Triple Systems.
Des. Codes Cryptogr., 1993
Computing Residual Connectedness Reliability for Restricted Networks.
Discret. Appl. Math., 1993
Threshold Channel Graphs.
Comb. Probab. Comput., 1993
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993
Conflict-Free Access for the Collections of Templates.
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993
1992
Roots of the Reliability Polynomial.
SIAM J. Discret. Math., 1992
Series-parallel subgraphs of planar graphs.
Networks, 1992
Conflict-Free Access to Parallel Memories.
J. Parallel Distributed Comput., 1992
Directed star decompositions of the complete directed graph.
J. Graph Theory, 1992
Support Sizes of Triple Systems.
J. Comb. Theory A, 1992
A New Class of Group Divisible Designs with Block Size Three.
J. Comb. Theory A, 1992
A Parallelization of Miller's n^log n Isomorphism Technique.
Inf. Process. Lett., 1992
Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems.
Des. Codes Cryptogr., 1992
A Note on Bounding k-Terminal Reliability.
Algorithmica, 1992
Networks and Reliability in Maple.
Proceedings of the Computational Support for Discrete Mathematics, 1992
On Implementing an Environment for Investigating Network reliability.
Proceedings of the Computer Science and Operations Research, 1992
1991
Spanning sets and scattering sets in Steiner triple systems.
J. Comb. Theory A, 1991
Partitioning Steiner triple systems into complete arcs.
Discret. Math., 1991
The fine structure of threefold triple systems: u = 1 or 3 (mod 6).
Discret. Math., 1991
Directed star decompositions of directed multigraphs.
Discret. Math., 1991
Intersections and supports of quadruple systems.
Discret. Math., 1991
The number of t-wise balance designs.
Comb., 1991
Network reliability: Numbers or insight? - A discussion paper.
Ann. Oper. Res., 1991
Combinatorial aspects of network reliability.
Ann. Oper. Res., 1991
Leaves, excesses and neighbourhoods in triple systems.
Australas. J Comb., 1991
The fine structure of threefold triple systems: v≡5(mod 6).
Australas. J Comb., 1991
1990
Combining monte carlo estimates and bounds for network reliability.
Networks, 1990
Efficient algorithms for computing the reliability of permutation and interval graphs.
Networks, 1990
Repeated edges in 2-factorizations.
J. Graph Theory, 1990
On two dual classes of planar graphs.
Discret. Math., 1990
Permutation graphs: Connected domination and Steiner trees.
Discret. Math., 1990
The spectrum of support sizes for threefold triple systems.
Discret. Math., 1990
Probabilistic single processor scheduling.
Discret. Appl. Math., 1990
Large sets of disjoint t-designs.
Australas. J Comb., 1990
1989
Multiplicative improvements in network reliability bounds.
Networks, 1989
Matroid Steiner problems, the Tutte polynomial and network reliability.
J. Comb. Theory B, 1989
Simple neighbourhoods in triple systems.
J. Comb. Theory A, 1989
Unranking and Ranking Spanning Trees of a Graph.
J. Algorithms, 1989
Series-Parallel Bounds for the Two-Terminal Reliability Problem.
INFORMS J. Comput., 1989
Hybrid triple systems and cubic feedback sets.
Graphs Comb., 1989
Percentages in pairwise balanced designs.
Discret. Math., 1989
Applications of Combinatorial Designs in Computer Science.
ACM Comput. Surv., 1989
Bounding Network Parameters by Approximating Graphs.
Proceedings of the Reliability Of Computer And Communication Networks, 1989
1988
A Set System Polynomial with Colouring and Reliability Applications.
SIAM J. Discret. Math., 1988
Bounding all-terminal reliability in computer networks.
Networks, 1988
Edge-packing of graphs and network reliability.
Discret. Math., 1988
The strong chromatic number of partial triple systems.
Discret. Appl. Math., 1988
Lower bounds on two-terminal network reliability.
Discret. Appl. Math., 1988
1987
Counting almost minimum cutsets with reliability applications.
Math. Program., 1987
1986
Improving reliability bounds in computer networks.
Networks, 1986
Quadratic leaves of maximal partial triple systems.
Graphs Comb., 1986
Some NP-complete problems for hypergraph degree sequences.
Discret. Appl. Math., 1986
1985
Some Empirical Observations on Program Behavior with Applications to Program Restructuring.
IEEE Trans. Software Eng., 1985
Optimum Communication Spanning Trees in Series-Parallel Networks.
SIAM J. Comput., 1985
The most reliable series-parallel networks.
Networks, 1985
Cataloguing the graphs on 10 vertices.
J. Graph Theory, 1985
1984
Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda.
J. Comb. Theory A, 1984
A census of regular 3-polystroma arising from honeycombs.
Discret. Math., 1984
The complexity of completing partial Latin squares.
Discret. Appl. Math., 1984
Concurrent Transmissions in Broadcast Networks.
Proceedings of the Automata, 1984
1983
Steiner trees, partial 2-trees, and minimum IFI networks.
Networks, 1983
Every Twofold Triple System Can Be Directed.
J. Comb. Theory A, 1983
Embedding Partial Steiner Triple Systems Is NP-Complete.
J. Comb. Theory A, 1983
Completing small partial triple systems.
Discret. Math., 1983
1982
Colouring steiner quadruple systems.
Discret. Appl. Math., 1982
Computing the Chromatic Index of Steiner Triple Systems.
Comput. J., 1982
1981
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs.
SIAM J. Comput., 1981
On testing isomorphism of permutation graphs.
Networks, 1981
Cyclic Block Designs With Block Size 3.
Eur. J. Comb., 1981
Concerning the complexity of deciding isomorphism of block designs.
Discret. Appl. Math., 1981
1980
The complexity of graph isomorphism and related problems.
PhD thesis, 1980
A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability.
Inf. Process. Lett., 1980
On deciding switching equivalence of graphs.
Discret. Appl. Math., 1980
1979
Orderly algorithms for generating restricted classes of graphs.
J. Graph Theory, 1979
The Complexity of Symmetrizing Matrices.
Inf. Process. Lett., 1979
1978
Graph isomorphism and self-complementary graphs.
SIGACT News, 1978
