{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:39Z","timestamp":1725541839123},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_13","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T12:14:44Z","timestamp":1260274484000},"page":"125-136","source":"Crossref","is-referenced-by-count":4,"title":["The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs"],"prefix":"10.1007","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilan","family":"Newman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamson, K.R., Fellows, M.R.: Finite automata, bounded treewidth, and well-quasiordering. In: Robertson, N., Seymour, P. (eds.) Graph Structure Theory, pp. 539\u2013564 (1993)","DOI":"10.1090\/conm\/147\/01199"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-92185-1_32","volume-title":"Internet and Network Economics","author":"D. Bil\u00f2","year":"2008","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G., Widmayer, P.: Computational aspects of a 2-player Stackelberg shortest paths tree game. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 251\u2013262. Springer, Heidelberg (2008)"},{"key":"13_CR4","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg network pricing games. In: Proc. 25th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 133\u2013142 (2008)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-73951-7_7","volume-title":"Algorithms and Data Structures","author":"J. Cardinal","year":"2007","unstructured":"Cardinal, J., Demaine, E.D., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg minimum spanning tree game. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 64\u201376. Springer, Heidelberg (2007) (to appear in Algorithmica)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70575-8_1","volume-title":"Automata, Languages and Programming","author":"B. Courcelle","year":"2008","unstructured":"Courcelle, B.: Graph structure and monadic second-order logic: Language theoretical aspects. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 1\u201313. Springer, Heidelberg (2008)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.: Approximation algorithms via structural results for apex-minor-free graphs. In: Proc. 36th International Colloquium on Automata, Languages and Programming, ICALP (2009)","DOI":"10.1007\/978-3-642-02927-1_27"},{"key":"13_CR9","unstructured":"Demaine, E.D., Hajiaghayi, M., Mohar, B.: Approximation algorithms via contraction decomposition. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 278\u2013287 (2007)"},{"key":"13_CR10","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/net.20260","volume":"53","author":"A. Grigoriev","year":"2009","unstructured":"Grigoriev, A., van Loon, J., Sitters, R., Uetz, M.: Optimal pricing of capacitated networks. Networks\u00a053(1), 79\u201387 (2009)","journal-title":"Networks"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: A subset spanner for planar graphs, with application to subset TSP. In: Proc. 38th ACM Symposium on Theory of Computing (STOC), pp. 749\u2013756 (2006)","DOI":"10.1145\/1132516.1132620"},{"issue":"12","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","volume":"44","author":"M. Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model of taxation and its application to optimal highway pricing. Management Science\u00a044(12), 1608\u20131622 (1998)","journal-title":"Management Science"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.20074","volume":"46","author":"S. Roch","year":"2005","unstructured":"Roch, S., Savard, G., Marcotte, P.: An approximation algorithm for Stackelberg network pricing. Networks\u00a046(1), 57\u201367 (2005)","journal-title":"Networks"},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput.\u00a011(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:35:30Z","timestamp":1606167330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}