{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:35:09Z","timestamp":1743024909055,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961507"},{"type":"electronic","value":"9783319961514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-96151-4_16","type":"book-chapter","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T12:21:49Z","timestamp":1531830109000},"page":"183-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for Measuring the Funnel-Likeness of DAGs"],"prefix":"10.1007","author":[{"given":"Marcelo Garlet","family":"Millani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"issue":"8","key":"16_CR1","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1016\/j.ic.2007.02.006","volume":"205","author":"N Ailon","year":"2007","unstructured":"Ailon, N., Alon, N.: Hardness of fully dense problems. Inf. Comput. 205(8), 1117\u20131129 (2007)","journal-title":"Inf. Comput."},{"key":"16_CR2","series-title":"Springer Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2008","unstructured":"Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics. Springer, London (2008). https:\/\/doi.org\/10.1007\/978-1-84800-998-1"},{"issue":"6","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1016\/j.jcss.2010.10.001","volume":"77","author":"S Bessy","year":"2011","unstructured":"Bessy, S., Fomin, F.V., Gaspers, S., Paul, C., Perez, A., Saurabh, S., Thomass\u00e9, S.: Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6), 1071\u20131078 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.dam.2016.12.002","volume":"220","author":"R Bevern van","year":"2017","unstructured":"van Bevern, R., Bredereck, R., Chopin, M., Hartung, S., H\u00fcffner, F., Nichterlein, A., Such\u00fd, O.: Fixed-parameter algorithms for DAG partitioning. Discrete Appl. Math. 220, 134\u2013160 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0166-218X(02)00242-1","volume":"127","author":"L Cai","year":"2003","unstructured":"Cai, L.: Parameterized complexity of vertex colouring. Discrete Appl. Math. 127(3), 415\u2013429 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548306007887","volume":"16","author":"P Charbit","year":"2007","unstructured":"Charbit, P., Thomass\u00e9, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Comb. Probab. Comput. 16(1), 1\u20134 (2007)","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"16_CR7","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., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR8","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. Discrete Appl. Math. 168, 88\u2013107 (2014)","journal-title":"Discrete Appl. Math."},{"key":"16_CR9","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., Hlinen\u00fd, P., Kneis, J., Meister, D., Obdrz\u00e1lek, J., Rossmanith, P., Sikdar, S.: Are there any good digraph width measures? J. Comb. Theory Ser. B 116, 250\u2013286 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proceedings of the 39th STOC, pp. 95\u2013103. ACM (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT - The Koblenz network collection. In: Proceedings of the 22nd WWW, pp. 1343\u20131350. ACM (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"16_CR13","unstructured":"Lehmann, J.: The computational complexity of worst case flows in unreliable flow networks. Bachelor thesis, Institut f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, October 2017"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kleinberg, J.: Meme-tracking and the dynamics of the news cycle. In: Proceedings of 15th ACM SIGKDD, pp. 497\u2013506. ACM (2009)","DOI":"10.1145\/1557019.1557077"},{"key":"16_CR15","unstructured":"Millani, M.G.: Funnels\u2013algorithmic complexity of problems on special directed acyclic graphs. Master thesis, Department of Electrical Engineering and Computer Science, TU Berlin, August 2017. http:\/\/fpt.akt.tu-berlin.de\/publications\/theses\/MA-marcelo-millani.pdf"},{"key":"16_CR16","unstructured":"Millani, M.G.: Parfunn - Parameters for Funnels, August 2017. https:\/\/gitlab.tubit.tu-berlin.de\/mgmillani1\/parfunn"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Millani, M.G., Molter, H., Niedermeier, R., Sorge, M.: Efficient algorithms for measuring the funnel-likeness of DAGs. CoRR abs\/1801.10401 (2018)","DOI":"10.1007\/978-3-319-96151-4_16"},{"key":"16_CR18","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proceedings of the 27th STACS, pp. 17\u201332. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96151-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T19:05:06Z","timestamp":1571598306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96151-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961507","9783319961514"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96151-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/isco2018.lip6.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}