Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (ISAAC, 2005)

Enumerating Spanning and Connected Subsets in Graphs and Matroids. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (ESA, 2006)

Generating Minimal k-Vertex Connected Spanning Subgraphs. - Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Gábor Rudolf (COCOON, 2007)

Generating Cut Conjunctions in Graphs and Related Problems. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino (Algorithmica, 2008)

Generating All Vertices of a Polyhedron Is Hard. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich (Discret. Comput. Geom., 2008)

Generating 3-vertex connected spanning subgraphs. - Endre Boros; Konrad Borys; Vladimir Gurvich; Gábor Rudolf (Discret. Math., 2008)

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. - Leonid Khachiyan; Endre Boros; Konrad Borys; Khaled M. Elbassioni; Vladimir Gurvich; Gábor Rudolf; Jihui Zhao (Theory Comput. Syst., 2008)

Combinatorial games modeling seki in GO. - Andrey Gol'berg; Vladimir Gurvich; Diogo Vieira Andrade; Konrad Borys; Gábor Rudolf (Discret. Math., 2014)