{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:00:27Z","timestamp":1742940027524,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_3","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T09:08:43Z","timestamp":1449652123000},"page":"31-44","source":"Crossref","is-referenced-by-count":0,"title":["Directed Pathwidth and Palletizers"],"prefix":"10.1007","author":[{"given":"Frank","family":"Gurski","sequence":"first","affiliation":[]},{"given":"Jochen","family":"Rethmann","sequence":"additional","affiliation":[]},{"given":"Egon","family":"Wanke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"3_CR1","first-page":"1","volume":"11","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11, 1\u201323 (1993)","journal-title":"Acta Cybern."},{"key":"3_CR2","volume-title":"On-line Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A.: On-line Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/0377-2217(94)90423-5","volume":"92","author":"R Koster de","year":"1994","unstructured":"de Koster, R.: Performance approximation of pick-to-belt orderpicking systems. Eur. J. Oper. Res. 92, 558\u2013573 (1994)","journal-title":"Eur. J. Oper. Res."},{"volume-title":"Quantitative Graph Theory: Mathematical Foundations and Applications","year":"2014","key":"3_CR4","unstructured":"Dehmer, M., Emmert-Streib, F. (eds.): Quantitative Graph Theory: Mathematical Foundations and Applications. CRC Press Inc., New York (2014)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Online Algorithms: The State of the Art","year":"1998","unstructured":"Fiat, A., Woeginger, G.J. (eds.): Online Algorithms: The State of the Art. LNCS, vol. 1442. Springer, Heidelberg (1998)"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-3-319-07001-8_25","volume-title":"Operations Research Proceedings 2013","author":"F Gurski","year":"2014","unstructured":"Gurski, F., Rethmann, J., Wanke, E.: Moving bins from conveyor belts onto pallets using FIFO queues. In: Huisman, D., Louwerse, I. (eds.) Operations Research Proceedings 2013, pp. 185\u2013191. Springer, Heidelberg (2014)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Gurski, F., Rethmann, J., Wanke, E.: Algorithms for controlling palletizers. In: Proceedings of the International Conference on Operations Research (OR 2014), Selected Papers. Springer-Verlag (2015, to appear)","DOI":"10.1007\/978-3-319-28697-6_28"},{"key":"3_CR8","series-title":"Advances in Intelligent Systems and Computing","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"F Gurski","year":"2015","unstructured":"Gurski, F., Rethmann, J., Wanke, E.: A practical approach for the FIFO stack-up problem. In: An Le Thi, H., Dinh, T.P., Nguyen, N.T. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences. AISC, vol. 360. Springer, Heidelberg (2015)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory, Ser. B 82, 138\u2013155 (2001)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"3_CR10","unstructured":"Kashiwabara, T., Fujisawa, T.: NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph. In: Proceedings of the International Symposium on Circuits and Systems, pp. 657\u2013660 (1979)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.tcs.2014.10.009","volume":"562","author":"S Kintali","year":"2015","unstructured":"Kintali, S., Kothari, N., Kumar, A.: Approximation algorithms for digraph width parameters. Theor. Comput. Sci. 562, 365\u2013376 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-33293-7_18","volume-title":"Parameterized and Exact Computation","author":"K Kitsunai","year":"2012","unstructured":"Kitsunai, K., Kobayashi, Y., Komuro, K., Tamaki, H., Tano, T.: Computing directed pathwidth in $$O(1.89^n)$$ O ( 1 . 89 n ) time. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 182\u2013193. Springer, Heidelberg (2012)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","volume":"58","author":"B Monien","year":"1988","unstructured":"Monien, B., Sudborough, I.H.: Min cut is NP-complete for edge weighted trees. Theor. Comput. Sci. 58, 209\u2013229 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR14","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, New York (1994)"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0377-2217(96)00303-7","volume":"103","author":"J Rethmann","year":"1997","unstructured":"Rethmann, J., Wanke, E.: Storage controlled pile-up systems, theoretical foundations. Eur. J. Oper. Res. 103(3), 515\u2013530 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s001860050085","volume":"51","author":"J Rethmann","year":"2000","unstructured":"Rethmann, J., Wanke, E.: On approximation algorithms for the stack-up problem. Math. Methods Oper. Res. 51, 203\u2013233 (2000)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/S0377-2217(99)00351-3","volume":"128","author":"J Rethmann","year":"2001","unstructured":"Rethmann, J., Wanke, E.: Stack-up algorithms for palletizing at delivery industry. Eur. J. Oper. Res. 128(1), 74\u201397 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-25870-1_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H Tamaki","year":"2011","unstructured":"Tamaki, H.: A polynomial time algorithm for bounded directed pathwidth. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 331\u2013342. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T22:41:43Z","timestamp":1718232103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}