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