Konrad Borys

From MaRDI portal
Person:929287

Available identifiers

zbMath Open borys.konradMaRDI QIDQ929287

List of research outcomes





PublicationDate of PublicationType
Combinatorial games modeling seki in Go2014-06-25Paper
Generating all vertices of a polyhedron is hard2010-08-16Paper
Generating all vertices of a polyhedron is hard2009-04-14Paper
Generating Minimal k-Vertex Connected Spanning Subgraphs2009-03-06Paper
Generating 3-vertex connected spanning subgraphs2009-01-28Paper
Generating cut conjunctions in graphs and related problems2008-07-01Paper
On short paths interdiction problems: Total and node-wise limited interdiction2008-06-17Paper
ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)2008-04-29Paper
Generating all vertices of a polyhedron is hard2008-04-16Paper
Enumerating Spanning and Connected Subsets in Graphs and Matroids2008-03-11Paper
Algorithms and Computation2006-11-14Paper

Research outcomes over time

This page was built for person: Konrad Borys

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:929287&oldid=7291232"
Powered by MediaWiki