| 2008 |
|---|
| 8 | EE | Leonid Khachiyan,
Endre Boros,
Konrad Borys,
Khaled M. Elbassioni,
Vladimir Gurvich,
Kazuhisa Makino:
Generating Cut Conjunctions in Graphs and Related Problems.
Algorithmica 51(3): 239-263 (2008) |
| 7 | EE | Leonid Khachiyan,
Endre Boros,
Konrad Borys,
Khaled M. Elbassioni,
Vladimir Gurvich:
Generating All Vertices of a Polyhedron Is Hard.
Discrete & Computational Geometry 39(1-3): 174-190 (2008) |
| 6 | EE | Endre Boros,
Konrad Borys,
Vladimir Gurvich,
Gábor Rudolf:
Generating 3-vertex connected spanning subgraphs.
Discrete Mathematics 308(24): 6285-6297 (2008) |
| 5 | 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 |
|---|
| 4 | 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 |
| 2006 |
|---|
| 3 | EE | Leonid Khachiyan,
Endre Boros,
Konrad Borys,
Khaled M. Elbassioni,
Vladimir Gurvich,
Kazuhisa Makino:
Enumerating Spanning and Connected Subsets in Graphs and Matroids.
ESA 2006: 444-455 |
| 2 | EE | Leonid Khachiyan,
Endre Boros,
Konrad Borys,
Khaled M. Elbassioni,
Vladimir Gurvich:
Generating all vertices of a polyhedron is hard.
SODA 2006: 758-765 |
| 2005 |
|---|
| 1 | EE | Leonid Khachiyan,
Endre Boros,
Konrad Borys,
Khaled M. Elbassioni,
Vladimir Gurvich,
Kazuhisa Makino:
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.
ISAAC 2005: 156-165 |
