Concepedia

Konrad Borys

KB

6

Publications

306

Citations

6

H-Index

2006

Active since

Affiliations

Rutgers, The State University of New Jersey(Current)

Max Planck Society

Max Planck Institute for Informatics

Konrad Borys is an author at Rutgers, The State University of New Jersey specializing in graph theory, discrete mathematics, and engineering.

Top concepts

EngineeringGraph TheoryDiscrete MathematicsCombinatorial OptimizationComputer ScienceComputational ComplexityNatural SciencesGeometry ModelingLinear ProgrammingComputer-aided Design

Publications per year

2006–2008

6

Publications

6

Generating All Vertices of a Polyhedron Is Hard

Leonid Khachiyan, Endre Boros, Konrad Borys et al. · Discrete & Computational Geometry · 2008 · 126 citations · Full text

Mathematical Programming, Engineering, Planar Graph +19

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

Mathematical Programming, Engineering, Planar Graph +20

Enumerating Spanning and Connected Subsets in Graphs and Matroids

Leonid Khachiyan, Endre Boros, Konrad Borys et al. · Lecture notes in computer science · 2006 · 20 citations

Matroid Theory, Network Science, Graph Theory +8

Generating Cut Conjunctions in Graphs and Related Problems

Leonid Khachiyan, Endre Boros, Konrad Borys et al. · Algorithmica · 2007 · 16 citations · Full text

Engineering, Cut Conjunctions, Network Analysis +18

Rows per page

1–5 of 6