{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:44:30Z","timestamp":1774629870324,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030678982","type":"print"},{"value":"9783030678999","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_8","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"95-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Acyclic Coloring Parameterized by Directed Clique-Width"],"prefix":"10.1007","author":[{"given":"Frank","family":"Gurski","sequence":"first","affiliation":[]},{"given":"Dominique","family":"Komander","sequence":"additional","affiliation":[]},{"given":"Carolin","family":"Rehs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/jgt.21811","volume":"79","author":"S Andres","year":"2015","unstructured":"Andres, S., Hochst\u00e4ttler, W.: Perfect digraphs. J. Graph Theory 79(1), 21\u201329 (2015)","journal-title":"J. Graph Theory"},{"key":"8_CR2","series-title":"Springer Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71840-8","volume-title":"Classes of Directed Graphs","author":"J Bang-Jensen","year":"2018","unstructured":"Bang-Jensen, J., Gutin, G.: Classes of Directed Graphs. SMM. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-71840-8"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/jgt.21775","volume":"77","author":"J Bang-Jensen","year":"2014","unstructured":"Bang-Jensen, J., Maddaloni, A.: Arc-disjoint paths in decomposable digraphs. J. Graph Theory 77, 89\u2013110 (2014)","journal-title":"J. Graph Theory"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/jgt.20003","volume":"46","author":"D Bokal","year":"2004","unstructured":"Bokal, D., Fijavz, G., Juvan, M., Kayll, P., Mohar, B.: The circular chromatic number of a digraph. J. Graph Theory 46(3), 227\u2013240 (2004)","journal-title":"J. Graph Theory"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"4","author":"D Corneil","year":"2005","unstructured":"Corneil, D., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 4, 825\u2013847 (2005)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101, 77\u2013114 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"12","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1016\/j.dam.2006.03.005","volume":"154","author":"C Crespelle","year":"2006","unstructured":"Crespelle, C., Paul, C.: Fully dynamic recognition algorithm and certificate for directed cographs. Discret. Appl. Math. 154(12), 1722\u20131741 (2006)","journal-title":"Discret. Appl. Math."},{"key":"8_CR9","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45477-2_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 117\u2013128. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45477-2_12"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-44634-6_9","volume-title":"Algorithms and Data Structures","author":"W Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: Deciding clique-width for graphs of bounded tree-width. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 87\u201398. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44634-6_9"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1137\/S0895480103422184","volume":"17","author":"T Feder","year":"2003","unstructured":"Feder, T., Hell, P., Mohar, B.: Acyclic homomorphisms and circular colorings of digraphs. SIAM J. Discret. Math. 17(1), 161\u2013163 (2003)","journal-title":"SIAM J. Discret. Math."},{"issue":"5","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"F Fomin","year":"2010","unstructured":"Fomin, F., Golovach, P., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM J. Comput. 39(5), 1941\u20131956 (2010)","journal-title":"SIAM J. Comput."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Fomin, F., Golovach, P., Lokshtanov, D., Saurabh, S., Zehavi, M. Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. ACM Trans. Algorithms 15(1), 9:1\u20139:27 (2018)","DOI":"10.1145\/3280824"},{"key":"8_CR15","unstructured":"Ganian, R.: The parameterized complexity of oriented colouring. In: Proceedings of Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS. OASICS, vol. 13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.dam.2013.10.038","volume":"168","author":"R Ganian","year":"2014","unstructured":"Ganian, R., Hlinen\u00fd, P., Kneis, J., Langer, A., Obdrz\u00e1lek, J., Rossmanith, P.: Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168, 88\u2013107 (2014)","journal-title":"Discret. Appl. Math."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.jctb.2015.09.001","volume":"116","author":"R Ganian","year":"2016","unstructured":"Ganian, R., et al.: Are there any good digraph width measures? J. Comb. Theory Ser. B 116, 250\u2013286 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-38919-2_45","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"F Gurski","year":"2020","unstructured":"Gurski, F., Hoffmann, S., Komander, D., Rehs, C., Rethmann, J., Wanke, E.: Computing directed Steiner path covers for directed co-graphs (extended abstract). In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 556\u2013565. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_45"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-25027-0_20","volume-title":"Fundamentals of Computation Theory","author":"F Gurski","year":"2019","unstructured":"Gurski, F., Komander, D., Rehs, C.: Computing digraph width measures on directed co-graphs. In: G\u0105sieniec, L.A., Jansson, J., Levcopoulos, C. (eds.) FCT 2019. LNCS, vol. 11651, pp. 292\u2013305. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25027-0_20"},{"key":"8_CR20","unstructured":"Gurski, F., Komander, D., Rehs, C.: Acyclic coloring of special digraphs. ACM Computing Research Repository (CoRR), abs\/2006.13911, p. 16 (2020)"},{"issue":"6","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1007\/s00224-019-09919-x","volume":"63","author":"F Gurski","year":"2019","unstructured":"Gurski, F., Rehs, C.: Comparing linear width parameters for directed graphs. Theory Comput. Syst. 63(6), 1358\u20131387 (2019)","journal-title":"Theory Comput. Syst."},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-40064-8_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F Gurski","year":"2000","unstructured":"Gurski, F., Wanke, E.: The tree-width of clique-width bounded graphs without $${\\rm K}_{n,n}$$. In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol. 1928, pp. 196\u2013205. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40064-8_19"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.11.003","volume":"616","author":"F Gurski","year":"2016","unstructured":"Gurski, F., Wanke, E., Yilmaz, E.: Directed NLC-width. Theor. Comput. Sci. 616, 1\u201317 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00224-012-9399-y","volume":"52","author":"M Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M., Rao, M.: The rank-width of edge-coloured graphs. Theory Comput. Syst. 52(4), 599\u2013644 (2013)","journal-title":"Theory Comput. Syst."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H Lenstra","year":"1983","unstructured":"Lenstra, H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1137\/16M108080X","volume":"31","author":"Z Li","year":"2017","unstructured":"Li, Z., Mohar, B.: Planar digraphs of digirth four are 2-colorable. SIAM J. Discret. Math. 31, 2201\u20132205 (2017)","journal-title":"SIAM J. Discret. Math."},{"key":"8_CR27","unstructured":"Millani, M., Steiner, R., Wiederrecht, S.: Colouring non-even digraphs. ACM Computing Research Repository (CoRR), abs\/1903.02872, p. 37 (2019)"},{"issue":"2","key":"8_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/jgt.10106","volume":"43","author":"B Mohar","year":"2003","unstructured":"Mohar, B.: Circular colorings of edge-weighted graphs. J. Graph Theory 43(2), 107\u2013116 (2003)","journal-title":"J. Graph Theory"},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V Neumann-Lara","year":"1982","unstructured":"Neumann-Lara, V.: The dichromatic number of a digraph. J. Comb. Theory Ser. B 33(2), 265\u2013270 (1982)","journal-title":"J. Comb. Theory Ser. B"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.: Graph minors II. Algorithmic aspects of tree width. J. Algorithms 7, 309\u2013322 (1986)","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"8_CR31","unstructured":"Steiner, R., Wiederrecht, S.: Parameterized algorithms for directed modular width. ACM Computing Research Repository (CoRR), abs\/1905.13203, p. 37 (2019)"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-39219-2_33","volume-title":"Algorithms and Discrete Applied Mathematics","author":"R Steiner","year":"2020","unstructured":"Steiner, R., Wiederrecht, S.: Parameterized algorithms for directed modular width. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 415\u2013426. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_33"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R., Lawler, E.: The recognition of series-parallel digraphs. SIAM J. Comput. 11, 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T17:18:17Z","timestamp":1670951897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,21","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}