Gábor N. Sárközy

  • Worcester Polytechnic Institute, USA

According to our database1, Gábor N. Sárközy authored at least 84 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Turán and Ramsey numbers in linear triple systems II.
Discret. Math., 2023

A General Approach for Supporting Time Series Matching Using Multiple-Warped Distances.
IEEE Trans. Knowl. Data Eng., 2022

Improved Monochromatic Double Stars in Edge Colorings.
Graphs Comb., 2022

Linear Turán numbers of acyclic triple systems.
Eur. J. Comb., 2022

Monochromatic square-cycle and square-path partitions.
Discret. Math., 2022

The linear Turán number of small triple systems or why is the wicket interesting?
Discret. Math., 2022

Ramsey numbers of path-matchings, covering designs, and 1-cores.
J. Comb. Theory, Ser. B, 2021

Turán and Ramsey numbers in linear triple systems.
Discret. Math., 2021

Large monochromatic components in multicolored bipartite graphs.
J. Graph Theory, 2020

Matchings with few colors in colored complete graphs and hypergraphs.
Discret. Math., 2020

Correlation-Based Analytics of Time Series Data.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

Nearest Neighbor Subsequence Search in Time Series Data.
Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

Generalized Dynamic Time Warping: Unleashing the Warping Power Hidden in Point-Wise Distances.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Cliques in \(C_4\) -free graphs of large minimum degree.
Period. Math. Hung., 2017

Rainbow matchings in bipartite multigraphs.
Period. Math. Hung., 2017

Monochromatic cycle power partitions.
Discret. Math., 2017

Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition.
Electron. J. Comb., 2017

Interactive Time Series Analytics Powered by ONEX.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Interactive Time Series Exploration Powered by the Marriage of Similarity Distances.
Proc. VLDB Endow., 2016

Ramsey Number of a Connected Triangle Matching.
J. Graph Theory, 2016

Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles.
J. Graph Theory, 2016

Monochromatic bounded degree subgraph partitions.
Discret. Math., 2016

Ramsey number of paths and connected matchings in Ore-type host graphs.
Discret. Math., 2016

On the Multi-Colored Ramsey Numbers of Paths and Even Cycles.
Electron. J. Comb., 2016

Induced Colorful Trees and Paths in Large Chromatic Graphs.
Electron. J. Comb., 2016

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.
Graphs Comb., 2015

Ramsey numbers for bipartite graphs with small bandwidth.
Eur. J. Comb., 2015

Improved monochromatic loose cycle partitions in hypergraphs.
Discret. Math., 2014

Rainbow matchings and cycle-free partial transversals of Latin squares.
Discret. Math., 2014

Monochromatic Loose-cycle Partitions in Hypergraphs.
Electron. J. Comb., 2014

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

An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs.
J. Graph Theory, 2013

Monochromatic Path and Cycle Partitions in Hypergraphs.
Electron. J. Comb., 2013

Applying Clustering to the Problem of Predicting Retention within an ITS: Comparing Regularity Clustering with Traditional Methods.
Proceedings of the Twenty-Sixth International Florida Artificial Intelligence Research Society Conference, 2013

Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp.
Comb. Probab. Comput., 2012

A Practical Regularity Partitioning Algorithm and its Applications in Clustering
CoRR, 2012

Clustered Knowledge Tracing.
Proceedings of the Intelligent Tutoring Systems - 11th International Conference, 2012

Co-Clustering by Bipartite Spectral Graph Partitioning for Out-of-Tutor Prediction.
Proceedings of the 5th International Conference on Educational Data Mining, 2012

Monochromatic cycle partitions of edge-colored graphs.
J. Graph Theory, 2011

Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.
Discret. Math., 2011

The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle.
Comb. Probab. Comput., 2011

Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.
Electron. J. Comb., 2011

Long rainbow cycles in proper edge-colorings of complete graphs.
Australas. J Comb., 2011

Spectral Clustering in Educational Data Mining.
Proceedings of the 4th International Conference on Educational Data Mining, 2011

Ramsey-type results for Gallai colorings.
J. Graph Theory, 2010

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.
J. Graph Theory, 2010

Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.
Graphs Comb., 2010

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

Gallai colorings of non-complete graphs.
Discret. Math., 2010

Multipartite Ramsey numbers for odd cycles.
J. Graph Theory, 2009

A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.
Discret. Math., 2009

Stability of the path-path Ramsey number.
Discret. Math., 2009

Inequalities for the first-fit chromatic number.
J. Graph Theory, 2008

Monochromatic Hamiltonian <i>t</i>-tight Berge-cycles in hypergraphs.
J. Graph Theory, 2008

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
J. Comb. Theory, Ser. B, 2008

Size of Monochromatic Double Stars in Edge Colorings.
Graphs Comb., 2008

Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discret. Math., 2008

On 2-factors with k components.
Discret. Math., 2008

Size of monochromatic components in local edge colorings.
Discret. Math., 2008

The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.
Electron. J. Comb., 2008

Tripartite Ramsey numbers for paths.
J. Graph Theory, 2007

Three-Color Ramsey Numbers For Paths.
Comb., 2007

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

An improved bound for the monochromatic cycle partition number.
J. Comb. Theory, Ser. B, 2006

On the size of partial block designs with large blocks.
Discret. Math., 2005

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

An Extension Of The Ruzsa-Szemerédi Theorem.
Comb., 2004

An application of the regularity lemma in generalized Ramsey theory.
J. Graph Theory, 2003

On the number of Hamiltonian cycles in Dirac graphs.
Discret. Math., 2003

On bipartite generalized Ramsey theory.
Ars Comb., 2003

Proof of the Alon-Yuster conjecture.
Discret. Math., 2001

Spanning Trees In Dense Graphs.
Comb. Probab. Comput., 2001

On Edge Colorings with at Least q Colors in Every Subset of p Vertices.
Electron. J. Comb., 2001

Vertex Partitions by Connected Monochromatic k-Regular Graphs.
J. Comb. Theory, Ser. B, 2000

On <i>k</i>-ordered Hamiltonian graphs.
J. Graph Theory, 1999

Complete tripartite subgraphs in the coprime graph of integers.
Discret. Math., 1999

Counting irregular multigraphs.
Discret. Math., 1999

An algorithmic version of the blow-up lemma.
Random Struct. Algorithms, 1998

On the Pósa-Seymour conjecture.
J. Graph Theory, 1998

On cycles in the coprime graph of integers.
Electron. J. Comb., 1997

Blow-Up Lemma.
Comb., 1997

On the square of a Hamiltonian cycle in dense graphs.
Random Struct. Algorithms, 1996

Cycles in bipartite graphs and an application in number theory.
J. Graph Theory, 1995

proof of a Packing Conjecture of Bollobás.
Comb. Probab. Comput., 1995