| Publication | Date of Publication | Type |
|---|
| Detecting arrays for effects of multiple interacting factors | 2024-12-03 | Paper |
| Mixed-level covering, locating, and detecting arrays via cyclotomy | 2024-10-09 | Paper |
| Resolutions for an infinite family of Bose triple systems | 2024-10-09 | Paper |
| Sets of mutually orthogoval projective and affine planes | 2024-10-08 | Paper |
| Asymptotic existence of egalitarian Steiner 2-designs | 2024-10-02 | Paper |
| An efficient screening method for identifying parameters and interactions that impact wireless network performance | 2024-10-02 | Paper |
| On the maximum double independence number of Steiner triple systems | 2024-01-31 | Paper |
| Bussey systems and Steiner's tactical problem | 2024-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6182378 | 2024-01-25 | Paper |
| Network reliability: Heading out on the highway | 2023-12-11 | Paper |
| Detecting arrays for effects of single factors | 2023-11-10 | Paper |
| The spectrum of resolvable Bose triple systems | 2023-05-15 | Paper |
| Network reliability | 2023-04-28 | Paper |
| Sets of mutually orthogoval projective and affine planes | 2022-10-21 | Paper |
| Algorithms for Constructing Anonymizing Arrays | 2022-10-13 | Paper |
| Egalitarian Steiner quadruple systems of doubly even order | 2022-05-17 | Paper |
| Mixed covering arrays on graphs of small treewidth | 2022-03-17 | Paper |
| Balanced and Swap-Robust Trades for Dynamical Distributed Storage | 2022-01-22 | Paper |
| Perfect hash families: the generalization to higher indices | 2021-10-04 | Paper |
| Egalitarian Steiner triple systems for data popularity | 2021-10-04 | Paper |
| Egalitarian edge orderings of complete graphs | 2021-07-28 | Paper |
| Covering strong separating hash families | 2021-06-15 | Paper |
| New bounds on the maximum size of Sperner partition systems | 2021-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133659 | 2020-11-10 | Paper |
| Access balancing in storage systems by labeling partial Steiner systems | 2020-10-21 | Paper |
| Set-Codes with Small Intersections and Small Discrepancies | 2020-06-09 | Paper |
| Detecting arrays for main effects | 2020-04-29 | Paper |
| Two‐stage algorithms for covering array construction | 2019-12-12 | Paper |
| Distributing hash families with few rows | 2019-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5241121 | 2019-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5241120 | 2019-10-30 | Paper |
| Subspace restrictions and affine composition for covering perfect hash families | 2019-10-02 | Paper |
| Optimality and constructions of locating arrays | 2019-08-27 | Paper |
| Improving two recursive constructions for covering arrays | 2019-08-27 | Paper |
| Resolvable covering arrays | 2019-08-27 | Paper |
| Constructions of optimal orthogonal arrays with repeated rows | 2019-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4614041 | 2019-01-30 | Paper |
| Counting subwords and regular languages | 2018-11-22 | Paper |
| On a combinatorial framework for fault characterization | 2018-11-01 | Paper |
| Assessing reliability of multistage interconnection networks | 2018-09-14 | Paper |
| Separating interaction effects using locating and detecting arrays | 2018-09-06 | Paper |
| Partial covering arrays: algorithms and asymptotics | 2018-08-03 | Paper |
| Group divisible covering designs with block size four | 2018-05-22 | Paper |
| Fractal perfect hash families (extended abstract) | 2018-04-12 | Paper |
| Asymptotic and constructive methods for covering perfect hash families and covering arrays | 2018-04-10 | Paper |
| Improved strength four covering arrays with three symbols | 2018-03-22 | Paper |
| A hierarchical framework for recovery in compressive sensing | 2018-01-11 | Paper |
| Steiner Triple Systems with High Chromatic Index | 2017-11-24 | Paper |
| Compressed Sensing With Combinatorial Designs: Theory and Simulations | 2017-10-19 | Paper |
| A Combinatorial Approach to X-Tolerant Compaction Circuits | 2017-07-27 | Paper |
| Upper Bounds on the Size of Covering Arrays | 2017-06-23 | Paper |
| Disjoint spread systems and fault location | 2016-10-28 | Paper |
| Partial covering arrays: algorithms and asymptotics | 2016-09-29 | Paper |
| Steiner Loops Satisfying the Statement of Moufang's Theorem | 2016-07-06 | Paper |
| Quorums from difference covers | 2016-06-16 | Paper |
| The existence of well-balanced triple systems | 2016-05-24 | Paper |
| Suitable Permutations, Binary Covering Arrays, and Paley Matrices | 2016-01-25 | Paper |
| Augmentation of covering arrays of strength two | 2015-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3451449 | 2015-11-16 | Paper |
| Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses | 2015-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3195092 | 2015-10-21 | Paper |
| Sequence Covering Arrays and Linear Extensions | 2015-09-15 | Paper |
| Covering and packing for pairs | 2015-06-19 | Paper |
| Conditional expectation algorithms for covering arrays | 2014-11-04 | Paper |
| Covering arrays, augmentation, and quilting arrays | 2014-09-29 | Paper |
| Sequence Covering Arrays | 2014-04-10 | Paper |
| Hierarchical Recovery in Compressive Sensing | 2014-03-04 | Paper |
| \(f\)-vectors of pure complexes and pure multicomplexes of rank three | 2014-01-27 | Paper |
| Expected time to detection of interaction faults | 2013-12-13 | Paper |
| The existence of \((K_2\times K_6)\)-designs | 2013-09-26 | Paper |
| Doubly resolvable nearly Kirkman triple systems | 2013-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5327064 | 2013-08-01 | Paper |
| Randomized Post-optimization for t-Restrictions | 2013-04-09 | Paper |
| Strengthening hash families and compressive sensing | 2013-01-18 | Paper |
| Trails of triples in partial triple systems | 2012-11-28 | Paper |
| Randomized post-optimization of covering arrays | 2012-11-15 | Paper |
| Variable Weight Sequences for Adaptive Scheduled Access in MANETs | 2012-09-07 | Paper |
| Constructing heterogeneous hash families by puncturing linear transversal designs | 2012-04-12 | Paper |
| Cover starters for covering arrays of strength two | 2012-03-16 | Paper |
| Efficient Conditional Expectation Algorithms for Constructing Hash Families | 2012-01-13 | Paper |
| Grooming traffic to minimize load | 2012-01-11 | Paper |
| Mixed covering arrays of strength three with few factors | 2011-08-01 | Paper |
| Heterogeneous hash families and covering arrays | 2011-05-31 | Paper |
| Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 | 2011-05-10 | Paper |
| D-optimal designs with interaction coverage | 2011-04-18 | Paper |
| Drop cost and wavelength optimal two-period grooming with ratio 4 | 2011-04-15 | Paper |
| Boolean aspects of network reliability | 2011-03-09 | Paper |
| Optical grooming with grooming ratio nine | 2011-01-07 | Paper |
| Covering and radius-covering arrays: constructions and classification | 2010-10-11 | Paper |
| Properties of the Steiner triple systems of order 19 | 2010-08-12 | Paper |
| Covering arrays from cyclotomy | 2010-05-19 | Paper |
| A recursive construction for perfect hash families | 2010-05-06 | Paper |
| Optical grooming with grooming ratio eight | 2010-04-28 | Paper |
| Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven | 2010-03-17 | Paper |
| Graph designs for the eight-edge five-vertex graphs | 2009-12-15 | Paper |
| Randomized postoptimization of covering arrays | 2009-12-11 | Paper |
| Chip firing and all-terminal network reliability bounds | 2009-11-23 | Paper |
| Small stopping sets in Steiner triple systems | 2009-10-26 | Paper |
| MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS | 2009-09-22 | Paper |
| Truncated D-Optimal Designs for Screening Experiments | 2009-08-03 | Paper |
| Binary Covering Arrays and Existentially Closed Graphs | 2009-07-23 | Paper |
| Merging covering arrays and compressing multiple sequence alignments | 2009-06-24 | Paper |
| Linear hash families and forbidden configurations | 2009-03-31 | Paper |
| Scalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects | 2009-03-09 | Paper |
| Constructing Perfect Hash Families Using a Greedy Algorithm | 2009-03-09 | Paper |
| The configuration polytope of ℓ-line configurations in Steiner triple systems | 2009-02-09 | Paper |
| Minimum embedding of Steiner triple systems into \((K_4 - e)\)-designs. II | 2009-01-28 | Paper |
| Minimum embedding of Steiner triple systems into \((K4-e)\)-designs. I | 2009-01-27 | Paper |
| Fully gated graphs: Recognition and convex operations | 2009-01-27 | Paper |
| Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares | 2008-12-21 | Paper |
| Optimal Frequency-Hopping Sequences Via Cyclotomy | 2008-12-21 | Paper |
| Sequence Designs for Ultra-Wideband Impulse Radio With Optimal Correlation Properties | 2008-12-21 | Paper |
| Ternary Schedules for Energy-Limited Sensor Networks | 2008-12-21 | Paper |
| Grooming for two-period optical networks | 2008-12-17 | Paper |
| Lower bounds for two-period grooming via linear programming duality | 2008-12-17 | Paper |
| Tabu search for covering arrays using permutation vectors | 2008-11-06 | Paper |
| Constructing strength three covering arrays with augmented annealing | 2008-05-29 | Paper |
| Failed disk recovery in double erasure RAID arrays | 2008-05-16 | Paper |
| Locating and detecting arrays for interaction faults | 2008-04-23 | Paper |
| Transport schemes for topology-transparent scheduling | 2008-02-18 | Paper |
| Strength two covering arrays: existence tables and projection | 2008-02-14 | Paper |
| Directed complete bipartite graph decompositions: indirect constructions | 2008-01-30 | Paper |
| Multiterminal resilience for series‐parallel networks | 2007-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3594048 | 2007-08-07 | Paper |
| Perfect Hash Families: Constructions and Existence | 2007-07-27 | Paper |
| Detecting and Locating Interaction Faults | 2007-05-29 | Paper |
| Opening the door | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424714 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424719 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424726 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424712 | 2007-03-05 | Paper |
| Renewal Networks: Connectivity and Reachability on a Time Interval | 2007-01-19 | Paper |
| Roux-type constructions for covering arrays of strengths three and four | 2006-11-22 | Paper |
| Recursive constructions of covering arrays | 2006-09-14 | Paper |
| Cover-free families and topology-transparent communication | 2006-09-14 | Paper |
| On constant composition codes | 2006-06-09 | Paper |
| Covering arrays of higher strength from permutation vectors | 2006-06-06 | Paper |
| Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6 | 2006-06-01 | Paper |
| Products of mixed covering arrays of strength two | 2006-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5710434 | 2005-12-02 | Paper |
| Embedding path designs into kite systems | 2005-09-22 | Paper |
| A Recursive Construction For Regular Difference Triangle Sets | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461478 | 2005-07-26 | Paper |
| Ovals and hyperovals in nets | 2005-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677987 | 2005-05-23 | Paper |
| Recursive constructions for optimal (n,4,2)-OOCs | 2005-01-12 | Paper |
| Grooming in unidirectional rings: \(K_{4}-e\) designs | 2004-08-20 | Paper |
| Constructions for permutation codes in powerline communications | 2004-08-16 | Paper |
| Cover-free families and topology-transparent scheduling for MANETs | 2004-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736879 | 2004-08-11 | Paper |
| Optimal \((n,4,2)\)-OOC of small orders. | 2004-03-29 | Paper |
| Preface (to the special issue in honor of Zhu Lie's 60th birthday) | 2004-03-29 | Paper |
| Ladder orderings of pairs and RAID performance. | 2004-03-29 | Paper |
| Concerning seven and eight mutually orthogonal Latin squares | 2004-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4798514 | 2004-02-03 | Paper |
| Minimum embedding of P3-designs into (K4?e)-designs | 2003-11-10 | Paper |
| Specialized block-colourings of Steiner triple systems and the upper chromatic index | 2003-10-16 | Paper |
| Optimal and pessimal orderings of Steiner triple systems in disk arrays. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405650 | 2003-06-23 | Paper |
| Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs | 2003-03-16 | Paper |
| Quorum systems constructed from combinatorial designs | 2003-01-14 | Paper |
| Transversal designs in classical planes and spaces | 2002-10-13 | Paper |
| Dominated error correcting codes with distance two | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551381 | 2002-09-05 | Paper |
| Projective planes and congestion-free networks | 2002-08-29 | Paper |
| Orthogonal arrays of strength three from regular 3-wise balanced designs | 2002-05-20 | Paper |
| Triangulations and a generalization of Bose's method | 2002-05-02 | Paper |
| Kirkman triple systems of order 21 with nontrivial automorphism group | 2002-03-19 | Paper |
| Generating sets in Steiner triple systems | 2002-03-07 | Paper |
| Minimum weights of point codes of Steiner triple systems | 2002-01-21 | Paper |
| Mutually orthogonal Latin squares: A brief survey of constructions | 2002-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263658 | 2001-11-22 | Paper |
| Equireplicate balanced binary codes for oligo arrays | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508366 | 2001-11-08 | Paper |
| (M,S)-optimal designs with block size three | 2001-09-02 | Paper |
| Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems | 2001-08-20 | Paper |
| Sharper bounds in adpative group testing | 2001-07-19 | Paper |
| Minimizing drop cost for SONET/WDM networks with \(\frac 18\) wavelength requirements | 2001-06-20 | Paper |
| On directed incomplete transversal designs with block size five | 2001-06-10 | Paper |
| Deleting lines in projective planes | 2001-06-10 | Paper |
| An application of permutatation arrays to block ciphers | 2001-05-16 | Paper |
| Quintessential pairwise balanced designs | 2001-01-03 | Paper |
| Construction Techniques for Anti-Pasch Steiner Triple Systems | 2000-12-13 | Paper |
| Tight \(4\)-factor orthogonal main effect plans | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505271 | 2000-09-26 | Paper |
| Modified group divisible designs with block size four | 2000-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495395 | 2000-08-10 | Paper |
| Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs | 2000-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934842 | 2000-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262993 | 2000-06-09 | Paper |
| A golf design of order 11 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269430 | 2000-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945799 | 2000-03-23 | Paper |
| Weakly union-free maximum packings | 2000-03-13 | Paper |
| Group testing for consecutive positives | 2000-02-16 | Paper |
| Kirkman school project designs | 2000-01-11 | Paper |
| Asymptotically optimal erasure-resilient codes for large disk arrays. | 2000-01-01 | Paper |
| Covering arrays of strength three | 1999-11-22 | Paper |
| Pooling, lattice square, and union jack designs | 1999-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256358 | 1999-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228217 | 1999-06-30 | Paper |
| Bicoloring Steiner triple systems | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4248175 | 1999-06-03 | Paper |
| The existence of uniform 5-GDDs | 1999-05-16 | Paper |
| Weakly union-free twofold triple systems | 1999-01-14 | Paper |
| Point code minimum Steiner triple systems | 1999-01-14 | Paper |
| A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges | 1999-01-12 | Paper |
| The spectrum for rotational Steiner triple systems | 1998-12-02 | Paper |
| A class of partial triple systems with applications in survey sampling | 1998-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217579 | 1998-11-11 | Paper |
| Completing the spectrum of rotational Mendelsohn triple systems | 1998-10-28 | Paper |
| Asymptotic Existence of Tight Orthogonal Main Effect Plans | 1998-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393249 | 1998-06-08 | Paper |
| More thwarts in transversal designs | 1998-04-26 | Paper |
| Complete arcs in Steiner triple systems | 1998-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4357348 | 1998-03-02 | Paper |
| Wang tilings and distributed verification on anonymous torus networks | 1997-09-07 | Paper |
| Existence of incomplete transversal designs with block size five and any index \(\lambda\) | 1997-08-27 | Paper |
| Pairwise balanced designs with block sizes 8, 9, and 10 | 1997-08-27 | Paper |
| Some direct constructions for incomplete transversal designs | 1997-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876930 | 1997-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4877000 | 1997-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876984 | 1997-06-09 | Paper |
| Balanced Steiner triple systems | 1997-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858155 | 1997-05-28 | Paper |
| Pairwise balanced designs with consecutive block sizes | 1997-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4337355 | 1997-05-19 | Paper |
| Concerning difference matrices | 1997-03-23 | Paper |
| Cohen–Macaulay Rings in Network Reliability | 1997-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4884215 | 1997-02-17 | Paper |
| Constructions for difference triangle sets | 1997-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876951 | 1996-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876924 | 1996-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876929 | 1996-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876991 | 1996-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876998 | 1996-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876948 | 1996-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888903 | 1996-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876994 | 1996-07-17 | Paper |
| Transversal designs of block size eight and nine | 1996-07-04 | Paper |
| Two Algorithms for Unranking Arborescences | 1996-06-04 | Paper |
| Equitable embeddings of Steiner triple systems | 1996-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876928 | 1996-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876927 | 1996-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876931 | 1996-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858959 | 1996-04-29 | Paper |
| Non-Stanley bounds for network reliability | 1996-03-17 | Paper |
| A new approach to solving three combinatorial enumeration problems on planar graphs | 1996-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858960 | 1996-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845373 | 1996-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858161 | 1995-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4853766 | 1995-11-01 | Paper |
| Consecutive cuts and paths, and bounds on k‐terminal reliability | 1995-07-20 | Paper |
| Thwarts in transversal designs | 1995-05-04 | Paper |
| The complexity of computing the Tutte polynomial on transversal matroids | 1995-05-04 | Paper |
| Anti-mitre Steiner triple systems | 1995-05-03 | Paper |
| Concerning difference families with block size four | 1995-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4697577 | 1995-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763332 | 1995-04-11 | Paper |
| Partial Steiner triple systems with equal-sized holes | 1995-04-04 | Paper |
| The Spectrum of Orthogonal Steiner Triple Systems | 1995-03-20 | Paper |
| Reliability polynomials can cross twice | 1995-01-08 | Paper |
| Analysis and synthesis problems for network resilience | 1994-12-04 | Paper |
| Network reliability and the probabilistic estimation of damage from fire spread | 1994-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4301917 | 1994-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139738 | 1994-10-31 | Paper |
| On the log concavity of reliability and matroidal sequences | 1994-07-03 | Paper |
| Threshold Channel Graphs | 1994-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288081 | 1994-04-21 | Paper |
| Transformations on channel graphs | 1994-01-16 | Paper |
| Computing residual connectedness reliability for restricted networks | 1993-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3136978 | 1993-11-01 | Paper |
| Reliable assignments of processors to tasks and factoring on matroids | 1993-10-24 | Paper |
| The spectrum of maximal partial Steiner triple systems | 1993-08-29 | Paper |
| Renormalization of two—terminal reliability | 1993-08-23 | Paper |
| Network transformations and bounding network reliability | 1993-06-29 | Paper |
| Support sizes of sixfold triple systems | 1993-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035359 | 1993-05-18 | Paper |
| Roots of the Reliability Polynomials | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4026146 | 1993-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4026152 | 1993-02-21 | Paper |
| Series-Parallel Bounds for the Two-Terminal Reliability Problem | 1993-01-17 | Paper |
| Support sizes of triple systems | 1993-01-17 | Paper |
| Series-parallel subgraphs of planar graphs | 1993-01-17 | Paper |
| Directed star decompositions of the complete directed graph | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4017193 | 1993-01-16 | Paper |
| A parallelization of Miller's \(n^{\log n}\) isomorphism technique | 1993-01-16 | Paper |
| Concerning multiplier automorphisms of cyclic Steiner triple systems | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4017179 | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014625 | 1992-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014297 | 1992-10-06 | Paper |
| Steiner triple systems of order 19 with nontrivial automorphism group | 1992-09-27 | Paper |
| Pairwise Balanced Designs with Block Sizes Three and Four | 1992-09-27 | Paper |
| A new class of group divisible designs with block size three | 1992-06-28 | Paper |
| The fine structure of threefold triple systems: \(v\equiv 1 \text{ or }3\pmod 6\) | 1992-06-28 | Paper |
| Intersections and supports of quadruple systems | 1992-06-28 | Paper |
| Transitive Steiner and Kirkman Triple Systems of Order 27 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3987950 | 1992-06-28 | Paper |
| A note on bounding \(k\)-terminal reliability | 1992-06-28 | Paper |
| Directed star decompositions of directed multigraphs | 1992-06-28 | Paper |
| Combinatorial aspects of network reliability | 1992-06-27 | Paper |
| The number of \(t\)-wise balanced designs | 1992-06-27 | Paper |
| Unit disk graphs | 1992-06-25 | Paper |
| Permutation graphs: Connected domination and Steiner trees | 1992-06-25 | Paper |
| Spanning sets and scattering sets in Steiner triple systems | 1992-06-25 | Paper |
| Partitioning Steiner triple systems into complete arcs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974696 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974151 | 1992-06-25 | Paper |
| Neighbor designs and m-wheel systems | 1991-01-01 | Paper |
| Network reliability: Numbers or insight? (A discussion paper) | 1991-01-01 | Paper |
| Automorphisms of directed triple systems | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360875 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750865 | 1990-01-01 | Paper |
| Efficient algorithms for computing the reliability of permutation and interval graphs | 1990-01-01 | Paper |
| On two dual classes of planar graphs | 1990-01-01 | Paper |
| The spectrum of support sizes for threefold triple systems | 1990-01-01 | Paper |
| Locating A Broadcast Facility In An Unreliable Network | 1990-01-01 | Paper |
| Probabilistic single processor scheduling | 1990-01-01 | Paper |
| Combining monte carlo estimates and bounds for network reliability | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197830 | 1990-01-01 | Paper |
| Repeated edges in 2-factorizations | 1990-01-01 | Paper |
| Hybrid triple systems and cubic feedback sets | 1989-01-01 | Paper |
| Unranking and ranking spanning trees of a graph | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490005 | 1989-01-01 | Paper |
| Matroid Steiner problems, the Tutte polynomial and network reliability | 1989-01-01 | Paper |
| Computing 2-terminal reliability for radio-broadcast networks | 1989-01-01 | Paper |
| Simple neighbourhoods in triple systems | 1989-01-01 | Paper |
| Percentages in pairwise balanced designs | 1989-01-01 | Paper |
| Multiplicative improvements in network reliability bounds | 1989-01-01 | Paper |
| Edge-packings of graphs and network reliability | 1988-01-01 | Paper |
| Lower bounds on two-terminal network reliability | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813587 | 1988-01-01 | Paper |
| The complexity of some edge deletion problems | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832583 | 1988-01-01 | Paper |
| Edge-coloured designs with block size four | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809810 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3821601 | 1988-01-01 | Paper |
| The strong chromatic number of partial triple systems | 1988-01-01 | Paper |
| Problem 94 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3834087 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818350 | 1988-01-01 | Paper |
| A Set System Polynomial with Colouring and Reliability Applications | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789614 | 1987-01-01 | Paper |
| Element neighbourhoods in twofold triple systems | 1987-01-01 | Paper |
| Counting almost minimum cutsets with reliability applications | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3770548 | 1987-01-01 | Paper |
| Network Resilience | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786488 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783317 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789576 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3778032 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3778030 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789577 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789615 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781113 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781114 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3030848 | 1987-01-01 | Paper |
| Some NP-complete problems for hypergraph degree sequences | 1986-01-01 | Paper |
| Quadratic leaves of maximal partial triple systems | 1986-01-01 | Paper |
| Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1 | 1986-01-01 | Paper |
| Improving reliability bounds in computer networks | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3027023 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3718464 | 1986-01-01 | Paper |
| Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4722082 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782734 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745851 | 1985-01-01 | Paper |
| Finding minimum dominating cycles in permutation graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728912 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692865 | 1985-01-01 | Paper |
| Minimizing setups in ordered sets of fixed width | 1985-01-01 | Paper |
| Optimum Communication Spanning Trees in Series-Parallel Networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3724358 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043160 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3684150 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758869 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026711 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792693 | 1985-01-01 | Paper |
| Cataloguing the graphs on 10 vertices | 1985-01-01 | Paper |
| The Leggett bounds for network reliability | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3705466 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3699716 | 1985-01-01 | Paper |
| The most reliable series-parallel networks | 1985-01-01 | Paper |
| Recursive constructions for cyclic block designs | 1984-01-01 | Paper |
| The complexity of completing partial Latin squares | 1984-01-01 | Paper |
| A census of regular 3-polystroma arising from honeycombs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218070 | 1984-01-01 | Paper |
| Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\) | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3346335 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3344026 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340871 | 1984-01-01 | Paper |
| Block Sizes in Pairwise Balanced Designs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3676158 | 1984-01-01 | Paper |
| Steiner trees, partial 2–trees, and minimum IFI networks | 1983-01-01 | Paper |
| Greedy Colourings of Steiner Triple Systems | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323963 | 1983-01-01 | Paper |
| Completing small partial triple systems | 1983-01-01 | Paper |
| Embedding partial Steiner triple systems is NP-complete | 1983-01-01 | Paper |
| Every twofold triple system can be directed | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663311 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3342583 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674675 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313865 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3322148 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3329482 | 1983-01-01 | Paper |
| Kotzig Factorizations: Existence and Computational Results | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663321 | 1982-01-01 | Paper |
| Farey Series and Maximal Outerplanar Graphs | 1982-01-01 | Paper |
| The chromatic index of cyclic Steiner 2-designs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216660 | 1982-01-01 | Paper |
| Coloring Block Designs is NP-Complete | 1982-01-01 | Paper |
| Colouring Steiner quadruple systems | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4742797 | 1982-01-01 | Paper |
| The Analysis of Directed Triple Systems by Refinement | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4749845 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659799 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3968962 | 1982-01-01 | Paper |
| Cyclic block designs with block size 3 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956957 | 1981-01-01 | Paper |
| On testing isomorphism of permutation graphs | 1981-01-01 | Paper |
| Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs | 1981-01-01 | Paper |
| Concerning the complexity of deciding isomorphism of block designs | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3921762 | 1981-01-01 | Paper |
| Deciding Hadamard equivalence of Hadamard matrices | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3958506 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4748165 | 1981-01-01 | Paper |
| A correction to Colbourn's paper on the complexity of matrix symmetrizability | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3903016 | 1980-01-01 | Paper |
| On deciding switching equivalence of graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3863899 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3903017 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3909058 | 1980-01-01 | Paper |
| The Complexity of Combinatorial Isomorphism Problems | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3885188 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3900079 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916602 | 1980-01-01 | Paper |
| The complexity of symmetrizing matrices | 1979-01-01 | Paper |
| Orderly algorithms for graph generation | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186367 | 1979-01-01 | Paper |
| Orderly algorithms for generating restricted classes of graphs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3924252 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4170760 | 1978-01-01 | Paper |
