Béla Csaba

Publication Activity (10 Years)

Years Active: 1997-2021
Publications (10 Years): 7

Top Topics

Graph Embedding

Minimum Spanning Trees

Software Quality

Top Venues

Comb. Probab. Comput.

Electron. J. Comb.

Publications

József Balogh, Béla Csaba, András Pluhár, Andrew Treglown
A discrepancy version of the Hajnal-Szemerédi theorem. Comb. Probab. Comput. 30 (3) (2021)
József Balogh, Béla Csaba, Yifan Jing, András Pluhár
On the Discrepancies of Graphs. Electron. J. Comb. 27 (2) (2020)
Béla Csaba, Bálint Vásárhelyi
On the Relation of Separability, Bandwidth and Embedding. Graphs Comb. 35 (6) (2019)
Béla Csaba, Bálint Vásárhelyi
On embedding degree sequences. Informatica (Slovenia) 43 (1) (2019)
Béla Csaba, Judit Nagy-György
Embedding Graphs Having Ore-Degree at Most Five. SIAM J. Discret. Math. 33 (1) (2019)
József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár
On the path separation number of graphs. Discret. Appl. Math. 213 (2016)
Árpád Beszédes, Lajos Schrettner, Béla Csaba, Tamás Gergely, Judit Jász, Tibor Gyimóthy
Empirical investigation of SEA-based dependence cluster properties. Sci. Comput. Program. 105 (2015)
Béla Csaba, Thomas A. Plick, Ali Shokoufandeh
Optimal random matchings, tours, and spanning trees in hierarchically separated trees. Theor. Comput. Sci. 500 (2013)
Béla Csaba, Lajos Schrettner, Árpád Beszédes, Judit Jász, Péter Hegedüs, Tibor Gyimóthy
Relating Clusterization Measures and Software Quality. CSMR (2013)
Béla Csaba, Thomas A. Plick, Ali Shokoufandeh
Optimal Random Matchings, Tours, and Spanning Trees in Hierarchically Separated Trees. CoRR (2013)
Árpád Beszédes, Lajos Schrettner, Béla Csaba, Tamás Gergely, Judit Jász, Tibor Gyimóthy
Empirical investigation of SEA-based dependence cluster properties. SCAM (2013)
Béla Csaba, Thomas A. Plick, Ali Shokoufandeh
A note on the Caro-Tuza bound on the independence number of uniform hypergraphs. Australas. J Comb. 52 (2012)
Béla Csaba, Marcelo Mydlarz
Approximate multipartite version of the Hajnal-Szemerédi theorem. J. Comb. Theory, Ser. B 102 (2) (2012)
József Balogh, Béla Csaba, Wojciech Samotij
Local resilience of almost spanning trees in random graphs. Random Struct. Algorithms 38 (1-2) (2011)
József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij
Large Bounded Degree Trees in Expanding Graphs. Electron. J. Comb. 17 (1) (2010)
Béla Csaba, András Pluhár
A randomized algorithm for the on-line weighted bipartite matching problem. J. Sched. 11 (6) (2008)
Béla Csaba
On embedding well-separable graphs. Discret. Math. 308 (19) (2008)
Jeff Abrahamson, Béla Csaba, Ali Shokoufandeh
Optimal Random Matchings on Trees and Applications. APPROX-RANDOM (2008)
Béla Csaba
On the Bollobás-Eldridge Conjecture for Bipartite Graphs. Comb. Probab. Comput. 16 (5) (2007)
Béla Csaba, András Pluhár
A randomized algorithm for the on-line weighted bipartite matching problem CoRR (2007)
Béla Csaba
Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree. Electron. J. Comb. 14 (1) (2007)
Béla Csaba, Sachin Lodha
-server problem on a line. Random Struct. Algorithms 29 (1) (2006)
Béla Csaba, Ali Shokoufandeh, Endre Szemerédi
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. Comb. 23 (1) (2003)
Béla Csaba, Marek Karpinski, Piotr Krysta
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. SODA (2002)
Béla Csaba
Note on the Work Function Algorithm. Acta Cybern. 14 (3) (2000)
Béla Csaba
On the Partitioning Algorithm. Acta Cybern. 14 (2) (1999)
Béla Csaba, G. Dányi
Server Problems and Regular Languages. Acta Cybern. 13 (1) (1997)