| Publication | Date of Publication | Type |
|---|
| The power of many colours | 2024-12-12 | Paper |
| Diagonalization Games | 2024-12-12 | Paper |
| Erasure list-decodable codes and Turán hypercube problems | 2024-11-01 | Paper |
| Implicit representation of sparse hereditary families | 2024-10-25 | Paper |
| Connectivity graph-codes | 2024-10-24 | Paper |
| Identifying the deviator | 2024-10-16 | Paper |
| Cats in cubes | 2024-10-07 | Paper |
| Eli Goodman (1933--2021) and Ricky Pollack (1935--2018) | 2024-09-26 | Paper |
| On sums and products along the edges, II | 2024-09-11 | Paper |
| On a random model of forgetting | 2024-08-21 | Paper |
| Logarithmically larger deletion codes of all distances | 2024-07-21 | Paper |
| Erratum to: ``Multitasking capacity: hardness results and improved constructions | 2024-07-16 | Paper |
| Strong blocking sets and minimal codes from expander graphs | 2024-07-12 | Paper |
| Boosting simple learners | 2024-07-03 | Paper |
| Hitting a Prime in 2.43 Dice Rolls (On Average) | 2024-06-27 | Paper |
| Graph-codes | 2024-02-05 | Paper |
| Invertibility of Digraphs and Tournaments | 2024-01-23 | Paper |
| Turán graphs with bounded matching number | 2024-01-15 | Paper |
| Fair Partitions | 2024-01-05 | Paper |
| The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs | 2023-11-29 | Paper |
| Boosting simple learners | 2023-11-14 | Paper |
| Adversarial laws of large numbers and optimal regret in online classification | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059949 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084349 | 2023-10-31 | Paper |
| Spanning trees with few non-leaves | 2023-10-23 | Paper |
| Near-sunflowers and focal families | 2023-10-23 | Paper |
| Complete minors and average degree: A short proof | 2023-10-12 | Paper |
| Divisible subdivisions | 2023-10-04 | Paper |
| New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) | 2023-10-02 | Paper |
| List Ramsey numbers | 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 | 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 | 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 | 2023-05-08 | Paper |
| Private and Online Learnability Are Equivalent | 2023-04-27 | Paper |
| Irregular subgraphs | 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 | 2023-03-31 | Paper |
| Structured Codes of Graphs | 2023-03-30 | Paper |
| Counting dope matrices | 2023-02-21 | Paper |
| Unit and distinct distances in typical norms | 2023-02-17 | Paper |
| On sums of monotone random integer variables | 2023-01-23 | Paper |
| Friends and strangers walking on graphs | 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 | 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 | 2022-08-25 | Paper |
| Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles | 2022-07-21 | Paper |
| The runsort permuton | 2022-06-13 | Paper |
| Counting Dope Matrices | 2022-05-18 | Paper |
| High-girth near-Ramanujan graphs with localized eigenvectors | 2022-04-25 | Paper |
| Additive approximation of generalized Turán questions | 2022-03-25 | Paper |
| On a random model of forgetting | 2022-03-04 | Paper |
| On the hat guessing number of graphs | 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 | 2021-12-18 | Paper |
| Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs | 2021-11-03 | Paper |
| Explicit expanders of every degree and size | 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 | 2021-06-15 | Paper |
| Mixing properties of colourings of the ℤd lattice | 2021-06-15 | Paper |
| Large cliques and independent sets all over the place | 2021-06-10 | Paper |
| Dominance Solvability in Random Games | 2021-05-22 | Paper |
| Inverse problems for minimal complements and maximal supplements | 2021-03-29 | Paper |
| Hitting all maximum independent sets | 2021-03-10 | Paper |
| Limitations on regularity lemmas for clustering graphs | 2021-02-02 | Paper |
| Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs | 2020-12-18 | Paper |
| Distributed Corruption Detection in Networks | 2020-12-17 | Paper |
| Ronald Louis Graham (1935 ‐ 2020) | 2020-11-30 | Paper |
| Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits | 2020-10-02 | Paper |
| Problems and results in Extremal Combinatorics -- IV | 2020-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121899 | 2020-09-22 | Paper |
| A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families | 2020-08-12 | Paper |
| On sums and products along the edges, II | 2020-07-25 | Paper |
| Lovász, Vectors, Graphs and Codes | 2020-07-08 | Paper |
| The hat guessing number of graphs | 2020-07-07 | Paper |
| Efficient Splitting of Measures and Necklaces | 2020-06-30 | Paper |
| Efficient removal lemmas for matrices | 2020-05-26 | Paper |
| Out‐colourings of digraphs | 2020-05-21 | Paper |
| Isoperimetry, stability, and irredundance in direct products | 2020-05-21 | Paper |
| On the product dimension of clique factors | 2020-04-09 | Paper |
| Multitasking Capacity: Hardness Results and Improved Constructions | 2020-03-26 | Paper |
| The minrank of random graphs over arbitrary fields | 2020-03-04 | Paper |
| Sums, products, and ratios along the edges of a graph | 2020-02-25 | Paper |
| Private PAC learning implies finite Littlestone dimension | 2020-01-30 | Paper |
| Efficient arithmetic regularity and removal lemmas for induced bipartite patterns | 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 | 2019-11-28 | Paper |
| Reliable communication over highly connected noisy networks | 2019-11-27 | Paper |
| On Generalized Regularity | 2019-11-05 | Paper |
| Gregory Gutin and graph optimization problems | 2019-07-25 | Paper |
| On the compatibility of quartet trees | 2019-06-20 | Paper |
| Broadcast Throughput in Radio Networks: Routing vs. Network Coding | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743464 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633843 | 2019-05-06 | Paper |
| Induced Universal Hypergraphs | 2019-04-24 | Paper |
| List-Decodable Zero-Rate Codes | 2019-03-28 | Paper |
| \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups | 2019-02-20 | Paper |
| List Ramsey numbers | 2019-02-19 | Paper |
| Optimal induced universal graphs for bounded-degree graphs | 2019-01-31 | Paper |
| Permutations resilient to deletions | 2019-01-24 | Paper |
| Many cliques in \(H\)-free subgraphs of random graphs | 2018-12-10 | Paper |
| Additive Approximation of Generalized Tur\'an Questions | 2018-11-21 | Paper |
| Ordinal embeddings of minimum relaxation | 2018-11-05 | Paper |
| Guessing secrets efficiently via list decoding | 2018-11-05 | Paper |
| Separation dimension and sparsity | 2018-10-31 | Paper |
| Clique coloring of dense random graphs | 2018-08-16 | Paper |
| Uniformly Discrete Forests with Poor Visibility | 2018-07-24 | Paper |
| On the maximum quartet distance between phylogenetic trees | 2018-07-16 | Paper |
| Optimal induced universal graphs for bounded-degree graphs | 2018-07-16 | Paper |
| Ramsey-nice families of graphs | 2018-06-28 | Paper |
| Duplication Distance to the Root for Binary Sequences | 2018-06-27 | Paper |
| Testing Equality in Communication Graphs | 2018-06-27 | Paper |
| Sign rank versus Vapnik-Chervonenkis dimension | 2018-04-06 | Paper |
| Fair Representation by Independent Sets | 2018-02-26 | Paper |
| Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles | 2017-12-21 | Paper |
| Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback | 2017-12-08 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 2017-12-05 | Paper |
| Broadcast Transmission to Prioritizing Receivers | 2017-11-13 | Paper |
| Easily Testable Graph Properties | 2017-10-04 | Paper |
| On Active and Passive Testing | 2017-10-04 | Paper |
| Reliable Communication over Highly Connected Noisy Networks | 2017-09-29 | Paper |
| Optimal Monotone Encodings | 2017-08-08 | Paper |
| Typical peak sidelobe level of binary sequences | 2017-07-27 | Paper |
| Typechecking XML views of relational databases | 2017-06-13 | Paper |
| Counting contours on trees | 2017-05-22 | Paper |
| Linear Boolean Classification, Coding and the Critical Problem | 2017-04-28 | Paper |
| Asymptotically optimal induced universal graphs | 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 | 2017-03-06 | Paper |
| More on the Bipartite Decomposition of Random Graphs | 2017-02-01 | Paper |
| Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes | 2016-11-17 | Paper |
| Many \(T\) copies in \(H\)-free graphs | 2016-10-14 | Paper |
| Many \(T\) copies in \(H\)-free graphs | 2016-10-12 | Paper |
| Optimal compression of approximate inner products and dimension reduction | 2016-10-02 | Paper |
| Coloring, sparseness and girth | 2016-09-15 | Paper |
| A spectral technique for coloring random 3-colorable graphs (preliminary version) | 2016-09-01 | Paper |
| Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract) | 2016-09-01 | Paper |
| High girth augmented trees are huge | 2016-08-18 | Paper |
| Reflections on Paul Erdős on his birth centenary. II | 2016-06-15 | Paper |
| Problems and results in extremal combinatorics. III. | 2016-05-25 | Paper |
| On the maximum quartet distance between phylogenetic trees | 2016-04-15 | Paper |
| The probabilistic method | 2016-04-07 | Paper |
| On rigid matrices and \(U\)-polynomials | 2016-01-06 | Paper |
| Size and degree anti-Ramsey numbers | 2015-12-17 | Paper |
| Local and global colorability of graphs | 2015-12-08 | Paper |
| Separation Dimension of Bounded Degree Graphs | 2015-11-27 | Paper |
| Weak ε-nets and interval chains | 2015-11-11 | Paper |
| Approximating sparse binary matrices in the cut-norm | 2015-09-28 | Paper |
| Algorithmic construction of sets for k -restrictions | 2015-09-02 | Paper |
| A general approach to online network optimization problems | 2015-09-02 | Paper |
| Economical Graph Discovery | 2015-08-28 | Paper |
| Comparable pairs in families of sets | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501827 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501357 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501312 | 2015-08-03 | Paper |
| Bipartite decomposition of random graphs | 2015-06-10 | Paper |
| Local correction with constant error rate | 2015-05-26 | Paper |
| Routing permutations on graphs via matchings | 2015-05-07 | Paper |
| Sign rank versus VC dimension | 2015-03-26 | Paper |
| Bayesian ignorance | 2015-03-02 | Paper |
| Practically stabilizing SWMR atomic memory in message-passing systems | 2015-02-20 | Paper |
| Chasing a Fast Robber on Planar Graphs and Random Graphs | 2015-01-21 | Paper |
| The Asymmetric Matrix Partition Problem | 2015-01-12 | Paper |
| Drawing outerplanar graphs using three edge lengths | 2014-12-23 | Paper |
| Correction: Basic Network Creation Games | 2014-12-22 | Paper |
| On the Compatibility of Quartet Trees | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934626 | 2014-12-18 | Paper |
| A combinatorial characterization of the testable graph properties | 2014-11-25 | Paper |
| Admission control to minimize rejections and online set cover with repetitions | 2014-11-18 | Paper |
| Balanced families of perfect hash functions and their applications | 2014-11-18 | Paper |
| Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics | 2014-10-13 | Paper |
| Linear equations, arithmetic progressions and hypergraph property testing | 2014-10-13 | Paper |
| The Turán number of sparse spanning graphs | 2014-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191585 | 2014-10-06 | Paper |
| A note on general sliding window processes | 2014-09-29 | Paper |
| Maximizing the Number of Nonnegative Subsets | 2014-09-26 | Paper |
| Chasing robbers on random geometric graphs-an alternative approach | 2014-09-12 | Paper |
| The approximate rank of a matrix and its algorithmic applications | 2014-08-07 | Paper |
| Additive patterns in multiplicative subgroups | 2014-08-01 | Paper |
| The chromatic number of random Cayley graphs | 2014-07-29 | Paper |
| Choice-Memory Tradeoff in Allocations | 2014-07-25 | Paper |
| Counting sum-free sets in abelian groups | 2014-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419950 | 2014-06-11 | Paper |
| Two notions of unit distance graphs | 2014-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417644 | 2014-05-22 | Paper |
| Paul Erdős and Probabilistic Reasoning | 2014-05-19 | Paper |
| Nearly complete graphs decomposable into large induced matchings and their applications | 2014-05-13 | Paper |
| Beeping a maximal independent set | 2014-03-25 | Paper |
| A refinement of the Cameron-Erdős conjecture | 2014-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395722 | 2014-02-17 | Paper |
| How to Put through Your Agenda in Collective Binary Decisions | 2013-12-17 | Paper |
| Restricted integer partition functions | 2013-10-25 | Paper |
| Playing to retain the advantage | 2013-10-10 | Paper |
| Basic network creation games | 2013-09-26 | Paper |
| Nearly complete graphs decomposable into large induced matchings and their applications | 2013-09-02 | Paper |
| Nearly tight bounds for testing function isomorphism | 2013-07-24 | Paper |
| On sunflowers and matrix multiplication | 2013-07-19 | Paper |
| Minimizing the Number of Carries in Addition | 2013-06-27 | Paper |
| Adversarial Leakage in Games | 2013-06-27 | Paper |
| Tight bounds for shared memory systems accessed by Byzantine processes | 2013-06-07 | Paper |
| A Note on Degenerate and Spectrally Degenerate Graphs | 2013-03-07 | Paper |
| The de Bruijn-Erdős theorem for hypergraphs | 2012-11-28 | Paper |
| Sums and products along sparse graphs | 2012-11-13 | Paper |
| Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions | 2012-11-02 | Paper |
| Bayesian ignorance | 2012-10-11 | Paper |
| Multicolored matchings in hypergraphs | 2012-09-05 | Paper |
| Local correction of juntas | 2012-07-18 | Paper |
| Local rainbow colorings | 2012-07-16 | Paper |
| Dense uniform hypergraphs have high list chromatic number | 2012-07-04 | Paper |
| Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels | 2012-06-04 | Paper |
| Nonnegative \(k\)-sums, fractional covers, and probability of small deviations | 2012-05-11 | Paper |
| A non-linear lower bound for planar epsilon-nets | 2012-03-01 | Paper |
| A Biological Solution to a Fundamental Distributed Computing Problem | 2011-11-30 | Paper |
| Solving MAX-\(r\)-SAT above a tight lower bound | 2011-11-07 | Paper |
| Beeping a maximal independent set | 2011-10-28 | Paper |
| Sparse Balanced Partitions and the Complexity of Subgraph Problems | 2011-10-27 | Paper |
| Hypergraph list coloring and Euclidean Ramsey theory | 2011-10-25 | Paper |
| On graphs and algebraic graphs that do not contain cycles of length 4 | 2011-10-12 | Paper |
| Testing perfection is hard | 2011-10-12 | Paper |
| Many Random Walks Are Faster Than One | 2011-08-16 | Paper |
| Increasing the chromatic number of a random graph | 2011-06-27 | Paper |
| The Brunn–Minkowski Inequality and Nontrivial Cycles in the Discrete Torus | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002762 | 2011-05-24 | Paper |
| Modular Orientations of Random and Quasi-Random Regular Graphs | 2011-05-11 | Paper |
| Strategyproof Approximation of the Minimax on Networks | 2011-04-27 | Paper |
| The structure of almost all graphs in a hereditary property | 2011-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3078200 | 2011-02-18 | Paper |
| On a generalization of Meyniel's conjecture on the Cops and Robbers game | 2011-02-17 | Paper |
| The number of \(F\)-matchings in almost every tree is a zero residue | 2011-02-17 | Paper |
| Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions | 2011-01-17 | Paper |
| High degree graphs contain large-star factors | 2010-12-13 | Paper |
| A note on regular Ramsey graphs | 2010-11-10 | Paper |
| Walking in circles | 2010-10-28 | Paper |
| The number of sumsets in a finite field | 2010-10-20 | Paper |
| Playing to Retain the Advantage | 2010-10-14 | Paper |
| On Constant Time Approximation of Parameters of Bounded Degree Graphs | 2010-10-12 | Paper |
| Testing Boolean Function Isomorphism | 2010-09-10 | Paper |
| A note on competitive diffusion through social networks | 2010-09-07 | Paper |
| Choice-memory tradeoff in allocations | 2010-09-01 | Paper |
| Quadratic forms on graphs | 2010-08-16 | Paper |
| Every monotone graph property is testable | 2010-08-16 | Paper |
| Testing triangle-freeness in general graphs | 2010-08-16 | Paper |
| The online set cover problem | 2010-08-16 | Paper |
| Testing subgraphs in directed graphs | 2010-08-16 | Paper |
| Approximating the cut-norm via Grothendieck's inequality | 2010-08-15 | Paper |
| Uniformly cross intersecting families | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579480 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579389 | 2010-08-06 | Paper |
| Random sampling and approximation of MAX-CSP problems | 2010-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576675 | 2010-07-30 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| The Online Set Cover Problem | 2010-04-29 | Paper |
| Perturbed Identity Matrices Have High Rank: Proof and Applications | 2010-04-23 | Paper |
| Sizes of Induced Subgraphs of Ramsey Graphs | 2010-04-22 | Paper |
| Economical Elimination of Cycles in the Torus | 2010-04-22 | Paper |
| Another abstraction of the Erdős-Szekeres happy end theorem | 2010-03-26 | Paper |
| Can a Graph Have Distinct Regular Partitions? | 2010-03-17 | Paper |
| Cleaning Regular Graphs with Brushes | 2010-03-17 | Paper |
| A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity | 2010-03-17 | Paper |
| Spanning Directed Trees with Many Leaves | 2010-03-17 | Paper |
| The inverse Banzhaf problem | 2010-03-15 | Paper |
| Discrete Kakeya-type problems and small bases | 2010-01-26 | Paper |
| Poisson approximation for non-backtracking random walks | 2010-01-26 | Paper |
| Balanced hashing, color coding and approximate counting | 2010-01-14 | Paper |
| Stability-type results for hereditary properties | 2009-12-18 | Paper |
| Large Nearly Regular Induced Subgraphs | 2009-11-27 | Paper |
| Linear time algorithms for finding a dominating set of fixed size in degenerated graphs | 2009-11-25 | Paper |
| Hardness of edge-modification problems | 2009-11-06 | Paper |
| Deterministic Approximation Algorithms for the Nearest Codeword Problem | 2009-10-28 | Paper |
| Tell me who I am: An interactive recommendation system | 2009-10-19 | Paper |
| ECONOMICAL TORIC SPINES VIA CHEEGER'S INEQUALITY | 2009-09-29 | Paper |
| Polychromatic colorings of plane graphs | 2009-08-27 | Paper |
| Additive approximation for edge-deletion problems | 2009-07-15 | Paper |
| Fast FAST | 2009-07-14 | Paper |
| Almost \(k\)-wise independence versus \(k\)-wise independence | 2009-07-09 | Paper |
| Approximating the maximum clique minor and some subgraph homeomorphism problems | 2009-06-22 | Paper |
| Testing Triangle-Freeness in General Graphs | 2009-05-27 | Paper |
| Splitting necklaces and measurable colorings of the real line | 2009-05-05 | Paper |
| Every Monotone Graph Property Is Testable | 2009-04-30 | Paper |
| The maximum number of perfect matchings in graphs with a given degree sequence | 2009-04-07 | Paper |
| A simple algorithm for edge-coloring bipartite multigraphs | 2009-03-23 | Paper |
| Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs | 2009-03-06 | Paper |
| Can a Graph Have Distinct Regular Partitions? | 2009-03-06 | Paper |
| Induced subgraphs with distinct sizes | 2009-03-04 | Paper |
| Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property | 2009-02-25 | Paper |
| CONFLICT-FREE COLORINGS OF SHALLOW DISCS | 2009-02-24 | Paper |
| Polychromatic colorings of plane graphs | 2009-02-12 | Paper |
| The complexity of the outer face in arrangements of random segments | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601520 | 2009-02-10 | Paper |
| An isoperimetric inequality in the universal cover of the punctured plane | 2009-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549649 | 2009-01-05 | Paper |
| Improved approximation for directed cut problems | 2009-01-05 | Paper |
| A Characterization of the (Natural) Graph Properties Testable with One-Sided Error | 2008-12-22 | Paper |
| Tracing Many Users With Almost No Rate Penalty | 2008-12-21 | Paper |
| The Shannon capacity of a graph and the independence numbers of its powers | 2008-12-21 | Paper |
| Testing Reed–Muller Codes | 2008-12-21 | Paper |
| An Elementary Construction of Constant-Degree Expanders | 2008-12-11 | Paper |
| Graphs with integral spectrum | 2008-12-02 | Paper |
| Small Sample Spaces Cannot Fool Low Degree Polynomials | 2008-11-27 | Paper |
| The Grothendieck constant of random and pseudo-random graphs | 2008-10-29 | Paper |
| Embedding nearly-spanning bounded degree trees | 2008-10-22 | Paper |
| Privileged users in zero-error transmission over a noisy channel | 2008-10-22 | Paper |
| A separation theorem in property testing | 2008-10-21 | Paper |
| Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover | 2008-09-25 | Paper |
| Problems and results in extremal combinatorics. II | 2008-09-04 | Paper |
| What is the furthest graph from a hereditary property? | 2008-09-04 | Paper |
| Optimal Monotone Encodings | 2008-08-28 | Paper |
| The maximum edit distance from hereditary graph properties | 2008-07-24 | Paper |
| Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs | 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 | 2008-05-22 | Paper |
| NON-BACKTRACKING RANDOM WALKS MIX FASTER | 2008-05-20 | Paper |
| Better Algorithms and Bounds for Directed Maximum Leaf Problems | 2008-04-24 | Paper |
| k-Wise Independent Random Graphs | 2008-04-08 | Paper |
| Turán’s Theorem in the Hypercube | 2008-03-28 | Paper |
| Breaking the rhythm on graphs | 2008-03-18 | Paper |
| Codes and Xor graph products | 2008-01-14 | Paper |
| Sparse universal graphs for bounded‐degree graphs | 2008-01-08 | Paper |
| On (ε,k)‐min‐wise independent permutations | 2008-01-08 | Paper |
| On graphs with subgraphs having large independence numbers | 2008-01-04 | Paper |
| Parameterized Algorithms for Directed Maximum Leaf Problems | 2007-11-28 | Paper |
| Balanced Families of Perfect Hash Functions and Their Applications | 2007-11-28 | Paper |
| Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions | 2007-11-28 | Paper |
| Measures of pseudorandomness for finite sequences: typical values | 2007-11-27 | Paper |
| Large sets in finite fields are sumsets | 2007-09-14 | Paper |
| Hardness of fully dense problems | 2007-08-23 | Paper |
| Edge Colouring with Delays | 2007-07-30 | Paper |
| Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213] | 2007-07-16 | Paper |
| Maximum directed cuts in acyclic digraphs | 2007-06-11 | Paper |
| Nonrepetitive colorings of graphs | 2007-05-29 | Paper |
| On an extremal hypergraph problem of Brown, Erdős and Sós | 2007-05-08 | Paper |
| Homomorphisms in graph property testing | 2007-03-05 | Paper |
| Splitting digraphs | 2007-02-07 | Paper |
| A Ramsey-type result for the hypercube | 2007-02-07 | Paper |
| Regular graphs whose subgraphs tend to be acyclic | 2007-02-07 | Paper |
| Independent sets in tensor graph powers | 2007-01-24 | Paper |
| The number of oriantations having no fixed tournament | 2007-01-02 | Paper |
| Partitioning multi-dimensional sets in a small number of ``uniform parts | 2006-12-07 | Paper |
| Feasible Schedules for Rotating Transmissions | 2006-12-05 | Paper |
| Tracing a single user | 2006-11-15 | Paper |
| Explicit construction of linear sized tolerant networks. (Reprint) | 2006-08-04 | Paper |
| Sharp bounds for some multicolour Ramsey numbers | 2006-06-27 | Paper |
| On a hypergraph matching problem | 2006-06-16 | Paper |
| Approximating the Cut-Norm via Grothendieck's Inequality | 2006-06-01 | Paper |
| Ranking Tournaments | 2006-06-01 | Paper |
| Dominating sets in \(k\)-majority tournaments. | 2006-05-18 | Paper |
| \(H\)-free graphs of large minimum degree | 2006-03-22 | Paper |
| Quadratic forms on graphs | 2006-03-21 | Paper |
| Measures of Pseudorandomness for Finite Sequences: Minimal Values | 2006-03-13 | Paper |
| MaxCut in ${\bm H)$-Free Graphs | 2005-11-14 | Paper |
| Discrepancy games | 2005-11-01 | Paper |
| Crossing patterns of semi-algebraic sets | 2005-09-28 | Paper |
| Learning a Hidden Subgraph | 2005-09-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Smaller Explicit Superconcentrators | 2005-04-11 | Paper |
| THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES | 2005-03-14 | Paper |
| Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions | 2005-03-08 | Paper |
| Testing of Clustering | 2005-02-25 | Paper |
| Graph products, Fourier analysis and spectral techniques | 2005-02-24 | Paper |
| Learning a Hidden Matching | 2005-02-21 | Paper |
| New Bounds on Parent-Identifying Codes: The Case of Multiple Parents | 2005-02-18 | Paper |
| Dense graphs are antimagic | 2005-02-16 | Paper |
| Linear hash functions | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828996 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828940 | 2004-11-29 | Paper |
| Testing subgraphs in directed graphs | 2004-11-18 | Paper |
| Random sampling and approximation of MAX-CSPs | 2004-11-18 | Paper |
| Tight estimates for eigenvalues of regular graphs | 2004-10-13 | Paper |
| Algorithms with large domination ratio | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818866 | 2004-09-24 | Paper |
| Percolation on finite graphs and isoperimetric inequalities. | 2004-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471316 | 2004-07-28 | Paper |
| A coding theory bound and zero-sum square matrices | 2004-03-04 | Paper |
| Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints | 2004-02-03 | Paper |
| Testing of Clustering | 2004-01-08 | Paper |
| Generalized hashing and parent-identifying codes. | 2004-01-06 | Paper |
| Problems and results in extremal combinatorics. I. | 2004-01-05 | Paper |
| ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS | 2003-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418777 | 2003-10-26 | Paper |
| Equilateral sets in \(l_p^n\) | 2003-09-01 | Paper |
| Partitioning into graphs with only small components | 2003-08-25 | Paper |
| Induced subgraphs of prescribed size | 2003-08-20 | Paper |
| XML with data values: Typechecking revisited. | 2003-08-19 | Paper |
| Maximum cuts and judicious partitions in graphs without short cycles | 2003-08-17 | Paper |
| Testing satisfiability | 2003-08-17 | Paper |
| On the concentration of eigenvalues of random symmetric matrices | 2003-06-30 | Paper |
| Factor \(d\)-domatic colorings of graphs | 2003-04-28 | Paper |
| Transversal numbers for hypergraphs arising in geometry | 2003-03-26 | Paper |
| Voting paradoxes and digraphs realizations | 2003-03-26 | Paper |
| Nonrepetitive colorings of graphs | 2003-03-19 | Paper |
| Testing subgraphs in large graphs | 2003-03-19 | Paper |
| On the discrepancy of combinatorial rectangles | 2003-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550231 | 2003-01-20 | Paper |
| Scalable secure storage when half the system is faulty | 2003-01-14 | Paper |
| Covering a hypergraph of subgraphs | 2002-12-02 | Paper |
| On partitions of discrete boxes | 2002-12-02 | Paper |
| Game domination number | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780792 | 2002-11-21 | Paper |
| Acyclic edge colorings of graphs | 2002-11-06 | Paper |
| Tracking join and self-join sizes in limited storage | 2002-09-12 | Paper |
| The Chromatic Number of Graph Powers | 2002-08-25 | Paper |
| Sparse universal graphs | 2002-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2739345 | 2002-06-30 | Paper |
| Constructive lower bounds for off-diagonal Ramsey numbers | 2002-06-24 | Paper |
| Large induced forests in sparse graphs | 2002-06-03 | Paper |
| Algorithmic aspects of acyclic edge colorings | 2002-05-21 | Paper |
| The Moore bound for irregular graphs | 2002-05-14 | Paper |
| The probabilistic method. With an appendix on the life and work of Paul Erdős. | 2002-04-23 | Paper |
| Testing \(k\)-colorability | 2002-04-23 | Paper |
| Constructing worst case instances for semidefinite programming based approximation algorithms | 2002-04-23 | Paper |
| Linear arboricity and linear \(k\)-arboricity of regular graphs | 2002-03-29 | Paper |
| On the maximum number of Hamiltonian paths in tournaments | 2002-03-29 | Paper |
| Parent-identifying codes | 2002-03-06 | Paper |
| Ramsey-type theorems with forbidden subgraphs | 2002-02-13 | Paper |
| On the complexity of arrangements of circles in the plane | 2002-02-07 | Paper |
| Constructing worst case instances for semidefinite programming based approximation algorithms | 2002-01-30 | Paper |
| String quartets in binary | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230366 | 2002-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228444 | 2002-01-20 | Paper |
| Refining the graph density condition for the existence of almost \(K\)-factors | 2001-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754178 | 2001-12-09 | Paper |
| Equireplicate balanced binary codes for oligo arrays | 2001-11-11 | Paper |
| Locally thin set families | 2001-11-09 | Paper |
| Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative | 2001-08-12 | Paper |
| Unextendible product bases | 2001-07-29 | Paper |
| Recursive bounds for perfect hashing | 2001-07-29 | Paper |
| Efficient testing of large graphs | 2001-06-13 | Paper |
| Long cycles in critical graphs | 2001-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500691 | 2001-04-09 | Paper |
| Regular languages are testable with a constant number of queries | 2001-03-19 | Paper |
| On a problem in shuffling | 2001-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527014 | 2001-02-28 | Paper |
| Packing Ferrers Shapes | 2001-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4523493 | 2001-01-11 | Paper |
| Decreasing the diameter of bounded degree graphs | 2000-12-19 | Paper |
| On the number of permutations avoiding a given pattern | 2000-11-19 | Paper |
| Bipartite Subgraphs and the Smallest Eigenvalue | 2000-10-08 | Paper |
| Triangle-free graphs with large chromatic numbers | 2000-09-15 | Paper |
| Coloring graphs with sparse neighborhoods | 2000-06-25 | Paper |
| On Two Segmentation Problems | 2000-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954420 | 2000-06-07 | Paper |
| List coloring of random and pseudo-random graphs | 2000-05-14 | Paper |
| Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252735 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941824 | 2000-03-19 | Paper |
| Additive Latin transversals. | 2000-01-01 | Paper |
| Norm-graphs: Variations and applications | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705344 | 1999-12-19 | Paper |
| Non-averaging subsets and non-vanishing transversals | 1999-12-12 | Paper |
| Separable partitions | 1999-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839004 | 1999-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228450 | 1999-10-04 | Paper |
| The space complexity of approximating the frequency moments | 1999-09-22 | Paper |
| The Shannon capacity of a union | 1999-09-14 | Paper |
| Combinatorial Nullstellensatz | 1999-09-10 | Paper |
| Progressions in sequences of nearly consecutive integers | 1999-07-20 | Paper |
| The choice number of random bipartite graphs | 1999-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222171 | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250228 | 1999-06-17 | Paper |
| Short odd cycles in 4-chromatic graphs | 1999-06-10 | Paper |
| Large sets of nearly orthogonal vectors | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230372 | 1999-04-28 | Paper |
| Homomorphisms of edge-colored graphs and Coxeter groups | 1999-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230357 | 1999-04-22 | Paper |
| The concentration of the chromatic number of random graphs | 1999-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4208482 | 1999-03-09 | Paper |
| An asymptotic isoperimetric inequality | 1999-03-02 | Paper |
| Covering the edges of a graph by a prescribed tree with minimum overlap | 1999-02-01 | Paper |
| Approximation schemes for scheduling on parallel machines | 1998-11-01 | Paper |
| On-line and off-line approximation algorithms for vector covering problems | 1998-10-01 | Paper |
| Packings with large minimum kissing numbers | 1998-09-07 | Paper |
| On the capacity of digraphs | 1998-09-07 | Paper |
| Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs | 1998-06-22 | Paper |
| Constructive bounds for a Ramsey-type problem | 1998-06-22 | Paper |
| \(T\)-choosability in graphs | 1998-06-18 | Paper |
| Piercing \(d\)-intervals | 1998-06-08 | Paper |
| Approximating the independence number via the \(\vartheta\)-function | 1998-04-22 | Paper |
| Bipartite subgraphs of integer weighted graphs | 1998-04-01 | Paper |
| Coins with Arbitrary Weights | 1998-03-12 | Paper |
| Perfect matchings in \(\varepsilon\)-regular graphs | 1998-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358434 | 1998-03-02 | Paper |
| Subgraphs with a large cochromatic number | 1998-03-02 | Paper |
| A note on graph colorings and graph polynomials | 1998-02-22 | Paper |
| Scale-sensitive dimensions, uniform convergence, and learnability | 1998-02-17 | Paper |
| On the Edge-Expansion of Graphs | 1998-02-16 | Paper |
| A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture | 1998-02-15 | Paper |
| Short certificates for tournaments | 1998-02-12 | Paper |
| A Spectral Technique for Coloring Random 3-Colorable Graphs | 1998-02-10 | Paper |
| Color-coding | 1998-01-28 | Paper |
| On the exponent of all pairs shortest path problem | 1997-12-08 | Paper |
| Choosability and fractional chromatic numbers | 1997-12-02 | Paper |
| A linear time erasure-resilient code with nearly optimal recovery | 1997-10-20 | Paper |
| Intersecting Systems | 1997-09-28 | Paper |
| Nearly perfect matchings in regular simple hypergraphs | 1997-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129926 | 1997-09-07 | Paper |
| Improved parallel approximation of a class of integer programming problems | 1997-09-04 | Paper |
| On the degree, size, and chromatic index of a uniform hypergraph | 1997-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347877 | 1997-08-11 | Paper |
| Source coding and graph entropies | 1997-07-31 | Paper |
| The polynomial method and restricted sums of congruence classes | 1997-05-11 | Paper |
| Acyclic matchings | 1997-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128932 | 1997-04-23 | Paper |
| Bipartite subgraphs | 1997-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688995 | 1997-03-11 | Paper |
| Finding and counting given length cycles | 1997-03-06 | Paper |
| On acyclic colorings of graphs on surfaces | 1997-03-06 | Paper |
| Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions | 1997-03-03 | Paper |
| \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials | 1997-02-28 | Paper |
| Matching nuts and bolts faster | 1997-02-27 | Paper |
| Onk-saturated graphs with restrictions on the degrees | 1997-02-26 | Paper |
| \(H\)-factors in dense graphs | 1997-01-12 | Paper |
| Disjoint directed cycles | 1996-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878282 | 1996-12-03 | Paper |
| Independence numbers of locally sparse graphs and a Ramsey type problem | 1996-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871780 | 1996-10-21 | Paper |
| On Short Edges in Straight-Edge Triangulations. | 1996-08-27 | Paper |
| 2-factors in dense graphs | 1996-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862104 | 1996-06-27 | Paper |
| Adding Distinct Congruence Classes Modulo a Prime | 1996-05-29 | Paper |
| Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case | 1996-05-28 | Paper |
| On a problem of Erdös and Turán and some related results | 1996-03-31 | Paper |
| Repeated communication and Ramsey graphs | 1996-02-12 | Paper |
| The 123 theorem and its extensions | 1996-02-01 | Paper |
| Sure monochromatic subset sums | 1996-01-09 | Paper |
| A lattice point problem and additive number theory | 1995-11-21 | Paper |
| Tough Ramsey graphs without short cycles | 1995-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845256 | 1995-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326629 | 1995-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320818 | 1995-07-19 | Paper |
| Derandomized graph products | 1995-07-16 | Paper |
| Covering with Latin transversals | 1995-07-11 | Paper |
| Bounding the piercing number | 1995-07-05 | Paper |
| A Graph-Theoretic Game and Its Application to the k-Server Problem | 1995-07-03 | Paper |
| Routing Permutations on Graphs via Matchings | 1995-05-14 | Paper |
| The acyclic orientation game on random graphs | 1995-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763426 | 1995-04-11 | Paper |
| Explicit Ramsey graphs and orthonormal labelings | 1995-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327375 | 1995-04-05 | Paper |
| Parallel linear programming in fixed dimension almost surely in constant time | 1995-03-01 | Paper |
| A lower bound on the expected length of one-to-one codes | 1995-03-01 | Paper |
| Disjoint systems | 1995-02-09 | Paper |
| Can visibility graphs be represented compactly? | 1994-11-27 | Paper |
| Perfect Hashing and Probability | 1994-11-20 | Paper |
| Efficient simulation of finite automata by neural nets | 1994-11-13 | Paper |
| Planar Separators | 1994-10-10 | Paper |
| Packing of partial designs | 1994-10-10 | Paper |
| Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling | 1994-08-29 | Paper |
| Threshold Functions for H-factors | 1994-08-28 | Paper |
| Choice Numbers of Graphs: a Probabilistic Approach | 1994-08-10 | Paper |
| Subdivided graphs have linear ramsey numbers | 1994-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142409 | 1994-06-28 | Paper |
| The Algorithmic Aspects of the Regularity Lemma | 1994-06-05 | Paper |
| Point Selections and Weak ε-Nets for Convex Hulls | 1994-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273619 | 1994-05-19 | Paper |
| Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition | 1994-05-12 | Paper |
| Probabilistic methods in coloring and decomposition problems | 1994-05-05 | Paper |
| Random Cayley graphs and expanders | 1994-04-27 | Paper |
| Superconcentrators of depths 2 and 3; odd levels help (rarely) | 1994-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284607 | 1994-03-24 | Paper |
| On three zero‐sum Ramsey‐type problems | 1994-03-13 | Paper |
| Linear extensions of a random partial order | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137169 | 1993-11-01 | Paper |
| Bisection of trees and sequences | 1993-10-24 | Paper |
| On-line Steiner trees in the Euclidean plane | 1993-09-30 | Paper |
| Coin-Flipping Games Immune against Linear-Sized Coalitions | 1993-05-17 | Paper |
| Covering the cube by affine hyperplanes | 1993-05-16 | Paper |
| Addendum to “simple constructions of almost k-wise independent random variables” | 1993-05-16 | Paper |
| Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem | 1993-04-01 | Paper |
| Star arboricity | 1993-03-10 | Paper |
| Almost \(H\)-factors in dense graphs | 1993-01-16 | Paper |
| Colorings and orientations of graphs | 1993-01-16 | Paper |
| Transmitting in the \(n\)-dimensional cube | 1993-01-16 | Paper |
| Partitioning a rectangle into small perimeter rectangles | 1993-01-16 | Paper |
| Piercing convex sets | 1993-01-16 | Paper |
| Simple Constructions of Almost k-wise Independent Random Variables | 1992-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010305 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011245 | 1992-09-27 | Paper |
| Economical coverings of sets of lattice points | 1992-09-27 | Paper |
| Uniform dilations | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4004078 | 1992-09-18 | Paper |
| Spanning subgraphs of random graphs | 1992-08-03 | Paper |
| Generalized sum graphs | 1992-08-03 | Paper |
| On the second eigenvalue of a graph | 1992-06-28 | Paper |
| Independent sets in regular graphs and sum-free subsets of finite groups | 1992-06-28 | Paper |
| The strong chromatic number of a graph | 1992-06-28 | Paper |
| Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs | 1992-06-28 | Paper |
| Single round simulation on radio networks | 1992-06-28 | Paper |
| A note on Euclidean Ramsey theory and a construction of Bourgain | 1992-06-28 | Paper |
| Multicolored forests in bipartite decompositions of graphs | 1992-06-28 | Paper |
| Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems | 1992-06-27 | Paper |
| A parallel algorithmic version of the local lemma | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972756 | 1992-06-26 | Paper |
| The number of spanning trees in regular graphs | 1992-06-25 | Paper |
| Transversal numbers of uniform hypergraphs | 1992-06-25 | Paper |
| A Separator Theorem for Nonplanar Graphs | 1992-06-25 | Paper |
| Acyclic coloring of graphs | 1992-06-25 | Paper |
| Additive bases of vector spaces over prime fields | 1992-06-25 | Paper |
| A lower bound for radio broadcast | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972124 | 1992-06-25 | Paper |
| The CW-inequalities for vectors in \(\ell_ 1\) | 1992-06-25 | Paper |
| Not all graphs are segment \(T\)-graphs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972125 | 1992-06-25 | Paper |
| Ramsey graphs cannot be defined by real polynomials | 1992-06-25 | Paper |
| Set systems with no union of cardinality 0 modulo \(m\) | 1992-06-25 | Paper |
| Parallel comparison algorithms for approximation problems | 1991-01-01 | Paper |
| Ramsey graphs contain many distinct induced subgraphs | 1991-01-01 | Paper |
| Linear Circuits over $\operatorname{GF}(2)$ | 1990-01-01 | Paper |
| The maximum number of Hamiltonian paths in tournaments | 1990-01-01 | Paper |
| Universal sequences for complete graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5749346 | 1990-01-01 | Paper |
| Generating pseudo-random permutations and maximum flow algorithms | 1990-01-01 | Paper |
| Finding an Approximate Maximum | 1989-01-01 | Paper |
| The star arboricity of graphs | 1989-01-01 | Paper |
| A nowhere-zero point in linear mappings | 1989-01-01 | Paper |
| The maximum size of a convex polygon in a restricted set of points in the plane | 1989-01-01 | Paper |
| Disjoint edges in geometric graphs | 1989-01-01 | Paper |
| Sub-Ramsey numbers of arithmetic progressions | 1989-01-01 | Paper |
| Cutting disjoint disks by straight lines | 1989-01-01 | Paper |
| Combinatorial reconstruction problems | 1989-01-01 | Paper |
| An algorithm for the detection and construction of Monge sequences | 1989-01-01 | Paper |
| Reflection Sequences | 1989-01-01 | Paper |
| A counterexample to the rank-coloring conjecture | 1989-01-01 | Paper |
| An Application of Set Theory to Coding Theory | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832604 | 1989-01-01 | Paper |
| Graphs with a small number of distinct induced subgraphs | 1989-01-01 | Paper |
| Legitimate colorings of projective planes | 1989-01-01 | Paper |
| Ascending waves | 1989-01-01 | Paper |
| Cycles of length 0 modulo k in directed graphs | 1989-01-01 | Paper |
| On Nečiporuk's theorem for branching programs | 1989-01-01 | Paper |
| Degrees of freedom versus dimension for containment orders | 1988-01-01 | Paper |
| Explicit construction of linear sized tolerant networks | 1988-01-01 | Paper |
| The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms | 1988-01-01 | Paper |
| Balancing sets of vectors | 1988-01-01 | Paper |
| The linear arboricity of graphs | 1988-01-01 | Paper |
| Every 8-uniform 8-regular hypergraph is 2-colorable | 1988-01-01 | Paper |
| Sorting, Approximate Sorting, and Searching in Rounds | 1988-01-01 | Paper |
| Sums of subsequences modulo prime powers | 1988-01-01 | Paper |
| Meanders and their applications in lower bounds arguments | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835493 | 1988-01-01 | Paper |
| The average size of an independent set in graphs with a given chromatic number | 1988-01-01 | Paper |
| Large induced degenerate subgraphs | 1987-01-01 | Paper |
| The monotone circuit complexity of Boolean functions | 1987-01-01 | Paper |
| Splitting necklaces | 1987-01-01 | Paper |
| Subset sums | 1987-01-01 | Paper |
| Better expanders and superconcentrators | 1987-01-01 | Paper |
| Subgraphs of large connectivity and chromatic number in graphs of large chromatic number | 1987-01-01 | Paper |
| On the kernel of intersecting families | 1987-01-01 | Paper |
| Monochromatic directed walks in arc-colored directed graphs | 1987-01-01 | Paper |
| Regressions and monotone chains. II: the poset of integer intervals | 1987-01-01 | Paper |
| The smallest n-uniform hypergraph with positive discrepancy | 1987-01-01 | Paper |
| Eigenvalues and expanders | 1986-01-01 | Paper |
| The number of polytopes, configurations and real matroids | 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 | 1986-01-01 | Paper |
| Covering graphs by the minimum number of equivalence relations | 1986-01-01 | Paper |
| On the number of certain subgraphs contained in graphs with a given number of edges | 1986-01-01 | Paper |
| Extremal problems concerning transformations of the set of edges of the complete graph | 1986-01-01 | Paper |
| Explicit construction of exponential sized families of k-independent sets | 1986-01-01 | Paper |
| The longest cycle of a graph with a large minimal degree | 1986-01-01 | Paper |
| Decomposition of the complete r-graph into complete r-partite r-graphs | 1986-01-01 | Paper |
| The Borsuk-Ulam Theorem and Bisection of Necklaces | 1986-01-01 | Paper |
| Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory | 1986-01-01 | Paper |
| Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3705467 | 1986-01-01 | Paper |
| The number of small semispaces of a finite set of points in the plane | 1986-01-01 | Paper |
| On the intersection of edges of a geometric graph by straight lines | 1986-01-01 | Paper |
| Covering a square by small perimeter rectangles | 1986-01-01 | Paper |
| \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators | 1985-01-01 | Paper |
| Covering Multigraphs by Simple Circuits | 1985-01-01 | Paper |
| The maximum number of disjoint pairs in a family of subsets | 1985-01-01 | Paper |
| An application of graph theory to additive number theory | 1985-01-01 | Paper |
| A simple proof of the upper bound theorem | 1985-01-01 | Paper |
| Separating pairs of points of standard boxes | 1985-01-01 | Paper |
| An extremal problem for sets with applications to graph theory | 1985-01-01 | Paper |
| Hypergraphs with high chromatic number | 1985-01-01 | Paper |
| Asynchronous threshold networks | 1985-01-01 | Paper |
| Even edge colorings of a graph | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700850 | 1985-01-01 | Paper |
| Regular subgraphs of almost regular graphs | 1984-01-01 | Paper |
| Every 4-regular graph plus an edge contains a 3-regular subgraph | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3708047 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680852 | 1984-01-01 | Paper |
| A note on subdigraphs of digraphs with large outdegrees | 1984-01-01 | Paper |
| On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems | 1983-01-01 | Paper |
| On the density of sets of vectors | 1983-01-01 | Paper |
| A note on the decomposition of graphs into isomorphic matchings | 1983-01-01 | Paper |
| Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3967547 | 1982-01-01 | Paper |
| On the number of subgraphs of prescribed type of graphs with a given number of edges | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3944640 | 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 |
