The following pages link to Konrad Borys (Q929287):
Displaying 11 items.
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Generating 3-vertex connected spanning subgraphs (Q998366) (← links)
- Combinatorial games modeling seki in Go (Q2017043) (← links)
- Generating Minimal k-Vertex Connected Spanning Subgraphs (Q3608847) (← links)
- (Q3619946) (← links)
- ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385037) (← links)
- Enumerating Spanning and Connected Subsets in Graphs and Matroids (Q5449549) (← links)
- Algorithms and Computation (Q5897849) (← links)
- Generating all vertices of a polyhedron is hard (Q5901119) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
