Yoshiharu Kohayakawa

Tássio Naia

RAIRO Oper. Res., 2024

2023

The mod k $k$ chromatic index of random graphs.

[BibT_eX]

[DOI]

Fábio Botler

Lucas Colucci

J. Graph Theory, August, 2023

Guest Editorial: Special Issue on Theoretical Informatics.

[BibT_eX]

[DOI]

Algorithmica, August, 2023

The anti-Ramsey threshold of complete graphs.

[BibT_eX]

[DOI]

Olaf Parczyk

Jakob Schnitzer

Discret. Math., May, 2023

The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$.

[BibT_eX]

[DOI]

Fábio Botler

Lucas Colucci

J. Graph Theory, 2023

Resilience for loose Hamilton cycles.

[BibT_eX]

[DOI]

José D. Alvarado

Richard Lang

Henrique Stagni

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

A canonical Ramsey theorem with list constraints in random graphs.

[BibT_eX]

[DOI]

José D. Alvarado

Patrick Morris

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Factors in randomly perturbed hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

2021

Covering 3-Edge-Colored Random Graphs with Monochromatic Trees.

[BibT_eX]

[DOI]

Walner Mendonça

Bruno Pasqualotto Cavalar

Bjarne Schülke

SIAM J. Discret. Math., 2021

On the Query Complexity of Estimating the Distance to Hereditary Graph Properties.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Orientation Ramsey Thresholds for Cycles and Cliques.

[BibT_eX]

[DOI]

Gabriel Ferreira Barros

Tássio Naia

SIAM J. Discret. Math., 2021

Finding any given 2-factor in sparse pseudorandom graphs efficiently.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

On strong Sidon sets of integers.

[BibT_eX]

[DOI]

Sang June Lee

Carlos Gustavo Moreira

J. Comb. Theory A, 2021

A tight lower bound for the online bounded space hypercube bin packing problem.

[BibT_eX]

[DOI]

Yoshiko Wakabayashi

Discret. Math. Theor. Comput. Sci., 2021

Hitting times for arc-disjoint arborescences in random digraph processes.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Constrained colourings of random graphs.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Counting restricted orientations of random graphs.

[BibT_eX]

[DOI]

Robert Morris

Random Struct. Algorithms, July, 2020

The multicolour size-Ramsey number of powers of paths.

[BibT_eX]

[DOI]

Matthew Jenssen

Barnaby Roberts

J. Comb. Theory B, 2020

A perspective on theoretical computer science in Latin America.

[BibT_eX]

[DOI]

Marcos Kiwi

Francisco Rodríguez-Henríquez

Sergio Rajsbaum

Jayme Luiz Szwarcfiter

Alfredo Viola

Commun. ACM, 2020

2019

The size Ramsey number of short subdivisions of bounded degree graphs.

[BibT_eX]

[DOI]

Troy Retter

Random Struct. Algorithms, 2019

Universality for bounded degree spanning trees in randomly perturbed graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Powers of tight Hamilton cycles in randomly perturbed hypergraphs.

[BibT_eX]

[DOI]

Wiebke Bedenknecht

Random Struct. Algorithms, 2019

The size?Ramsey number of powers of paths.

[BibT_eX]

[DOI]

Damian Reding

Barnaby Roberts

J. Graph Theory, 2019

Preface.

[BibT_eX]

[DOI]

Gabriel Coutinho

Vinícius Fernandes dos Santos

Sebastián Urrutia

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Clique-factors in sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Extremal and probabilistic results for order types.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Infinite Sidon Sets Contained in Sparse Random Sets of Integers.

[BibT_eX]

[DOI]

Sangjune Lee

Carlos Gustavo Moreira

SIAM J. Discret. Math., 2018

On an anti-Ramsey threshold for sparse graphs with one triangle.

[BibT_eX]

[DOI]

P. B. Konstadinidis

J. Graph Theory, 2018

Near-perfect clique-factors in sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Yury Person

Electron. Notes Discret. Math., 2018

On hypergraphs without loose cycles.

[BibT_eX]

[DOI]

Discret. Math., 2018

A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game.

[BibT_eX]

[DOI]

Yoshiko Wakabayashi

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Property Testing for Point Sets on the Plane.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Chromatic thresholds in sparse random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Chromatic thresholds in dense random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

On the number of r-transitive orientations of G(n, p).

[BibT_eX]

[DOI]

Robert Morris

Electron. Notes Discret. Math., 2017

Monochromatic trees in random graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Estimating the distance to a hereditary graph property.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Counting results for sparse pseudorandom hypergraphs II.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Counting results for sparse pseudorandom hypergraphs I.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Densities in large permutations and parameter testing.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

2016

The number of B3-sets of a given cardinality.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2016

A note on supersaturated set systems.

[BibT_eX]

[DOI]

Peter Frankl

Eur. J. Comb., 2016

On the Number of Bh -Sets.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

Estimating Parameters Associated with Monotone Properties.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2016

2015

An Extension of the Blow-up Lemma to Arrangeable Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Tight Hamilton cycles in random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

A counting lemma for sparse pseudorandom hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Triangle-Free Subgraphs of Random Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Edge-colorings of uniform hypergraphs avoiding monochromatic matchings.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Upper bounds on probability thresholds for asymmetric Ramsey properties.

[BibT_eX]

[DOI]

Reto Spöhel

Random Struct. Algorithms, 2014

On an anti-Ramsey threshold for random graphs.

[BibT_eX]

[DOI]

P. B. Konstadinidis

Eur. J. Comb., 2014

Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Large permutations and parameter testing.

[BibT_eX]

[DOI]

CoRR, 2014

On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length.

[BibT_eX]

[DOI]

Peter Allen

Roberto F. Parente

Electron. J. Comb., 2014

Powers of Hamilton Cycles in Pseudorandom Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Limits of permutation sequences.

[BibT_eX]

[DOI]

Balázs Ráth

J. Comb. Theory B, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

An Unstable Hypergraph Problem with a Unique Optimal Solution.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Properly coloured copies and rainbow copies of large graphs with small maximum degree.

[BibT_eX]

[DOI]

Julia Böttcher

Aldo Procacci

Random Struct. Algorithms, 2012

Hypergraphs with many Kneser colorings.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

An Improved Upper Bound on the Density of Universal Random Graphs.

[BibT_eX]

[DOI]

Andrzej Rucinski

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Testing permutation properties through subpermutations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A note on counting orientations.

[BibT_eX]

[DOI]

Roberto F. Parente

Electron. Notes Discret. Math., 2011

On an anti-Ramsey property of random graphs.

[BibT_eX]

[DOI]

P. B. Konstadinidis

Electron. Notes Discret. Math., 2011

Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

A note on random k-dimensional posets.

[BibT_eX]

[DOI]

Ricardo C. Corrêa

Electron. Notes Discret. Math., 2011

Every hereditary permutation property is testable.

[BibT_eX]

[DOI]

Antônio J. O. Bastos

Electron. Notes Discret. Math., 2011

The maximum size of a Sidon set contained in a sparse random set of integers.

[BibT_eX]

[DOI]

Sangjune Lee

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Weak hypergraph regularity and linear hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Property Testing and Parameter Testing for Permutations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

A note on permutation regularity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Kneser Colorings of Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Almost spanning subgraphs of random graphs after adversarial edge removal.

[BibT_eX]

[DOI]

Julia Böttcher

Electron. Notes Discret. Math., 2009

2008

JumpNet: Improving Connectivity and Robustness in Unstructured P2P Networks by Randomness.

[BibT_eX]

[DOI]

Internet Math., 2008

On the Resilience of Long Cycles in Random Graphs.

[BibT_eX]

[DOI]

Martin Marciniszyn

Angelika Steger

Electron. J. Comb., 2008

An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Universality of random graphs.

[BibT_eX]

[DOI]

Andrzej Rucinski

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Querying priced information in databases: The conjunctive case.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Turán's theorem for pseudo-random graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Small subsets inherit sparse epsilon-regularity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

2006

Measures of Pseudorandomness for Finite Sequences: Minimal Values.

[BibT_eX]

[DOI]

Noga Alon

Christian Mauduit

Comb. Probab. Comput., 2006

An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jair Donadelli

RAIRO Theor. Informatics Appl., 2005

The 3-colored Ramsey number of odd cycles.

[BibT_eX]

[DOI]

Miklós Simonovits

Jozef Skokan

Electron. Notes Discret. Math., 2005

Distance Graphs on the Integers.

[BibT_eX]

[DOI]

Mike Ferrara

Comb. Probab. Comput., 2005

A Practical Minimal Perfect Hashing Method.

[BibT_eX]

[DOI]

Fabiano C. Botelho

Nivio Ziviani

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004

The Turán Theorem for Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Querying Priced Information in Databases: The Conjunctive Case.

[BibT_eX]

[DOI]

Eduardo Sany Laber

Renato Carmo

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Advances in the Regularity Method.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

An Optimal Algorithm for Checking Regularity.

[BibT_eX]

[DOI]

Lubos Thoma

SIAM J. Comput., 2003

Regular pairs in sparse random graphs I.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

Hereditary Properties Of Triple Systems.

[BibT_eX]

[DOI]

Brendan Nagle

Comb. Probab. Comput., 2003

Ramsey Games Against a One-Armed Bandit.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Special Issue on Ramsey Theory.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

Hypergraphs, Quasi-randomness, and Conditions for Regularity.

[BibT_eX]

[DOI]

Jozef Skokan

J. Comb. Theory A, 2002

The Width of Random Subsets of Boolean Lattices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall.

[BibT_eX]

[DOI]

Jair Donadelli

Electron. J. Comb., 2002

An optimal algorithm for checking regularity (extended abstract).

[BibT_eX]

[DOI]

Lubos Thoma

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Searching in Random Partially Ordered Sets.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Efficient Testing of Hypergraphs.

[BibT_eX]

[DOI]

Brendan Nagle

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Ramsey minimal graphs.

[BibT_eX]

J. Braz. Comput. Soc., 2001

Bounds for Optimal Coverings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Multidimensional Cube Packing.

[BibT_eX]

[DOI]

Prabhakar Raghavan

Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2001

Near-optimum Universal Graphs for Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

2000

The length of random subsets of Boolean lattices.

[BibT_eX]

[DOI]

Deryk Osthus

Random Struct. Algorithms, 2000

Equivalent Conditions for Regularity (Extended Abstract).

[BibT_eX]

[DOI]

Jozef Skokan

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Algorithmic Aspects of Regularity.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Finding Skew Partitions Efficiently.

[BibT_eX]

[DOI]

Sulamita Klein

Bruce A. Reed

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Universality and Tolerance.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1998

Packing and Covering Triangles in Tripartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1998

Induced Ramsey Numbers.

[BibT_eX]

[DOI]

Hans Jürgen Prömel

Comb., 1998

An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.

[BibT_eX]

[DOI]

Angelika Steger

Comb., 1998

1997

Threshold functions for asymmetric Ramsey properties involving cycles.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

The size of the largest bipartite subgraphs.

[BibT_eX]

[DOI]

Paul Erdös

András Gyárfás

Discret. Math., 1997

On K4-Free Subgraphs of Random Graphs.

[BibT_eX]

[DOI]

Comb., 1997

1996

Ramsey-type results for oriented trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Partitioning by Monochromatic Trees.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.

[BibT_eX]

[DOI]

Comb., 1996

1995

On the Anti-Ramsey Property of Ramanujan Graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Connectivity Properties of Random Subgraphs of the Cube.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Sparse Anti-Ramsey Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

The Induced Size-Ramsey Number of Cycles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

1994

On the Diameter and Radius of Random Subgraphs of the Cube.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

Percolation in High Dimensions.

[BibT_eX]

[DOI]

Eur. J. Comb., 1994

An Extension of the Erdös-Stone Theorem.

[BibT_eX]

[DOI]

Comb., 1994

1993

Ramsey Properties of Orientations of Graphs.

[BibT_eX]

[DOI]

Graham R. Brightwell

Random Struct. Algorithms, 1993

1992

The Evaluation of Random Subgraphs of the Cube.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

On small graphs with highly imperfect powers.

[BibT_eX]

[DOI]

Jerzy Wojciechowski

Discret. Math., 1992

1991

A note on induced cycles in Kneser graphs.

[BibT_eX]

[DOI]

Comb., 1991

1990

A Note on Kernels of Intersecting Families.

[BibT_eX]

[DOI]