| 2008 |
|---|
| 12 | EE | Jeff Abrahamson,
Béla Csaba,
Ali Shokoufandeh:
Optimal Random Matchings on Trees and Applications.
APPROX-RANDOM 2008: 254-265 |
| 11 | EE | Béla Csaba:
On embedding well-separable graphs.
Discrete Mathematics 308(19): 4322-4331 (2008) |
| 10 | EE | Béla Csaba,
András Pluhár:
A randomized algorithm for the on-line weighted bipartite matching problem.
J. Scheduling 11(6): 449-455 (2008) |
| 2007 |
|---|
| 9 | EE | Béla Csaba,
András Pluhár:
A randomized algorithm for the on-line weighted bipartite matching problem
CoRR abs/0705.4673: (2007) |
| 8 | EE | Béla Csaba:
On the Bollobás-Eldridge Conjecture for Bipartite Graphs.
Combinatorics, Probability & Computing 16(5): 661-691 (2007) |
| 7 | EE | Béla Csaba:
Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree.
Electr. J. Comb. 14(1): (2007) |
| 2006 |
|---|
| 6 | EE | Béla Csaba,
Sachin Lodha:
A randomized on-line algorithm for the k-server problem on a line.
Random Struct. Algorithms 29(1): 82-104 (2006) |
| 2003 |
|---|
| 5 | EE | Béla Csaba,
Ali Shokoufandeh,
Endre Szemerédi:
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three.
Combinatorica 23(1): 35-72 (2003) |
| 2002 |
|---|
| 4 | EE | Béla Csaba,
Marek Karpinski,
Piotr Krysta:
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.
SODA 2002: 74-83 |
| 2000 |
|---|
| 3 | EE | Béla Csaba:
Note on the Work Function Algorithm.
Acta Cybern. 14(3): 503-506 (2000) |
| 1999 |
|---|
| 2 | EE | Béla Csaba:
On the Partitioning Algorithm.
Acta Cybern. 14(2): 217-228 (1999) |
| 1997 |
|---|
| 1 | EE | Béla Csaba,
G. Dányi:
Server Problems and Regular Languages.
Acta Cybern. 13(1): 23-40 (1997) |
