2023
The mod k $k$ chromatic index of random graphs.
J. Graph Theory, August, 2023
Guest Editorial: Special Issue on Theoretical Informatics.
Algorithmica, August, 2023
The anti-Ramsey threshold of complete graphs.
Discret. Math., May, 2023
The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$.
J. Graph Theory, 2023
Resilience for loose Hamilton cycles.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
A canonical Ramsey theorem with list constraints in random graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2022
Factors in randomly perturbed hypergraphs.
Random Struct. Algorithms, 2022
2021
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees.
SIAM J. Discret. Math., 2021
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties.
SIAM J. Discret. Math., 2021
Orientation Ramsey Thresholds for Cycles and Cliques.
SIAM J. Discret. Math., 2021
Finding any given 2-factor in sparse pseudorandom graphs efficiently.
J. Graph Theory, 2021
On strong Sidon sets of integers.
J. Comb. Theory, Ser. A, 2021
A tight lower bound for the online bounded space hypercube bin packing problem.
Discret. Math. Theor. Comput. Sci., 2021
Hitting times for arc-disjoint arborescences in random digraph processes.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
Constrained colourings of random graphs.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
2020
Counting restricted orientations of random graphs.
Random Struct. Algorithms, July, 2020
The multicolour size-Ramsey number of powers of paths.
J. Comb. Theory, Ser. B, 2020
Estimating parameters associated with monotone properties.
Comb. Probab. Comput., 2020
A perspective on theoretical computer science in Latin America.
Commun. ACM, 2020
2019
The size Ramsey number of short subdivisions of bounded degree graphs.
Random Struct. Algorithms, 2019
Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Struct. Algorithms, 2019
Powers of tight Hamilton cycles in randomly perturbed hypergraphs.
Random Struct. Algorithms, 2019
The size?Ramsey number of powers of paths.
J. Graph Theory, 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Clique-factors in sparse pseudorandom graphs.
Eur. J. Comb., 2019
Extremal and probabilistic results for order types.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
2018
Infinite Sidon Sets Contained in Sparse Random Sets of Integers.
SIAM J. Discret. Math., 2018
On an anti-Ramsey threshold for sparse graphs with one triangle.
J. Graph Theory, 2018
Near-perfect clique-factors in sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2018
On hypergraphs without loose cycles.
Discret. Math., 2018
A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
Property Testing for Point Sets on the Plane.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
2017
Chromatic thresholds in sparse random graphs.
Random Struct. Algorithms, 2017
Chromatic thresholds in dense random graphs.
Random Struct. Algorithms, 2017
On the number of r-transitive orientations of G(n, p).
Electron. Notes Discret. Math., 2017
Monochromatic trees in random graphs.
Electron. Notes Discret. Math., 2017
Estimating the distance to a hereditary graph property.
Electron. Notes Discret. Math., 2017
Counting results for sparse pseudorandom hypergraphs II.
Eur. J. Comb., 2017
Counting results for sparse pseudorandom hypergraphs I.
Eur. J. Comb., 2017
Densities in large permutations and parameter testing.
Eur. J. Comb., 2017
Powers of Hamilton cycles in pseudorandom graphs.
Comb., 2017
2016
The number of B<sub>3</sub>-sets of a given cardinality.
J. Comb. Theory, Ser. A, 2016
A note on supersaturated set systems.
Eur. J. Comb., 2016
On the Number of <i>B<sub>h</sub> </i>-Sets.
Comb. Probab. Comput., 2016
2015
An Extension of the Blow-up Lemma to Arrangeable Graphs.
SIAM J. Discret. Math., 2015
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.
Random Struct. Algorithms, 2015
An improved upper bound on the density of universal random graphs.
Random Struct. Algorithms, 2015
Tight Hamilton cycles in random hypergraphs.
Random Struct. Algorithms, 2015
A counting lemma for sparse pseudorandom hypergraphs.
Electron. Notes Discret. Math., 2015
Triangle-Free Subgraphs of Random Graphs.
Electron. Notes Discret. Math., 2015
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings.
Discret. Math., 2015
2014
Upper bounds on probability thresholds for asymmetric Ramsey properties.
Random Struct. Algorithms, 2014
On an anti-Ramsey threshold for random graphs.
Eur. J. Comb., 2014
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number.
Eur. J. Comb., 2014
Large permutations and parameter testing.
CoRR, 2014
On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length.
Electron. J. Comb., 2014
2013
Limits of permutation sequences.
J. Comb. Theory, Ser. B, 2013
An approximate blow-up lemma for sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2013
An Unstable Hypergraph Problem with a Unique Optimal Solution.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013
2012
Universality of Random Graphs.
SIAM J. Discret. Math., 2012
Properly coloured copies and rainbow copies of large graphs with small maximum degree.
Random Struct. Algorithms, 2012
Hypergraphs with many Kneser colorings.
Eur. J. Comb., 2012
Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size.
Comb. Probab. Comput., 2012
2011
Testing permutation properties through subpermutations.
Theor. Comput. Sci., 2011
A note on counting orientations.
Electron. Notes Discret. Math., 2011
On an anti-Ramsey property of random graphs.
Electron. Notes Discret. Math., 2011
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number.
Electron. Notes Discret. Math., 2011
A note on random k-dimensional posets.
Electron. Notes Discret. Math., 2011
Every hereditary permutation property is testable.
Electron. Notes Discret. Math., 2011
The maximum size of a Sidon set contained in a sparse random set of integers.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Weak hypergraph regularity and linear hypergraphs.
J. Comb. Theory, Ser. B, 2010
Property Testing and Parameter Testing for Permutations.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
2009
A note on permutation regularity.
Electron. Notes Discret. Math., 2009
Kneser Colorings of Uniform Hypergraphs.
Electron. Notes Discret. Math., 2009
Almost spanning subgraphs of random graphs after adversarial edge removal.
Electron. Notes Discret. Math., 2009
2008
JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness.
Internet Math., 2008
On the Resilience of Long Cycles in Random Graphs.
Electron. J. Comb., 2008
An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications.
Electron. J. Comb., 2008
2007
Querying priced information in databases: The conjunctive case.
ACM Trans. Algorithms, 2007
Turán's theorem for pseudo-random graphs.
J. Comb. Theory, Ser. A, 2007
Small subsets inherit sparse epsilon-regularity.
J. Comb. Theory, Ser. B, 2007
2006
Measures of Pseudorandomness for Finite Sequences: Minimal Values.
Comb. Probab. Comput., 2006
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
2005
A note on the Size-Ramsey number of long subdivisions of graphs.
RAIRO Theor. Informatics Appl., 2005
The 3-colored Ramsey number of odd cycles.
Electron. Notes Discret. Math., 2005
Distance Graphs on the Integers.
Comb. Probab. Comput., 2005
A Practical Minimal Perfect Hashing Method.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
2004
Searching in random partially ordered sets.
Theor. Comput. Sci., 2004
The Turán Theorem for Random Graphs.
Comb. Probab. Comput., 2004
Querying Priced Information in Databases: The Conjunctive Case.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Advances in the Regularity Method.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
2003
An Optimal Algorithm for Checking Regularity.
SIAM J. Comput., 2003
Regular pairs in sparse random graphs I.
Random Struct. Algorithms, 2003
Hereditary Properties Of Triple Systems.
Comb. Probab. Comput., 2003
Ramsey Games Against a One-Armed Bandit.
Comb. Probab. Comput., 2003
Special Issue on Ramsey Theory.
Comb. Probab. Comput., 2003
2002
Hypergraphs, Quasi-randomness, and Conditions for Regularity.
J. Comb. Theory, Ser. A, 2002
The Width of Random Subsets of Boolean Lattices.
J. Comb. Theory, Ser. A, 2002
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall.
Electron. J. Comb., 2002
An optimal algorithm for checking regularity (extended abstract).
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Efficient Testing of Hypergraphs.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
2001
J. Braz. Comput. Soc., 2001
Bounds for Optimal Coverings.
Electron. Notes Discret. Math., 2001
Multidimensional Cube Packing.
Electron. Notes Discret. Math., 2001
Near-optimum Universal Graphs for Graphs with Bounded Degrees.
Proceedings of the Approximation, 2001
2000
The length of random subsets of Boolean lattices.
Random Struct. Algorithms, 2000
Finding Skew Partitions Efficiently.
J. Algorithms, 2000
Equivalent Conditions for Regularity (Extended Abstract).
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
Algorithmic Aspects of Regularity.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
Universality and Tolerance.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
1998
Packing and Covering Triangles in Tripartite Graphs.
Graphs Comb., 1998
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.
Comb., 1998
1997
Threshold functions for asymmetric Ramsey properties involving cycles.
Random Struct. Algorithms, 1997
The size of the largest bipartite subgraphs.
Discret. Math., 1997
On <i>K</i><sup>4</sup>-Free Subgraphs of Random Graphs.
Comb., 1997
1996
Ramsey-type results for oriented trees.
J. Graph Theory, 1996
Partitioning by Monochromatic Trees.
J. Comb. Theory, Ser. B, 1996
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.
Comb., 1996
1995
On the Anti-Ramsey Property of Ramanujan Graphs.
Random Struct. Algorithms, 1995
Connectivity Properties of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1995
Sparse Anti-Ramsey Graphs.
J. Comb. Theory, Ser. B, 1995
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
J. Comb. Theory, Ser. B, 1995
The Induced Size-Ramsey Number of Cycles.
Comb. Probab. Comput., 1995
1994
On the Diameter and Radius of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1994
Percolation in High Dimensions.
Eur. J. Comb., 1994
An Extension of the Erdös-Stone Theorem.
Comb., 1994
1993
Ramsey Properties of Orientations of Graphs.
Random Struct. Algorithms, 1993
1992
The Evaluation of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1992
On small graphs with highly imperfect powers.
Discret. Math., 1992
1991
A note on induced cycles in Kneser graphs.
Comb., 1991
1990
A Note on Kernels of Intersecting Families.
Eur. J. Comb., 1990
