| 2008 |
|---|
| 5 | EE | Endre Boros,
Konrad Borys,
Vladimir Gurvich,
Gábor Rudolf:
Generating 3-vertex connected spanning subgraphs.
Discrete Mathematics 308(24): 6285-6297 (2008) |
| 4 | EE | Leonid Khachiyan,
Endre Boros,
Konrad Borys,
Khaled M. Elbassioni,
Vladimir Gurvich,
Gábor Rudolf,
Jihui Zhao:
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction.
Theory Comput. Syst. 43(2): 204-233 (2008) |
| 2007 |
|---|
| 3 | EE | Endre Boros,
Konrad Borys,
Khaled M. Elbassioni,
Vladimir Gurvich,
Kazuhisa Makino,
Gábor Rudolf:
Generating Minimal k-Vertex Connected Spanning Subgraphs.
COCOON 2007: 222-231 |
| 2 | | Vadim V. Lozin,
Gábor Rudolf:
Minimal Universal Bipartite Graphs.
Ars Comb. 84: (2007) |
| 2006 |
|---|
| 1 | EE | Nilay Noyan,
Gábor Rudolf,
Andrzej Ruszczynski:
Relaxations of linear programming problems with first order stochastic dominance constraints.
Oper. Res. Lett. 34(6): 653-659 (2006) |
