Konrad Borys

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Combinatorial games modeling seki in Go Discrete Mathematics	2014-06-25	Paper
Generating all vertices of a polyhedron is hard Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06	2010-08-16	Paper
Generating all vertices of a polyhedron is hard	2009-04-14	Paper
Generating Minimal k-Vertex Connected Spanning Subgraphs Lecture Notes in Computer Science	2009-03-06	Paper
Generating 3-vertex connected spanning subgraphs Discrete Mathematics	2009-01-28	Paper
Generating cut conjunctions in graphs and related problems Algorithmica	2008-07-01	Paper
On short paths interdiction problems: Total and node-wise limited interdiction Theory of Computing Systems	2008-06-17	Paper
ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) Journal of the Operations Research Society of Japan	2008-04-29	Paper
Generating all vertices of a polyhedron is hard Discrete & Computational Geometry	2008-04-16	Paper
Enumerating Spanning and Connected Subsets in Graphs and Matroids Lecture Notes in Computer Science	2008-03-11	Paper
Algorithms and Computation Lecture Notes in Computer Science	2006-11-14	Paper

Research outcomes over time

This page was built for person: Konrad Borys