{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:38:41Z","timestamp":1725849521861},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319295152"},{"type":"electronic","value":"9783319295169"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29516-9_8","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T05:05:19Z","timestamp":1455858319000},"page":"88-99","source":"Crossref","is-referenced-by-count":3,"title":["Enumerating Cyclic Orientations of a Graph"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Conte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"key":"8_CR1","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: ALENEX\/ANALC, vol. 69 (2004)"},{"issue":"2\u20133","key":"8_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/rsa.3240060213","volume":"6","author":"N Alon","year":"1995","unstructured":"Alon, N., Tuza, Z.: The acyclic orientation game on random graphs. Random Struct. Algorithms 6(2\u20133), 261\u2013268 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0020-0190(99)00120-9","volume":"72","author":"VC Barbosa","year":"1999","unstructured":"Barbosa, V.C., Szwarcfiter, J.L.: Generating all the acyclic orientations of an undirected graph. Inf. Process. Lett. 72(1), 71\u201374 (1999)","journal-title":"Inf. Process. Lett."},{"key":"8_CR4","volume-title":"Extremal Graph Theory","author":"B Bollobas","year":"2004","unstructured":"Bollobas, B.: Extremal Graph Theory. Dover Publications Incorporated, New York (2004)"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","volume":"9","author":"P Erd\u0151s","year":"1962","unstructured":"Erd\u0151s, P., P\u00f3sa, L.: On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9, 3\u201312 (1962)","journal-title":"Publ. Math. Debrecen"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jctb.1997.1769","volume":"71","author":"DC Fisher","year":"1997","unstructured":"Fisher, D.C., Fraughnaugh, K., Langley, L., West, D.B.: The number of dependent arcs in an acyclic orientation. J. Comb. Theor. Ser. B 71(1), 73\u201378 (1997)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/0607036","volume":"7","author":"N Linial","year":"1986","unstructured":"Linial, N.: Hard enumeration problems in geometry and combinatorics. SIAM J. Algeb. Discrete Meth. 7(2), 331\u2013335 (1986)","journal-title":"SIAM J. Algeb. Discrete Meth."},{"key":"8_CR10","unstructured":"Moon, J.: Topics on tournaments. In: Selected Topics in Mathematics. Athena series. Holt, Rinehart and Winston (1968)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/S0963548309990289","volume":"19","author":"O Pikhurko","year":"2010","unstructured":"Pikhurko, O.: Finding an unknown acyclic orientation of a given graph. Comb. Probab. Comput. 19(1), 121\u2013131 (2010)","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1006\/jagm.1997.0891","volume":"26","author":"MB Squire","year":"1998","unstructured":"Squire, M.B.: Generating the acyclic orientations of a graph. J. Algorithms 26(2), 275\u2013290 (1998)","journal-title":"J. Algorithms"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(73)90108-8","volume":"5","author":"RP Stanley","year":"1973","unstructured":"Stanley, R.P.: Acyclic orientations of graphs. Discrete Math. 5(2), 171\u2013178 (1973)","journal-title":"Discrete Math."},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","volume":"2","author":"RE Tarjan","year":"1974","unstructured":"Tarjan, R.E.: A note on finding the bridges of a graph. Inf. Process. Lett. 2(6), 160\u2013161 (1974)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29516-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T22:59:11Z","timestamp":1692226751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29516-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319295152","9783319295169"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29516-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}