Gábor N. Sárközy

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 28

Top Topics

Mutual Reinforcement

Dynamic Time Warping

Bipartite Graph

Nearest Neighbor

Top Venues

Electron. J. Comb.

J. Graph Theory

Publications

András Gyárfás, Gábor N. Sárközy
-s. Graphs Comb. 39 (5) (2023)
Gábor N. Sárközy
Turán and Ramsey numbers in linear triple systems II. Discret. Math. 346 (1) (2023)
Gábor N. Sárközy
Improved Monochromatic Double Stars in Edge Colorings. Graphs Comb. 38 (3) (2022)
András Gyárfás, Gábor N. Sárközy
The linear Turán number of small triple systems or why is the wicket interesting? Discret. Math. 345 (11) (2022)
Rodica Neamtu, Ramoza Ahsan, Cuong Nguyen, Charles Lovering, Elke A. Rundensteiner, Gábor N. Sárközy
A General Approach for Supporting Time Series Matching Using Multiple-Warped Distances. IEEE Trans. Knowl. Data Eng. 34 (4) (2022)
Gábor N. Sárközy
Monochromatic square-cycle and square-path partitions. Discret. Math. 345 (3) (2022)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy
Linear Turán numbers of acyclic triple systems. Eur. J. Comb. 99 (2022)
Louis DeBiasio, András Gyárfás, Gábor N. Sárközy
Ramsey numbers of path-matchings, covering designs, and 1-cores. J. Comb. Theory, Ser. B 146 (2021)
András Gyárfás, Gábor N. Sárközy
Turán and Ramsey numbers in linear triple systems. Discret. Math. 344 (3) (2021)
András Gyárfás, Gábor N. Sárközy
Matchings with few colors in colored complete graphs and hypergraphs. Discret. Math. 343 (5) (2020)
Louis DeBiasio, Robert A. Krueger, Gábor N. Sárközy
Large monochromatic components in multicolored bipartite graphs. J. Graph Theory 94 (1) (2020)
Ramoza Ahsan, Rodica Neamtu, Muzammil Bashir, Elke A. Rundensteiner, Gábor N. Sárközy
Correlation-Based Analytics of Time Series Data. IEEE BigData (2020)
Ramoza Ahsan, Muzammil Bashir, Rodica Neamtu, Elke A. Rundensteiner, Gábor N. Sárközy
Nearest Neighbor Subsequence Search in Time Series Data. IEEE BigData (2019)
Rodica Neamtu, Ramoza Ahsan, Elke A. Rundensteiner, Gábor N. Sárközy, Eamonn J. Keogh, Hoang Anh Dau, Cuong Nguyen, Charles Lovering
Generalized Dynamic Time Warping: Unleashing the Warping Power Hidden in Point-Wise Distances. ICDE (2018)
János Barát, András Gyárfás, Gábor N. Sárközy
Rainbow matchings in bipartite multigraphs. Period. Math. Hung. 74 (1) (2017)
Rodica Neamtu, Ramoza Ahsan, Charles Lovering, Cuong Nguyen, Elke A. Rundensteiner, Gábor N. Sárközy
Interactive Time Series Analytics Powered by ONEX. SIGMOD Conference (2017)
András Gyárfás, Gábor N. Sárközy
Cliques in \(C_4\) -free graphs of large minimum degree. Period. Math. Hung. 74 (1) (2017)
András Gyárfás, Gábor N. Sárközy
Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition. Electron. J. Comb. 24 (3) (2017)
Gábor N. Sárközy
Monochromatic cycle power partitions. Discret. Math. 340 (2) (2017)
András Gyárfás, Gábor N. Sárközy
Ramsey Number of a Connected Triangle Matching. J. Graph Theory 83 (2) (2016)
Andrey Grinshpun, Gábor N. Sárközy
Monochromatic bounded degree subgraph partitions. Discret. Math. 339 (1) (2016)
János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy
Ramsey number of paths and connected matchings in Ore-type host graphs. Discret. Math. 339 (6) (2016)
András Gyárfás, Gábor N. Sárközy
Induced Colorful Trees and Paths in Large Chromatic Graphs. Electron. J. Comb. 23 (4) (2016)
Gábor N. Sárközy
On the Multi-Colored Ramsey Numbers of Paths and Even Cycles. Electron. J. Comb. 23 (3) (2016)
János Barát, Gábor N. Sárközy
Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles. J. Graph Theory 81 (4) (2016)
Rodica Neamtu, Ramoza Ahsan, Elke A. Rundensteiner, Gábor N. Sárközy
Interactive Time Series Exploration Powered by the Marriage of Similarity Distances. Proc. VLDB Endow. 10 (3) (2016)
András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems. Graphs Comb. 31 (1) (2015)
Guilherme Oliveira Mota, Gábor N. Sárközy, Mathias Schacht, Anusch Taraz
Ramsey numbers for bipartite graphs with small bandwidth. Eur. J. Comb. 48 (2015)
András Gyárfás, Gábor N. Sárközy
Rainbow matchings and cycle-free partial transversals of Latin squares. Discret. Math. 327 (2014)
Gábor N. Sárközy
Improved monochromatic loose cycle partitions in hypergraphs. Discret. Math. 334 (2014)
András Gyárfás, Gábor N. Sárközy
Monochromatic Loose-cycle Partitions in Hypergraphs. Electron. J. Comb. 21 (2) (2014)
József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy
Partitioning 2-edge-colored graphs by monochromatic paths and cycles. Comb. 34 (5) (2014)
Fei Song, Shubhendu Trivedi, Yutao Wang, Gábor N. Sárközy, Neil T. Heffernan
Applying Clustering to the Problem of Predicting Retention within an ITS: Comparing Regularity Clustering with Traditional Methods. FLAIRS Conference (2013)
András Gyárfás, Gábor N. Sárközy
Monochromatic Path and Cycle Partitions in Hypergraphs. Electron. J. Comb. 20 (1) (2013)
Gábor N. Sárközy, Stanley M. Selkow, Fei Song
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs. J. Graph Theory 73 (2) (2013)
Zachary A. Pardos, Shubhendu Trivedi, Neil T. Heffernan, Gábor N. Sárközy
Clustered Knowledge Tracing. ITS (2012)
András Gyárfás, Gábor N. Sárközy
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp. Comb. Probab. Comput. 21 (1-2) (2012)
Gábor N. Sárközy, Fei Song, Endre Szemerédi, Shubhendu Trivedi
A Practical Regularity Partitioning Algorithm and its Applications in Clustering CoRR (2012)
Shubhendu Trivedi, Zachary A. Pardos, Gábor N. Sárközy, Neil T. Heffernan
Co-Clustering by Bipartite Spectral Graph Partitioning for Out-of-Tutor Prediction. EDM (2012)
András Gyárfás, Gábor N. Sárközy
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle. Comb. Probab. Comput. 20 (1) (2011)
Shubhendu Trivedi, Zachary A. Pardos, Gábor N. Sárközy, Neil T. Heffernan
Spectral Clustering in Educational Data Mining. EDM (2011)
Gábor N. Sárközy, Stanley M. Selkow, Fei Song
Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs. Discret. Math. 311 (18-19) (2011)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Richard H. Schelp
Long rainbow cycles in proper edge-colorings of complete graphs. Australas. J Comb. 50 (2011)
Gábor N. Sárközy
Monochromatic cycle partitions of edge-colored graphs. J. Graph Theory 66 (1) (2011)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. Electron. J. Comb. 18 (1) (2011)
András Gyárfás, Gábor N. Sárközy
Gallai colorings of non-complete graphs. Discret. Math. 310 (5) (2010)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. J. Graph Theory 63 (4) (2010)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs. Graphs Comb. 26 (1) (2010)
Ian Levitt, Gábor N. Sárközy, Endre Szemerédi
How to avoid using the Regularity Lemma: Pósa's conjecture revisited. Discret. Math. 310 (3) (2010)
András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow
Ramsey-type results for Gallai colorings. J. Graph Theory 64 (3) (2010)
Gábor N. Sárközy
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs. Discret. Math. 309 (6) (2009)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
Stability of the path-path Ramsey number. Discret. Math. 309 (13) (2009)
András Gyárfás, Gábor N. Sárközy, Richard H. Schelp
Multipartite Ramsey numbers for odd cycles. J. Graph Theory 61 (1) (2009)
András Gyárfás, Gábor N. Sárközy
Size of monochromatic components in local edge colorings. Discret. Math. 308 (12) (2008)
Paul Dorbec, Sylvain Gravier, Gábor N. Sárközy
-tight Berge-cycles in hypergraphs. J. Graph Theory 59 (1) (2008)
Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
Inequalities for the first-fit chromatic number. J. Graph Theory 59 (1) (2008)
Gábor N. Sárközy, Stanley M. Selkow
Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discret. Math. 308 (23) (2008)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-color Ramsey numbers for paths. Comb. 28 (4) (2008)
András Gyárfás, Gábor N. Sárközy
Size of Monochromatic Double Stars in Edge Colorings. Graphs Comb. 24 (6) (2008)
Gábor N. Sárközy
On 2-factors with k components. Discret. Math. 308 (10) (2008)
András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory, Ser. B 98 (2) (2008)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs. Electron. J. Comb. 15 (1) (2008)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Tripartite Ramsey numbers for paths. J. Graph Theory 55 (2) (2007)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-Color Ramsey Numbers For Paths. Comb. 27 (1) (2007)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
An improved bound for the monochromatic cycle partition number. J. Comb. Theory, Ser. B 96 (6) (2006)
Gábor N. Sárközy, Stanley M. Selkow
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós. J. Graph Theory 52 (2) (2006)
András Sárközy, Gábor N. Sárközy
On the size of partial block designs with large blocks. Discret. Math. 305 (1-3) (2005)
Gábor N. Sárközy, Stanley M. Selkow
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós. Discret. Math. 297 (1-3) (2005)
Gábor N. Sárközy, Stanley M. Selkow
An Extension Of The Ruzsa-Szemerédi Theorem. Comb. 25 (1) (2004)
Gábor N. Sárközy, Stanley M. Selkow
An application of the regularity lemma in generalized Ramsey theory. J. Graph Theory 44 (1) (2003)
Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi
On the number of Hamiltonian cycles in Dirac graphs. Discret. Math. 265 (1-3) (2003)
Gábor N. Sárközy, Stanley M. Selkow
On bipartite generalized Ramsey theory. Ars Comb. 68 (2003)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
Proof of the Alon-Yuster conjecture. Discret. Math. 235 (1-3) (2001)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
Spanning Trees In Dense Graphs. Comb. Probab. Comput. 10 (5) (2001)
Gábor N. Sárközy, Stanley M. Selkow
On Edge Colorings with at Least q Colors in Every Subset of p Vertices. Electron. J. Comb. 8 (1) (2001)
Gábor N. Sárközy, Stanley M. Selkow
Vertex Partitions by Connected Monochromatic k-Regular Graphs. J. Comb. Theory, Ser. B 78 (1) (2000)
Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow
-ordered Hamiltonian graphs. J. Graph Theory 32 (1) (1999)
Gábor N. Sárközy
Complete tripartite subgraphs in the coprime graph of integers. Discret. Math. 202 (1-3) (1999)
Aron C. Atkins, Gábor N. Sárközy, Stanley M. Selkow
Counting irregular multigraphs. Discret. Math. 195 (1-3) (1999)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
On the Pósa-Seymour conjecture. J. Graph Theory 29 (3) (1998)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
An algorithmic version of the blow-up lemma. Random Struct. Algorithms 12 (3) (1998)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
Blow-Up Lemma. Comb. 17 (1) (1997)
Paul Erdös, Gábor N. Sárközy
On cycles in the coprime graph of integers. Electron. J. Comb. 4 (2) (1997)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
On the square of a Hamiltonian cycle in dense graphs. Random Struct. Algorithms 9 (1-2) (1996)
Gábor N. Sárközy
Cycles in bipartite graphs and an application in number theory. J. Graph Theory 19 (3) (1995)
János Komlós, Gábor N. Sárközy, Endre Szemerédi
proof of a Packing Conjecture of Bollobás. Comb. Probab. Comput. 4 (1995)