Charles J. Colbourn

SN Comput. Sci., 2024

Guaranteeing anonymity in attribute-based authorization.

[BibT_eX]

[DOI]

Gail-Joon Ahn

J. Inf. Secur. Appl., 2024

Detecting arrays for effects of multiple interacting factors.

[BibT_eX]

[DOI]

Inf. Comput., 2024

Sets of mutually orthogoval projective and affine planes.

[BibT_eX]

[DOI]

Comb. Theory, 2024

2023

The spectrum of resolvable Bose triple systems.

[BibT_eX]

[DOI]

Dylan Lusi

Discret. Math., July, 2023

Algorithmic methods for covering arrays of higher index.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

Summary of In-Parameter-Order strategies for covering perfect hash families.

[BibT_eX]

[DOI]

Michael Wagner

Dimitris E. Simos

Proceedings of the IEEE International Conference on Software Testing, Verification and Validation, ICST 2023, 2023

2022

Mixed covering arrays on graphs of small treewidth.

[BibT_eX]

[DOI]

Soumen Maity

Discret. Math. Algorithms Appl., 2022

Egalitarian Steiner quadruple systems of doubly even order.

[BibT_eX]

[DOI]

Discret. Math., 2022

In-Parameter-Order strategies for covering perfect hash families.

[BibT_eX]

[DOI]

Michael Wagner

Dimitris E. Simos

Appl. Math. Comput., 2022

Balanced and Swap-Robust Trades for Dynamical Distributed Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Network reliability: Heading out on the highway.

[BibT_eX]

[DOI]

Networks, 2021

Egalitarian Edge Orderings of Complete Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Egalitarian Steiner triple systems for data popularity.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2021

2020

Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019).

[BibT_eX]

[DOI]

Nadia Pisanti

Roberto Grossi

Theory Comput. Syst., 2020

New bounds on the maximum size of Sperner partition systems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Algorithms for Constructing Anonymizing Arrays.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Access Balancing in Storage Systems by Labeling Partial Steiner Systems.

[BibT_eX]

[DOI]

Charles Joseph Colbourn

Proceedings of the IEEE International Symposium on Information Theory, 2020

Popularity Block Labelling for Steiner Systems.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019

Distributing hash families with few rows.

[BibT_eX]

[DOI]

Ryan E. Dougherty

Theor. Comput. Sci., 2019

Constructions of optimal orthogonal arrays with repeated rows.

[BibT_eX]

[DOI]

Shannon Veitch

Discret. Math., 2019

Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation.

[BibT_eX]

[DOI]

Comput. Commun., 2019

Robustness of Recovery in Locating Array-Based Screening Experiments.

[BibT_eX]

[DOI]

Stephen A. Seidel

Proceedings of the 2019 Spring Simulation Conference, 2019

Set-Codes with Small Intersections and Small Discrepancies.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Partitioned Search with Column Resampling for Locating Array Construction.

[BibT_eX]

[DOI]

Douglas C. Montgomery

Proceedings of the 2019 IEEE International Conference on Software Testing, 2019

Genetic algorithms for affine transformations to existential t-restrictions.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Detecting Arrays for Main Effects.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2018

Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing.

[BibT_eX]

[DOI]

IEEE Trans. Reliab., 2018

On a Combinatorial Framework for Fault Characterization.

[BibT_eX]

[DOI]

Reshma C. Chandrasekharan

Math. Comput. Sci., 2018

Improved Strength Four Covering Arrays with Three Symbols.

[BibT_eX]

[DOI]

Soumen Maity

Yasmeen Akhtar

Graphs Comb., 2018

Fractal Perfect Hash Families (Extended Abstract).

[BibT_eX]

[DOI]

Ryan E. Dougherty

Electron. Notes Discret. Math., 2018

Asymptotic and constructive methods for covering perfect hash families and covering arrays.

[BibT_eX]

[DOI]

Kaushik Sarkar

Des. Codes Cryptogr., 2018

A hierarchical framework for recovery in compressive sensing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Subspace restrictions and affine composition for covering perfect hash families.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2018

Testbed Evaluation of Optimized REACT over Multi-hop Paths.

[BibT_eX]

[DOI]

Proceedings of the Wired/Wireless Internet Communications, 2018

Separating Interaction Effects Using Locating and Detecting Arrays.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Analysis of large-scale experimental data from wireless networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2018, 2018

Counting Subwords and Regular Languages.

[BibT_eX]

[DOI]

Ryan E. Dougherty

Thomas Finn Lidbetter

Jeffrey O. Shallit

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Compressed Sensing With Combinatorial Designs: Theory and Simulations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Upper Bounds on the Size of Covering Arrays.

[BibT_eX]

[DOI]

Kaushik Sarkar

SIAM J. Discret. Math., 2017

Steiner Triple Systems with High Chromatic Index.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Variable-weight topology-transparent scheduling.

[BibT_eX]

[DOI]

Comput. Networks, 2017

2016

Disjoint Spread Systems and Fault Location.

[BibT_eX]

[DOI]

Bingli Fan

SIAM J. Discret. Math., 2016

Two-stage algorithms for covering array construction.

[BibT_eX]

[DOI]

Kaushik Sarkar

CoRR, 2016

Partial Covering Arrays: Algorithms and Asymptotics.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Screening interacting factors in a wireless network testbed using locating arrays.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Computer Communications Workshops, 2016

Coverage, Location, Detection, and Measurement.

[BibT_eX]

[DOI]

Proceedings of the Ninth IEEE International Conference on Software Testing, 2016

2015

A Discrete Particle Swarm Optimization for Covering Array Generation.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2015

Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems.

[BibT_eX]

[DOI]

Abraham N. Aldaco

ACM SIGOPS Oper. Syst. Rev., 2015

Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2015

Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures.

[BibT_eX]

[DOI]

Inf. Softw. Technol., 2015

Augmentation of Covering Arrays of Strength Two.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Compressed sensing and designs: theory and simulations.

[BibT_eX]

[DOI]

CoRR, 2015

Steiner loops satisfying Moufang's theorem.

[BibT_eX]

[DOI]

Maria De Lourdes Merlini Giuliani

Izabella Stuhl

Australas. J Comb., 2015

2014

ATLAS: Adaptive Topology- andLoad-Aware Scheduling.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2014

Covering arrays, augmentation, and quilting arrays.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2014

f-vectors of pure complexes and pure multicomplexes of rank three.

[BibT_eX]

[DOI]

Melissa S. Keranen

Discret. Math., 2014

Hierarchical Recovery in Compressive Sensing.

[BibT_eX]

[DOI]

CoRR, 2014

Sequence Covering Arrays and Linear Extensions.

[BibT_eX]

[DOI]

Patrick C. Murray

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

Topological Persistence for Medium Access Control.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2013

Sequence Covering Arrays.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Covering and packing for pairs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

The BioIntelligence Framework: a new computational platform for biomedical knowledge computing.

[BibT_eX]

[DOI]

J. Am. Medical Informatics Assoc., 2013

The Existence of (K 2 × K 6)-Designs.

[BibT_eX]

[DOI]

Chengmin Wang

Graphs Comb., 2013

Randomized post-optimization of covering arrays.

[BibT_eX]

[DOI]

Peyman Nayeri

Goran Konjevod

Eur. J. Comb., 2013

ATLAS: Adaptive Topology- and Load-Aware Scheduling

[BibT_eX]

[DOI]

CoRR, 2013

Empirically Identifying the Best Greedy Algorithm for Covering Array Generation.

[BibT_eX]

[DOI]

Proceedings of the Sixth IEEE International Conference on Software Testing, 2013

Test algebra for combinatorial testing.

[BibT_eX]

[DOI]

Proceedings of the 8th International Workshop on Automation of Software Test, 2013

Adaptive Fault Detection for Testing Tenant Applications in Multi-tenancy SaaS Systems.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Cloud Engineering, 2013

Randomized Post-optimization for t-Restrictions.

[BibT_eX]

[DOI]

Peyman Nayeri

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Other combinatorial structures.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

Block designs.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

2012

Strengthening hash families and compressive sensing.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Cover starters for covering arrays of strength two.

[BibT_eX]

[DOI]

Discret. Math., 2012

Grooming traffic to minimize load.

[BibT_eX]

[DOI]

Discret. Math., 2012

Trails of triples in partial triple systems.

[BibT_eX]

[DOI]

Chengmin Wang

Des. Codes Cryptogr., 2012

Variable Weight Sequences for Adaptive Scheduled Access in MANETs.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications - SETA 2012, 2012

2011

Covering arrays and hash families.

[BibT_eX]

[DOI]

Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Compressive Sensing Matrices and Hash Families.

[BibT_eX]

[DOI]

Christopher McLean

IEEE Trans. Commun., 2011

Grooming Traffic to Maximize Throughput in SONET Rings.

[BibT_eX]

[DOI]

JOCN, 2011

Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19.

[BibT_eX]

[DOI]

Petteri Kaski

Patric R. J. Östergård

David A. Pike

Olli Pottonen

Discret. Math., 2011

Optical grooming with grooming ratio nine.

[BibT_eX]

[DOI]

Gennian Ge

Discret. Math., 2011

Efficient Conditional Expectation Algorithms for Constructing Hash Families.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Finding Interaction Faults Adaptively Using Distance-Based Strategies.

[BibT_eX]

[DOI]

D. Richard Kuhn

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.

[BibT_eX]

[DOI]

Yuichiro Fujiwara

IEEE Trans. Inf. Theory, 2010

Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Covering arrays from cyclotomy.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

Covering and radius-covering arrays: Constructions and classification.

[BibT_eX]

[DOI]

Jan-Christoph Schlage-Puchta

Gerzson Kéri

P. P. Rivas Soriano

Discret. Appl. Math., 2010

Properties of the Steiner Triple Systems of Order 19.

[BibT_eX]

[DOI]

Patric R. J. Östergård

David A. Pike

Olli Pottonen

Electron. J. Comb., 2010

Apples and oranges: comparing schedule- and contention-based medium access control.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2010

Frameproof codes and compressive sensing.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

Boolean Aspects of Network Reliability.

[BibT_eX]

[DOI]

Yves Crama

Peter L. Hammer

Proceedings of the Boolean Models and Methods in Mathematics, 2010

2009

A density-based greedy algorithm for higher strength covering arrays.

[BibT_eX]

[DOI]

Softw. Test. Verification Reliab., 2009

A recursive construction for perfect hash families.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2009

Multi-Terminal Network Connectedness on Series-Parallel Networks.

[BibT_eX]

[DOI]

Toni R. Farley

Discret. Math. Algorithms Appl., 2009

Minimum embedding of Steiner triple systems into (K4-e)-designs II.

[BibT_eX]

[DOI]

Discret. Math., 2009

Graph designs for the eight-edge five-vertex graphs.

[BibT_eX]

[DOI]

Gennian Ge

Discret. Math., 2009

Chip firing and all-terminal network reliability bounds.

[BibT_eX]

[DOI]

Richard J. Nowakowski

Discret. Optim., 2009

Linear hash families and forbidden configurations.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

Merging covering arrays and compressing multiple sequence alignments.

[BibT_eX]

[DOI]

Andreas H. Ronneseth

Discret. Appl. Math., 2009

Optical grooming with grooming ratio eight.

[BibT_eX]

[DOI]

Gennian Ge

Discret. Appl. Math., 2009

Small stopping sets in Steiner triple systems.

[BibT_eX]

[DOI]

Yuichiro Fujiwara

Cryptogr. Commun., 2009

Randomized Postoptimization of Covering Arrays.

[BibT_eX]

[DOI]

Peyman Nayeri

Goran Konjevod

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Multiterminal measures for network reliability and resilience.

[BibT_eX]

[DOI]

Toni R. Farley

Proceedings of the 7th International Workshop on Design of Reliable Communication Networks, 2009

Locating and Detecting Arrays for Interaction Faults.

[BibT_eX]

[DOI]

Daniel W. McClary

Proceedings of the Search Methodologies, 05.07. - 10.07.2009, 2009

Binary Covering Arrays and Existentially Closed Graphs.

[BibT_eX]

[DOI]

Gerzson Kéri

Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008

Rateless forward error correction for topology-transparent scheduling.

[BibT_eX]

[DOI]

Sruthi Yellamraju

IEEE/ACM Trans. Netw., 2008

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Grooming for two-period optical networks.

[BibT_eX]

[DOI]

Networks, 2008

Lower bounds for two-period grooming via linear programming duality.

[BibT_eX]

[DOI]

Networks, 2008

Directed complete bipartite graph decompositions: Indirect constructions.

[BibT_eX]

[DOI]

Discret. Math., 2008

Minimum embedding of Steiner triple systems into (K4-e)-designs I.

[BibT_eX]

[DOI]

Discret. Math., 2008

Fully gated graphs: Recognition and convex operations.

[BibT_eX]

[DOI]

Cécile Huybrechts

Discret. Math., 2008

Strength two covering arrays: Existence tables and projection.

[BibT_eX]

[DOI]

Discret. Math., 2008

Constructing strength three covering arrays with augmented annealing.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Ternary Schedules for Energy-Limited Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

The density algorithm for pairwise interaction testing.

[BibT_eX]

[DOI]

Softw. Test. Verification Reliab., 2007

Multiterminal resilience for series-parallel networks.

[BibT_eX]

[DOI]

Toni R. Farley

Networks, 2007

Perfect Hash Families: Constructions and Existence.

[BibT_eX]

[DOI]

Robert A. Walker

J. Math. Cryptol., 2007

Failed disk recovery in double erasure RAID arrays.

[BibT_eX]

[DOI]

Kaushik Srinivasan

J. Discrete Algorithms, 2007

Transport schemes for topology-transparent scheduling.

[BibT_eX]

[DOI]

Zhiqiang Zhang

J. Comb. Optim., 2007

Biased covering arrays for progressive ranking and composition of Web Services.

[BibT_eX]

[DOI]

Yinong Chen

Int. J. Simul. Process. Model., 2007

Lower bounds on multiple sequence alignment using exact 3-way alignment.

[BibT_eX]

[DOI]

Sudhir Kumar

BMC Bioinform., 2007

A carrier sense multiple access protocol with power backoff (CSMA/PB).

[BibT_eX]

[DOI]

Ad Hoc Networks, 2007

Just-in-Time Online Scheduling for WDM EPONs.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2007

One-test-at-a-time heuristic search for interaction test suites.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

2006

The effects of synchronization on topology-transparent scheduling.

[BibT_eX]

[DOI]

Wirel. Networks, 2006

Prioritized interaction testing for pair-wise coverage with seeding and constraints.

[BibT_eX]

[DOI]

Inf. Softw. Technol., 2006

Detecting and Locating Interaction Faults.

[BibT_eX]

[DOI]

Daniel W. McClary

Electron. Notes Discret. Math., 2006

Roux-type constructions for covering arrays of strengths three and four.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2006

On constant composition codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Slot synchronized topology-transparent scheduling for sensor networks.

[BibT_eX]

[DOI]

Comput. Commun., 2006

Topology-Transparent Schedules for Energy Limited Ad hoc Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Conference on Computer-Aided Design, 2006

2005

Optimal frequency-hopping sequences via cyclotomy.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

A Recursive Construction For Regular Difference Triangle Sets.

[BibT_eX]

[DOI]

Solomon W. Golomb

SIAM J. Discret. Math., 2005

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Embedding path designs into kite systems.

[BibT_eX]

[DOI]

Discret. Math., 2005

Ovals and hyperovals in nets.

[BibT_eX]

[DOI]

David A. Drake

Wendy J. Myrvold

Discret. Math., 2005

Software performance testing using covering arrays: efficient screening designs with categorical factors.

[BibT_eX]

[DOI]

Dean S. Hoskins

Douglas C. Montgomery

Proceedings of the Fifth International Workshop on Software and Performance, 2005

Progressive Ranking and Composition of Web Services Using Covering Arrays.

[BibT_eX]

[DOI]

Yinong Chen

Wei-Tek Tsai

Proceedings of the 10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2005), 2005

Constructing interaction test suites with greedy algorithms.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Software Engineering (ICSE 2005), 2005

Test prioritization for pairwise interaction coverage.

[BibT_eX]

[DOI]

Proceedings of the ICSE 2005 Workshop on Advances in Model-Based Software Testing, 2005

2004

Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares.

[BibT_eX]

[DOI]

Torleiv Kløve

IEEE Trans. Inf. Theory, 2004

Sequence designs for ultra-wideband impulse radio with optimal correlation properties.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Optimal (n, 4, 2)-OOC of small orders.

[BibT_eX]

[DOI]

Discret. Math., 2004

Grooming in unidirectional rings: K4-e designs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Preface.

[BibT_eX]

[DOI]

Discret. Math., 2004

Cover-Free Families and Topology-Transparent Scheduling for MANETs.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2004

Constructions for Permutation Codes in Powerline Communications.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2004

Ladder orderings of pairs and RAID performance.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Dynamic spectrum utilization in ad hoc networks.

[BibT_eX]

[DOI]

Comput. Networks, 2004

Experimental designs in software engineering: d-optimal designs and covering arrays.

[BibT_eX]

[DOI]

Dean S. Hoskins

Renée Turban

Proceedings of the ACM Workshop on Interdisciplinary Software Engineering Research, 2004

Securing dynamic spectrum use.

[BibT_eX]

[DOI]

Minghao Cui

Proceedings of the 60th IEEE Vehicular Technology Conference, 2004

Scheduled persistence for medium access control in sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems, 2004

Topology Transparent Scheduling, Synchronization, and Maximum Delay.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

A deterministic density algorithm for pairwise interaction coverage.

[BibT_eX]

Renée Turban

Proceedings of the IASTED International Conference on Software Engineering, 2004

2003

Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index.

[BibT_eX]

[DOI]

Graphs Comb., 2003

Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs.

[BibT_eX]

[DOI]

Discret. Math., 2003

Preface.

[BibT_eX]

[DOI]

Dalibor Froncek

Discret. Math., 2003

Resolving P(v, 3, λ) designs into regular P3-configurations.

[BibT_eX]

[DOI]

Australas. J Comb., 2003

On Quaternary MacDonald Codes.

[BibT_eX]

[DOI]

Manish K. Gupta

Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

Augmenting Simulated Annealing to Build Interaction Test Suites.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 2003

Constructing Test Suites for Interaction Testing.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Software Engineering, 2003

Topology-transparent scheduling for MANETs using orthogonal arrays.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

Variable Strength Interaction Testing of Components.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002

Kirkman triple systems of order 21 with nontrivial automorphism group.

[BibT_eX]

[DOI]

Math. Comput., 2002

Preface: In Honour of Ronald C. Mullin.

[BibT_eX]

G. H. John van Rees

Des. Codes Cryptogr., 2002

The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs.

[BibT_eX]

Des. Codes Cryptogr., 2002

Projective planes and congestion-free networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Construction of optimal quality control for oligo arrays.

[BibT_eX]

[DOI]

Martin Tompa

Bioinform., 2002

NS1D0 Sequences and Anti-Pasch Steiner Triple Systems.

[BibT_eX]

Feliu Sagols

Ars Comb., 2002

2001

Equireplicate Balanced Binary Codes for Oligo Arrays.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

Minimizing drop cost for SONET/WDM networks with wavelength requirements.

[BibT_eX]

[DOI]

Peng-Jun Wan

Networks, 2001

Quorum Systems Constructed from Combinatorial Designs.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Triangulations and a generalization of Bose's method.

[BibT_eX]

[DOI]

Feliu Sagols

Discret. Math., 2001

Preface.

[BibT_eX]

[DOI]

Hao Shen

Discret. Math., 2001

(M, S)-optimal designs with block size three.

[BibT_eX]

[DOI]

Australas. J Comb., 2001

Ordering disks for double erasure codes.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Cluttered Orderings for the Complete Graph.

[BibT_eX]

[DOI]

Dalibor Froncek

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Transversal Designs in Classical Planes and Spaces.

[BibT_eX]

[DOI]

Aiden A. Bruen

J. Comb. Theory A, 2000

Quorums from difference covers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Modified group divisible designs with block size four.

[BibT_eX]

[DOI]

Discret. Math., 2000

Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-User Communication Systems.

[BibT_eX]

Sufang Zhao

Des. Codes Cryptogr., 2000

Coding, Cryptography, and Computer Security - Preface.

[BibT_eX]

[DOI]

Hadi Kharaghani

Discret. Appl. Math., 2000

Asymptotically optimal erasure-resilient codes for large disk arrays.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Multiple Access Communications Using Combinatorial Designs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Science, 2000

1999

Combinatorial Designs.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Kirkman school project designs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Covering Arrays of Strength Three.

[BibT_eX]

[DOI]

M. A. Chateauneuf

Des. Codes Cryptogr., 1999

Bicoloring Steiner Triple Systems.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

Balanced sampling plans with block size four excluding contiguous units.

[BibT_eX]

[DOI]

Australas. J Comb., 1999

1998

A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges.

[BibT_eX]

[DOI]

Guoliang Xue

Theor. Comput. Sci., 1998

Completing the spectrum of rotational Mendelsohn triple systems.

[BibT_eX]

[DOI]

Zhike Jiang

Discret. Math., 1998

Tight 4-factor orthogonal main effect plans.

[BibT_eX]

[DOI]

Robert P. Gallant

Discret. Math., 1998

Point Code Minimum Steiner Triple Systems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1998

Deleting Lines in Projective Planes.

[BibT_eX]

Ars Comb., 1998

On Directed Incomplete Transversal Designs with Block Size Five.

[BibT_eX]

Jianxing Yin

Ars Comb., 1998

1997

Constructions for difference triangle sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Wang Tilings and Distributed Verification on Anonymous Torus Networks.

[BibT_eX]

[DOI]

Jan K. Pachl

Theory Comput. Syst., 1997

Pairwise Balanced Designs with Block Sizes 8, 9, and 10.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Balanced Steiner Triple Systems.

[BibT_eX]

[DOI]

Lucien Haddad

Václav Linek

J. Comb. Theory A, 1997

Complete Arcs in Steiner Triple Systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Pairwise Balanced Designs with Consecutive Block Sizes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1997

Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1997

1996

Cohen-Macaulay Rings in Network Reliability.

[BibT_eX]

[DOI]

David G. Wagner

SIAM J. Discret. Math., 1996

Equitable Embeddings of Steiner Triple Systems.

[BibT_eX]

[DOI]

Lucien Haddad

Václav Linek

J. Comb. Theory A, 1996

Two Algorithms for Unranking Arborescences.

[BibT_eX]

[DOI]

Wendy J. Myrvold

Eugene Neufeld

J. Algorithms, 1996

Transversal Designs of Block Size Eight and Nine.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

Existence of three HMOLS of types hn and 2n31.

[BibT_eX]

[DOI]

Frank E. Bennett

Lie Zhu

Discret. Math., 1996

Concerning Difference Matrices.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1996

N(n), v(n): Similarities and Differences.

[BibT_eX]

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

Consecutive cuts and paths, and bounds on k-terminal reliability.

[BibT_eX]

[DOI]

Heidi J. Strayer

Networks, 1995

Preface.

[BibT_eX]

[DOI]

Klaus Sutner

Networks, 1995

Partial Steiner Triple Systems with Equal-Sized Holes.

[BibT_eX]

Charles A. Cusack

J. Comb. Theory A, 1995

Thwarts in Transversal Designs.

[BibT_eX]

[DOI]

Mieczyslaw Wojtas

Des. Codes Cryptogr., 1995

A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.

[BibT_eX]

[DOI]

J. Scott Provan

Dirk Vertigan

Discret. Appl. Math., 1995

The Complexity of Computing the Tutte Polynomial on Transversal Matroids.

[BibT_eX]

[DOI]

J. Scott Provan

Dirk Vertigan

Comb., 1995

Existence of six incomplete MOLS.

[BibT_eX]

[DOI]

Lie Zhu

Australas. J Comb., 1995

Orthogonal resolutions of triple systems.

[BibT_eX]

[DOI]

Australas. J Comb., 1995

1994

Anti-mitre steiner triple systems.

[BibT_eX]

[DOI]

Graphs Comb., 1994

Concerning difference families with block size four.

[BibT_eX]

[DOI]

Paul L. Check

Discret. Math., 1994

Network reliability and the probabilistic estimation of damage from fire spread.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1994

Conflict-free access to constant-perimeter, rectangular, subarrays.

[BibT_eX]

[DOI]

Doreen L. Erickson

Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993

Evaluating performability: Most probable states and bounds.

[BibT_eX]

[DOI]

Telecommun. Syst., 1993

Transformations on channel graphs.

[BibT_eX]

[DOI]

Miro Kraetzl

IEEE Trans. Commun., 1993

Assessing Reliability of Multistage Interconnection Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1993

Renormalization of two - terminal reliability.

[BibT_eX]

[DOI]

Networks, 1993

Network transformations and bounding network reliability.

[BibT_eX]

[DOI]

John S. Devitt

Networks, 1993

Book reviews.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1993

Support sizes of sixfold triple systems.

[BibT_eX]

[DOI]

Ebadollah S. Mahmoodian

Discret. Math., 1993

Reliable assignments of processors to tasks and factoring on matroids.

[BibT_eX]

[DOI]

Discret. Math., 1993

The Spectrum of Maximal Partial Steiner Triple Systems.

[BibT_eX]

[DOI]

Stefan Znám

Des. Codes Cryptogr., 1993

Computing Residual Connectedness Reliability for Restricted Networks.

[BibT_eX]

[DOI]

Appajosyula Satyanarayana

Charles L. Suffel

Klaus Sutner

Discret. Appl. Math., 1993

Threshold Channel Graphs.

[BibT_eX]

[DOI]

Miro Kraetzl

Comb. Probab. Comput., 1993

Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract).

[BibT_eX]

[DOI]

Jan K. Pachl

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Conflict-Free Access for the Collections of Templates.

[BibT_eX]

Doreen L. Erickson

Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

1992

Roots of the Reliability Polynomial.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Series-parallel subgraphs of planar graphs.

[BibT_eX]

[DOI]

Networks, 1992

Conflict-Free Access to Parallel Memories.

[BibT_eX]

[DOI]

Katherine Heinrich

J. Parallel Distributed Comput., 1992

Directed star decompositions of the complete directed graph.

[BibT_eX]

[DOI]

Dean G. Hoffman

C. A. Rodger

J. Graph Theory, 1992

Support Sizes of Triple Systems.

[BibT_eX]

Charles C. Lindner

J. Comb. Theory A, 1992

A New Class of Group Divisible Designs with Block Size Three.

[BibT_eX]

Dean G. Hoffman

Rolf S. Rees

J. Comb. Theory A, 1992

A Parallelization of Miller's n^log n Isomorphism Technique.

[BibT_eX]

[DOI]

Luc Teirlinck

Inf. Process. Lett., 1992

Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1992

A Note on Bounding k-Terminal Reliability.

[BibT_eX]

[DOI]

Algorithmica, 1992

Networks and Reliability in Maple.

[BibT_eX]

[DOI]

John S. Devitt

Proceedings of the Computational Support for Discrete Mathematics, 1992

On Implementing an Environment for Investigating Network reliability.

[BibT_eX]

[DOI]

John S. Devitt

Proceedings of the Computer Science and Operations Research, 1992

1991

Spanning sets and scattering sets in Steiner triple systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1991

Partitioning Steiner triple systems into complete arcs.

[BibT_eX]

[DOI]

Kevin T. Phelps

Marialuisa J. de Resmini

Discret. Math., 1991

The fine structure of threefold triple systems: u = 1 or 3 (mod 6).

[BibT_eX]

[DOI]

Discret. Math., 1991

Preface.

[BibT_eX]

[DOI]

Dieter Jungnickel

Discret. Math., 1991

Directed star decompositions of directed multigraphs.

[BibT_eX]

[DOI]

Dean G. Hoffman

C. A. Rodger

Discret. Math., 1991

Intersections and supports of quadruple systems.

[BibT_eX]

[DOI]

Alan Hartman

Discret. Math., 1991

The number of t-wise balance designs.

[BibT_eX]

[DOI]

Comb., 1991

Network reliability: Numbers or insight? - A discussion paper.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1991

Combinatorial aspects of network reliability.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1991

Leaves, excesses and neighbourhoods in triple systems.

[BibT_eX]

[DOI]

Australas. J Comb., 1991

The fine structure of threefold triple systems: v≡5(mod 6).

[BibT_eX]

[DOI]

Rudolf Mathon

Nabil Shalaby

Australas. J Comb., 1991

1990

Combining monte carlo estimates and bounds for network reliability.

[BibT_eX]

[DOI]

Louis D. Nel

Networks, 1990

Efficient algorithms for computing the reliability of permutation and interval graphs.

[BibT_eX]

[DOI]

Hosam M. Aboelfotoh

Networks, 1990

Repeated edges in 2-factorizations.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

On two dual classes of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 1990

Permutation graphs: Connected domination and Steiner trees.

[BibT_eX]

[DOI]

Lorna K. Stewart

Discret. Math., 1990

The spectrum of support sizes for threefold triple systems.

[BibT_eX]

[DOI]

Ebadollah S. Mahmoodian

Discret. Math., 1990

Unit disk graphs.

[BibT_eX]

[DOI]

Brent N. Clark

David S. Johnson

Discret. Math., 1990

Probabilistic single processor scheduling.

[BibT_eX]

[DOI]

Janelle J. Harms

Discret. Appl. Math., 1990

Large sets of disjoint t-designs.

[BibT_eX]

[DOI]

Australas. J Comb., 1990

1989

Multiplicative improvements in network reliability bounds.

[BibT_eX]

[DOI]

Timothy B. Brecht

Networks, 1989

Matroid Steiner problems, the Tutte polynomial and network reliability.

[BibT_eX]

[DOI]

William R. Pulleyblank

J. Comb. Theory B, 1989

Simple neighbourhoods in triple systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1989

Unranking and Ranking Spanning Trees of a Graph.

[BibT_eX]

[DOI]

Robert P. J. Day

Louis D. Nel

J. Algorithms, 1989

Series-Parallel Bounds for the Two-Terminal Reliability Problem.

[BibT_eX]

[DOI]

Hosam M. Aboelfotoh

INFORMS J. Comput., 1989

Hybrid triple systems and cubic feedback sets.

[BibT_eX]

[DOI]

William R. Pulleyblank

Graphs Comb., 1989

Percentages in pairwise balanced designs.

[BibT_eX]

[DOI]

Vojtech Rödl

Discret. Math., 1989

Applications of Combinatorial Designs in Computer Science.

[BibT_eX]

[DOI]

Paul C. van Oorschot

ACM Comput. Surv., 1989

Bounding Network Parameters by Approximating Graphs.

[BibT_eX]

[DOI]

Eugene I. Litvak

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

A Set System Polynomial with Colouring and Reliability Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

Bounding all-terminal reliability in computer networks.

[BibT_eX]

[DOI]

Networks, 1988

Edge-packing of graphs and network reliability.

[BibT_eX]

[DOI]

Discret. Math., 1988

Problem 94.

[BibT_eX]

Discret. Math., 1988

The strong chromatic number of partial triple systems.

[BibT_eX]

[DOI]

Dieter Jungnickel

Discret. Appl. Math., 1988

Lower bounds on two-terminal network reliability.

[BibT_eX]

[DOI]

Timothy B. Brecht

Discret. Appl. Math., 1988

1987

Counting almost minimum cutsets with reliability applications.

[BibT_eX]

[DOI]

Aparna Ramanathan

Math. Program., 1987

1986

Improving reliability bounds in computer networks.

[BibT_eX]

[DOI]

Timothy B. Brecht

Networks, 1986

Quadratic leaves of maximal partial triple systems.

[BibT_eX]

[DOI]

Graphs Comb., 1986

Some NP-complete problems for hypergraph degree sequences.

[BibT_eX]

[DOI]

William L. Kocay

Discret. Appl. Math., 1986

1985

Some Empirical Observations on Program Behavior with Applications to Program Restructuring.

[BibT_eX]

[DOI]

Judith B. Peachey

Richard B. Bunt

IEEE Trans. Software Eng., 1985

Optimum Communication Spanning Trees in Series-Parallel Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

The most reliable series-parallel networks.

[BibT_eX]

[DOI]

Eric Neufeld

Networks, 1985

Cataloguing the graphs on 10 vertices.

[BibT_eX]

[DOI]

J. Graph Theory, 1985

1984

Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda.

[BibT_eX]

[DOI]

Rose C. Hamm

C. A. Rodger

J. Comb. Theory A, 1984

A census of regular 3-polystroma arising from honeycombs.

[BibT_eX]

[DOI]

Asia Ivic Weiss

Discret. Math., 1984

The complexity of completing partial Latin squares.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

Concurrent Transmissions in Broadcast Networks.

[BibT_eX]

[DOI]

Andrzej Proskurowski

Proceedings of the Automata, 1984

1983

Steiner trees, partial 2-trees, and minimum IFI networks.

[BibT_eX]

[DOI]

Joseph A. Wald

Networks, 1983

Every Twofold Triple System Can Be Directed.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

Embedding Partial Steiner Triple Systems Is NP-Complete.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

Completing small partial triple systems.

[BibT_eX]

[DOI]

Discret. Math., 1983

1982

Colouring steiner quadruple systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1982

Computing the Chromatic Index of Steiner Triple Systems.

[BibT_eX]

[DOI]

Comput. J., 1982

1981

Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs.

[BibT_eX]

[DOI]

Kellogg S. Booth

SIAM J. Comput., 1981

On testing isomorphism of permutation graphs.

[BibT_eX]

[DOI]

Networks, 1981

Cyclic Block Designs With Block Size 3.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

Concerning the complexity of deciding isomorphism of block designs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

1980

The complexity of graph isomorphism and related problems.

[BibT_eX]

[DOI]

PhD thesis, 1980

A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability.

[BibT_eX]

[DOI]

Brendan D. McKay

Inf. Process. Lett., 1980

On deciding switching equivalence of graphs.

[BibT_eX]

[DOI]

Derek G. Corneil

Discret. Appl. Math., 1980

1979

Orderly algorithms for generating restricted classes of graphs.

[BibT_eX]

[DOI]

Ronald C. Read

J. Graph Theory, 1979

The Complexity of Symmetrizing Matrices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

1978

Graph isomorphism and self-complementary graphs.

[BibT_eX]

[DOI]