Béla Csaba

According to our database1, Béla Csaba authored at least 23 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the Discrepancies of Graphs.
Electron. J. Comb., 2020

2019
Embedding Graphs Having Ore-Degree at Most Five.
SIAM J. Discret. Math., 2019

On embedding degree sequences.
Informatica (Slovenia), 2019

On the Relation of Separability, Bandwidth and Embedding.
Graphs Comb., 2019

2016
On the path separation number of graphs.
Discret. Appl. Math., 2016

2015
Empirical investigation of SEA-based dependence cluster properties.
Sci. Comput. Program., 2015

2013
Optimal random matchings, tours, and spanning trees in hierarchically separated trees.
Theor. Comput. Sci., 2013

Relating Clusterization Measures and Software Quality.
Proceedings of the 17th European Conference on Software Maintenance and Reengineering, 2013

2012
Approximate multipartite version of the Hajnal-Szemerédi theorem.
J. Comb. Theory, Ser. B, 2012

A note on the Caro-Tuza bound on the independence number of uniform hypergraphs.
Australas. J Comb., 2012

2011
Local resilience of almost spanning trees in random graphs.
Random Struct. Algorithms, 2011

2010
Large Bounded Degree Trees in Expanding Graphs.
Electron. J. Comb., 2010

2008
A randomized algorithm for the on-line weighted bipartite matching problem.
J. Sched., 2008

On embedding well-separable graphs.
Discret. Math., 2008

Optimal Random Matchings on Trees and Applications.
Proceedings of the Approximation, 2008

2007
On the Bollobás-Eldridge Conjecture for Bipartite Graphs.
Comb. Probab. Comput., 2007

Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree.
Electron. J. Comb., 2007

2006
A randomized on-line algorithm for the <i>k</i>-server problem on a line.
Random Struct. Algorithms, 2006

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

2002
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2000
Note on the Work Function Algorithm.
Acta Cybern., 2000

1999
On the Partitioning Algorithm.
Acta Cybern., 1999

1997
Server Problems and Regular Languages.
Acta Cybern., 1997


  Loading...