{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:07:26Z","timestamp":1725815246135},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_30","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"364-376","source":"Crossref","is-referenced-by-count":4,"title":["Towards a Characterization of Leaf Powers by Clique Arrangements"],"prefix":"10.1007","author":[{"given":"Ragnar","family":"Nevries","sequence":"first","affiliation":[]},{"given":"Christian","family":"Rosenke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(93)90165-K","volume":"43","author":"E. Bibelnieks","year":"1993","unstructured":"Bibelnieks, E., Dearing, P.M.: Neighborhood Subtree Tolerance Graphs. Discrete Applied Mathematics\u00a043, 13\u201326 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-78773-0_42","volume-title":"LATIN 2008: Theoretical Informatics","author":"A. Brandst\u00e4dt","year":"2008","unstructured":"Brandst\u00e4dt, A., Hundt, C.: Ptolemaic Graphs and Interval Graphs are Leaf Powers. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 479\u2013491. Springer, Heidelberg (2008)"},{"issue":"4","key":"30_CR3","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.disc.2009.10.006","volume":"310","author":"A. Brandst\u00e4dt","year":"2009","unstructured":"Brandst\u00e4dt, A., Hundt, C., Mancini, F., Wagner, P.: Rooted Directed Path Graphs are Leaf Powers. Discrete Mathematics\u00a0310(4), 897\u2013910 (2009)","journal-title":"Discrete Mathematics"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A. Brandstdt","year":"2006","unstructured":"Brandstdt, A., Le, V.B.: Structure and Linear Time Recognition of 3-Leaf Powers. Information Processing Letters\u00a098, 133\u2013138 (2006)","journal-title":"Information Processing Letters"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-85097-7_15","volume-title":"Combinatorial Optimization and Applications","author":"A. Brandst\u00e4dt","year":"2008","unstructured":"Brandst\u00e4dt, A., Le, V.B.: Simplicial powers of graphs. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 160\u2013170. Springer, Heidelberg (2008)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"3843","DOI":"10.1016\/j.disc.2008.10.025","volume":"309","author":"A. Brandst\u00e4dt","year":"2009","unstructured":"Brandst\u00e4dt, A., Le, V.B., Rautenbach, D.: Distance-hereditary 5-Leaf Powers. Discrete Mathematics\u00a0309, 3843\u20133852 (2009)","journal-title":"Discrete Mathematics"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Brandstdt, A., Le, V.B., Sritharan, R.: Structure and Linear Time Recognition of 4-Leaf Powers. ACM Transactions on Algorithms\u00a05(1) (2008)","DOI":"10.1145\/1435375.1435386"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-540-74456-6_47","volume-title":"Mathematical Foundations of Computer Science 2007","author":"A. Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Wagner, P.: On (k,\u2113)-Leaf Powers. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 525\u2013535. Springer, Heidelberg (2007)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-85097-7_16","volume-title":"Combinatorial Optimization and Applications","author":"A. Brandst\u00e4dt","year":"2008","unstructured":"Brandst\u00e4dt, A., Wagner, P.: On k- Versus (k + 1)-Leaf Powers. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 171\u2013179. Springer, Heidelberg (2008)"},{"issue":"3","key":"30_CR11","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0607039","volume":"7","author":"M.W. Broin","year":"1986","unstructured":"Broin, M.W., Lowe, T.J.: A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices. SIAM Journal on Algebraic Discrete Methods\u00a07(3), 348\u2013357 (1986)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2012.11.015","volume":"468","author":"T. Calamoneri","year":"2013","unstructured":"Calamoneri, T., Montefusco, E., Petreschi, R., Sinaimeri, B.: Exploring Pairwise Compatibility Graphs. Theoretical Computer Science\u00a0468, 23\u201336 (2013)","journal-title":"Theoretical Computer Science"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-74839-7_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.-S. Chang","year":"2007","unstructured":"Chang, M.-S., Ko, M.-T.: The 3-Steiner Root Problem. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 109\u2013120. Springer, Heidelberg (2007)"},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-005-1180-z","volume":"44","author":"M. Dom","year":"2006","unstructured":"Dom, M., Guo, J., Hffner, F., Niedermeier, R.: Error Compensation in Leaf Root Problems. Algorithmica\u00a044(4), 363\u2013381 (2006)","journal-title":"Algorithmica"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11604686_35","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Dom","year":"2005","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Extending the Tractability Border for Closest Leaf Powers. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 397\u2013408. Springer, Heidelberg (2005)"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M. Farber","year":"1983","unstructured":"Farber, M.: Characterizations of Strongly Chordal Graphs. Discrete Mathematics\u00a043, 173\u2013189 (1983)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","volume":"13","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: A Recognition Algorithm for the Intersection Graphs of Directed Paths in Directed Trees. Discrete Mathematics\u00a013(3), 237\u2013249 (1974)","journal-title":"Discrete Mathematics"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/jgt.3190050314","volume":"5","author":"E. Howorka","year":"1981","unstructured":"Howorka, E.: A Characterization of Ptolemaic Graphs. Journal of Graph Theory\u00a05, 323\u2013331 (1981)","journal-title":"Journal of Graph Theory"},{"key":"30_CR19","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-39763-2_14","volume-title":"Algorithms in Bioinformatics","author":"P. Kearney","year":"2003","unstructured":"Kearney, P., Munro, J.I., Phillips, D.: Efficient Generation of Uniform Samples from Phylogenetic Trees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 177\u2013189. Springer, Heidelberg (2003)"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-45043-3_33","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Nevries","year":"2013","unstructured":"Nevries, R., Rosenke, C.: Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol.\u00a08165, pp. 382\u2013393. Springer, Heidelberg (2013)"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Nevries, R., Rosenke, C.: Towards a Characterization of Leaf Powers by Clique Arrangements (2014), \n                      \n                        http:\/\/arxiv.org\/","DOI":"10.1007\/978-3-662-46078-8_30"},{"issue":"1","key":"30_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1195","volume":"42","author":"N. Nishimura","year":"2002","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: On Graph Powers for Leaf Labeled Trees. Journal of Algorithms\u00a042(1), 69\u2013108 (2002)","journal-title":"Journal of Algorithms"},{"issue":"13","key":"30_CR23","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.disc.2006.03.030","volume":"306","author":"D. Rautenbach","year":"2006","unstructured":"Rautenbach, D.: Some Remarks about Leaf Roots. Discrete Mathematics\u00a0306(13), 1456\u20131461 (2006)","journal-title":"Discrete Mathematics"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11602613_20","volume-title":"Algorithms and Computation","author":"R. Uehara","year":"2005","unstructured":"Uehara, R., Uno, Y.: Laminar Structure of Ptolemaic Graphs and its Applications. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 186\u2013195. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:59:39Z","timestamp":1559087979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}