Konrad Borys

According to our database, Konrad Borys authored at least 8 papers between 2005 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Combinatorial games modeling seki in GO.

Andrey Gol'berg, Vladimir Gurvich, Diogo Vieira Andrade, Konrad Borys, Gábor Rudolf

Discret. Math., 2014

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

Generating 3-vertex connected spanning subgraphs.

Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf

Discret. Math., 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 Cut Conjunctions in Graphs and Related Problems.

Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino

Algorithmica, 2008

2007

Generating Minimal k-Vertex Connected Spanning Subgraphs.

Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Enumerating Spanning and Connected Subsets in Graphs and Matroids.

Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino

Proceedings of the Algorithms, 2006

2005

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.

Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005