( en | de | ru )

 

Disambiguation of "Borys, Konrad"

Author of the publication

copydeleteadd this publication to your clipboard
Generating Minimal k-Vertex Connected Spanning Subgraphs.

, , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 222-231. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Grigor Borys

Wulf-Eckhard Borys

Borys Frankewycz

Borys Salamander

Borys Bondarʹ

 

Other publications of authors with the same name

Generating all vertices of a polyhedron is hard., , , , and . SODA, page 758-765. ACM Press, (2006)Generating Cut Conjunctions in Graphs and Related Problems., , , , , and . Algorithmica, 51 (3): 239-263 (2008)Generating Minimal k-Vertex Connected Spanning Subgraphs., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 222-231. Springer, (2007)Combinatorial games modeling seki in GO., , , , and . Discret. Math., (2014)On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction., , , , , , and . Theory Comput. Syst., 43 (2): 204-233 (2008)Generating 3-vertex connected spanning subgraphs., , , and . Discret. Math., 308 (24): 6285-6297 (2008)Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs., , , , , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 156-165. Springer, (2005)Generating All Vertices of a Polyhedron Is Hard., , , , and . Discret. Comput. Geom., 39 (1-3): 174-190 (2008)Enumerating Spanning and Connected Subsets in Graphs and Matroids., , , , , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 444-455. Springer, (2006)