{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T19:15:23Z","timestamp":1694459723969},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00186-008-0259-0","type":"journal-article","created":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T09:24:47Z","timestamp":1221816287000},"page":"281-296","source":"Crossref","is-referenced-by-count":2,"title":["A minimization version of a directed subgraph homeomorphism problem"],"prefix":"10.1007","volume":"69","author":[{"given":"Janina A.","family":"Brenner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan C.","family":"van der Veen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"issue":"23","key":"259_CR1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(85)90222-1","volume":"38","author":"T Asano","year":"1985","unstructured":"Asano T (1985) An approach to the subgraph homeomorphism problem. Theoret Comput Sci 38(23): 249\u2013267","journal-title":"Theoret Comput Sci"},{"key":"259_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"S Bhatt","year":"1987","unstructured":"Bhatt S, Cosmadakis S (1987) The complexity of minimizing wire lengths in VLSI layouts. Inform Process Lett 25: 263\u2013267","journal-title":"Inform Process Lett"},{"key":"259_CR3","doi-asserted-by":"crossref","unstructured":"Brenner J (2005) Simultaneous scheduling, binding and routing to processor-like reconfigurable architectures. Diploma thesis, Braunschweig University of Technology, Braunschweig, Germany","DOI":"10.1109\/FPL.2006.311262"},{"key":"259_CR4","doi-asserted-by":"crossref","unstructured":"Brenner J, Fekete S, van der Veen J, Oliveira Filho J, Rosenstiel W (2006) Optimal simultaneous scheduling, binding and routing for processor-like reconfigurable architectures. International conference on field programmable logic and applications (FPL)","DOI":"10.1109\/FPL.2006.311262"},{"key":"259_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune S, Hopcroft JE, Wyllie J (1980) The directed subgraph homeomorphism problem. Theor Comput Sci 10: 111\u2013121","journal-title":"Theor Comput Sci"},{"key":"259_CR6","volume-title":"Computers and intractability: a guide to the theory of NP\u00ad-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP\u00ad-completeness. W. H. Freeman, New York"},{"key":"259_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial optimization: theory and algorithms. Algorithms and combinatorics 21, 2nd edn","author":"B Korte","year":"2002","unstructured":"Korte B, Vygen J (2002) Combinatorial optimization: theory and algorithms. Algorithms and combinatorics 21, 2nd edn. Springer, Berlin"},{"key":"259_CR8","unstructured":"K\u00fchn D, Osthus D (2002) Large topological cliques in graphs without a 4-cycle. Hamburger Beitr\u00e4ge zur Mathematik, Heft 144"},{"key":"259_CR9","doi-asserted-by":"crossref","unstructured":"LaPaugh A, Rivest R (1978) The subgraph homeomorphism problem. In: Proceedings of the 10th annual ACM symposium on theory of computing, association for computing machinery, New York, pp 40\u201350","DOI":"10.1145\/800133.804330"},{"key":"259_CR10","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/PL00009829","volume":"18","author":"W Mader","year":"1998","unstructured":"Mader W (1998) Topological subgraphs in graphs of large girth. Combinatorica 18: 405\u2013412","journal-title":"Combinatorica"},{"key":"259_CR11","doi-asserted-by":"crossref","unstructured":"Oppold T, Schweizer T, Kuhn T, Rosenstiel W (2004) A design environment for processor-like reconfigurable hardware. In: IEEE International conference on parallel computing in electrical engineering (PARELEC), Dresden, Germany, pp 171\u2013176","DOI":"10.1109\/PCEE.2004.1"},{"key":"259_CR12","unstructured":"Oppold T, Schweizer T, Kuhn T, Rosenstiel W (2004) CRC (Configurable Reconfigurable Core)\u2014Bewertungs- und Entwurfsverfahren f\u00fcr prozessorartig rekonfigurierbare Architekturen. Zwischenkolloquium DFG-SPP 1148. http:\/\/www12.informatik.uni-erlangen.de\/spprr\/colloquium02\/uni-tuebingen-rosenstiel.pdf"},{"key":"259_CR13","doi-asserted-by":"crossref","unstructured":"Schaefer TJ (1978) The complexity of satisfiability problems. In: Proceedings of the 10th annual ACM symposium on theory of computing, association for computing machinery, New York, pp 216\u2013226","DOI":"10.1145\/800133.804350"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-008-0259-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-008-0259-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-008-0259-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:28Z","timestamp":1558622008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-008-0259-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["259"],"URL":"https:\/\/doi.org\/10.1007\/s00186-008-0259-0","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,20]]}}}