{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:55:22Z","timestamp":1759146922134},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0304-3975(92)90126-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"285-298","source":"Crossref","is-referenced-by-count":8,"title":["Processor optimization for flow graphs"],"prefix":"10.1016","volume":"104","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90126-Z_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0304-3975(92)90126-Z_BIB2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"4","author":"Chvatal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0304-3975(92)90126-Z_BIB3","first-page":"313","article-title":"A methodology for design of digital systems \u2014 supported by SARA at the age of one","author":"Estrin","year":"1978","journal-title":"Proc. of National Computer Conference"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB4","first-page":"726","article-title":"An ADA to standard cell hardware compiler based on graph grammars and scheduling","author":"Girczyc","year":"1984","journal-title":"Proc. of the ICCD"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB5","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB6","series-title":"Thesis","article-title":"Ein Zuordnungsproblem im Hardware-Design","author":"Jansen","year":"1990"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB7","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90126-Z_BIB8","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB9","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(92)90126-Z_BIB11","series-title":"Hab. Thesis","article-title":"Ein Software-System zur Synthese von Rechnerstrukturen und zur Erzeugung von Mikrocode","author":"Marwedel","year":"1985"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB12","first-page":"536","article-title":"Splicer: a heuristic approach to connectivity binding","author":"Pangrle","year":"1988","journal-title":"Proc. 25th Design Automation Conference"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB13","series-title":"Thesis","article-title":"Synthesis of high-speed digital systems","author":"Park","year":"1985"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB14","first-page":"461","article-title":"MAHA: a program for data path synthesis","author":"Parker","year":"1986","journal-title":"Proc. 23rd Design Automation Conference"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/DAC.1979.1600091","article-title":"The CMU design automation system: an example of automated data path design","author":"Parker","year":"1979","journal-title":"Proc. 16th Design Automation Conference"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB16","first-page":"263","article-title":"HAL: a multi-paradigm approach to automatic data path synthesis","author":"Paulin","year":"1986","journal-title":"Proc. 23rd Design Automation Conference"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB17","first-page":"391","article-title":"Synthesizing circuits from behavioral level specifications","author":"Rosenstiel","year":"1985","journal-title":"Proc. 7th Conference on CHDL"},{"key":"10.1016\/0304-3975(92)90126-Z_BIB18","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","article-title":"On a property of the class of n-colorable graphs","volume":"16","author":"Seinsche","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"issue":"12","key":"10.1016\/0304-3975(92)90126-Z_BIB19","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/MC.1983.1654270","article-title":"MacPitts: An approach to silicon compilation","volume":"16","author":"Southard","year":"1983","journal-title":"Computer"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290126Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290126Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:20:34Z","timestamp":1555114834000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290126Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["030439759290126Z"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90126-z","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}