{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:34Z","timestamp":1751342854226,"version":"3.41.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1023\/a:1009802905533","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"235-251","source":"Crossref","is-referenced-by-count":1,"title":["On Integrality, Stability and Composition of Dicycle Packings and Covers"],"prefix":"10.1007","volume":"4","author":[{"given":"Zeev","family":"Nutov","sequence":"first","affiliation":[]},{"given":"Michal","family":"Penn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"264576_CR1","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1137\/S0895480190182691","volume":"7","author":"F. Barahona","year":"1994","unstructured":"F. Barahona, J. Foulupt, and A.R. Mahjoub, \u201cComposition of graphs and polyhedra IV: Acyclic spanning subgraphs,\u201d SIAM J. Discrete Math., vol. 7, no. 3, pp. 390\u2013402, 1994.","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"264576_CR2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0895480190182678","volume":"7","author":"F. Barahona","year":"1994","unstructured":"F. Barahona and A.R. Mahjoub, \u201cComposition of graphs and polyhedra II: Stable sets,\u201d SIAM J. Discrete Math., vol. 7, no. 3, pp. 359\u2013371, 1994a.","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"264576_CR3","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1137\/S089548019018268X","volume":"7","author":"F. Barahona","year":"1994","unstructured":"F. Barahona and A.R. Mahjoub, \u201cComposition of graphs and polyhedra III: Graphs with no W\n4 minor,\u201d SIAM J. Discrete Math., vol. 7, no. 3, pp. 372\u2013389, 1994b.","journal-title":"SIAM J. Discrete Math."},{"key":"264576_CR4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"K.S. Booth and G.S. Lueker, \u201cTesting for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms,\u201d J. Comp. Sys. Sci., vol. 13, pp. 335\u2013379, 1976.","journal-title":"J. Comp. Sys. Sci."},{"key":"264576_CR5","doi-asserted-by":"crossref","unstructured":"G. Even, J. Naor, S. Rao, and B. Shieber, \u201cDivide-and-conquer approximation algorithms via spreading metrics,\u201d in Proc. 36th FOCS, 1995, pp. 62\u201371.","DOI":"10.1109\/SFCS.1995.492463"},{"key":"264576_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230200102","volume":"20","author":"M.M. Flood","year":"1990","unstructured":"M.M. Flood, \u201cExact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem,\u201d Networks, vol. 20, pp. 1\u201323, 1990.","journal-title":"Networks"},{"key":"264576_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02579270","volume":"1","author":"A. Frank","year":"1981","unstructured":"A. Frank, \u201cHow to make a digraph strongly connected,\u201d Combinatorica, vol. 1, pp. 145\u2013153, 1981.","journal-title":"Combinatorica"},{"key":"264576_CR8","unstructured":"H.N. Gabow, \u201cA representation for crossing set families with application to submodular flow problems,\u201d in Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 202\u2013211."},{"key":"264576_CR9","unstructured":"A. Galluccio and M. Loebl, \u201cEven directed cycles in H-free graphs,\u201d IASI T.R. No. 410, July, 1995."},{"key":"264576_CR10","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger, and G. Reinelt, \u201cAcyclic subdigraphs and linear orderings: Polytopes, facets, and a cutting plane algorithm,\u201d in Graphs and Orders, I. Rival (Ed.), D. Reidel Publishing Company, 1985, pp. 217\u2013264.","DOI":"10.1007\/978-94-009-5315-4_7"},{"key":"264576_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag: Berlin, 1988."},{"key":"264576_CR12","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1090\/S0002-9904-1943-08065-2","volume":"49","author":"D.W. Hall","year":"1943","unstructured":"D.W. Hall, \u201cA note on primitive skew curves,\u201d Bull. Amer. Math. Soc., vol. 49, pp. 935\u2013937, 1943.","journal-title":"Bull. Amer. Math. Soc."},{"key":"264576_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"J.E. Hopcroft and R.E. Tarjan, \u201cDividing a graph into triconnected components,\u201d SIAM J. Comput. 2, pp. 135\u2013158, 1973.","journal-title":"SIAM J. Comput."},{"key":"264576_CR14","unstructured":"M. J\u00fcnger, Polyhedral Combinatorics and the Acyclic Subdigraph Problem, Heldermann Verlag, 1985."},{"key":"264576_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinatorial problems,\u201d in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Eds.), Plemum Press: New-York, 1972, pp. 85\u2013103."},{"key":"264576_CR16","unstructured":"A. Karzanov, \u201cOn the minimal number of arcs of a digraph meeting all its directed cutsets,\u201d Graph Theory Newsletters, vol. 8, no. 4, 1979, Abstract."},{"key":"264576_CR17","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1090\/conm\/147\/01205","volume":"147","author":"A.K. Kelmans","year":"1991","unstructured":"A.K. Kelmans, \u201cGraph planarity and related topics,\u201d Contemporary Math., vol. 147, pp. 635\u2013667, 1991.","journal-title":"Contemporary Math."},{"key":"264576_CR18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0890-5401(90)90031-C","volume":"84","author":"S. Khuller","year":"1990","unstructured":"S. Khuller, \u201cExtended planar graph algorithms to K\n3,3-free graphs,\u201d Information and Computation, vol. 84, pp. 13\u201325, 1990.","journal-title":"Information and Computation"},{"key":"264576_CR19","volume-title":"The acyclic subgraph problem","author":"H.W. Lenstra Jr.","year":"1973","unstructured":"H.W. Lenstra, Jr., \u201cThe acyclic subgraph problem,\u201d Report BW26, Mathematisch Centrum, Amsterdam, 1973."},{"key":"264576_CR20","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","volume":"21","author":"L. Lov\u00e0sz","year":"1976","unstructured":"L. Lov\u00e0sz, \u201cOn two minimax theorems in graph theory,\u201d J. Combinatorial Theory (B), vol. 21, pp. 96\u2013103, 1976.","journal-title":"J. Combinatorial Theory (B)"},{"key":"264576_CR21","volume-title":"A minimax equality for directed graphs","author":"C.L. Lucchesi","year":"1976","unstructured":"C.L. Lucchesi, \u201cA minimax equality for directed graphs,\u201d Ph.D. Dissertation, University of Waterloo, Waterloo, Ontario, 1976."},{"issue":"2","key":"264576_CR22","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C.L. Lucchesi","year":"1978","unstructured":"C.L. Lucchesi and D.H. Younger, \u201cA minimax relation for directed graphs,\u201d J. London Math. Soc., vol. 17, no. 2, pp. 369\u2013374, 1978.","journal-title":"J. London Math. Soc."},{"key":"264576_CR23","volume-title":"Optimisation en analyse ordinale des donn\u00e9es","author":"J.F. Mascotorchino","year":"1979","unstructured":"J.F. Mascotorchino and P. Michand, Optimisation en analyse ordinale des donn\u00e9es, Masson: Paris, 1979."},{"key":"264576_CR24","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/(SICI)1097-0037(199808)32:1<67::AID-NET5>3.0.CO;2-H","volume":"32","author":"R. Manor","year":"1998","unstructured":"R. Manor and M. Penn, \u201cAn extended planar algorithm for maximum integral two-flow,\u201d Networks, vol. 32, pp. 67\u201376, 1998.","journal-title":"Networks"},{"key":"264576_CR25","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0166-218X(94)00060-Q","volume":"60","author":"Z. Nutov","year":"1995","unstructured":"Z. Nutov and M. Penn, \u201cOn the integral dicycle packings and covers and the Linear Ordering Polytope,\u201d Discrete Applied Mathematics, vol. 60, pp. 293\u2013309, 1995.","journal-title":"Discrete Applied Mathematics"},{"key":"264576_CR26","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0196-6774(88)90022-3","volume":"9","author":"V. Ramachandran","year":"1998","unstructured":"V. Ramachandran, \u201cFinding a minimum feedback arc set in reducible flow graphs,\u201d J. of Algorithms, vol. 9, pp. 299\u2013313, 1998.","journal-title":"J. of Algorithms"},{"key":"264576_CR27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P. Seymour","year":"1995","unstructured":"P. Seymour, \u201cPacking directed circuits fractionally,\u201d Combinatorica, vol. 15, pp. 281\u2013288, 1995.","journal-title":"Combinatorica"},{"key":"264576_CR28","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/0890-5401(89)90017-5","volume":"80","author":"V.V. Vazirani","year":"1989","unstructured":"V.V. Vazirani, \u201cNC algorithms for computing the number of perfect matchings in K\n3,3-free graphs and related problems,\u201d Information and Computation, vol. 80, pp. 152\u2013164, 1989.","journal-title":"Information and Computation"},{"key":"264576_CR29","unstructured":"K. Wagner, \u201cUber eine Erweiterung eines Satzes von Kuratowski,\u201d D. Math., pp. 280\u2013285, 1937."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009802905533.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009802905533\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009802905533.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:15:56Z","timestamp":1751282156000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009802905533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["264576"],"URL":"https:\/\/doi.org\/10.1023\/a:1009802905533","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}