Béla Csaba

According to our database, Béla Csaba authored at least 24 papers between 1997 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

A discrepancy version of the Hajnal-Szemerédi theorem.

József Balogh, Béla Csaba, András Pluhár, Andrew Treglown

Comb. Probab. Comput., 2021

2020

On the Discrepancies of Graphs.

József Balogh, Béla Csaba, Yifan Jing, András Pluhár

Electron. J. Comb., 2020

2019

Embedding Graphs Having Ore-Degree at Most Five.

Béla Csaba, Judit Nagy-György

SIAM J. Discret. Math., 2019

On embedding degree sequences.

Béla Csaba, Bálint Vásárhelyi

Informatica (Slovenia), 2019

On the Relation of Separability, Bandwidth and Embedding.

Béla Csaba, Bálint Vásárhelyi

Graphs Comb., 2019

2016

On the path separation number of graphs.

József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár

Discret. Appl. Math., 2016

2015

Empirical investigation of SEA-based dependence cluster properties.

Árpád Beszédes, Lajos Schrettner, Béla Csaba, Tamás Gergely, Judit Jász, Tibor Gyimóthy

Sci. Comput. Program., 2015

2013

Optimal random matchings, tours, and spanning trees in hierarchically separated trees.

Béla Csaba, Thomas A. Plick, Ali Shokoufandeh

Theor. Comput. Sci., 2013

Relating Clusterization Measures and Software Quality.

Béla Csaba, Lajos Schrettner, Árpád Beszédes, Judit Jász, Péter Hegedüs, Tibor Gyimóthy

Proceedings of the 17th European Conference on Software Maintenance and Reengineering, 2013

2012

Approximate multipartite version of the Hajnal-Szemerédi theorem.

Béla Csaba, Marcelo Mydlarz

J. Comb. Theory, Ser. B, 2012

A note on the Caro-Tuza bound on the independence number of uniform hypergraphs.

Béla Csaba, Thomas A. Plick, Ali Shokoufandeh

Australas. J Comb., 2012

2011

Local resilience of almost spanning trees in random graphs.

József Balogh, Béla Csaba, Wojciech Samotij

Random Struct. Algorithms, 2011

2010

Large Bounded Degree Trees in Expanding Graphs.

József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij

Electron. J. Comb., 2010

2008

A randomized algorithm for the on-line weighted bipartite matching problem.

Béla Csaba, András Pluhár

J. Sched., 2008

On embedding well-separable graphs.

Béla Csaba

Discret. Math., 2008

Optimal Random Matchings on Trees and Applications.

Jeff Abrahamson, Béla Csaba, Ali Shokoufandeh

Proceedings of the Approximation, 2008

2007

On the Bollobás-Eldridge Conjecture for Bipartite Graphs.

Béla Csaba

Comb. Probab. Comput., 2007

Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree.

Béla Csaba

Electron. J. Comb., 2007

2006

A randomized on-line algorithm for the <i>k</i>-server problem on a line.

Béla Csaba, Sachin Lodha

Random Struct. Algorithms, 2006

2003

Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three.

Béla Csaba, Ali Shokoufandeh, Endre Szemerédi

Comb., 2003

2002

Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.

Béla Csaba, Marek Karpinski, Piotr Krysta

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2000

Note on the Work Function Algorithm.

Béla Csaba

Acta Cybern., 2000

1999

On the Partitioning Algorithm.

Béla Csaba

Acta Cybern., 1999

1997

Server Problems and Regular Languages.

Béla Csaba, G. Dányi

Acta Cybern., 1997