| Publication | Date of Publication | Type |
|---|
The power of many colours
Forum of Mathematics, Sigma | 2024-12-12 | Paper |
Diagonalization Games
American Mathematical Monthly | 2024-12-12 | Paper |
Erasure list-decodable codes and Turán hypercube problems
Finite Fields and their Applications | 2024-11-01 | Paper |
Implicit representation of sparse hereditary families
Discrete \& Computational Geometry | 2024-10-25 | Paper |
Connectivity graph-codes
Random Structures \& Algorithms | 2024-10-24 | Paper |
Identifying the deviator
The Annals of Applied Probability | 2024-10-16 | Paper |
Cats in cubes
The Electronic Journal of Combinatorics | 2024-10-07 | Paper |
Eli Goodman (1933--2021) and Ricky Pollack (1935--2018)
Notices of the American Mathematical Society | 2024-09-26 | Paper |
On sums and products along the edges, II
Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Mathematica | 2024-09-11 | Paper |
On a random model of forgetting
The Annals of Applied Probability | 2024-08-21 | Paper |
Logarithmically larger deletion codes of all distances
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Erratum to: ``Multitasking capacity: hardness results and improved constructions
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Strong blocking sets and minimal codes from expander graphs
Transactions of the American Mathematical Society | 2024-07-12 | Paper |
Boosting simple learners
TheoretiCS | 2024-07-03 | Paper |
Hitting a Prime in 2.43 Dice Rolls (On Average)
The American Statistician | 2024-06-27 | Paper |
Graph-codes
European Journal of Combinatorics | 2024-02-05 | Paper |
Invertibility of Digraphs and Tournaments
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
Turán graphs with bounded matching number
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
Fair Partitions
Surveys in Combinatorics 2022 | 2024-01-05 | Paper |
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs
SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
Boosting simple learners
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Adversarial laws of large numbers and optimal regret in online classification
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7760134 (Why is no real title available?)
| 2023-11-02 | Paper |
scientific article; zbMATH DE number 7758308 (Why is no real title available?)
| 2023-10-31 | Paper |
Spanning trees with few non-leaves
Israel Journal of Mathematics | 2023-10-23 | Paper |
Near-sunflowers and focal families
Israel Journal of Mathematics | 2023-10-23 | Paper |
Complete minors and average degree: A short proof
Journal of Graph Theory | 2023-10-12 | Paper |
Divisible subdivisions
Journal of Graph Theory | 2023-10-04 | Paper |
New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\)
European Journal of Combinatorics | 2023-10-02 | Paper |
List Ramsey numbers
Journal of Graph Theory | 2023-09-29 | Paper |
Essentially tight bounds for rainbow cycles in proper edge-colourings
| 2023-09-08 | Paper |
The power of many colours
| 2023-08-29 | Paper |
Rank of Matrices with Entries from a Multiplicative Group
IMRN. International Mathematics Research Notices | 2023-08-15 | Paper |
Connectivity Graph-Codes
| 2023-08-15 | Paper |
Ordering Candidates via Vantage Points
| 2023-08-09 | Paper |
On bipartite coverings of graphs and multigraphs
| 2023-07-31 | Paper |
Largest subgraph from a hereditary property in a random graph
Discrete Mathematics | 2023-06-12 | Paper |
Strong blocking sets and minimal codes from expander graphs
| 2023-05-24 | Paper |
Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Private and Online Learnability Are Equivalent
Journal of the ACM | 2023-04-27 | Paper |
Irregular subgraphs
Combinatorics, Probability and Computing | 2023-04-03 | Paper |
The limit points of the top and bottom eigenvalues of regular graphs
| 2023-04-03 | Paper |
The diameter of the uniform spanning tree of dense graphs
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Structured Codes of Graphs
SIAM Journal on Discrete Mathematics | 2023-03-30 | Paper |
Counting dope matrices
Journal of Algebra | 2023-02-21 | Paper |
Unit and distinct distances in typical norms
| 2023-02-17 | Paper |
On sums of monotone random integer variables
Electronic Communications in Probability | 2023-01-23 | Paper |
Friends and strangers walking on graphs
Séminaire Lotharingien de Combinatoire | 2023-01-05 | Paper |
Diagonalization Games
| 2023-01-05 | Paper |
Cats in cubes
| 2022-11-27 | Paper |
Typical and extremal aspects of friends-and-strangers graphs
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
Logarithmically larger deletion codes of all distances
| 2022-09-23 | Paper |
Hitting a prime in 2.43 dice rolls (on average)
| 2022-09-15 | Paper |
The \(\varepsilon\)-\(t\)-net problem
Discrete \& Computational Geometry | 2022-08-25 | Paper |
Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
| 2022-07-21 | Paper |
The runsort permuton
Advances in Applied Mathematics | 2022-06-13 | Paper |
Counting Dope Matrices
| 2022-05-18 | Paper |
High-girth near-Ramanujan graphs with localized eigenvectors
Israel Journal of Mathematics | 2022-04-25 | Paper |
Additive approximation of generalized Turán questions
Algorithmica | 2022-03-25 | Paper |
On a random model of forgetting
| 2022-03-04 | Paper |
On the hat guessing number of graphs
Discrete Mathematics | 2022-02-14 | Paper |
Implicit representation of sparse hereditary families
| 2022-01-02 | Paper |
Random necklaces require fewer cuts
| 2021-12-29 | Paper |
Asymmetric list sizes in bipartite graphs
Annals of Combinatorics | 2021-12-18 | Paper |
Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
Experimental Mathematics | 2021-11-03 | Paper |
Explicit expanders of every degree and size
Combinatorica | 2021-10-25 | Paper |
Irregular Subgraphs
| 2021-08-05 | Paper |
Efficient removal lemmas for matrices
| 2021-07-28 | Paper |
Partitioning all $k$-subsets into $r$-wise intersecting families
| 2021-07-27 | Paper |
Edge-statistics on large graphs
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Mixing properties of colourings of the ℤd lattice
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Large cliques and independent sets all over the place
Proceedings of the American Mathematical Society | 2021-06-10 | Paper |
Dominance Solvability in Random Games
| 2021-05-22 | Paper |
Inverse problems for minimal complements and maximal supplements
Journal of Number Theory | 2021-03-29 | Paper |
Hitting all maximum independent sets
| 2021-03-10 | Paper |
Limitations on regularity lemmas for clustering graphs
Advances in Applied Mathematics | 2021-02-02 | Paper |
Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
Acta Mathematica Hungarica | 2020-12-18 | Paper |
Distributed corruption detection in networks
Theory of Computing | 2020-12-17 | Paper |
Ronald Louis Graham (1935 ‐ 2020)
Random Structures \& Algorithms | 2020-11-30 | Paper |
Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
Combinatorica | 2020-10-02 | Paper |
Problems and results in Extremal Combinatorics -- IV
| 2020-09-26 | Paper |
scientific article; zbMATH DE number 7250151 (Why is no real title available?)
| 2020-09-22 | Paper |
A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families
Discrete Mathematics | 2020-08-12 | Paper |
On sums and products along the edges, II
| 2020-07-25 | Paper |
Lovász, vectors, graphs and codes
Bolyai Society Mathematical Studies | 2020-07-08 | Paper |
The hat guessing number of graphs
Journal of Combinatorial Theory. Series B | 2020-07-07 | Paper |
Efficient Splitting of Measures and Necklaces
| 2020-06-30 | Paper |
Efficient removal lemmas for matrices
Order | 2020-05-26 | Paper |
Out-colourings of digraphs
Journal of Graph Theory | 2020-05-21 | Paper |
Isoperimetry, stability, and irredundance in direct products
Discrete Mathematics | 2020-05-21 | Paper |
On the product dimension of clique factors
European Journal of Combinatorics | 2020-04-09 | Paper |
Multitasking capacity: hardness results and improved constructions
SIAM Journal on Discrete Mathematics | 2020-03-26 | Paper |
The minrank of random graphs over arbitrary fields
Israel Journal of Mathematics | 2020-03-04 | Paper |
Sums, products, and ratios along the edges of a graph
Publicacions Matemàtiques | 2020-02-25 | Paper |
Private PAC learning implies finite Littlestone dimension
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
discrete Analysis | 2020-01-17 | Paper |
Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemer\'{e}di Graphs and Hypergraphs
| 2020-01-02 | Paper |
Traces of hypergraphs
Journal of the London Mathematical Society | 2019-11-28 | Paper |
Reliable communication over highly connected noisy networks
Distributed Computing | 2019-11-27 | Paper |
On Generalized Regularity
| 2019-11-05 | Paper |
Gregory Gutin and graph optimization problems
| 2019-07-25 | Paper |
Broadcast throughput in radio networks: routing vs. network coding
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
On the compatibility of quartet trees
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Space-efficient local computation algorithms
| 2019-05-10 | Paper |
On the power of two, three and four probes
| 2019-05-06 | Paper |
Induced universal hypergraphs
SIAM Journal on Discrete Mathematics | 2019-04-24 | Paper |
List-Decodable Zero-Rate Codes
IEEE Transactions on Information Theory | 2019-03-28 | Paper |
\(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
Discrete Mathematics | 2019-02-20 | Paper |
List Ramsey numbers
| 2019-02-19 | Paper |
Optimal induced universal graphs for bounded-degree graphs
Mathematical Proceedings of the Cambridge Philosophical Society | 2019-01-31 | Paper |
Permutations resilient to deletions
Annals of Combinatorics | 2019-01-24 | Paper |
Many cliques in \(H\)-free subgraphs of random graphs
Journal of Combinatorics | 2018-12-10 | Paper |
Additive Approximation of Generalized Tur\'an Questions
| 2018-11-21 | Paper |
Guessing secrets efficiently via list decoding
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Separation dimension and sparsity
Journal of Graph Theory | 2018-10-31 | Paper |
Clique coloring of dense random graphs
Journal of Graph Theory | 2018-08-16 | Paper |
Uniformly Discrete Forests with Poor Visibility
Combinatorics, Probability and Computing | 2018-07-24 | Paper |
On the maximum quartet distance between phylogenetic trees
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Optimal induced universal graphs for bounded-degree graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Ramsey-nice families of graphs
European Journal of Combinatorics | 2018-06-28 | Paper |
Testing Equality in Communication Graphs
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Duplication Distance to the Root for Binary Sequences
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Sign rank versus Vapnik-Chervonenkis dimension
Sbornik: Mathematics | 2018-04-06 | Paper |
Fair representation by independent sets
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
Israel Journal of Mathematics | 2017-12-21 | Paper |
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
SIAM Journal on Computing | 2017-12-08 | Paper |
On-line and off-line approximation algorithms for vector covering problems
Algorithms — ESA '96 | 2017-12-05 | Paper |
Broadcast transmission to prioritizing receivers
SIAM Journal on Discrete Mathematics | 2017-11-13 | Paper |
Easily testable graph properties
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
On active and passive testing
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Reliable communication over highly connected noisy networks
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Optimal Monotone Encodings
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Typical peak sidelobe level of binary sequences
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Typechecking XML views of relational databases
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Counting contours on trees
Letters in Mathematical Physics | 2017-05-22 | Paper |
Linear Boolean Classification, Coding and the Critical Problem
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Asymptotically optimal induced universal graphs
Geometric and Functional Analysis. GAFA | 2017-04-11 | Paper |
Testing hereditary properties of ordered graphs and matrices
| 2017-04-07 | Paper |
The cover number of a matrix and its algorithmic applications
| 2017-03-22 | Paper |
Revenue and reserve prices in a probabilistic single item auction
Algorithmica | 2017-03-06 | Paper |
More on the bipartite decomposition of random graphs
Journal of Graph Theory | 2017-02-01 | Paper |
Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
Journal of Graph Theory | 2016-11-17 | Paper |
Many \(T\) copies in \(H\)-free graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Many \(T\) copies in \(H\)-free graphs
Journal of Combinatorial Theory. Series B | 2016-10-12 | Paper |
Optimal compression of approximate inner products and dimension reduction
| 2016-10-02 | Paper |
Coloring, sparseness and girth
Israel Journal of Mathematics | 2016-09-15 | Paper |
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
High girth augmented trees are huge
Journal of Combinatorial Theory. Series A | 2016-08-18 | Paper |
Reflections on Paul Erdős on his birth centenary. II
Notices of the American Mathematical Society | 2016-06-15 | Paper |
Problems and results in extremal combinatorics. III.
Journal of Combinatorics | 2016-05-25 | Paper |
On the maximum quartet distance between phylogenetic trees
SIAM Journal on Discrete Mathematics | 2016-04-15 | Paper |
The probabilistic method
Wiley-Interscience Series in Discrete Mathematics and Optimization | 2016-04-07 | Paper |
On rigid matrices and \(U\)-polynomials
Computational Complexity | 2016-01-06 | Paper |
Size and degree anti-Ramsey numbers
Graphs and Combinatorics | 2015-12-17 | Paper |
Local and global colorability of graphs
Discrete Mathematics | 2015-12-08 | Paper |
Separation dimension of bounded degree graphs
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Weak ε-nets and interval chains
Journal of the ACM | 2015-11-11 | Paper |
Approximating sparse binary matrices in the cut-norm
Linear Algebra and its Applications | 2015-09-28 | Paper |
Algorithmic construction of sets for k -restrictions
ACM Transactions on Algorithms | 2015-09-02 | Paper |
A general approach to online network optimization problems
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Economical Graph Discovery
Operations Research | 2015-08-28 | Paper |
Comparable pairs in families of sets
Journal of Combinatorial Theory. Series B | 2015-08-21 | Paper |
scientific article; zbMATH DE number 6472625 (Why is no real title available?)
| 2015-08-14 | Paper |
scientific article; zbMATH DE number 6469238 (Why is no real title available?)
| 2015-08-03 | Paper |
scientific article; zbMATH DE number 6469194 (Why is no real title available?)
| 2015-08-03 | Paper |
Bipartite decomposition of random graphs
Journal of Combinatorial Theory. Series B | 2015-06-10 | Paper |
Local correction with constant error rate
Algorithmica | 2015-05-26 | Paper |
Routing permutations on graphs via matchings
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Sign rank versus VC dimension
| 2015-03-26 | Paper |
Bayesian ignorance
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Practically stabilizing SWMR atomic memory in message-passing systems
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Chasing a fast robber on planar graphs and random graphs
Journal of Graph Theory | 2015-01-21 | Paper |
The asymmetric matrix partition problem
Web and Internet Economics | 2015-01-12 | Paper |
Drawing outerplanar graphs using three edge lengths
Computational Geometry | 2014-12-23 | Paper |
Correction: ``Basic network creation games
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
On the compatibility of quartet trees
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
An elementary construction of constant-degree expanders
| 2014-12-18 | Paper |
A combinatorial characterization of the testable graph properties, it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Admission control to minimize rejections and online set cover with repetitions
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Balanced families of perfect hash functions and their applications
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Linear equations, arithmetic progressions and hypergraph property testing
| 2014-10-13 | Paper |
Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics
| 2014-10-13 | Paper |
The Turán number of sparse spanning graphs
Journal of Combinatorial Theory. Series B | 2014-10-06 | Paper |
Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
Theory of Computing | 2014-10-06 | Paper |
A note on general sliding window processes
Electronic Communications in Probability | 2014-09-29 | Paper |
Maximizing the Number of Nonnegative Subsets
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Chasing robbers on random geometric graphs-an alternative approach
Discrete Applied Mathematics | 2014-09-12 | Paper |
The approximate rank of a matrix and its algorithmic applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Additive patterns in multiplicative subgroups
Geometric and Functional Analysis. GAFA | 2014-08-01 | Paper |
The chromatic number of random Cayley graphs
European Journal of Combinatorics | 2014-07-29 | Paper |
Choice-Memory Tradeoff in Allocations
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Counting sum-free sets in abelian groups
Israel Journal of Mathematics | 2014-06-25 | Paper |
Two notions of unit distance graphs
| 2014-06-11 | Paper |
Two notions of unit distance graphs
Journal of Combinatorial Theory. Series A | 2014-05-26 | Paper |
scientific article; zbMATH DE number 6297727 (Why is no real title available?)
| 2014-05-22 | Paper |
Paul Erdős and probabilistic reasoning
Bolyai Society Mathematical Studies | 2014-05-19 | Paper |
Nearly complete graphs decomposable into large induced matchings and their applications
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Beeping a maximal independent set
Distributed Computing | 2014-03-25 | Paper |
A refinement of the Cameron-Erdős conjecture
Proceedings of the London Mathematical Society | 2014-02-28 | Paper |
Matrix sparsification and nested dissection over arbitrary fields
| 2014-02-17 | Paper |
How to Put through Your Agenda in Collective Binary Decisions
Algorithmic Decision Theory | 2013-12-17 | Paper |
Restricted integer partition functions
Integers | 2013-10-25 | Paper |
Playing to retain the advantage
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Basic network creation games
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Nearly complete graphs decomposable into large induced matchings and their applications
Journal of the European Mathematical Society (JEMS) | 2013-09-02 | Paper |
Nearly tight bounds for testing function isomorphism
SIAM Journal on Computing | 2013-07-24 | Paper |
On sunflowers and matrix multiplication
Computational Complexity | 2013-07-19 | Paper |
Minimizing the number of carries in addition
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Adversarial Leakage in Games
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Tight bounds for shared memory systems accessed by Byzantine processes
Distributed Computing | 2013-06-07 | Paper |
A note on degenerate and spectrally degenerate graphs
Journal of Graph Theory | 2013-03-07 | Paper |
The de Bruijn-Erdős theorem for hypergraphs
Designs, Codes and Cryptography | 2012-11-28 | Paper |
Sums and products along sparse graphs
Israel Journal of Mathematics | 2012-11-13 | Paper |
Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Bayesian ignorance
Theoretical Computer Science | 2012-10-11 | Paper |
Multicolored matchings in hypergraphs
Moscow Journal of Combinatorics and Number Theory | 2012-09-05 | Paper |
Local correction of juntas
Information Processing Letters | 2012-07-18 | Paper |
Local rainbow colorings
Journal of Combinatorics | 2012-07-16 | Paper |
Dense uniform hypergraphs have high list chromatic number
Discrete Mathematics | 2012-07-04 | Paper |
Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
Journal of Combinatorial Theory. Series A | 2012-06-04 | Paper |
Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
Journal of Combinatorial Theory. Series B | 2012-05-11 | Paper |
A non-linear lower bound for planar epsilon-nets
Discrete \& Computational Geometry | 2012-03-01 | Paper |
A biological solution to a fundamental distributed computing problem
Science | 2011-11-30 | Paper |
Solving MAX-\(r\)-SAT above a tight lower bound
Algorithmica | 2011-11-07 | Paper |
Beeping a maximal independent set
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Sparse balanced partitions and the complexity of subgraph problems
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Hypergraph list coloring and Euclidean Ramsey theory
Random Structures \& Algorithms | 2011-10-25 | Paper |
On graphs and algebraic graphs that do not contain cycles of length 4
Journal of Graph Theory | 2011-10-12 | Paper |
Testing perfection is hard
| 2011-10-12 | Paper |
Many Random Walks Are Faster Than One
Combinatorics, Probability and Computing | 2011-08-16 | Paper |
Increasing the chromatic number of a random graph
Journal of Combinatorics | 2011-06-27 | Paper |
The Brunn-Minkowski inequality and nontrivial cycles in the discrete torus
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Linear equations, arithmetic progressions and hypergraph property testing
Theory of Computing | 2011-05-24 | Paper |
Modular orientations of random and quasi-random regular graphs
Combinatorics, Probability and Computing | 2011-05-11 | Paper |
Strategyproof approximation of the minimax on networks
Mathematics of Operations Research | 2011-04-27 | Paper |
The structure of almost all graphs in a hereditary property
Journal of Combinatorial Theory. Series B | 2011-03-14 | Paper |
Universality, tolerance, chaos and order
| 2011-02-18 | Paper |
On a generalization of Meyniel's conjecture on the Cops and Robbers game
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
The number of \(F\)-matchings in almost every tree is a zero residue
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
SIAM Journal on Computing | 2011-01-17 | Paper |
High degree graphs contain large-star factors
| 2010-12-13 | Paper |
A note on regular Ramsey graphs
Journal of Graph Theory | 2010-11-10 | Paper |
Walking in circles
Discrete Mathematics | 2010-10-28 | Paper |
The number of sumsets in a finite field
Bulletin of the London Mathematical Society | 2010-10-20 | Paper |
Playing to retain the advantage
Combinatorics, Probability and Computing | 2010-10-14 | Paper |
On constant time approximation of parameters of bounded degree graphs
Property Testing | 2010-10-12 | Paper |
Testing Boolean function isomorphism
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
A note on competitive diffusion through social networks
Information Processing Letters | 2010-09-07 | Paper |
Choice-memory tradeoff in allocations
The Annals of Applied Probability | 2010-09-01 | Paper |
Quadratic forms on graphs (extended abstract)
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Testing triangle-freeness in general graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The online set cover problem
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Approximating the cut-norm via Grothendieck's inequality
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Uniformly cross intersecting families
Combinatorica | 2010-08-13 | Paper |
scientific article; zbMATH DE number 5764887 (Why is no real title available?)
| 2010-08-06 | Paper |
scientific article; zbMATH DE number 5764800 (Why is no real title available?)
| 2010-08-06 | Paper |
Random sampling and approximation of MAX-CSP problems
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Nonrepetitive colorings of graphs
| 2010-07-30 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science | 2010-05-26 | Paper |
The online set cover problem
SIAM Journal on Computing | 2010-04-29 | Paper |
Perturbed Identity Matrices Have High Rank: Proof and Applications
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Sizes of induced subgraphs of Ramsey graphs
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Economical elimination of cycles in the torus
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Another abstraction of the Erdős-Szekeres happy end theorem
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Can a graph have distinct regular partitions?
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Cleaning regular graphs with brushes
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
SIAM Journal on Computing | 2010-03-17 | Paper |
Spanning directed trees with many leaves
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
The inverse Banzhaf problem
Social Choice and Welfare | 2010-03-15 | Paper |
Poisson approximation for non-backtracking random walks
Israel Journal of Mathematics | 2010-01-26 | Paper |
Discrete Kakeya-type problems and small bases
Israel Journal of Mathematics | 2010-01-26 | Paper |
Balanced hashing, color coding and approximate counting
Parameterized and Exact Computation | 2010-01-14 | Paper |
Stability-type results for hereditary properties
Journal of Graph Theory | 2009-12-18 | Paper |
Large Nearly Regular Induced Subgraphs
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
Algorithmica | 2009-11-25 | Paper |
Hardness of edge-modification problems
Theoretical Computer Science | 2009-11-06 | Paper |
Deterministic Approximation Algorithms for the Nearest Codeword Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Tell me who I am: An interactive recommendation system
Theory of Computing Systems | 2009-10-19 | Paper |
ECONOMICAL TORIC SPINES VIA CHEEGER'S INEQUALITY
Journal of Topology and Analysis | 2009-09-29 | Paper |
Polychromatic colorings of plane graphs
Discrete \& Computational Geometry | 2009-08-27 | Paper |
Additive approximation for edge-deletion problems
Annals of Mathematics. Second Series | 2009-07-15 | Paper |
Fast FAST
Automata, Languages and Programming | 2009-07-14 | Paper |
Almost \(k\)-wise independence versus \(k\)-wise independence
Information Processing Letters | 2009-07-09 | Paper |
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science | 2009-06-22 | Paper |
Testing Triangle-Freeness in General Graphs
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Splitting necklaces and measurable colorings of the real line
Proceedings of the American Mathematical Society | 2009-05-05 | Paper |
Every Monotone Graph Property Is Testable
SIAM Journal on Computing | 2009-04-30 | Paper |
The maximum number of perfect matchings in graphs with a given degree sequence
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
A simple algorithm for edge-coloring bipartite multigraphs
Information Processing Letters | 2009-03-23 | Paper |
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Can a Graph Have Distinct Regular Partitions?
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Induced subgraphs with distinct sizes
Random Structures \& Algorithms | 2009-03-04 | Paper |
Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
Proceedings of the American Mathematical Society | 2009-02-25 | Paper |
CONFLICT-FREE COLORINGS OF SHALLOW DISCS
International Journal of Computational Geometry & Applications | 2009-02-24 | Paper |
Polychromatic colorings of plane graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5506190 (Why is no real title available?)
| 2009-02-10 | Paper |
An isoperimetric inequality in the universal cover of the punctured plane
Discrete Mathematics | 2009-01-28 | Paper |
scientific article; zbMATH DE number 5485485 (Why is no real title available?)
| 2009-01-05 | Paper |
Improved approximation for directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
SIAM Journal on Computing | 2008-12-22 | Paper |
Tracing Many Users With Almost No Rate Penalty
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Testing Reed–Muller Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The Shannon capacity of a graph and the independence numbers of its powers
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
An Elementary Construction of Constant-Degree Expanders
Combinatorics, Probability and Computing | 2008-12-11 | Paper |
Graphs with integral spectrum
Linear Algebra and its Applications | 2008-12-02 | Paper |
Small Sample Spaces Cannot Fool Low Degree Polynomials
Lecture Notes in Computer Science | 2008-11-27 | Paper |
The Grothendieck constant of random and pseudo-random graphs
Discrete Optimization | 2008-10-29 | Paper |
Embedding nearly-spanning bounded degree trees
Combinatorica | 2008-10-22 | Paper |
Privileged users in zero-error transmission over a noisy channel
Combinatorica | 2008-10-22 | Paper |
A separation theorem in property testing
Combinatorica | 2008-10-21 | Paper |
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Problems and results in extremal combinatorics. II
Discrete Mathematics | 2008-09-04 | Paper |
What is the furthest graph from a hereditary property?
Random Structures \& Algorithms | 2008-09-04 | Paper |
Optimal Monotone Encodings
Automata, Languages and Programming | 2008-08-28 | Paper |
The maximum edit distance from hereditary graph properties
Journal of Combinatorial Theory. Series B | 2008-07-24 | Paper |
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
SIAM Journal on Computing | 2008-06-19 | Paper |
The probabilistic method. With an appendix on the life and work of Paul Erdős.
| 2008-06-05 | Paper |
Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
NON-BACKTRACKING RANDOM WALKS MIX FASTER
Communications in Contemporary Mathematics | 2008-05-20 | Paper |
Better Algorithms and Bounds for Directed Maximum Leaf Problems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
k-Wise Independent Random Graphs
| 2008-04-08 | Paper |
Turán’s Theorem in the Hypercube
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
Breaking the rhythm on graphs
Discrete Mathematics | 2008-03-18 | Paper |
Codes and Xor graph products
Combinatorica | 2008-01-14 | Paper |
Sparse universal graphs for bounded‐degree graphs
Random Structures \& Algorithms | 2008-01-08 | Paper |
On (ε,k)‐min‐wise independent permutations
Random Structures \& Algorithms | 2008-01-08 | Paper |
On graphs with subgraphs having large independence numbers
Journal of Graph Theory | 2008-01-04 | Paper |
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Automata, Languages and Programming | 2007-11-28 | Paper |
Balanced Families of Perfect Hash Functions and Their Applications
Automata, Languages and Programming | 2007-11-28 | Paper |
Parameterized Algorithms for Directed Maximum Leaf Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
Measures of pseudorandomness for finite sequences: typical values
Proceedings of the London Mathematical Society | 2007-11-27 | Paper |
Large sets in finite fields are sumsets
Journal of Number Theory | 2007-09-14 | Paper |
Hardness of fully dense problems
Information and Computation | 2007-08-23 | Paper |
Edge Colouring with Delays
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213]
Information and Computation | 2007-07-16 | Paper |
Maximum directed cuts in acyclic digraphs
Journal of Graph Theory | 2007-06-11 | Paper |
Nonrepetitive colorings of graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On an extremal hypergraph problem of Brown, Erdős and Sós
Combinatorica | 2007-05-08 | Paper |
Homomorphisms in graph property testing
| 2007-03-05 | Paper |
Splitting digraphs
Combinatorics, Probability and Computing | 2007-02-07 | Paper |
A Ramsey-type result for the hypercube
Journal of Graph Theory | 2007-02-07 | Paper |
Regular graphs whose subgraphs tend to be acyclic
Random Structures \& Algorithms | 2007-02-07 | Paper |
Independent sets in tensor graph powers
Journal of Graph Theory | 2007-01-24 | Paper |
The number of oriantations having no fixed tournament
Combinatorica | 2007-01-02 | Paper |
Partitioning multi-dimensional sets in a small number of ``uniform parts
European Journal of Combinatorics | 2006-12-07 | Paper |
Feasible Schedules for Rotating Transmissions
Combinatorics, Probability and Computing | 2006-12-05 | Paper |
Tracing a single user
European Journal of Combinatorics | 2006-11-15 | Paper |
Explicit construction of linear sized tolerant networks. (Reprint)
Discrete Mathematics | 2006-08-04 | Paper |
Sharp bounds for some multicolour Ramsey numbers
Combinatorica | 2006-06-27 | Paper |
On a hypergraph matching problem
Graphs and Combinatorics | 2006-06-16 | Paper |
Approximating the Cut-Norm via Grothendieck's Inequality
SIAM Journal on Computing | 2006-06-01 | Paper |
Ranking Tournaments
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Dominating sets in \(k\)-majority tournaments.
Journal of Combinatorial Theory. Series B | 2006-05-18 | Paper |
\(H\)-free graphs of large minimum degree
The Electronic Journal of Combinatorics | 2006-03-22 | Paper |
Quadratic forms on graphs
Inventiones Mathematicae | 2006-03-21 | Paper |
Measures of Pseudorandomness for Finite Sequences: Minimal Values
Combinatorics, Probability and Computing | 2006-03-13 | Paper |
MaxCut in ${\bm H)$-Free Graphs
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
Discrepancy games
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Crossing patterns of semi-algebraic sets
Journal of Combinatorial Theory. Series A | 2005-09-28 | Paper |
Learning a Hidden Subgraph
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Smaller Explicit Superconcentrators
Internet Mathematics | 2005-04-11 | Paper |
THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
Journal of the London Mathematical Society | 2005-03-14 | Paper |
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
Combinatorics, Probability and Computing | 2005-03-08 | Paper |
Testing of Clustering
SIAM Review | 2005-02-25 | Paper |
Graph products, Fourier analysis and spectral techniques
Geometric and Functional Analysis. GAFA | 2005-02-24 | Paper |
Learning a Hidden Matching
SIAM Journal on Computing | 2005-02-21 | Paper |
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Combinatorics, Probability and Computing | 2005-02-18 | Paper |
Dense graphs are antimagic
Journal of Graph Theory | 2005-02-16 | Paper |
Linear hash functions
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 2119722 (Why is no real title available?)
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2119669 (Why is no real title available?)
| 2004-11-29 | Paper |
Testing subgraphs in directed graphs
Journal of Computer and System Sciences | 2004-11-18 | Paper |
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences | 2004-11-18 | Paper |
Tight estimates for eigenvalues of regular graphs
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
Algorithms with large domination ratio
Journal of Algorithms | 2004-10-04 | Paper |
scientific article; zbMATH DE number 2102778 (Why is no real title available?)
| 2004-09-24 | Paper |
Percolation on finite graphs and isoperimetric inequalities.
The Annals of Probability | 2004-09-15 | Paper |
scientific article; zbMATH DE number 2079357 (Why is no real title available?)
| 2004-07-28 | Paper |
A coding theory bound and zero-sum square matrices
Graphs and Combinatorics | 2004-03-04 | Paper |
Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
Random Structures \& Algorithms | 2004-02-03 | Paper |
Testing of Clustering
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Generalized hashing and parent-identifying codes.
Journal of Combinatorial Theory. Series A | 2004-01-06 | Paper |
Problems and results in extremal combinatorics. I.
Discrete Mathematics | 2004-01-05 | Paper |
ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS
Proceedings of the London Mathematical Society | 2003-11-17 | Paper |
scientific article; zbMATH DE number 1962903 (Why is no real title available?)
| 2003-10-26 | Paper |
Equilateral sets in \(l_p^n\)
Geometric and Functional Analysis. GAFA | 2003-09-01 | Paper |
Partitioning into graphs with only small components
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Induced subgraphs of prescribed size
Journal of Graph Theory | 2003-08-20 | Paper |
XML with data values: Typechecking revisited.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
Maximum cuts and judicious partitions in graphs without short cycles
Journal of Combinatorial Theory. Series B | 2003-08-17 | Paper |
Testing satisfiability
Journal of Algorithms | 2003-08-17 | Paper |
On the concentration of eigenvalues of random symmetric matrices
Israel Journal of Mathematics | 2003-06-30 | Paper |
Factor \(d\)-domatic colorings of graphs
Discrete Mathematics | 2003-04-28 | Paper |
Transversal numbers for hypergraphs arising in geometry
Advances in Applied Mathematics | 2003-03-26 | Paper |
Voting paradoxes and digraphs realizations
Advances in Applied Mathematics | 2003-03-26 | Paper |
Nonrepetitive colorings of graphs
Random Structures \& Algorithms | 2003-03-19 | Paper |
Testing subgraphs in large graphs
Random Structures \& Algorithms | 2003-03-19 | Paper |
On the discrepancy of combinatorial rectangles
Random Structures \& Algorithms | 2003-03-19 | Paper |
scientific article; zbMATH DE number 1787227 (Why is no real title available?)
| 2003-01-20 | Paper |
Scalable secure storage when half the system is faulty
Information and Computation | 2003-01-14 | Paper |
Covering a hypergraph of subgraphs
Discrete Mathematics | 2002-12-02 | Paper |
On partitions of discrete boxes
Discrete Mathematics | 2002-12-02 | Paper |
Game domination number
Discrete Mathematics | 2002-12-02 | Paper |
scientific article; zbMATH DE number 1833411 (Why is no real title available?)
| 2002-11-21 | Paper |
Acyclic edge colorings of graphs
Journal of Graph Theory | 2002-11-06 | Paper |
Tracking join and self-join sizes in limited storage
Journal of Computer and System Sciences | 2002-09-12 | Paper |
The Chromatic Number of Graph Powers
Combinatorics, Probability and Computing | 2002-08-25 | Paper |
Sparse universal graphs
Journal of Computational and Applied Mathematics | 2002-08-22 | Paper |
scientific article; zbMATH DE number 1643840 (Why is no real title available?)
| 2002-06-30 | Paper |
Constructive lower bounds for off-diagonal Ramsey numbers
Israel Journal of Mathematics | 2002-06-24 | Paper |
Large induced forests in sparse graphs
Journal of Graph Theory | 2002-06-03 | Paper |
Algorithmic aspects of acyclic edge colorings
Algorithmica | 2002-05-21 | Paper |
The Moore bound for irregular graphs
Graphs and Combinatorics | 2002-05-14 | Paper |
The probabilistic method. With an appendix on the life and work of Paul Erdős.
Wiley-Interscience Series in Discrete Mathematics and Optimization | 2002-04-23 | Paper |
Constructing worst case instances for semidefinite programming based approximation algorithms
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
Testing \(k\)-colorability
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
On the maximum number of Hamiltonian paths in tournaments
Random Structures \& Algorithms | 2002-03-29 | Paper |
Linear arboricity and linear \(k\)-arboricity of regular graphs
Graphs and Combinatorics | 2002-03-29 | Paper |
Parent-identifying codes
Journal of Combinatorial Theory. Series A | 2002-03-06 | Paper |
Ramsey-type theorems with forbidden subgraphs
Combinatorica | 2002-02-13 | Paper |
On the complexity of arrangements of circles in the plane
Discrete \& Computational Geometry | 2002-02-07 | Paper |
Constructing worst case instances for semidefinite programming based approximation algorithms
| 2002-01-30 | Paper |
String quartets in binary
Combinatorics, Probability and Computing | 2002-01-21 | Paper |
scientific article; zbMATH DE number 1256679 (Why is no real title available?)
| 2002-01-20 | Paper |
scientific article; zbMATH DE number 1256708 (Why is no real title available?)
| 2002-01-20 | Paper |
Refining the graph density condition for the existence of almost \(K\)-factors
Ars Combinatoria | 2001-12-17 | Paper |
scientific article; zbMATH DE number 1670854 (Why is no real title available?)
| 2001-12-09 | Paper |
Equireplicate balanced binary codes for oligo arrays
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
Locally thin set families
Combinatorics, Probability and Computing | 2001-11-09 | Paper |
Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
European Journal of Combinatorics | 2001-08-12 | Paper |
Recursive bounds for perfect hashing
Discrete Applied Mathematics | 2001-07-29 | Paper |
Unextendible product bases
Journal of Combinatorial Theory. Series A | 2001-07-29 | Paper |
Efficient testing of large graphs
Combinatorica | 2001-06-13 | Paper |
Long cycles in critical graphs
| 2001-05-10 | Paper |
scientific article; zbMATH DE number 1496580 (Why is no real title available?)
| 2001-04-09 | Paper |
Regular languages are testable with a constant number of queries
SIAM Journal on Computing | 2001-03-19 | Paper |
On a problem in shuffling
Journal of Combinatorial Theory. Series A | 2001-03-04 | Paper |
scientific article; zbMATH DE number 1559562 (Why is no real title available?)
| 2001-02-28 | Paper |
Packing Ferrers Shapes
Combinatorics, Probability and Computing | 2001-02-12 | Paper |
scientific article; zbMATH DE number 1550374 (Why is no real title available?)
| 2001-01-11 | Paper |
Decreasing the diameter of bounded degree graphs
| 2000-12-19 | Paper |
On the number of permutations avoiding a given pattern
Journal of Combinatorial Theory. Series A | 2000-11-19 | Paper |
Bipartite Subgraphs and the Smallest Eigenvalue
Combinatorics, Probability and Computing | 2000-10-08 | Paper |
Triangle-free graphs with large chromatic numbers
Discrete Mathematics | 2000-09-15 | Paper |
Coloring graphs with sparse neighborhoods
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
On Two Segmentation Problems
Journal of Algorithms | 2000-06-13 | Paper |
scientific article; zbMATH DE number 1456822 (Why is no real title available?)
| 2000-06-07 | Paper |
List coloring of random and pseudo-random graphs
Combinatorica | 2000-05-14 | Paper |
Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
European Journal of Combinatorics | 2000-05-04 | Paper |
scientific article; zbMATH DE number 1306883 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1418264 (Why is no real title available?)
| 2000-03-19 | Paper |
Additive Latin transversals.
Israel Journal of Mathematics | 2000-01-01 | Paper |
Norm-graphs: Variations and applications
Journal of Combinatorial Theory. Series B | 1999-12-20 | Paper |
scientific article; zbMATH DE number 1380608 (Why is no real title available?)
| 1999-12-19 | Paper |
Non-averaging subsets and non-vanishing transversals
Journal of Combinatorial Theory. Series A | 1999-12-12 | Paper |
Separable partitions
Discrete Applied Mathematics | 1999-11-02 | Paper |
scientific article; zbMATH DE number 1189239 (Why is no real title available?)
| 1999-10-25 | Paper |
scientific article; zbMATH DE number 1256715 (Why is no real title available?)
| 1999-10-04 | Paper |
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences | 1999-09-22 | Paper |
The Shannon capacity of a union
Combinatorica | 1999-09-14 | Paper |
Combinatorial Nullstellensatz
Combinatorics, Probability and Computing | 1999-09-10 | Paper |
Progressions in sequences of nearly consecutive integers
Journal of Combinatorial Theory. Series A | 1999-07-20 | Paper |
The choice number of random bipartite graphs
Annals of Combinatorics | 1999-06-28 | Paper |
scientific article; zbMATH DE number 1229732 (Why is no real title available?)
| 1999-06-21 | Paper |
scientific article; zbMATH DE number 1303602 (Why is no real title available?)
| 1999-06-17 | Paper |
Short odd cycles in 4-chromatic graphs
| 1999-06-10 | Paper |
Large sets of nearly orthogonal vectors
Graphs and Combinatorics | 1999-05-11 | Paper |
scientific article; zbMATH DE number 1256685 (Why is no real title available?)
| 1999-04-28 | Paper |
Homomorphisms of edge-colored graphs and Coxeter groups
Journal of Algebraic Combinatorics | 1999-04-23 | Paper |
scientific article; zbMATH DE number 1256670 (Why is no real title available?)
| 1999-04-22 | Paper |
The concentration of the chromatic number of random graphs
Combinatorica | 1999-03-14 | Paper |
scientific article; zbMATH DE number 1195809 (Why is no real title available?)
| 1999-03-09 | Paper |
An asymptotic isoperimetric inequality
Geometric and Functional Analysis. GAFA | 1999-03-02 | Paper |
Covering the edges of a graph by a prescribed tree with minimum overlap
Journal of Combinatorial Theory. Series B | 1999-02-01 | Paper |
Approximation schemes for scheduling on parallel machines
Journal of Scheduling | 1998-11-01 | Paper |
On-line and off-line approximation algorithms for vector covering problems
Algorithmica | 1998-10-01 | Paper |
On the capacity of digraphs
European Journal of Combinatorics | 1998-09-07 | Paper |
Packings with large minimum kissing numbers
Discrete Mathematics | 1998-09-07 | Paper |
Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
Journal of Combinatorial Theory. Series A | 1998-06-22 | Paper |
Constructive bounds for a Ramsey-type problem
Graphs and Combinatorics | 1998-06-22 | Paper |
\(T\)-choosability in graphs
Discrete Applied Mathematics | 1998-06-18 | Paper |
Piercing \(d\)-intervals
Discrete \& Computational Geometry | 1998-06-08 | Paper |
Approximating the independence number via the \(\vartheta\)-function
Mathematical Programming. Series A. Series B | 1998-04-22 | Paper |
Bipartite subgraphs of integer weighted graphs
Discrete Mathematics | 1998-04-01 | Paper |
Coins with Arbitrary Weights
Journal of Algorithms | 1998-03-12 | Paper |
Perfect matchings in \(\varepsilon\)-regular graphs
The Electronic Journal of Combinatorics | 1998-03-05 | Paper |
Subgraphs with a large cochromatic number
| 1998-03-02 | Paper |
scientific article; zbMATH DE number 1067836 (Why is no real title available?)
| 1998-03-02 | Paper |
A note on graph colorings and graph polynomials
Journal of Combinatorial Theory. Series B | 1998-02-22 | Paper |
Scale-sensitive dimensions, uniform convergence, and learnability
Journal of the ACM | 1998-02-17 | Paper |
On the Edge-Expansion of Graphs
Combinatorics, Probability and Computing | 1998-02-16 | Paper |
A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture
The Electronic Journal of Combinatorics | 1998-02-15 | Paper |
Short certificates for tournaments
The Electronic Journal of Combinatorics | 1998-02-12 | Paper |
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing | 1998-02-10 | Paper |
Color-coding
Journal of the ACM | 1998-01-28 | Paper |
On the exponent of all pairs shortest path problem
Journal of Computer and System Sciences | 1997-12-08 | Paper |
Choosability and fractional chromatic numbers
Discrete Mathematics | 1997-12-02 | Paper |
A linear time erasure-resilient code with nearly optimal recovery
IEEE Transactions on Information Theory | 1997-10-20 | Paper |
Intersecting Systems
Combinatorics, Probability and Computing | 1997-09-28 | Paper |
Nearly perfect matchings in regular simple hypergraphs
Israel Journal of Mathematics | 1997-09-17 | Paper |
scientific article; zbMATH DE number 1002208 (Why is no real title available?)
| 1997-09-07 | Paper |
Improved parallel approximation of a class of integer programming problems
Algorithmica | 1997-09-04 | Paper |
On the degree, size, and chromatic index of a uniform hypergraph
Journal of Combinatorial Theory. Series A | 1997-08-18 | Paper |
scientific article; zbMATH DE number 1047710 (Why is no real title available?)
| 1997-08-11 | Paper |
Source coding and graph entropies
IEEE Transactions on Information Theory | 1997-07-31 | Paper |
The polynomial method and restricted sums of congruence classes
Journal of Number Theory | 1997-05-11 | Paper |
Acyclic matchings
Advances in Mathematics | 1997-05-04 | Paper |
scientific article; zbMATH DE number 1003302 (Why is no real title available?)
| 1997-04-23 | Paper |
Bipartite subgraphs
Combinatorica | 1997-04-21 | Paper |
scientific article; zbMATH DE number 970791 (Why is no real title available?)
| 1997-03-11 | Paper |
Finding and counting given length cycles
Algorithmica | 1997-03-06 | Paper |
On acyclic colorings of graphs on surfaces
Israel Journal of Mathematics | 1997-03-06 | Paper |
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
Algorithmica | 1997-03-03 | Paper |
\(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials
Information Processing Letters | 1997-02-28 | Paper |
Matching nuts and bolts faster
Information Processing Letters | 1997-02-27 | Paper |
Onk-saturated graphs with restrictions on the degrees
| 1997-02-26 | Paper |
\(H\)-factors in dense graphs
Journal of Combinatorial Theory. Series B | 1997-01-12 | Paper |
Disjoint directed cycles
Journal of Combinatorial Theory. Series B | 1996-12-08 | Paper |
scientific article; zbMATH DE number 881158 (Why is no real title available?)
| 1996-12-03 | Paper |
Independence numbers of locally sparse graphs and a Ramsey type problem
| 1996-11-26 | Paper |
scientific article; zbMATH DE number 863501 (Why is no real title available?)
| 1996-10-21 | Paper |
On Short Edges in Straight-Edge Triangulations.
MATHEMATICA SCANDINAVICA | 1996-08-27 | Paper |
2-factors in dense graphs
Discrete Mathematics | 1996-07-07 | Paper |
scientific article; zbMATH DE number 837049 (Why is no real title available?)
| 1996-06-27 | Paper |
Adding Distinct Congruence Classes Modulo a Prime
The American Mathematical Monthly | 1996-05-29 | Paper |
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
Random Structures \& Algorithms | 1996-05-28 | Paper |
On a problem of Erdös and Turán and some related results
Journal of Number Theory | 1996-03-31 | Paper |
Repeated communication and Ramsey graphs
IEEE Transactions on Information Theory | 1996-02-12 | Paper |
The 123 theorem and its extensions
Journal of Combinatorial Theory. Series A | 1996-02-01 | Paper |
Sure monochromatic subset sums
Acta Arithmetica | 1996-01-09 | Paper |
A lattice point problem and additive number theory
Combinatorica | 1995-11-21 | Paper |
Tough Ramsey graphs without short cycles
Journal of Algebraic Combinatorics | 1995-11-16 | Paper |
scientific article; zbMATH DE number 736285 (Why is no real title available?)
| 1995-09-11 | Paper |
scientific article; zbMATH DE number 795107 (Why is no real title available?)
| 1995-09-11 | Paper |
scientific article; zbMATH DE number 718861 (Why is no real title available?)
| 1995-07-19 | Paper |
Derandomized graph products
Computational Complexity | 1995-07-16 | Paper |
Covering with Latin transversals
Discrete Applied Mathematics | 1995-07-11 | Paper |
Bounding the piercing number
Discrete \& Computational Geometry | 1995-07-05 | Paper |
A Graph-Theoretic Game and Its Application to the k-Server Problem
SIAM Journal on Computing | 1995-07-03 | Paper |
Routing Permutations on Graphs via Matchings
SIAM Journal on Discrete Mathematics | 1995-05-14 | Paper |
The acyclic orientation game on random graphs
Random Structures \& Algorithms | 1995-05-01 | Paper |
scientific article; zbMATH DE number 742987 (Why is no real title available?)
| 1995-04-11 | Paper |
Explicit Ramsey graphs and orthonormal labelings
The Electronic Journal of Combinatorics | 1995-04-06 | Paper |
scientific article; zbMATH DE number 741010 (Why is no real title available?)
| 1995-04-05 | Paper |
A lower bound on the expected length of one-to-one codes
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
Parallel linear programming in fixed dimension almost surely in constant time
Journal of the ACM | 1995-03-01 | Paper |
Disjoint systems
Random Structures \& Algorithms | 1995-02-09 | Paper |
Can visibility graphs be represented compactly?
Discrete \& Computational Geometry | 1994-11-27 | Paper |
Perfect Hashing and Probability
Combinatorics, Probability and Computing | 1994-11-20 | Paper |
Efficient simulation of finite automata by neural nets
Journal of the ACM | 1994-11-13 | Paper |
Planar Separators
SIAM Journal on Discrete Mathematics | 1994-10-10 | Paper |
Packing of partial designs
Graphs and Combinatorics | 1994-10-10 | Paper |
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
Theoretical Computer Science | 1994-08-29 | Paper |
Threshold Functions for H-factors
Combinatorics, Probability and Computing | 1994-08-28 | Paper |
Choice Numbers of Graphs: a Probabilistic Approach
Combinatorics, Probability and Computing | 1994-08-10 | Paper |
Subdivided graphs have linear ramsey numbers
Journal of Graph Theory | 1994-07-04 | Paper |
scientific article; zbMATH DE number 446487 (Why is no real title available?)
| 1994-06-28 | Paper |
The Algorithmic Aspects of the Regularity Lemma
Journal of Algorithms | 1994-06-05 | Paper |
Point Selections and Weak ε-Nets for Convex Hulls
Combinatorics, Probability and Computing | 1994-05-30 | Paper |
scientific article; zbMATH DE number 475373 (Why is no real title available?)
| 1994-05-19 | Paper |
Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
SIAM Journal on Discrete Mathematics | 1994-05-12 | Paper |
Probabilistic methods in coloring and decomposition problems
Discrete Mathematics | 1994-05-05 | Paper |
Random Cayley graphs and expanders
Random Structures \& Algorithms | 1994-04-27 | Paper |
Superconcentrators of depths 2 and 3; odd levels help (rarely)
Journal of Computer and System Sciences | 1994-04-27 | Paper |
scientific article; zbMATH DE number 524118 (Why is no real title available?)
| 1994-03-24 | Paper |
On three zero‐sum Ramsey‐type problems
Journal of Graph Theory | 1994-03-13 | Paper |
Linear extensions of a random partial order
The Annals of Applied Probability | 1994-01-01 | Paper |
scientific article; zbMATH DE number 426321 (Why is no real title available?)
| 1993-11-01 | Paper |
Bisection of trees and sequences
Discrete Mathematics | 1993-10-24 | Paper |
On-line Steiner trees in the Euclidean plane
Discrete \& Computational Geometry | 1993-09-30 | Paper |
Coin-Flipping Games Immune against Linear-Sized Coalitions
SIAM Journal on Computing | 1993-05-17 | Paper |
Covering the cube by affine hyperplanes
European Journal of Combinatorics | 1993-05-16 | Paper |
Addendum to “simple constructions of almost k-wise independent random variables”
Random Structures \& Algorithms | 1993-05-16 | Paper |
Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
Advances in Mathematics | 1993-04-01 | Paper |
Star arboricity
Combinatorica | 1993-03-10 | Paper |
Almost \(H\)-factors in dense graphs
Graphs and Combinatorics | 1993-01-16 | Paper |
Colorings and orientations of graphs
Combinatorica | 1993-01-16 | Paper |
Transmitting in the \(n\)-dimensional cube
Discrete Applied Mathematics | 1993-01-16 | Paper |
Partitioning a rectangle into small perimeter rectangles
Discrete Mathematics | 1993-01-16 | Paper |
Piercing convex sets
Bulletin of the American Mathematical Society | 1993-01-16 | Paper |
Simple Constructions of Almost k-wise Independent Random Variables
Random Structures \& Algorithms | 1992-10-18 | Paper |
Uniform dilations
Geometric and Functional Analysis. GAFA | 1992-09-27 | Paper |
Economical coverings of sets of lattice points
Geometric and Functional Analysis. GAFA | 1992-09-27 | Paper |
scientific article; zbMATH DE number 65694 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 66612 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 53883 (Why is no real title available?)
| 1992-09-18 | Paper |
Spanning subgraphs of random graphs
Graphs and Combinatorics | 1992-08-03 | Paper |
Generalized sum graphs
Graphs and Combinatorics | 1992-08-03 | Paper |
On the second eigenvalue of a graph
Discrete Mathematics | 1992-06-28 | Paper |
Independent sets in regular graphs and sum-free subsets of finite groups
Israel Journal of Mathematics | 1992-06-28 | Paper |
A note on Euclidean Ramsey theory and a construction of Bourgain
Acta Mathematica Hungarica | 1992-06-28 | Paper |
Multicolored forests in bipartite decompositions of graphs
Journal of Combinatorial Theory. Series B | 1992-06-28 | Paper |
The strong chromatic number of a graph
Random Structures \& Algorithms | 1992-06-28 | Paper |
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Single round simulation on radio networks
Journal of Algorithms | 1992-06-28 | Paper |
Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
Journal of Combinatorial Theory. Series A | 1992-06-27 | Paper |
A parallel algorithmic version of the local lemma
Random Structures \& Algorithms | 1992-06-27 | Paper |
scientific article; zbMATH DE number 16108 (Why is no real title available?)
| 1992-06-26 | Paper |
The number of spanning trees in regular graphs
Random Structures \& Algorithms | 1992-06-25 | Paper |
Transversal numbers of uniform hypergraphs
Graphs and Combinatorics | 1992-06-25 | Paper |
A Separator Theorem for Nonplanar Graphs
| 1992-06-25 | Paper |
Acyclic coloring of graphs
Random Structures \& Algorithms | 1992-06-25 | Paper |
Additive bases of vector spaces over prime fields
Journal of Combinatorial Theory. Series A | 1992-06-25 | Paper |
A lower bound for radio broadcast
Journal of Computer and System Sciences | 1992-06-25 | Paper |
scientific article; zbMATH DE number 15490 (Why is no real title available?)
| 1992-06-25 | Paper |
Ramsey graphs cannot be defined by real polynomials
Journal of Graph Theory | 1992-06-25 | Paper |
Set systems with no union of cardinality 0 modulo \(m\)
Graphs and Combinatorics | 1992-06-25 | Paper |
The CW-inequalities for vectors in \(\ell_ 1\)
European Journal of Combinatorics | 1992-06-25 | Paper |
Not all graphs are segment \(T\)-graphs
European Journal of Combinatorics | 1992-06-25 | Paper |
scientific article; zbMATH DE number 15489 (Why is no real title available?)
| 1992-06-25 | Paper |
Parallel comparison algorithms for approximation problems
Combinatorica | 1991-01-01 | Paper |
Ramsey graphs contain many distinct induced subgraphs
Graphs and Combinatorics | 1991-01-01 | Paper |
Linear Circuits over $\operatorname{GF}(2)$
SIAM Journal on Computing | 1990-01-01 | Paper |
The maximum number of Hamiltonian paths in tournaments
Combinatorica | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4183487 (Why is no real title available?)
| 1990-01-01 | Paper |
Generating pseudo-random permutations and maximum flow algorithms
Information Processing Letters | 1990-01-01 | Paper |
Universal sequences for complete graphs
Discrete Applied Mathematics | 1990-01-01 | Paper |
Finding an Approximate Maximum
SIAM Journal on Computing | 1989-01-01 | Paper |
The star arboricity of graphs
Discrete Mathematics | 1989-01-01 | Paper |
A nowhere-zero point in linear mappings
Combinatorica | 1989-01-01 | Paper |
The maximum size of a convex polygon in a restricted set of points in the plane
Discrete \& Computational Geometry | 1989-01-01 | Paper |
Graphs with a small number of distinct induced subgraphs
Discrete Mathematics | 1989-01-01 | Paper |
Legitimate colorings of projective planes
Graphs and Combinatorics | 1989-01-01 | Paper |
Ascending waves
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
Cycles of length 0 modulo k in directed graphs
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
On Nečiporuk's theorem for branching programs
Theoretical Computer Science | 1989-01-01 | Paper |
An Application of Set Theory to Coding Theory
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4108812 (Why is no real title available?)
| 1989-01-01 | Paper |
An algorithm for the detection and construction of Monge sequences
Linear Algebra and its Applications | 1989-01-01 | Paper |
Reflection Sequences
The American Mathematical Monthly | 1989-01-01 | Paper |
A counterexample to the rank-coloring conjecture
Journal of Graph Theory | 1989-01-01 | Paper |
Disjoint edges in geometric graphs
Discrete \& Computational Geometry | 1989-01-01 | Paper |
Sub-Ramsey numbers of arithmetic progressions
Graphs and Combinatorics | 1989-01-01 | Paper |
Cutting disjoint disks by straight lines
Discrete \& Computational Geometry | 1989-01-01 | Paper |
Combinatorial reconstruction problems
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
Degrees of freedom versus dimension for containment orders
Order | 1988-01-01 | Paper |
Explicit construction of linear sized tolerant networks
Discrete Mathematics | 1988-01-01 | Paper |
Sums of subsequences modulo prime powers
Discrete Mathematics | 1988-01-01 | Paper |
Meanders and their applications in lower bounds arguments
Journal of Computer and System Sciences | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4112642 (Why is no real title available?)
| 1988-01-01 | Paper |
The average size of an independent set in graphs with a given chromatic number
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
The linear arboricity of graphs
Israel Journal of Mathematics | 1988-01-01 | Paper |
Every 8-uniform 8-regular hypergraph is 2-colorable
Graphs and Combinatorics | 1988-01-01 | Paper |
Sorting, Approximate Sorting, and Searching in Rounds
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
SIAM Journal on Computing | 1988-01-01 | Paper |
Balancing sets of vectors
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Large induced degenerate subgraphs
Graphs and Combinatorics | 1987-01-01 | Paper |
The monotone circuit complexity of Boolean functions
Combinatorica | 1987-01-01 | Paper |
Splitting necklaces
Advances in Mathematics | 1987-01-01 | Paper |
On the kernel of intersecting families
Graphs and Combinatorics | 1987-01-01 | Paper |
Monochromatic directed walks in arc-colored directed graphs
Acta Mathematica Hungarica | 1987-01-01 | Paper |
Regressions and monotone chains. II: the poset of integer intervals
Order | 1987-01-01 | Paper |
The smallest n-uniform hypergraph with positive discrepancy
Combinatorica | 1987-01-01 | Paper |
Better expanders and superconcentrators
Journal of Algorithms | 1987-01-01 | Paper |
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
Journal of Graph Theory | 1987-01-01 | Paper |
Subset sums
Journal of Number Theory | 1987-01-01 | Paper |
Eigenvalues and expanders
Combinatorica | 1986-01-01 | Paper |
The number of polytopes, configurations and real matroids
Mathematika | 1986-01-01 | Paper |
The Chromatic Number of Kneser Hypergraphs
| 1986-01-01 | Paper |
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms | 1986-01-01 | Paper |
Covering graphs by the minimum number of equivalence relations
Combinatorica | 1986-01-01 | Paper |
On the number of certain subgraphs contained in graphs with a given number of edges
Israel Journal of Mathematics | 1986-01-01 | Paper |
Extremal problems concerning transformations of the set of edges of the complete graph
European Journal of Combinatorics | 1986-01-01 | Paper |
The number of small semispaces of a finite set of points in the plane
Journal of Combinatorial Theory. Series A | 1986-01-01 | Paper |
On the intersection of edges of a geometric graph by straight lines
Discrete Mathematics | 1986-01-01 | Paper |
Covering a square by small perimeter rectangles
Discrete \& Computational Geometry | 1986-01-01 | Paper |
Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
Combinatorica | 1986-01-01 | Paper |
Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
Journal of Combinatorial Theory. Series A | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3931029 (Why is no real title available?)
| 1986-01-01 | Paper |
Explicit construction of exponential sized families of k-independent sets
Discrete Mathematics | 1986-01-01 | Paper |
The longest cycle of a graph with a large minimal degree
Journal of Graph Theory | 1986-01-01 | Paper |
Decomposition of the complete r-graph into complete r-partite r-graphs
Graphs and Combinatorics | 1986-01-01 | Paper |
The Borsuk-Ulam Theorem and Bisection of Necklaces
| 1986-01-01 | Paper |
\(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
Covering Multigraphs by Simple Circuits
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Asynchronous threshold networks
Graphs and Combinatorics | 1985-01-01 | Paper |
Even edge colorings of a graph
Journal of Combinatorial Theory. Series B | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3926257 (Why is no real title available?)
| 1985-01-01 | Paper |
A simple proof of the upper bound theorem
European Journal of Combinatorics | 1985-01-01 | Paper |
Separating pairs of points of standard boxes
European Journal of Combinatorics | 1985-01-01 | Paper |
An extremal problem for sets with applications to graph theory
Journal of Combinatorial Theory. Series A | 1985-01-01 | Paper |
Hypergraphs with high chromatic number
Graphs and Combinatorics | 1985-01-01 | Paper |
The maximum number of disjoint pairs in a family of subsets
Graphs and Combinatorics | 1985-01-01 | Paper |
An application of graph theory to additive number theory
European Journal of Combinatorics | 1985-01-01 | Paper |
Regular subgraphs of almost regular graphs
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
A note on subdigraphs of digraphs with large outdegrees
Discrete Mathematics | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3933115 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3902677 (Why is no real title available?)
| 1984-01-01 | Paper |
Every 4-regular graph plus an edge contains a 3-regular subgraph
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
Journal of Graph Theory | 1983-01-01 | Paper |
On the density of sets of vectors
Discrete Mathematics | 1983-01-01 | Paper |
A note on the decomposition of graphs into isomorphic matchings
Acta Mathematica Hungarica | 1983-01-01 | Paper |
Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces
Israel Journal of Mathematics | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3790445 (Why is no real title available?)
| 1982-01-01 | Paper |
On the number of subgraphs of prescribed type of graphs with a given number of edges
Israel Journal of Mathematics | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3762107 (Why is no real title available?)
| 1981-01-01 | Paper |
The $\epsilon$-$t$-Net Problem
| N/A | Paper |
Identifying the Deviator
| N/A | Paper |
Universality for graphs with bounded density
| N/A | Paper |
Partitioning the hypercube into smaller hypercubes
| N/A | Paper |
Erasure codes and Tur\'an hypercube problems
| N/A | Paper |
Sumsets in the Hypercube
| N/A | Paper |
