{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:57:38Z","timestamp":1759147058990},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1016\/0020-0190(93)90115-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"171-175","source":"Crossref","is-referenced-by-count":55,"title":["Modeling hypergraphs by graphs with the same mincut properties"],"prefix":"10.1016","volume":"45","author":[{"given":"Edmund","family":"Ihler","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90115-P_BIB1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","article-title":"An algorithm for partitioning the nodes of a graph","volume":"3","author":"Barnes","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(93)90115-P_BIB2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A framework for solving VLSI graph layout problems","volume":"28","author":"Bhatt","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90115-P_BIB3","series-title":"Paths, Flows, and VLSI-Layout","first-page":"47","article-title":"Packing paths, circuits, and cuts \u2014 A survey","author":"Frank","year":"1990"},{"key":"10.1016\/0020-0190(93)90115-P_BIB4","series-title":"A new approximation technique for hypergraph partitioning problems, Manuscript","author":"Hadley","year":"1990"},{"key":"10.1016\/0020-0190(93)90115-P_BIB5","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/0020-0190(93)90115-P_BIB6","series-title":"Proc. Ninth ACM\/IEEE Design Automation Workshop","first-page":"57","article-title":"A proper model for the partitioning of electrical circuits","author":"Schweikert","year":"1972"},{"key":"10.1016\/0020-0190(93)90115-P_BIB7","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/31.57601","article-title":"A Gomory-Hu cut tree representation of a netlist partitioning problem","volume":"37","author":"Vannelli","year":"1990","journal-title":"IEEE Trans. Circuits and Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390115P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390115P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:41Z","timestamp":1555132901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390115P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["002001909390115P"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90115-p","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}