Statistics
Publications
6
Citations
313
H-Index
6
Active since
2006
Konrad Borys is an author at Rutgers, The State University of New Jersey specializing in computer science, combinatorial optimization, and natural sciences.
Publications per year
2006–2008
6
6
Generating All Vertices of a Polyhedron Is Hard
Leonid Khachiyan, Endre Boros, Konrad Borys et al. · Discrete & Computational Geometry · 2008 · 133 citations · Full text
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
Leonid Khachiyan, Endre Boros, Konrad Borys et al. · Theory of Computing Systems · 2007 · 106 citations · Full text
Generating all vertices of a polyhedron is hard
Leonid Khachiyan, Endre Boros, Konrad Borys et al. · Symposium on Discrete Algorithms · 2006 · 25 citations
Generating Cut Conjunctions in Graphs and Related Problems
Leonid Khachiyan, Endre Boros, Konrad Borys et al. · Algorithmica · 2007 · 16 citations · Full text
1–5 of 6