{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:25:09Z","timestamp":1759847109219},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143540"},{"type":"electronic","value":"9783642143557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_24","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T09:34:40Z","timestamp":1277285680000},"page":"229-242","source":"Crossref","is-referenced-by-count":2,"title":["Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles"],"prefix":"10.1007","author":[{"given":"Fabrice","family":"Talla Nobibon","sequence":"first","affiliation":[]},{"given":"Cor","family":"Hurkens","sequence":"additional","affiliation":[]},{"given":"Roel","family":"Leus","sequence":"additional","affiliation":[]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"2598","DOI":"10.1016\/j.disc.2007.01.009","volume":"307","author":"N. Apollonio","year":"2007","unstructured":"Apollonio, N., Franciosa, P.G.: A characterization of partial directed line graphs. Discrete Mathematics\u00a0307, 2598\u20132614 (2007)","journal-title":"Discrete Mathematics"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0304-3975(97)00254-5","volume":"230","author":"Z. Chen","year":"2000","unstructured":"Chen, Z.: Efficient algorithm for acyclic colorings of graphs. Theoretical Computer Science\u00a0230, 75\u201395 (2000)","journal-title":"Theoretical Computer Science"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1111\/j.1468-0262.2006.00757.x","volume":"75","author":"L. Cherchye","year":"2007","unstructured":"Cherchye, L., De Rock, B., Vermeulen, F.: The collective model of household consumption: a nonparametric characterization. Econometrica\u00a075, 553\u2013574 (2007)","journal-title":"Econometrica"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.jeconom.2008.09.010","volume":"147","author":"L. Cherchye","year":"2008","unstructured":"Cherchye, L., De Rock, B., Sabbe, J., Vermeulen, F.: Nonparametric tests of collectively rational consumption behavior: an integer programming procedure. Journal of Econometrics\u00a0147, 258\u2013265 (2008)","journal-title":"Journal of Econometrics"},{"key":"24_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2005","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2005)"},{"key":"24_CR7","volume-title":"Acyclic partitioning problem is NP-complete for k\u2009=\u20092. Private communication","author":"R. Deb","year":"2008","unstructured":"Deb, R.: Acyclic partitioning problem is NP-complete for k\u2009=\u20092. Private communication. Yale University, United States (2008)"},{"key":"24_CR8","volume-title":"An efficient nonparametric test of the collective household model. Working paper","author":"R. Deb","year":"2008","unstructured":"Deb, R.: An efficient nonparametric test of the collective household model. Working paper. Yale University, United States (2008)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.cagd.2006.03.004","volume":"23","author":"G. Farin","year":"2006","unstructured":"Farin, G.: Class A B\u00e9zier curves. Computer Aided Geometric Design\u00a023, 573\u2013581 (2006)","journal-title":"Computer Aided Geometric Design"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0004-3702(95)00050-X","volume":"81","author":"T. Hogg","year":"1985","unstructured":"Hogg, T.: Refining the phase transition in combinatorial search. Artificial Intelligence\u00a081, 127\u2013154 (1985)","journal-title":"Artificial Intelligence"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature\u00a0400, 133\u2013137 (1999)","journal-title":"Nature"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Talla Nobibon, F., Cherchye, L., De Rock, B., Sabbe, J., Spieksma, F.C.R.: Heuristics for deciding collectively rational consumption behavior. Research report ces08.24, University of Leuven (2008)","DOI":"10.2139\/ssrn.1291124"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Talla Nobibon, F., Hurken, C., Leus, R., Spieksma, F.C.R.: Coloring graphs to avoid monochromatic cycles. University of Leuven (2009) (manuscript)","DOI":"10.2139\/ssrn.1683889"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"2","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a02, 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Varian, H.: Revealed preference. In: Samuelsonian Economics and the 21st Century (2006)","DOI":"10.1093\/acprof:oso\/9780199298839.003.0007"},{"key":"24_CR16","first-page":"1","volume":"1","author":"Y. Wu","year":"1996","unstructured":"Wu, Y., Yuan, J., Zhao, Y.: Partition a graph into two induced forests. Journal of Mathematical Study\u00a01, 1\u20136 (1996)","journal-title":"Journal of Mathematical Study"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:51:34Z","timestamp":1606168294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}