{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:48:04Z","timestamp":1770972484420,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642293436","type":"print"},{"value":"9783642293443","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_24","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"279-290","source":"Crossref","is-referenced-by-count":23,"title":["Computing Minimum Geodetic Sets of Proper Interval Graphs"],"prefix":"10.1007","author":[{"given":"T\u0131naz","family":"Ekim","sequence":"first","affiliation":[]},{"given":"Aysel","family":"Erey","sequence":"additional","affiliation":[]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[]},{"given":"Pim","family":"van \u2019t Hof","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Meister","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"A.A. Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Information Processing Letters\u00a019, 37\u201340 (1984)","journal-title":"Information Processing Letters"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1080\/16073606.1985.9631921","volume":"8","author":"F. Buckley","year":"1986","unstructured":"Buckley, F., Harary, F.: Geodetic games for graphs. Questiones Mathematicae\u00a08, 321\u2013334 (1986)","journal-title":"Questiones Mathematicae"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","volume":"55","author":"D.G. Corneil","year":"1995","unstructured":"Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.P.: Simple linear time recognition of unit interval graphs. Information Processing Letters\u00a055, 99\u2013104 (1995)","journal-title":"Information Processing Letters"},{"key":"24_CR5","unstructured":"Dewdney, A.K.: Fast Turing reductions between problems in NP. Technical Report\u00a071, Department of Computer Science, University of Western Ontario (1981)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"5668","DOI":"10.1016\/j.disc.2008.04.020","volume":"309","author":"M.C. Dourado","year":"2009","unstructured":"Dourado, M.C., Gimbel, J.G., Kratochv\u00edl, J., Protti, F., Szwarcfiter, J.L.: On the computation of the hull number of a graph. Discrete Mathematics\u00a0309, 5668\u20135674 (2009)","journal-title":"Discrete Mathematics"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.disc.2009.09.018","volume":"310","author":"M.C. Dourado","year":"2010","unstructured":"Dourado, M.C., Protti, F., Rautenbach, D., Szwarcfiter, J.L.: Some remarks on the geodetic number of a graph. Discrete Mathematics\u00a0310, 832\u2013837 (2010)","journal-title":"Discrete Mathematics"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/0607049","volume":"7","author":"M. Farber","year":"1986","unstructured":"Farber, M., Jamison, R.E.: Convexity in graphs and hypergraphs. SIAM Journal on Algebraic and Discrete Methods\u00a07, 433\u2013442 (1986)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.3230240104","volume":"24","author":"O. Gerstel","year":"1994","unstructured":"Gerstel, O., Zaks, S.: A new characterization of tree medians with applications to distributed sorting. Networks\u00a024, 23\u201329 (1994)","journal-title":"Networks"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","volume":"17","author":"F. Harary","year":"1993","unstructured":"Harary, F., Loukakis, E., Tsouros, C.: The geodetic number of a graph. Mathematical Computation Modelling\u00a017, 89\u201395 (1993)","journal-title":"Mathematical Computation Modelling"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"389","DOI":"10.2989\/16073600309486069","volume":"26","author":"T.W. Haynes","year":"2003","unstructured":"Haynes, T.W., Henning, M.A., Tiller, C.: Geodetic achievement and avoidance games for graphs. Quaestiones Mathematicae\u00a026, 389\u2013397 (2003)","journal-title":"Quaestiones Mathematicae"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.disc.2004.08.039","volume":"293","author":"C. Hernandoa","year":"2005","unstructured":"Hernandoa, C., Jiang, T., Mora, M., Pelayo, I.M., Seara, C.: On the Steiner, geodetic and hull numbers of graphs. Discrete Mathematics\u00a0293, 139\u2013154 (2005)","journal-title":"Discrete Mathematics"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0020-0190(75)90055-1","volume":"4","author":"A.N.C. Kang","year":"1975","unstructured":"Kang, A.N.C., Ault, D.A.: Some properties of a centroid of a free tree. Information Processing Letters\u00a04, 18\u201320 (1975)","journal-title":"Information Processing Letters"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90308-I","volume":"25","author":"P.J. Looges","year":"1993","unstructured":"Looges, P.J., Olariu, S.: Optimal greedy algorithms for indifference graphs. Computers & Mathematics with Applications\u00a025, 15\u201325 (1993)","journal-title":"Computers & Mathematics with Applications"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0012-365X(78)90098-5","volume":"24","author":"S.L. Mitchell","year":"1978","unstructured":"Mitchell, S.L.: Another characterization of the centroid of a tree. Discrete Mathematics\u00a024, 277\u2013280 (1978)","journal-title":"Discrete Mathematics"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/16073606.1988.9632167","volume":"12","author":"M. Nec\u00e1skov\u00e1","year":"1988","unstructured":"Nec\u00e1skov\u00e1, M.: A note on the achievement geodetic games. Quaestiones Mathematicae\u00a012, 115\u2013119 (1988)","journal-title":"Quaestiones Mathematicae"},{"key":"24_CR18","first-page":"267","volume":"50","author":"C. Pandu Rangan","year":"1998","unstructured":"Pandu Rangan, C., Parthasarathy, K.R., Prakash, V.: On the g-centroidal problem in special classes of perfect graphs. Ars Combinatoria\u00a050, 267\u2013278 (1998)","journal-title":"Ars Combinatoria"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1155\/IJMMS.2005.1405","volume":"9","author":"V. Prakash","year":"2005","unstructured":"Prakash, V.: An Efficient g-centroid Location Algorithm for Cographs. International Journal of Mathematics and Mathematical Sciences\u00a09, 1405\u20131413 (2005)","journal-title":"International Journal of Mathematics and Mathematical Sciences"},{"key":"24_CR20","unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146. Academic Press (1969)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J. Spinrad","year":"1987","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discrete Applied Mathematics\u00a018, 279\u2013292 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR22","unstructured":"Veeraraghavan, P.: Application of g-convexity in mobile ad hoc networks. In: Proceedings of CITA 2009, pp. 33\u201338 (2009)"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ejor.2005.04.026","volume":"175","author":"F.H. Wang","year":"2006","unstructured":"Wang, F.H., Wang, Y.L., Chang, J.M.: The lower and upper forcing geodetic numbers of block-cactus graphs. European Journal of Operational Research\u00a0175, 238\u2013245 (2006)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:56:50Z","timestamp":1556683010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}