{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:58Z","timestamp":1725482218561},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_31","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"325-337","source":"Crossref","is-referenced-by-count":2,"title":["On the Hardness of Recognizing Bundles in Time Table Graphs"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Liebers","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Karsten","family":"Weihe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Stephen A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC\u201971, pages 151\u2013158, 1971. 329","DOI":"10.1145\/800157.805047"},{"key":"31_CR2","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W H Freeman & Co Ltd, 1979. 327, 329, 333"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC\u201978, pages 216\u2013226, 1978. 333","DOI":"10.1145\/800133.804350"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias M\u00fcller-Hannemann, Dorothea Wagner, and Thomas Willhalm. Empirical Design of Geometric Algorithms. In Proceedings of the 15th ACM Symposium on Computational Geometry, SCG\u201999, pages 86\u201394, 1999. 326","DOI":"10.1145\/304893.304918"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T02:28:21Z","timestamp":1550284101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}