| Publication | Date of Publication | Type |
|---|
| Coping with errors in binary search procedures (Preliminary Report) | 2014-03-14 | Paper |
| An odd kind of BCH code | 2013-11-29 | Paper |
| A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5295579 | 2007-07-30 | Paper |
| Extremal problems among subsets of a set. (Reprint) | 2006-08-04 | Paper |
| On Rado's boundedness conjecture | 2006-03-16 | Paper |
| A note on caterpillar-embeddings with no two parallel edges | 2005-04-15 | Paper |
| On partitions of discrete boxes | 2002-12-02 | Paper |
| Convex sets in the plane with three of every four meeting | 2002-02-13 | Paper |
| Recent developments in computational gene recognition | 2001-11-11 | Paper |
| Six lonely runners | 2001-10-16 | Paper |
| On a problem in shuffling | 2001-03-04 | Paper |
| Finding convex sets among points in the plane | 1999-03-18 | Paper |
| On the design of reliable Boolean circuits that contain partially unreliable gates | 1998-08-04 | Paper |
| A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture | 1998-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347896 | 1997-08-11 | Paper |
| Acyclic matchings | 1997-05-04 | Paper |
| Forcing disjoint segments in the plane | 1996-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882555 | 1996-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4859013 | 1996-04-23 | Paper |
| The prison yard problem | 1995-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326644 | 1995-04-18 | Paper |
| On the Maximum Number of Triangles in Wheel-Free Graphs | 1995-03-09 | Paper |
| An upper bound for the Ramsey numbers \(r(K_ 3,G)\) | 1994-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284614 | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138290 | 1994-08-28 | Paper |
| Crossing families | 1994-08-11 | Paper |
| Independence and the Havel-Hakimi residue | 1994-06-09 | Paper |
| Point Selections and Weak ε-Nets for Convex Hulls | 1994-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284610 | 1994-03-24 | Paper |
| Packing lines in a hypercube | 1994-03-20 | Paper |
| A note on maximal triangle‐free graphs | 1994-03-17 | Paper |
| Even Cycles in Directed Graphs | 1994-01-01 | Paper |
| Minimally distant sets of lattice points | 1993-08-25 | Paper |
| Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028477 | 1993-03-28 | Paper |
| Sharpening the LYM inequality | 1993-01-17 | Paper |
| On the product of sign vectors and unit vectors | 1993-01-17 | Paper |
| Piercing convex sets | 1993-01-16 | Paper |
| Partitioning a rectangle into small perimeter rectangles | 1993-01-16 | Paper |
| A quasi-polynomial bound for the diameter\\of graphs of polyhedra | 1992-09-27 | Paper |
| On zero-trees | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983256 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972135 | 1992-06-25 | Paper |
| Set systems with no union of cardinality 0 modulo \(m\) | 1992-06-25 | Paper |
| Partitioning a power set into union-free classes | 1992-06-25 | Paper |
| Representations of families of triples over \(GF(2)\) | 1992-06-25 | Paper |
| Sphere coverings of the hypercube with incomparable centers | 1992-06-25 | Paper |
| On the number of databases and closure operations | 1991-01-01 | Paper |
| Spanning Trees with Many Leaves | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5749346 | 1990-01-01 | Paper |
| Diameter and radius in the Manhattan metric | 1990-01-01 | Paper |
| An Almost Linear Time Algorithm for Generalized Matrix Searching | 1990-01-01 | Paper |
| Computing the Bandwidth of Interval Graphs | 1990-01-01 | Paper |
| Divisors without Unit-Congruent Ratios | 1989-01-01 | Paper |
| An addition theorem on the integers modulo \(n\) | 1989-01-01 | Paper |
| Radius and diameter in Manhattan lattices | 1989-01-01 | Paper |
| A minimal cutset of the Boolean lattice with almost all members | 1989-01-01 | Paper |
| Minimum cutsets for an element of a Boolean lattice | 1989-01-01 | Paper |
| A generalized model for understanding evasiveness | 1989-01-01 | Paper |
| Spanning trees with many leaves in cubic graphs | 1989-01-01 | Paper |
| Pair Labellings with Given Distance | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3201067 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3808295 | 1988-01-01 | Paper |
| The smallest n-uniform hypergraph with positive discrepancy | 1987-01-01 | Paper |
| The number of linear extensions of subset ordering | 1987-01-01 | Paper |
| Subgraphs of large connectivity and chromatic number in graphs of large chromatic number | 1987-01-01 | Paper |
| Covering a square by small perimeter rectangles | 1986-01-01 | Paper |
| Longest chains in the lattice of integer partitions ordered by majorization | 1986-01-01 | Paper |
| On a problem of Yuzvinsky on separating the n-cube | 1986-01-01 | Paper |
| Characterization of curve map graphs | 1984-01-01 | Paper |
| On a dual version of the one-dimensional bin packing problem | 1984-01-01 | Paper |
| Superantichains in the Lattice of Partitions of a Set | 1984-01-01 | Paper |
| An algorithm for covering polygons with rectangles | 1984-01-01 | Paper |
| A Statistical Procedure for Cluster Recognition with Application to Atlanta Leukemia-Lymphoma Data | 1983-01-01 | Paper |
| On the asymptotic number of tournament score sequences | 1983-01-01 | Paper |
| The number of rounds needed to exchange information within a graph | 1983-01-01 | Paper |
| An asymptotically optimal layout for the shuffle-exchange graph | 1983-01-01 | Paper |
| An algorithm for collapsing sign alternating sequences of real numbers | 1983-01-01 | Paper |
| Traditional Galleries Require Fewer Watchmen | 1983-01-01 | Paper |
| On the number of graphs without 4-cycles | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3944351 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3960781 | 1982-01-01 | Paper |
| Set Orderings Requiring Costliest Alphabetic Binary Trees | 1981-01-01 | Paper |
| Covering Regions by Rectangles | 1981-01-01 | Paper |
| Inherent complexity trade-offs for range query problems | 1981-01-01 | Paper |
| On cross-bandwidth | 1981-01-01 | Paper |
| Intersections of k-element sets | 1981-01-01 | Paper |
| Forests and score vectors | 1981-01-01 | Paper |
| On the Partial Sums of the Rearrangements of a Complex Series | 1981-01-01 | Paper |
| A Monotonicity Property of Partial Orders | 1981-01-01 | Paper |
| Some Results on Systems of Finite Sets That Satisfy a Certain Intersection Condition | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3947667 | 1981-01-01 | Paper |
| Ensembles and Largest Sojourns of Random Walks | 1980-01-01 | Paper |
| Helly-type theorems about sets | 1980-01-01 | Paper |
| Coping with errors in binary search procedures | 1980-01-01 | Paper |
| Further gossip problems | 1980-01-01 | Paper |
| Further results on the Aanderaa-Rosenberg conjecture | 1980-01-01 | Paper |
| The Asymptotic Number of Lattices | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4193510 | 1979-01-01 | Paper |
| The number of meets between two subsets of a lattice | 1979-01-01 | Paper |
| Skew chain orders and sets of rectangles | 1979-01-01 | Paper |
| Probabilities of Independent Choices Being Ordered | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3941435 | 1979-01-01 | Paper |
| Some Optimization Problems with Bulk-Service Queues | 1978-01-01 | Paper |
| On Two-Terminal Control of a Shuttle Service | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4196436 | 1978-01-01 | Paper |
| Algorithms for Loop Matchings | 1978-01-01 | Paper |
| Matrix tree theorems | 1978-01-01 | Paper |
| Maximal Rectilinear Crossing of Cycles | 1977-01-01 | Paper |
| On the Existence of Simultaneous Edge Disjoint Realizations of Degree Sequences with “Few” Edges | 1977-01-01 | Paper |
| A three part Sperner theorem | 1977-01-01 | Paper |
| The Number of Semigroups of Order n | 1976-01-01 | Paper |
| Extensions of the Erdös-Ko-Rado Theorem | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133658 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140761 | 1976-01-01 | Paper |
| The structure of Sperner k-families | 1976-01-01 | Paper |
| The structure of Sperner k-families | 1976-01-01 | Paper |
| The structure of Sperner k-families | 1976-01-01 | Paper |
| The degree sequences of self-complementary graphs | 1976-01-01 | Paper |
| Extremal properties of collections of subsets containing no two sets and their union | 1976-01-01 | Paper |
| A lower bound on the length of a sequence containing all permutations as subsequences | 1976-01-01 | Paper |
| More on complementary trees | 1976-01-01 | Paper |
| A note on the parity of the number of crossings of a graph | 1976-01-01 | Paper |
| Some new results on the Littlewood-Offord problem | 1976-01-01 | Paper |
| Strong versions of Sperner's theorem | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044605 | 1975-01-01 | Paper |
| Counting Trees in a Certain Class of Graphs | 1975-01-01 | Paper |
| Asymptotic Enumeration of Partial Orders on a Finite Set | 1975-01-01 | Paper |
| Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4074905 | 1975-01-01 | Paper |
| On Dedekind's Problem: The Number of Isotone Boolean Functions. II | 1975-01-01 | Paper |
| A Note on Some Subset Identities | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4097291 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103577 | 1975-01-01 | Paper |
| Algorithms | 1975-01-01 | Paper |
| Automorphisms of lexicographic products | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050598 | 1974-01-01 | Paper |
| Complementary Trees and Independent Matchings | 1974-01-01 | Paper |
| Cost allocation in networks: The bulk supplier problem | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777313 | 1974-01-01 | Paper |
| Extremal problems among subsets of a set | 1974-01-01 | Paper |
| On the number of latent subsets of intersecting collections | 1974-01-01 | Paper |
| A Note on Random Triangles | 1974-01-01 | Paper |
| Cost allocation for a spanning tree | 1973-01-01 | Paper |
| Normalized Matching in Direct Products of Partial Orders | 1973-01-01 | Paper |
| Increasing paths in edge ordered graphs | 1973-01-01 | Paper |
| On the average size of the sets in a Sperner family | 1973-01-01 | Paper |
| Families of \(k\)-independent sets | 1973-01-01 | Paper |
| Another Proof of a Result of Perry on Chains of Finite Sets | 1972-01-01 | Paper |
| Finding Uncomplemented Trees | 1972-01-01 | Paper |
| A generalization of Kaplansky's game | 1972-01-01 | Paper |
| How many sums of vectors can lie in a circle of diameter \(\sqrt 2?\) | 1972-01-01 | Paper |
| On Collections of Subsets Containing No 4-Member Boolean Algebra | 1971-01-01 | Paper |
| Configurations Maximizing the Number of Pairs of Hamming‐Adjacent Lattice Points | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5636886 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5640371 | 1971-01-01 | Paper |
| An algorithm for certain multi‐commodity flow problems | 1971-01-01 | Paper |
| Maximal sized antichains in partial orders | 1971-01-01 | Paper |
| Some positive definite functions on sets and their application to the Ising model | 1971-01-01 | Paper |
| A matching theorem for graphs | 1970-01-01 | Paper |
| Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops | 1970-01-01 | Paper |
| The Number of Finite Topologies | 1970-01-01 | Paper |
| Proportions of Irreducible Diagrams | 1970-01-01 | Paper |
| The crossing number of K5,n | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5616865 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5618374 | 1970-01-01 | Paper |
| Packing Squares in Rectangles I | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5661735 | 1970-01-01 | Paper |
| On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors | 1970-01-01 | Paper |
| On subsets contained in a family of non-commensurable subsets of a finite set | 1969-01-01 | Paper |
| On Dedekind's Problem: The Number of Monotone Boolean Functions | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5542810 | 1968-01-01 | Paper |
| On families of subsets of a finite set containing no two disjoint sets and their union | 1968-01-01 | Paper |
| On a conjecture of milner on k-graphs with non-disjoint edges | 1968-01-01 | Paper |
| On coloring graphs to maximize the proportion of multicolored k-edges | 1968-01-01 | Paper |
| Maximal number of subsets of a finite set No k of which are pairwise disjoint | 1968-01-01 | Paper |
| On a Combinatorial Problem of Erdos | 1966-01-01 | Paper |
| Families of Non-disjoint subsets | 1966-01-01 | Paper |
| On a combinatorial conjecture of Erdös | 1966-01-01 | Paper |
| On a lemma of Littlewood and Offord on the distribution of certain sums | 1965-01-01 | Paper |
| Some results on analytic functions in local field theory | 1959-01-01 | Paper |
| On the parity of K-baryon vertices | 1959-01-01 | Paper |
