{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:31:35Z","timestamp":1762867895499,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_1","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Succinct Data Structures for Families of Interval Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1059-1388","authenticated-orcid":false,"given":"H\u00fcseyin","family":"Acan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sankardeep","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8644-3691","authenticated-orcid":false,"given":"Seungbum","family":"Jo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0636-9880","authenticated-orcid":false,"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"2\u20133","key":"1_CR1","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.tcs.2008.08.016","volume":"408","author":"LC Aleardi","year":"2008","unstructured":"Aleardi, L.C., Devillers, O., Schaeffer, G.: Succinct representations of planar maps. Theor. Comput. Sci. 408(2\u20133), 174\u2013187 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5), 1069\u20131090 (2001)","journal-title":"J. ACM"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S Benser","year":"1959","unstructured":"Benser, S.: On the topology of the genetic fine structure. Proc. Nat. Acad. Sci. 45, 1607\u20131620 (1959)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-03367-4_9","volume-title":"Algorithms and Data Structures","author":"P Bose","year":"2009","unstructured":"Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 98\u2013109. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03367-4_9"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00453-011-9499-0","volume":"63","author":"GS Brodal","year":"2012","unstructured":"Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. Algorithmica 63(4), 815\u2013830 (2012)","journal-title":"Algorithmica"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<249::AID-NET5>3.0.CO;2-D","volume":"31","author":"DZ Chen","year":"1998","unstructured":"Chen, D.Z., Lee, D.T., Sridhar, R., Sekharan, C.N.: Solving the all-pair shortest path query problem on interval and circular-arc graphs. Networks 31(4), 249\u2013258 (1998)","journal-title":"Networks"},{"key":"1_CR8","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 383\u2013391 (1996)"},{"key":"1_CR9","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"1_CR10","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/s00453-012-9712-9","volume":"69","author":"A Farzan","year":"2014","unstructured":"Farzan, A., Kamali, S.: Compact navigation and distance oracles for graphs with small treewidth. Algorithmica 69(1), 92\u2013116 (2014)","journal-title":"Algorithmica"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2013.09.031","volume":"513","author":"A Farzan","year":"2013","unstructured":"Farzan, A., Munro, J.I.: Succinct encoding of arbitrary graphs. Theor. Comput. Sci. 513, 38\u201352 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR13","volume-title":"Mathematical Constants","author":"SR Finch","year":"2003","unstructured":"Finch, S.R.: Mathematical Constants. Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(85)90039-1","volume":"55","author":"MC Golumbic","year":"1985","unstructured":"Golumbic, M.C.: Interval graphs and related topics. Discrete Math. 55(2), 113\u2013121 (1985)","journal-title":"Discrete Math."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"5","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1145\/174147.169675","volume":"40","author":"MC Golumbic","year":"1993","unstructured":"Golumbic, M.C., Shamir, R.: Complexity and algorithms for reasoning about time: a graph-theoretic approach. J. ACM 40(5), 1108\u20131133 (1993)","journal-title":"J. ACM"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Golynski, A., Munro, J.I., Rao, S.S.: Rank\/select operations on large alphabets: a tool for text indexing. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 368\u2013373 (2006)","DOI":"10.1145\/1109557.1109599"},{"issue":"1\u20132","key":"1_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1\u20132), 59\u201384 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR20","unstructured":"Haj\u00f3s, G.: \u00dcber eine art von graphen. Int. Math. Nachr. 11, 1607\u20131620"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1090\/S0002-9947-1982-0662044-8","volume":"272","author":"P Hanlon","year":"1982","unstructured":"Hanlon, P.: Counting interval graphs. Trans. Am. Math. Soc. 272(2), 383\u2013426 (1982)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20132","key":"1_CR22","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0012-365X(87)90126-9","volume":"66","author":"S Klavzar","year":"1987","unstructured":"Klavzar, S., Petkovsek, M.: Intersection graphs of halflines and halfplanes. Discrete Math. 66(1\u20132), 133\u2013137 (1987)","journal-title":"Discrete Math."},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"JI Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762\u2013776 (2001)","journal-title":"SIAM J. Comput."},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Munro, J.I., Wu, K.: Succinct data structures for chordal graphs. In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, pp. 67:1\u201367:12 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.67","DOI":"10.4230\/LIPIcs.ISAAC.2018.67"},{"key":"1_CR25","unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory (1969)"},{"key":"1_CR26","unstructured":"Sloane, N.J.E.: The on-line encyclopedia of integer sequences. http:\/\/oeis.org"},{"issue":"1","key":"1_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/bproc\/27","volume":"4","author":"JC Yang","year":"2017","unstructured":"Yang, J.C., Pippenger, N.: On the enumeration of interval graphs. Proc. Am. Math. Soc. Ser. B 4(1), 1\u20133 (2017)","journal-title":"Proc. Am. Math. Soc. Ser. B"},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/bioinformatics\/10.3.309","volume":"10","author":"P Zhang","year":"1994","unstructured":"Zhang, P., et al.: An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA. Bioinformatics 10(3), 309\u2013317 (1994)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:52:14Z","timestamp":1710265934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}