The following pages link to Konrad Borys (Q929287):
Displaying 3 items.
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385037) (← links)
