Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Konrad
Last name:	Borys
DBLP:	04/4023
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 8 of 8  

Select a publication
Show	Title	Venue	Rating	Date
	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. Generating Cut Conjunctions in Graphs and Related Problems.	Algorithmica 2008, Volume 51	(0)	2008
	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich. Generating All Vertices of a Polyhedron Is Hard.	Discrete Computational Geometry 2008, Volume 39	(0)	2008
	Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf. Generating 3-vertex connected spanning subgraphs.	Discrete Mathematics 2008, Volume 308	(0)	2008
	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. 2008, Volume 43	(0)	2008
	Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf. Generating Minimal k-Vertex Connected Spanning Subgraphs.	Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings 2007	(0)	2007
	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. Enumerating Spanning and Connected Subsets in Graphs and Matroids.	Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings 2006	(0)	2006
	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich. Generating all vertices of a polyhedron is hard.	Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006 2006	(0)	2006
	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.	Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings 2005	(0)	2005

Your query returned 8 matches in the database.