{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:59:56Z","timestamp":1743001196218,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_26","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"360-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Slice Theoretic Approach for Embedding Problems on Digraphs"],"prefix":"10.1007","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM (JACM) 42(4), 844\u2013856 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","volume":"22","author":"J Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J.: Directed path-width and monotonicity in digraph searching. Graphs and Combinatorics 22(2), 161\u2013172 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of Theoretical Computer Science, Chap. 5, pp. 194\u2013242. Elsevier, Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theor. Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theor. Comput. Syst."},{"issue":"3","key":"26_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.3233\/FI-2010-367","volume":"105","author":"M Oliveira Oliveira de","year":"2010","unstructured":"de Oliveira Oliveira, M.: Hasse diagram generators and Petri nets. Fundamenta Informaticae 105(3), 263\u2013289 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-28332-1_38","volume-title":"Language and Automata Theory and Applications","author":"M Oliveira Oliveira de","year":"2012","unstructured":"de Oliveira Oliveira, M.: Canonizable partial order generators. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 445\u2013457. Springer, Heidelberg (2012)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-03898-8_12","volume-title":"Parameterized and Exact Computation","author":"M Oliveira Oliveira de","year":"2013","unstructured":"de Oliveira Oliveira, M.: Subgraphs satisfying MSO properties on z-topologically orderable digraphs. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 123\u2013136. Springer, Heidelberg (2013)"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1016\/j.jcss.2011.10.001","volume":"78","author":"FV Fomin","year":"2012","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S., Rao, B.V.R.: Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. 78(3), 698\u2013706 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-11269-0_15","volume-title":"Parameterized and Exact Computation","author":"R Ganian","year":"2009","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Kneis, J., Langer, A., Obdr\u017e\u00e1lek, J., Rossmanith, P.: On digraph width measures in parameterized algorithmics. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 185\u2013197. Springer, Heidelberg (2009)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K.-i., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: STOC, pp. 479\u2013488. ACM (2011)","DOI":"10.1145\/1993636.1993700"},{"issue":"2","key":"26_CR13","first-page":"189","volume":"14","author":"H Gruber","year":"2012","unstructured":"Gruber, H.: Digraph complexity measures and applications in formal language theory. Discrete Math. Theor. Comput. Sci. 14(2), 189\u2013204 (2012)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"2","key":"26_CR14","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.dam.2002.12.005","volume":"145","author":"A Gupta","year":"2005","unstructured":"Gupta, A., Nishimura, N., Proskurowski, A., Ragde, P.: Embeddings of k-connected graphs of pathwidth k. Discrete Appl. Math. 145(2), 242\u2013265 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theor. Ser. B 82(1), 138\u2013154 (2001)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-25870-1_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H Tamaki","year":"2011","unstructured":"Tamaki, H.: A polynomial time algorithm for bounded directed pathwidth. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 331\u2013342. Springer, Heidelberg (2011)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T19:48:12Z","timestamp":1600976892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}