{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:18:08Z","timestamp":1742991488685,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_19","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"222-233","source":"Crossref","is-referenced-by-count":5,"title":["Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines"],"prefix":"10.1007","author":[{"given":"C. Greg","family":"Plaxton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Fundamentals of Algorithmics","author":"G. Brassard","year":"1996","unstructured":"Brassard, G., Bratley, P.: Fundamentals of Algorithmics. Prentice Hall, Englewood Cliffs (1996)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Georgiadis, L., Hansen, K.A., Katriel, I.: Dynamic matchings in convex bipartite graphs. In: Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, pp. 406\u2013417 (August 2007)","DOI":"10.1007\/978-3-540-74456-6_37"},{"key":"19_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, McGraw-Hill, Cambridge (2001)","edition":"2"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0743-7315(84)90004-2","volume":"1","author":"E. Dekel","year":"1984","unstructured":"Dekel, E., Sahni, S.: A parallel matching algorithm for convex bipartite graphs and applications to scheduling. Journal of Parallel and Distributed Computing\u00a01, 185\u2013205 (1984)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences\u00a030, 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0167-6377(84)90068-3","volume":"3","author":"G. Gallo","year":"1984","unstructured":"Gallo, G.: An O(nlogn) algorithm for the convex bipartite matching problem. Operations Research Letters\u00a03, 313\u2013316 (1984)","journal-title":"Operations Research Letters"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F. Glover","year":"1967","unstructured":"Glover, F.: Maximum matching in convex bipartite graphs. Naval Research Logistic Quarterly\u00a014, 313\u2013316 (1967)","journal-title":"Naval Research Logistic Quarterly"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 287\u2013326 (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"19_CR9","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1978","unstructured":"Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press, New York (1978)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Katriel, I.: Matchings in node-weighted convex bipartite graphs. INFORMS Journal on Computing (December 2007); Published online in Articles in Advance (print version to in appear, 2008)","DOI":"10.1287\/ijoc.1070.0232"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W. Lipski Jr.","year":"1981","unstructured":"Lipski Jr., W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica\u00a015, 329\u2013346 (1981)","journal-title":"Acta Informatica"},{"key":"19_CR12","first-page":"63","volume":"46","author":"M.G. Scutell\u00e0","year":"1988","unstructured":"Scutell\u00e0, M.G., Scevola, G.: A modification of Lipski-Preparata\u2019s algorithm for the maximum matching problem on bipartite convex graphs. Ricerca Operativa\u00a046, 63\u201377 (1988)","journal-title":"Ricerca Operativa"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0898-1221(96)00079-X","volume":"31","author":"G. Steiner","year":"1996","unstructured":"Steiner, G., Yeomans, J.S.: A linear time algorithm for determining maximum matchings in convex, bipartite graphs. Computers and Mathematics with Applications\u00a031, 91\u201396 (1996)","journal-title":"Computers and Mathematics with Applications"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. Journal of the ACM\u00a022, 215\u2013225 (1975)","journal-title":"Journal of the ACM"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. van Emde Boas","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters\u00a06, 80\u201382 (1977)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:25:33Z","timestamp":1714620333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}