|
Search the dblp DataBase
Konrad Borys:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Enumerating Spanning and Connected Subsets in Graphs and Matroids. [Citation Graph (0, 0)][DBLP] ESA, 2006, pp:444-455 [Conf]
- Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:156-165 [Conf]
- Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
Generating all vertices of a polyhedron is hard. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:758-765 [Conf]
- Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
Generating Minimal k-Vertex Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:222-231 [Conf]
Generating Cut Conjunctions in Graphs and Related Problems. [Citation Graph (, )][DBLP]
Generating All Vertices of a Polyhedron Is Hard. [Citation Graph (, )][DBLP]
Generating 3-vertex connected spanning subgraphs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
|