{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:46:09Z","timestamp":1648910769192},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s11083-008-9085-5","type":"journal-article","created":{"date-parts":[[2008,7,19]],"date-time":"2008-07-19T05:54:51Z","timestamp":1216446891000},"page":"131-152","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning Posets"],"prefix":"10.1007","volume":"25","author":[{"given":"Viresh","family":"Patel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,20]]},"reference":[{"key":"9085_CR1","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"25","author":"C.S. Edwards","year":"1973","unstructured":"Edwards, C.S.: Some extremal properties of bipartite subgraphs. Can. J. Math. 25, 475\u2013485 (1973)","journal-title":"Can. J. Math."},{"key":"9085_CR2","first-page":"167","volume-title":"Recent Advances in Graph Theory (Proc. Second Czechoslovak Sympos., Prague, 1974)","author":"C.S. Edwards","year":"1975","unstructured":"Edwards, C.S.: An improved lower bound for the number of edges in a largest bipartite subgraph. In: Recent Advances in Graph Theory (Proc. Second Czechoslovak Sympos., Prague, 1974), pp. 167\u2013181. Academia, Prague (1975)"},{"key":"9085_CR3","volume-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability\u2014A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"issue":"2","key":"9085_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"9085_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer-Verlag, Berlin (1993)","edition":"2"},{"key":"9085_CR6","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1979","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, Oxford (1979)","edition":"5"},{"issue":"4","key":"9085_CR7","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S. Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4), 761\u2013777 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"9085_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0001-8708(79)90010-0","volume":"33","author":"M. Saks","year":"1979","unstructured":"Saks, M.: A short proof of the existence of k-saturated partitions of partially ordered sets. Adv. Math. 33(3), 207\u2013211 (1979)","journal-title":"Adv. Math."},{"issue":"2","key":"9085_CR9","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A. Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory Ser. B 80(2), 346\u2013355 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9085_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1017\/CBO9780511734885.006","volume-title":"Surveys in Combinatorics 2005","author":"A. Scott","year":"2005","unstructured":"Scott, A.: Judicious partitions and related problems. In: Surveys in Combinatorics 2005, pp. 95\u2013117. Cambridge University Press, Cambridge (2005)"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-008-9085-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-008-9085-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-008-9085-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:12:12Z","timestamp":1559365932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-008-9085-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9085"],"URL":"https:\/\/doi.org\/10.1007\/s11083-008-9085-5","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5]]}}}