Béla Csaba

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