{"_id":"Aam2ANRT3yBcj3zFH","authorIDs":[],"author_short":["Boros, E","Elbassioni, K","Gurvich, V","Khachiyan, L"],"bibbaseid":"boros-elbassioni-gurvich-khachiyan-enumeratingminimaldicutsandstronglyconnectedsubgraphsandrelatedgeometricproblems-2004","bibdata":{"address":"New York, NY, USA","author":["Boros, E","Elbassioni, K","Gurvich, V","Khachiyan, L"],"author_short":["Boros, E","Elbassioni, K","Gurvich, V","Khachiyan, L"],"bibtex":"@inproceedings{ Boros2004b,\n address = {New York, NY, USA},\n author = {Boros, E and Elbassioni, K and Gurvich, V and Khachiyan, L},\n booktitle = {ICCO 2004: the 10th International Conference on Integer Programming and Combinatorial Optimization},\n doi = {10.1007/978-3-540-25960-2_12},\n editor = {Bienstock, Daniel and Nemhauser, George},\n file = {:Users/KunihiroWASA/Dropbox/paper/2004/Boros et al., Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems, 2004.pdf:pdf},\n month = {June},\n pages = {152--162},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science},\n title = {{Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems}},\n url = {http://link.springer.com/chapter/10.1007/978-3-540-25960-2_12},\n volume = {3064},\n year = {2004}\n}","bibtype":"inproceedings","booktitle":"ICCO 2004: the 10th International Conference on Integer Programming and Combinatorial Optimization","doi":"10.1007/978-3-540-25960-2_12","editor":["Bienstock, Daniel","Nemhauser, George"],"editor_short":["Bienstock, D.","Nemhauser, G."],"file":":Users/KunihiroWASA/Dropbox/paper/2004/Boros et al., Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems, 2004.pdf:pdf","id":"Boros2004b","key":"Boros2004b","month":"June","pages":"152--162","publisher":"Springer Berlin Heidelberg","series":"Lecture Notes in Computer Science","title":"Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems","type":"inproceedings","url":"http://link.springer.com/chapter/10.1007/978-3-540-25960-2_12","volume":"3064","year":"2004","bibbaseid":"boros-elbassioni-gurvich-khachiyan-enumeratingminimaldicutsandstronglyconnectedsubgraphsandrelatedgeometricproblems-2004","role":"author","urls":{"Paper":"http://link.springer.com/chapter/10.1007/978-3-540-25960-2_12"},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.024Z","downloads":0,"keywords":[],"search_terms":["enumerating","minimal","dicuts","strongly","connected","subgraphs","related","geometric","problems","boros","elbassioni","gurvich","khachiyan"],"title":"Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems","year":2004,"dataSources":["YRMeqhMHoNu9HzJoC"]}