
Search the dblp DataBase
Béla Csaba:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Béla Csaba, Marek Karpinski, Piotr Krysta
Approximability of dense and sparse instances of minimum 2connectivity, TSP and path problems. [Citation Graph (0, 0)][DBLP] SODA, 2002, pp:7483 [Conf]
 Béla Csaba
Note on the Work Function Algorithm. [Citation Graph (0, 0)][DBLP] Acta Cybern., 2000, v:14, n:3, pp:503506 [Journal]
 Béla Csaba
On the Partitioning Algorithm. [Citation Graph (0, 0)][DBLP] Acta Cybern., 1999, v:14, n:2, pp:217228 [Journal]
 Béla Csaba, G. Dányi
Server Problems and Regular Languages. [Citation Graph (0, 0)][DBLP] Acta Cybern., 1997, v:13, n:1, pp:2340 [Journal]
 Béla Csaba, Ali Shokoufandeh, Endre Szemerédi
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. [Citation Graph (0, 0)][DBLP] Combinatorica, 2003, v:23, n:1, pp:3572 [Journal]
 Béla Csaba, Sachin Lodha
A randomized online algorithm for the kserver problem on a line. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2006, v:29, n:1, pp:82104 [Journal]
 Béla Csaba, András Pluhár
A randomized algorithm for the online weighted bipartite matching problem [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp: [Journal]
Optimal Random Matchings on Trees and Applications. [Citation Graph (, )][DBLP]
Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree. [Citation Graph (, )][DBLP]
On the BollobásEldridge Conjecture for Bipartite Graphs. [Citation Graph (, )][DBLP]
On embedding wellseparable graphs. [Citation Graph (, )][DBLP]
Search in 0.015secs, Finished in 0.016secs
