Gábor N. Sárközy

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

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



In proceedings 
PhD thesis 



On csauthors.net:


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.
Periodica Mathematica Hungarica, 2017

Rainbow matchings in bipartite multigraphs.
Periodica Mathematica Hungarica, 2017

Monochromatic cycle power partitions.
Discrete Mathematics, 2017

Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition.
Electr. 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.
PVLDB, 2016

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

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

Monochromatic bounded degree subgraph partitions.
Discrete Mathematics, 2016

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

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

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

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

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

Improved monochromatic loose cycle partitions in hypergraphs.
Discrete Mathematics, 2014

Rainbow matchings and cycle-free partial transversals of Latin squares.
Discrete Mathematics, 2014

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

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

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

Monochromatic Path and Cycle Partitions in Hypergraphs.
Electr. 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.
Combinatorics, Probability & Computing, 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.
Journal of Graph Theory, 2011

Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.
Discrete Mathematics, 2011

The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle.
Combinatorics, Probability & Computing, 2011

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

Long rainbow cycles in proper edge-colorings of complete graphs.
Australasian J. Combinatorics, 2011

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

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

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

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

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

Gallai colorings of non-complete graphs.
Discrete Mathematics, 2010

Multipartite Ramsey numbers for odd cycles.
Journal of Graph Theory, 2009

A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.
Discrete Mathematics, 2009

Stability of the path-path Ramsey number.
Discrete Mathematics, 2009

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

Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.
Journal of 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 and Combinatorics, 2008

Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discrete Mathematics, 2008

On 2-factors with k components.
Discrete Mathematics, 2008

Size of monochromatic components in local edge colorings.
Discrete Mathematics, 2008

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

Three-color Ramsey numbers for paths.
Combinatorica, 2008

Tripartite Ramsey numbers for paths.
Journal of Graph Theory, 2007

Three-Color Ramsey Numbers For Paths.
Combinatorica, 2007

On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós.
Journal of 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.
Discrete Mathematics, 2005

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

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

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

On the number of Hamiltonian cycles in Dirac graphs.
Discrete Mathematics, 2003

On bipartite generalized Ramsey theory.
Ars Comb., 2003

Proof of the Alon-Yuster conjecture.
Discrete Mathematics, 2001

Spanning Trees In Dense Graphs.
Combinatorics, Probability & Computing, 2001

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

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

On k-ordered Hamiltonian graphs.
Journal of Graph Theory, 1999

Complete tripartite subgraphs in the coprime graph of integers.
Discrete Mathematics, 1999

Counting irregular multigraphs.
Discrete Mathematics, 1999

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

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

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

Blow-Up Lemma.
Combinatorica, 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.
Journal of Graph Theory, 1995

proof of a Packing Conjecture of Bollobás.
Combinatorics, Probability & Computing, 1995