| Publication | Date of Publication | Type |
|---|
| Reaching fault diagnosis agreement under a hybrid fault model | 2018-07-09 | Paper |
| Sequential construction of a circular consecutive-2 system | 2016-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3463433 | 2016-01-14 | Paper |
| On the number of separable partitions | 2015-08-24 | Paper |
| Are there more almost separable partitions than separable partitions? | 2014-06-24 | Paper |
| Partitions. Optimality and clustering. Vol. II: Multi-parameter. | 2013-08-13 | Paper |
| A new approach to solve open-partition problems | 2012-07-10 | Paper |
| Pooling designs for clone library screening in the inhibitor complex model | 2011-09-27 | Paper |
| An almost-linear time and linear space algorithm for the longest common subsequence problem | 2009-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3626688 | 2009-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3544989 | 2008-12-08 | Paper |
| A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction | 2008-11-19 | Paper |
| An upper bound of the number of tests in pooling designs for the error-tolerant complex model | 2008-09-04 | Paper |
| Improved construction for pooling design | 2008-04-23 | Paper |
| A survey on nonadaptive group testing algorithms through the angle of decoding | 2008-04-23 | Paper |
| Sphere-separable partitions of multi-parameter elements | 2008-03-28 | Paper |
| An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution | 2008-02-18 | Paper |
| A polytope approach to the optimal assembly problem | 2007-10-23 | Paper |
| Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs | 2007-06-21 | Paper |
| On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out | 2007-05-22 | Paper |
| Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices | 2007-04-13 | Paper |
| A competitive algorithm in searching for many edges in a hypergraph | 2007-03-08 | Paper |
| Reliabilities of Double-Loop Networks | 2007-01-19 | Paper |
| Reliabilities of Consecutive-2 Graphs | 2007-01-19 | Paper |
| On the Failure Rates of Consecutive−k−out−of−n Systems | 2007-01-19 | Paper |
| Individual Testing of Independent Items in Optimal Group Testing | 2007-01-19 | Paper |
| Optimal Consecutive-k−Out−of−n Systems under a Fixed Budget | 2007-01-19 | Paper |
| A Monotonicity Result for Inspecting Independent Items | 2007-01-19 | Paper |
| Optimal Binomial Group Testing with a Test History | 2007-01-19 | Paper |
| The mean-partition problem | 2007-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395177 | 2006-11-01 | Paper |
| A Simple Relation between the Pattern Probability and the Rate of False Signals in Control Charts | 2006-08-30 | Paper |
| A novel use of \(t\)-packings to construct \(d\)-disjunct matrices | 2006-08-14 | Paper |
| Tessellating polyominos in the plane | 2006-08-04 | Paper |
| Rearrangeability of bit permutation networks | 2006-03-24 | Paper |
| Equivalence of buddy networks with arbitrary number of stages | 2006-01-10 | Paper |
| On 3-stage Clos networks with different nonblocking requirements on two types of calls | 2005-10-18 | Paper |
| Partition-Optimization with Schur Convex Sum Objective Functions | 2005-09-16 | Paper |
| Strictly Nonblocking Multirate logd(N,m,p) Networks | 2005-09-16 | Paper |
| A competitive algorithm to find all defective edges in a graph | 2005-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660246 | 2005-03-21 | Paper |
| The incremental group testing model for gap closing in sequencing long molecules | 2005-03-15 | Paper |
| The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\) | 2005-02-23 | Paper |
| Strict nonblockingness of reduced shuffle‐exchange networks | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4832864 | 2004-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818490 | 2004-09-28 | Paper |
| Decomposing complete graphs into \(K_{r} \times K_{c}\)'s. | 2004-01-06 | Paper |
| The expected numbers of unresolved positive clones for various random pool designs | 2003-11-25 | Paper |
| Comments on "Network resilience: a measure of network fault tolerance" [with reply] | 2003-10-16 | Paper |
| Using transforming matrices to generate DNA clone grids | 2003-09-09 | Paper |
| A general construction for nonblocking crosstalk-free photonic switching networks | 2003-08-20 | Paper |
| On Macula's error-correcting pool designs. | 2003-07-29 | Paper |
| Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks | 2003-07-17 | Paper |
| A survey on multi-loop networks. | 2003-05-25 | Paper |
| Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1 | 2003-01-05 | Paper |
| Group testing and fault detection for replicated files | 2002-09-29 | Paper |
| A minimal-automaton-based algorithm for the reliability of Con\((d,k,n)\) systems | 2002-08-20 | Paper |
| Rare-event component importance for the consecutive-k system | 2002-06-11 | Paper |
| The structural Birnbaum importance of consecutive-k systems | 2002-05-28 | Paper |
| Some permutation routing algorithms for low-dimensional hypercubes | 2002-03-03 | Paper |
| Monotone routing in multirate rearrangeable Clos networks | 2002-01-27 | Paper |
| Structure importance of consecutive-\(k\)-out-of-\(n\) systems | 2001-12-05 | Paper |
| When is individual testing optimal for nonadaptive group testing? | 2001-11-11 | Paper |
| A complementary survey on double-loop networks | 2001-08-20 | Paper |
| Lower bounds for wide-sense nonblocking Clos network | 2001-08-20 | Paper |
| Channel graphs of bit permutation networks | 2001-08-20 | Paper |
| A new index of component importance | 2001-07-23 | Paper |
| CORRIGENDA ON “NEW COMPARISONS IN BIRNBAUM IMPORTANCE FOR THE CONSECUTIVE-k-OUT-OF-n SYSTEM” | 2001-05-07 | Paper |
| Supermodularity in various partition problems | 2001-03-28 | Paper |
| Equivalent double-loop networks | 2001-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2703797 | 2001-03-15 | Paper |
| Sortabilities of partition properties | 2001-03-04 | Paper |
| Partition polytopes over 1-dimensional points | 2001-03-04 | Paper |
| Localizing combinatorial properties for partitions on block graphs | 2001-03-04 | Paper |
| Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle | 2001-02-18 | Paper |
| Optimal quantitative group testing on cycles and paths | 2001-01-01 | Paper |
| Explicit solution of partitioning problems over a 1-dimensional parameter space | 2000-12-07 | Paper |
| Equivalent nondegenerate L-shapes of double-loop networks | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262015 | 2000-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262016 | 2000-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515749 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515736 | 2000-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506360 | 2000-09-17 | Paper |
| Linear-shaped partition problems | 2000-09-04 | Paper |
| Reliabilities for \((n,f,k)\) systems | 2000-06-07 | Paper |
| RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS | 2000-01-01 | Paper |
| Representations and characterizations of vertices of bounded-shape partition polytopes | 1999-12-19 | Paper |
| A Polynomial Time Algorithm for Shaped Partition Problems | 1999-11-24 | Paper |
| Interconnecting Highways | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242729 | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218422 | 1999-03-22 | Paper |
| A unique arithmetic labeling of hexagonal lattices | 1999-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227584 | 1999-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400643 | 1999-02-10 | Paper |
| Constrained arrangements of objects in a cycle | 1998-10-01 | Paper |
| Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercube | 1998-08-30 | Paper |
| An O(n log n) algorithm for the generalized birthday problem | 1998-07-23 | Paper |
| Wide-sense nonblocking for multirate 3-stage Clos networks | 1998-07-22 | Paper |
| Enumerating consecutive and nested partitions for graphs | 1998-07-19 | Paper |
| The Hamiltonian property of the consecutive-3 digraphs | 1998-06-25 | Paper |
| On 1-rate wide-sense nonblocking for 3-stage Clos networks | 1998-06-09 | Paper |
| A simple and direct derivation for the number of noncrossing partitions | 1998-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385251 | 1998-04-13 | Paper |
| Exact reliabilities of most reliable double-loop networks | 1998-03-23 | Paper |
| Optimality of consecutive and nested tree partitions | 1997-10-26 | Paper |
| Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions | 1997-07-27 | Paper |
| Efficient algorithms for the reliabilities of replicated \(n\)-parallel-task graphs | 1997-07-15 | Paper |
| Extremal permutations with respect to weak majorizations | 1997-05-28 | Paper |
| Optimality of Nested Partitions and Its Application to Cluster Analysis | 1997-04-27 | Paper |
| A \(d\)-move local permutation routing for the \(d\)-cube | 1997-03-05 | Paper |
| Localizing combinatorial properties of partitions | 1996-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894985 | 1996-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883381 | 1996-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862297 | 1996-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870159 | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850674 | 1996-02-11 | Paper |
| Assembly at system level versus component level | 1996-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4857782 | 1995-12-06 | Paper |
| The time complexity of deterministic broadcast radio networks | 1995-09-06 | Paper |
| An isomorphic factorization of the complete graph | 1995-05-14 | Paper |
| Enumerating nested and consecutive partitions | 1995-05-11 | Paper |
| Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules | 1995-02-06 | Paper |
| Survival reliability of some double-loop networks and chordal rings | 1995-01-01 | Paper |
| Majorization and Schur Convexity with Respect to Partial Orders | 1994-10-13 | Paper |
| A new competitive algorithm for the counterfeit coin problem | 1994-09-25 | Paper |
| Cutting numbers for the forward loop backward hop network | 1994-09-04 | Paper |
| Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders | 1994-08-14 | Paper |
| The Hamiltonian property of consecutive-\(d\) digraphs | 1994-06-12 | Paper |
| Constrained partitioning problems | 1994-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4294600 | 1994-05-17 | Paper |
| Consecutive-2-of-n:F systems with node and link failures | 1994-04-21 | Paper |
| Minimal‐distance routing for KYKLOS II | 1994-03-24 | Paper |
| Competitive group testing | 1994-03-21 | Paper |
| Most reliable double loop networks in survival reliability | 1993-12-20 | Paper |
| Erratum to: Binary vectors with exactly \(k\) nonoverlapping \(m\)-tuples of consecutive ones | 1993-12-10 | Paper |
| An O(kn)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system | 1993-10-04 | Paper |
| ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS | 1993-06-29 | Paper |
| A two‐stage network with dual partial concentrators | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035362 | 1993-05-18 | Paper |
| Reducing the Steiner Problem in a Normed Space | 1993-03-09 | Paper |
| The Steiner tree problem | 1993-01-23 | Paper |
| The capacity of the subarray partial concentrators | 1993-01-17 | Paper |
| An improved upper bound for the subarray partial concentrators | 1993-01-16 | Paper |
| Generalization of an engineering principle | 1993-01-16 | Paper |
| Reliabilities of chordal rings | 1992-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010313 | 1992-09-27 | Paper |
| Steiner Minimal Trees on Chinese Checkerboards | 1992-09-27 | Paper |
| Steiner tree problems | 1992-06-28 | Paper |
| A proof of the Gilbert-Pollak conjecture on the Steiner ratio | 1992-06-28 | Paper |
| The rectilinear Steiner arborescence problem | 1992-06-28 | Paper |
| An explicit solution for the number of minimal p-cutsequences in a consecutive-k-out of-n:F system | 1992-06-28 | Paper |
| A primer of the Euclidean Steiner problem | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983503 | 1992-06-27 | Paper |
| A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization | 1992-06-26 | Paper |
| Knockout tournaments with diluted Bradley-Terry preference schemes | 1991-01-01 | Paper |
| Using combinatorial designs to construct partial concentrators | 1991-01-01 | Paper |
| Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones | 1991-01-01 | Paper |
| Comments on Bern's probabilistic results on rectilinear Steiner trees | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3481535 | 1990-01-01 | Paper |
| The Steiner ratio conjecture of Gilbert and Pollak is true. | 1990-01-01 | Paper |
| An Improved Algorithm for Steiner Trees | 1990-01-01 | Paper |
| Optimal Assembly of an s-Stage k-Out-of-n System | 1990-01-01 | Paper |
| On optimal nested group testing algorithms | 1990-01-01 | Paper |
| Optimal Assignment of Components to a Two-Stage k-Out-of-n System | 1989-01-01 | Paper |
| Multistate consecutively-connected systems | 1989-01-01 | Paper |
| A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks | 1989-01-01 | Paper |
| Cutoff Point and Monotonicity Properties for Multinomial Group Testing | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3199426 | 1989-01-01 | Paper |
| Optimal relayed mobile communication systems | 1989-01-01 | Paper |
| Diameters of weighted double loop networks | 1988-01-01 | Paper |
| Generalized de Bruijn digraphs | 1988-01-01 | Paper |
| A decomposition theorem on Euclidean Steiner minimal trees | 1988-01-01 | Paper |
| Stronger players win more balanced knockout tournaments | 1988-01-01 | Paper |
| The existence of symmetric skew balanced starters for odd prime powers | 1988-01-01 | Paper |
| A Fundamental Monotonicity in Group Testing | 1988-01-01 | Paper |
| Existence of Symmetric Skew Balanced Starters for Odd Prime Powers | 1988-01-01 | Paper |
| A direct algorithm for computing reliability of a consecutive-k cycle | 1988-01-01 | Paper |
| Asymptotic results for partial concentrators | 1988-01-01 | Paper |
| Relayed consecutive-k-out-of-n:F lines | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780312 | 1987-01-01 | Paper |
| Steiner minimal trees for bar waves | 1987-01-01 | Paper |
| Steiner minimal trees on sets of four points | 1987-01-01 | Paper |
| Redundant consecutive-k systems | 1987-01-01 | Paper |
| The Hamiltonian property of linear functions | 1987-01-01 | Paper |
| Some inequalities concerning random subsets of a set (Corresp.) | 1987-01-01 | Paper |
| Optimal Assignments for Consecutive-2 Graphs | 1987-01-01 | Paper |
| Cutoff points for roll call protocols in multiple access systems | 1987-01-01 | Paper |
| Optimal Consecutive-2-Out-of-n Systems | 1986-01-01 | Paper |
| Simplified Reliabilities for Consecutive-k-out-of-nSystems | 1986-01-01 | Paper |
| On Nonblocking Multiconnection Networks | 1986-01-01 | Paper |
| A linear time algorithm for full Steiner trees | 1986-01-01 | Paper |
| Do local majorities force a global majority? | 1986-01-01 | Paper |
| Fixed Sample-Size Multinomial Selection in Scalar Zones | 1986-01-01 | Paper |
| Least-Favorable Configurations in the Multinomial Selection Problem: A Survey | 1986-01-01 | Paper |
| On a conjecture of trietsch and handler on the flow-dependent steiner ratio | 1986-01-01 | Paper |
| Optimal consecutive-2 systems of lines and cycles | 1985-01-01 | Paper |
| Failure Distributions of Consecutive-k-out-of-n:F Systems | 1985-01-01 | Paper |
| Steiner Minimal Tree for Points on a Circle | 1985-01-01 | Paper |
| Diagonal and pandiagonal tournament Latin squares | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734418 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691590 | 1985-01-01 | Paper |
| Component-level redundancy is better than system-level redundancy for channel graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3028697 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698066 | 1985-01-01 | Paper |
| Selecting non-consecutive balls arranged in many lines | 1984-01-01 | Paper |
| Selecting k objects from a cycle with p pairs of separation s | 1984-01-01 | Paper |
| A multilication theorem for balanced Howell rotations | 1984-01-01 | Paper |
| Detection of a Defective Coin with Partial Weight Information | 1984-01-01 | Paper |
| Complete balanced Howell rotations for 16k + 12 partnerships | 1984-01-01 | Paper |
| Three Versions of a Group Testing Game | 1984-01-01 | Paper |
| Some theorems, counterexamples, and conjectures in multinomial selection theory | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3223603 | 1984-01-01 | Paper |
| A New Bound for the Steiner Ratio | 1983-01-01 | Paper |
| A partition identity | 1983-01-01 | Paper |
| Control Algorithms for Rearrangeable Clos Networks | 1983-01-01 | Paper |
| Latin squares and superqueens | 1983-01-01 | Paper |
| Multiplicative magic squares | 1983-01-01 | Paper |
| Optimal Sequencing of Items In a Consecutive-2-out-of-n System | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3313866 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334700 | 1983-01-01 | Paper |
| Fast Solutions for Consecutive-k-out-of-n: F System | 1982-01-01 | Paper |
| New Concepts in Seeding Knockout Tournaments | 1982-01-01 | Paper |
| Balanced Howell Rotations of the Twin prime Power Type | 1982-01-01 | Paper |
| Minimizing a Combinatorial Function | 1982-01-01 | Paper |
| Complete balanced Howell rotations for 8k+5 teams | 1982-01-01 | Paper |
| Group testing with two defectives | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3666868 | 1982-01-01 | Paper |
| Symmetric Skew Balanced Starters and Complete Balanced Howell Rotations | 1982-01-01 | Paper |
| A Multistage Selection Scheme for the Most Probable Event | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3946858 | 1982-01-01 | Paper |
| Computing the Blocking Probabilities for Spiderweb Channel Graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3952943 | 1982-01-01 | Paper |
| Comparisons on Blocking Probabilities for Regular Series Parallel Channel Graphs | 1982-01-01 | Paper |
| Optimal partitions | 1981-01-01 | Paper |
| A Group Testing Problem on Two Disjoint Sets | 1981-01-01 | Paper |
| Cycle Polynomials | 1981-01-01 | Paper |
| Hypergeometric and Generalized Hypergeometric Group Testing | 1981-01-01 | Paper |
| A Boundary Problem for Group Testing | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3918154 | 1981-01-01 | Paper |
| Characterization for Series-Parallel Channel Graphs | 1981-01-01 | Paper |
| Efficient Realization Techniques for Network Flow Patterns | 1981-01-01 | Paper |
| Optimal Merging of 3 Elements with n Elements | 1980-01-01 | Paper |
| Stronger players win more knockout tournaments in average | 1980-01-01 | Paper |
| An explicit expression for the cost of a class of Huffman trees | 1980-01-01 | Paper |
| A Group Testing Problem | 1980-01-01 | Paper |
| The Connection Patterns of Two Complete Binary Trees | 1980-01-01 | Paper |
| Maximum Wealth Trees | 1980-01-01 | Paper |
| Blocking Probabilities for a Class of Spiderweb Channel Graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960012 | 1980-01-01 | Paper |
| Majorization on a Partially Ordered Set | 1979-01-01 | Paper |
| Three-Stage Multiconnection Networks Which Are Nonblocking in the Wide Sense | 1979-01-01 | Paper |
| An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees | 1979-01-01 | Paper |
| An O(n log n) algorithm for suboptimal rectilinear Steiner trees | 1979-01-01 | Paper |
| The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter | 1979-01-01 | Paper |
| Crisscross latin squares | 1979-01-01 | Paper |
| Generalized Huffman Trees | 1979-01-01 | Paper |
| Crisscross latin squares | 1979-01-01 | Paper |
| Some Realizability Theorems in Group Testing | 1979-01-01 | Paper |
| On the construction of balanced switching networks | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3882468 | 1979-01-01 | Paper |
| On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194972 | 1979-01-01 | Paper |
| Minimum range sequences of all k-subsets of a set | 1978-01-01 | Paper |
| A Lower Bound for the Steiner Tree Problem | 1978-01-01 | Paper |
| Do Stronger Players Win More Knockout Tournaments? | 1978-01-01 | Paper |
| Link designs and probability analyses for a class of connecting networks | 1978-01-01 | Paper |
| Distribution of integers into k-tuples with prescribed conditions | 1978-01-01 | Paper |
| A Note on Hypergeometric Group Testing Procedures | 1978-01-01 | Paper |
| On Blocking Probabilities for a Class of Linear Graphs | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4159176 | 1978-01-01 | Paper |
| The Construction for Symmetrical Zone-Balanced Networks | 1978-01-01 | Paper |
| Some Optimal Partition Problems with Applications to Switching Networks | 1978-01-01 | Paper |
| A Generalization of Takagi's Theorem on Optimal Channel Graphs | 1978-01-01 | Paper |
| Neighbor designs | 1977-01-01 | Paper |
| Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units | 1977-01-01 | Paper |
| Rectilinear steiner trees: Efficient special-case algorithms | 1977-01-01 | Paper |
| A generalization of the Karlin-McGregor theorem on coincidence probabilities and an application to clustering | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4163243 | 1977-01-01 | Paper |
| On Blocking Probabilities for Switching Networks | 1977-01-01 | Paper |
| A Probability Inequality and Its Application to Switching Networks | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4118665 | 1977-01-01 | Paper |
| A problem on blocking probabilities in connecting networks | 1977-01-01 | Paper |
| Construction for Group-Balanced Connecting Networks | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186352 | 1977-01-01 | Paper |
| On Steiner Minimal Trees with Rectilinear Distance | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4100104 | 1976-01-01 | Paper |
| Use of Steiner's problem in suboptimal routing in rectilinear metric | 1976-01-01 | Paper |
| New constructions for balanced Howell rotations | 1976-01-01 | Paper |
| Group testing with a dilution effect | 1976-01-01 | Paper |
| New classes of complete balanced Howell rotations | 1976-01-01 | Paper |
| Construction of 2-balanced \((n,k,\lambda)\) arrays | 1976-01-01 | Paper |
| An Optimum Nested Procedure in Binomial Group Testing | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4097330 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4111579 | 1976-01-01 | Paper |
| On the Rearrangeability of Some Multistage Connecting Networks | 1976-01-01 | Paper |
| A Generalized Binomial Group Testing Problem | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4067113 | 1975-01-01 | Paper |
| Isolating a Single Defective Using Group Testing | 1974-01-01 | Paper |
| A direct method to construct triple systems | 1974-01-01 | Paper |
| On Finding a Single Defective in Binomial Group Testing | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4052970 | 1974-01-01 | Paper |
| Constructions for some classes of neighbor designs | 1973-01-01 | Paper |
| A Class of Merging Algorithms | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4082196 | 1973-01-01 | Paper |
| Rearrangeability of multi‐connection three‐stage clos networks | 1972-01-01 | Paper |
| A Method for Detecting All Defective Members in a Population by Group Testing | 1972-01-01 | Paper |
| A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets | 1972-01-01 | Paper |
| Constructions for balanced Howell rotations for bridge tournaments | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5663263 | 1972-01-01 | Paper |
| Optimal merging of 2 elements with n elements | 1971-01-01 | Paper |
| On generating a random sequence | 1971-01-01 | Paper |
| On Beneš Rearrangeable Networks | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5658994 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5617635 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5622986 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4773288 | 1969-01-01 | Paper |
| A Polynomial Time Algorithm for Vertex Enumeration and Optimization over Shaped Partition Polytopes | N/A | Paper |
