Hanno Lefmann

Dionatan Ricardo Schmidt

Discret. Math., April, 2024

Canonical Theorems for Colored Integers with Respect to Some Linear Combinations.

[BibT_eX]

[DOI]

Maria Axenovich

Josefran de Oliveira Bastos

SIAM J. Discret. Math., March, 2024

2023

Graphs with many edge-colorings such that complete graphs are rainbow.

[BibT_eX]

[DOI]

Fabrício Siqueira Benevides

Andy Oertel

Dionatan Ricardo Schmidt

Discret. Appl. Math., July, 2023

Heilbronn triangle-type problems in the unit square [0,1]2.

[BibT_eX]

[DOI]

Random Struct. Algorithms, May, 2023

2021

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Rainbow Erdös-Rothschild Problem for the Fano Plane.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

An extension of the rainbow Erdős-Rothschild problem.

[BibT_eX]

[DOI]

Josefran de Oliveira Bastos

Denilson Nolibos

Discret. Math., 2021

Maximum number of r-edge-colorings such that all copies of Kk are rainbow.

[BibT_eX]

[DOI]

Andy Oertel

Dionatan Ricardo Schmidt

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

2020

On the independence number of non-uniform uncrowded hypergraphs.

[BibT_eX]

[DOI]

Sang June Lee

Discret. Math., 2020

Estimating parameters associated with monotone properties.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

2019

Stability Results for Two Classes of Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Remarks on an Edge-coloring Problem.

[BibT_eX]

[DOI]

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

2018

Edge-colorings avoiding rainbow stars.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

2017

Estimating the distance to a hereditary graph property.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Stability of extremal hypergraphs with applications to an edge-coloring problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On graphs with a large number of edge-colorings avoiding a rainbow triangle.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

2016

A coloring problem for intersecting vector spaces.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Edge-colorings avoiding fixed rainbow stars.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

A rainbow Erdős-Rothschild problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Edge-colorings avoiding a fixed matching with a prescribed color pattern.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Edge-colorings of uniform hypergraphs avoiding monochromatic matchings.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Some Partition Theorems for Infinite and Finite Matrices.

[BibT_eX]

[DOI]

David S. Gunderson

Neil Hindman

Integers, 2014

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

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

2013

Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs.

[BibT_eX]

[DOI]

Yury Person

J. Graph Theory, 2013

Graphs on Affine and Linear Spaces and Deuber Sets.

[BibT_eX]

[DOI]

David S. Gunderson

Electron. J. Comb., 2013

An Unstable Hypergraph Problem with a Unique Optimal Solution.

[BibT_eX]

[DOI]

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

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

2011

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2009

Kneser Colorings of Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

2008

Point sets in the unit square and large areas of convex hulls of subsets of points.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

Distributions of points in the unit square and large k-gons.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Distributions of Points in d Dimensions and Large k -Point Simplices.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

No lGrid-Points in Spaces of Small Dimension.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Generalizations of Heilbronn's Triangle Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Convex Hulls of Point-Sets and Non-uniform Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Large triangles in the d-dimensional unit cube.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Distributions of Points and Large Convex Hulls of k Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Sparse Parity-Check Matrices over ${GF(q)}$.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2005

Distributions of points in the unit-square and large k-gons.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Distributions of Points and Large Quadrangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Large Triangles in the d-Dimensional Unit-Cube.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

On Heilbronn's Problem in Higher Dimension.

[BibT_eX]

[DOI]

Comb., 2003

Sparse Parity-Check Matrices over Finite Fields (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions.

[BibT_eX]

[DOI]

Niels Schmitt

SIAM J. Comput., 2002

A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three.

[BibT_eX]

[DOI]

Niels Schmitt

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2000

An Algorithm for Heilbronn's Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

MODp-tests, almost independence and small probability spaces.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Coloring arcs of convex sets.

[BibT_eX]

[DOI]

Heiko Harborth

Discret. Math., 2000

1999

The Algorithmic Aspects of Uncrowded Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Sparse 0-1-Matrices And Forbidden Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1999

1998

On k-Partite Subgraphs.

[BibT_eX]

Ars Comb., 1998

Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximating Maximum Independent Sets in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

PAC-Learning from General Examples.

[BibT_eX]

[DOI]

Paul Fischer

Klaus-Uwe Höffgen

Theor. Comput. Sci., 1997

Some typical properties of large AND/OR Boolean formulas.

[BibT_eX]

[DOI]

Petr Savický

Random Struct. Algorithms, 1997

On Sparse Parity Check Matrices.

[BibT_eX]

[DOI]

Pavel Pudlák

Petr Savický

Des. Codes Cryptogr., 1997

MODp-tests, Almost Independence and Small Probability Spaces (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

A combinatorial design approach to MAXCUT.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Multicolored Subsets in Colored Hypergraphs.

[BibT_eX]

[DOI]

Beata Wysocka

J. Comb. Theory A, 1996

Independent Sets in Graphs with Triangles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Canonical partition relations for (m, p, c)-systems.

[BibT_eX]

[DOI]

Neil Hindman

Discret. Math., 1996

On the degree of regularity of some equations.

[BibT_eX]

[DOI]

Arie Bialostocki

Terry Meerdink

Discret. Math., 1996

Proper Bounded Edge-Colorings.

[BibT_eX]

Beata Wysocka

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

On Sparse Parity Chack Matrices (Extended Abstract).

[BibT_eX]

[DOI]

Pavel Pudlák

Petr Savický

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.

[BibT_eX]

[DOI]

Richard A. Duke

SIAM J. Comput., 1995

On Uncrowded Hypergraphs.

[BibT_eX]

[DOI]

Richard A. Duke

Random Struct. Algorithms, 1995

Shift graphs and lower bounds on Ramsey numbers rk(l; r).

[BibT_eX]

[DOI]

Dwight Duffus

Discret. Math., 1995

Monochromatic and zero-sum sets of nondecreasing diameter.

[BibT_eX]

[DOI]

Arie Bialostocki

Paul Erdös

Discret. Math., 1995

Point Sets with Distinct Distances.

[BibT_eX]

[DOI]

Torsten Thiele

Comb., 1995

On Erdös-Rado Numbers.

[BibT_eX]

[DOI]

Comb., 1995

Infinite Partition Regular Matrices.

[BibT_eX]

[DOI]

Comb., 1995

Derandomization for Sparse Approximations and Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

Rado's Theorem for Commutative Rings.

[BibT_eX]

J. Comb. Theory A, 1994

The Algorithmic Aspects of the Regularity Lemma.

[BibT_eX]

[DOI]

J. Algorithms, 1994

1993

On Canonical Ramsey Numbers for Complete Graphs versus Paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Rigid Linear Binary Codes.

[BibT_eX]

Kevin T. Phelps

J. Comb. Theory A, 1993

Partition Regularity of (M, P, C)-Systems.

[BibT_eX]

Neil Hindman

J. Comb. Theory A, 1993

Approximations with Axis-Aligned Rectangles (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

Monochromatic Vs multicolored paths.

[BibT_eX]

[DOI]

Robin Thomas

Graphs Comb., 1992

The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

On partition regular systems of equations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1991

Non t-intersecting families of linear spaces over GF(q).

[BibT_eX]

[DOI]

Discret. Math., 1991

1990

On Families in Finite Lattices.

[BibT_eX]

[DOI]

Eur. J. Comb., 1990

1989

Partitions of Aomega.

[BibT_eX]

[DOI]

Bernd Voigt

SIAM J. Discret. Math., 1989

A note on monoton waves.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1989

An extremal problem for Graham-Rotschild parameter words.

[BibT_eX]

[DOI]

Comb., 1989

1986

A canonical version for partition regular systems of linear equations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

1984

A remark on infinite arithmetic progressions.

[BibT_eX]

[DOI]