Server Problems and Regular Languages. - Béla Csaba; G. Dányi (Acta Cybern., 1997)

On the Partitioning Algorithm. - Béla Csaba (Acta Cybern., 1999)

Note on the Work Function Algorithm. - Béla Csaba (Acta Cybern., 2000)

Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. - Béla Csaba; Marek Karpinski; Piotr Krysta (SODA, 2002)

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)

A randomized on-line algorithm for the k-server problem on a line. - Béla Csaba; Sachin Lodha (Random Struct. Algorithms, 2006)

Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree. - Béla Csaba (Electron. J. Comb., 2007)

On the Bollobás-Eldridge Conjecture for Bipartite Graphs. - Béla Csaba (Comb. Probab. Comput., 2007)

Optimal Random Matchings on Trees and Applications. - Jeff Abrahamson; Béla Csaba; Ali Shokoufandeh (APPROX-RANDOM, 2008)

On embedding well-separable graphs. - Béla Csaba (Discret. Math., 2008)

A randomized algorithm for the on-line weighted bipartite matching problem. - Béla Csaba; András Pluhár (J. Sched., 2008)

Large Bounded Degree Trees in Expanding Graphs. - József Balogh; Béla Csaba; Martin Pei; Wojciech Samotij (Electron. J. Comb., 2010)

Local resilience of almost spanning trees in random graphs. - József Balogh; Béla Csaba; Wojciech Samotij (Random Struct. Algorithms, 2011)

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)

Approximate multipartite version of the Hajnal-Szemerédi theorem. - Béla Csaba; Marcelo Mydlarz (J. Comb. Theory B, 2012)

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 (CSMR, 2013)

Optimal random matchings, tours, and spanning trees in hierarchically separated trees. - Béla Csaba; Thomas A. Plick; Ali Shokoufandeh (Theor. Comput. Sci., 2013)

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)

On the path separation number of graphs. - József Balogh; Béla Csaba; Ryan R. Martin; András Pluhár (Discret. Appl. Math., 2016)

On the Relation of Separability, Bandwidth and Embedding. - Béla Csaba; Bálint Vásárhelyi (Graphs Comb., 2019)

On embedding degree sequences. - Béla Csaba; Bálint Vásárhelyi (Informatica (Slovenia), 2019)

Embedding Graphs Having Ore-Degree at Most Five. - Béla Csaba; Judit Nagy-György (SIAM J. Discret. Math., 2019)

On the Discrepancies of Graphs. - József Balogh; Béla Csaba; Yifan Jing; András Pluhár (Electron. J. Comb., 2020)

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)

On the Advice Complexity of Online Matching on the Line. - Béla Csaba; Judit Nagy-György (Discret. Math. Theor. Comput. Sci., 2024)

On the Ramsey-Turán Problem for 4-Cliques. - Béla Csaba (SIAM J. Discret. Math., 2025)