Gábor N. Sárközy

Graphs Comb., October, 2023

Turán and Ramsey numbers in linear triple systems II.

[BibT_eX]

[DOI]

Discret. Math., 2023

2022

A General Approach for Supporting Time Series Matching Using Multiple-Warped Distances.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Improved Monochromatic Double Stars in Edge Colorings.

[BibT_eX]

[DOI]

Graphs Comb., 2022

Linear Turán numbers of acyclic triple systems.

[BibT_eX]

[DOI]

Miklós Ruszinkó

Eur. J. Comb., 2022

Monochromatic square-cycle and square-path partitions.

[BibT_eX]

[DOI]

Discret. Math., 2022

The linear Turán number of small triple systems or why is the wicket interesting?

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

Ramsey numbers of path-matchings, covering designs, and 1-cores.

[BibT_eX]

[DOI]

Louis DeBiasio

J. Comb. Theory B, 2021

Turán and Ramsey numbers in linear triple systems.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Large monochromatic components in multicolored bipartite graphs.

[BibT_eX]

[DOI]

Louis DeBiasio

Robert A. Krueger

J. Graph Theory, 2020

Matchings with few colors in colored complete graphs and hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Correlation-Based Analytics of Time Series Data.

[BibT_eX]

[DOI]

Muzammil Bashir

Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019

Nearest Neighbor Subsequence Search in Time Series Data.

[BibT_eX]

[DOI]

Muzammil Bashir

Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018

Generalized Dynamic Time Warping: Unleashing the Warping Power Hidden in Point-Wise Distances.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017

Cliques in \(C_4\) -free graphs of large minimum degree.

[BibT_eX]

[DOI]

Period. Math. Hung., 2017

Rainbow matchings in bipartite multigraphs.

[BibT_eX]

[DOI]

János Barát

Period. Math. Hung., 2017

Monochromatic cycle power partitions.

[BibT_eX]

[DOI]

Discret. Math., 2017

Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Interactive Time Series Analytics Powered by ONEX.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

2016

Interactive Time Series Exploration Powered by the Marriage of Similarity Distances.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

Ramsey Number of a Connected Triangle Matching.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles.

[BibT_eX]

[DOI]

János Barát

J. Graph Theory, 2016

Monochromatic bounded degree subgraph partitions.

[BibT_eX]

[DOI]

Andrey Grinshpun

Discret. Math., 2016

Ramsey number of paths and connected matchings in Ore-type host graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

On the Multi-Colored Ramsey Numbers of Paths and Even Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Induced Colorful Trees and Paths in Large Chromatic Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Ramsey numbers for bipartite graphs with small bandwidth.

[BibT_eX]

[DOI]

Guilherme Oliveira Mota

Mathias Schacht

Anusch Taraz

Eur. J. Comb., 2015

2014

Improved monochromatic loose cycle partitions in hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

Rainbow matchings and cycle-free partial transversals of Latin squares.

[BibT_eX]

[DOI]

Discret. Math., 2014

Monochromatic Loose-cycle Partitions in Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Partitioning 2-edge-colored graphs by monochromatic paths and cycles.

[BibT_eX]

[DOI]

Comb., 2014

2013

An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs.

[BibT_eX]

[DOI]

Fei Song

J. Graph Theory, 2013

Monochromatic Path and Cycle Partitions in Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Applying Clustering to the Problem of Predicting Retention within an ITS: Comparing Regularity Clustering with Traditional Methods.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Florida Artificial Intelligence Research Society Conference, 2013

2012

Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

A Practical Regularity Partitioning Algorithm and its Applications in Clustering

[BibT_eX]

[DOI]

CoRR, 2012

Clustered Knowledge Tracing.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Tutoring Systems - 11th International Conference, 2012

Co-Clustering by Bipartite Spectral Graph Partitioning for Out-of-Tutor Prediction.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Educational Data Mining, 2012

2011

Monochromatic cycle partitions of edge-colored graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.

[BibT_eX]

[DOI]

Fei Song

Discret. Math., 2011

The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

Long rainbow cycles in proper edge-colorings of complete graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2011

Spectral Clustering in Educational Data Mining.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Educational Data Mining, 2011

2010

Ramsey-type results for Gallai colorings.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2010

How to avoid using the Regularity Lemma: Pósa's conjecture revisited.

[BibT_eX]

[DOI]

Ian Levitt

Discret. Math., 2010

Gallai colorings of non-complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Multipartite Ramsey numbers for odd cycles.

[BibT_eX]

[DOI]

Richard H. Schelp

J. Graph Theory, 2009

A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Stability of the path-path Ramsey number.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Inequalities for the first-fit chromatic number.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.

[BibT_eX]

[DOI]

Paul Dorbec

Sylvain Gravier

J. Graph Theory, 2008

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Size of Monochromatic Double Stars in Edge Colorings.

[BibT_eX]

[DOI]

Graphs Comb., 2008

Distributing vertices along a Hamiltonian cycle in Dirac graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

On 2-factors with k components.

[BibT_eX]

[DOI]

Discret. Math., 2008

Size of monochromatic components in local edge colorings.

[BibT_eX]

[DOI]

Discret. Math., 2008

The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Three-color Ramsey numbers for paths.

[BibT_eX]

[DOI]

Comb., 2008

2007

Tripartite Ramsey numbers for paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

2006

On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

An improved bound for the monochromatic cycle partition number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

2005

On the size of partial block designs with large blocks.

[BibT_eX]

[DOI]

András Sárközy

Discret. Math., 2005

On a Turán-type hypergraph problem of Brown, Erdos and T. Sós.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

An Extension Of The Ruzsa-Szemerédi Theorem.

[BibT_eX]

[DOI]

Comb., 2004

2003

An application of the regularity lemma in generalized Ramsey theory.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

On the number of Hamiltonian cycles in Dirac graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

On bipartite generalized Ramsey theory.

[BibT_eX]

Ars Comb., 2003

2001

Proof of the Alon-Yuster conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2001

Spanning Trees In Dense Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

On Edge Colorings with at Least q Colors in Every Subset of p Vertices.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

2000

Vertex Partitions by Connected Monochromatic k-Regular Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

1999

On k-ordered Hamiltonian graphs.

[BibT_eX]

[DOI]

Hal A. Kierstead

J. Graph Theory, 1999

Complete tripartite subgraphs in the coprime graph of integers.

[BibT_eX]

[DOI]

Discret. Math., 1999

Counting irregular multigraphs.

[BibT_eX]

[DOI]

Aron C. Atkins

Discret. Math., 1999

1998

An algorithmic version of the blow-up lemma.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

On the Pósa-Seymour conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

1997

On cycles in the coprime graph of integers.

[BibT_eX]

[DOI]

Paul Erdös

Electron. J. Comb., 1997

Blow-Up Lemma.

[BibT_eX]

[DOI]

Comb., 1997

1996

On the square of a Hamiltonian cycle in dense graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

1995

Cycles in bipartite graphs and an application in number theory.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

proof of a Packing Conjecture of Bollobás.

[BibT_eX]

[DOI]