{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T17:21:12Z","timestamp":1720459272703},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T00:00:00Z","timestamp":1675814400000},"content-version":"vor","delay-in-days":1468,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1016\/j.tcs.2019.01.007","type":"journal-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T16:18:10Z","timestamp":1547050690000},"page":"14-49","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Fully dynamic representations of interval graphs"],"prefix":"10.1016","volume":"759","author":[{"given":"Christophe","family":"Crespelle","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2019.01.007_br0010","series-title":"Graph-Theoretic Concepts in Computer Science: 35th International Workshop","first-page":"77","article-title":"Fully dynamic representations of interval graphs","volume":"vol. 5911","author":"Crespelle","year":"2009"},{"key":"10.1016\/j.tcs.2019.01.007_br0020","series-title":"Proceedings of the Third Annual ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/j.tcs.2019.01.007_br0030","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","article-title":"Graph Classes: A Survey","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/j.tcs.2019.01.007_br0040","article-title":"\u00dcber eine art von graphen","volume":"11","author":"Haj\u00f6s","year":"1957","journal-title":"Internat. Math. Nachr."},{"key":"10.1016\/j.tcs.2019.01.007_br0050","article-title":"Algorithmic Graph Theory and Perfect Graphs","volume":"vol. 57","author":"Golumbic","year":"2004"},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0060","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2019.01.007_br0070","series-title":"Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"175","article-title":"The ultimate interval graph recognition algorithm?","author":"Corneil","year":"1998"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2019.01.007_br0080","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","article-title":"Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing","volume":"234","author":"Habib","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2019.01.007_br0090","series-title":"18th International Workshop on Graph-Theoretic Concept in Computer Science","first-page":"11","article-title":"A simple test for interval graphs","volume":"vol. 657","author":"Hsu","year":"1993"},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0100","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/S0097539792224814","article-title":"Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs","volume":"28","author":"Hsu","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2019.01.007_br0110","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","article-title":"An incremental linear-time algorithm for recognizing interval graphs","volume":"18","author":"Korte","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2019.01.007_br0120","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/S0097539703437855","article-title":"Certifying algorithms for recognizing interval graphs and permutation graphs","volume":"36","author":"Kratsch","year":"2006","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2019.01.007_br0130","series-title":"Graphs and Orders","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/j.tcs.2019.01.007_br0140","series-title":"International Workshop on Computational Geometry \u2013 Methods, Algorithms and Applications","first-page":"289","article-title":"A new simple linear algorithm to recognize interval graphs","volume":"vol. 553","author":"Simon","year":"1991"},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0150","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.dam.2003.07.001","article-title":"A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs","volume":"138","author":"Corneil","year":"2004","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2019.01.007_br0160","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","article-title":"Simple linear time recognition of unit interval graphs","volume":"55","author":"Corneil","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0170","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0020-0190(95)00133-W","article-title":"A linear-time algorithm for proper interval graph recognition","volume":"56","author":"de Figueiredo","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0180","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/S0895480103430259","article-title":"Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs","volume":"18","author":"Hell","year":"2004","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0190","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0020-0190(03)00298-9","article-title":"A linear time recognition algorithm for proper interval graphs","volume":"87","author":"Panda","year":"2003","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2019.01.007_br0200","article-title":"Efficient Graph Representations","volume":"vol. 19","author":"Spinrad","year":"2003"},{"key":"10.1016\/j.tcs.2019.01.007_br0210","series-title":"WG","first-page":"143","article-title":"Transitive orientation of graphs with side constraints","author":"Korte","year":"1985"},{"key":"10.1016\/j.tcs.2019.01.007_br0220","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2012.12.031","article-title":"An O(n2)-time algorithm for the minimal interval completion problem","volume":"494","author":"Crespelle","year":"2013","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2019.01.007_br0230","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1137\/S0097539794280736","article-title":"On-line planarity testing","volume":"25","author":"Battista","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2019.01.007_br0240","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s00453-008-9273-0","article-title":"Fully dynamic algorithm for recognition and modular decomposition of permutation graphs","volume":"58","author":"Crespelle","year":"2010","journal-title":"Algorithmica"},{"issue":"12","key":"10.1016\/j.tcs.2019.01.007_br0250","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1016\/j.dam.2006.03.005","article-title":"Fully dynamic recognition algorithm and certificate for directed cographs","volume":"154","author":"Crespelle","year":"2006","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2019.01.007_br0260","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/S0097539794269072","article-title":"Separator based sparsification II: edge and vertex connectivity","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2019.01.007_br0270","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0097539700372216","article-title":"A fully dynamic algorithm for recognizing and representing proper interval graphs","volume":"31","author":"Hell","year":"2002","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2019.01.007_br0280","doi-asserted-by":"crossref","first-page":"40:1","DOI":"10.1145\/1383369.1383371","article-title":"Fully dynamic algorithms for chordal graphs and split graphs","volume":"4","author":"Ibarra","year":"2008","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2019.01.007_br0290","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.tcs.2012.03.020","article-title":"A fully dynamic algorithm for the recognition of P4-sparse graphs","volume":"439","author":"Nikolopoulos","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"2\u20133","key":"10.1016\/j.tcs.2019.01.007_br0300","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0166-218X(03)00448-7","article-title":"A fully dynamic algorithm for modular decomposition and recognition of cographs","volume":"136","author":"Shamir","year":"2004","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2019.01.007_br0310","series-title":"STACS","first-page":"344","article-title":"An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs","volume":"vol. 4393","author":"Tedder","year":"2007"},{"key":"10.1016\/j.tcs.2019.01.007_br0320","series-title":"Combinatorics and Computer Science","first-page":"27","article-title":"On-line recognition of interval graphs in O(m+nlog\u2061n) time","author":"Hsu","year":"1996"},{"key":"10.1016\/j.tcs.2019.01.007_br0330","series-title":"Dynamic Representation of Consecutive-Ones Matrices and Interval Graphs","author":"Springer","year":"2015"},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0340","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s00453-009-9291-6","article-title":"A fully dynamic graph algorithm for recognizing interval graphs","volume":"58","author":"Ibarra","year":"2010","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2019.01.007_br0350","series-title":"International Workshop on Algorithms and Computation","first-page":"190","article-title":"A fully dynamic graph algorithm for recognizing proper interval graphs","author":"Ibarra","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2019.01.007_br0360","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","article-title":"Incremental modular decomposition algorithm","volume":"36","author":"Muller","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.tcs.2019.01.007_br0370","series-title":"31st Int. Workshop on Graph Theoretical Concepts in Computer Science","first-page":"421","article-title":"Algebraic operations on PQ trees and modular decomposition trees","volume":"vol. 3787","author":"McConnell","year":"2005"},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0380","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1137\/060651331","article-title":"Computing common intervals of k permutations, with applications to modular decomposition of graphs","volume":"22","author":"Bergeron","year":"2008","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2019.01.007_br0390","series-title":"16th International Symposium on Algorithms and Computation","first-page":"146","article-title":"Revisiting Uno and Yagiura's algorithm","volume":"vol. 3827","author":"Bui-Xuan","year":"2005"},{"issue":"2","key":"10.1016\/j.tcs.2019.01.007_br0400","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/s004539910014","article-title":"Fast algorithms to enumerate all common intervals of two permutations","volume":"26","author":"Uno","year":"2000","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2019.01.007_br0410","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.tcs.2019.01.007_br0420","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02022041","article-title":"Algorithmic aspect of the substitution decomposition in optimization over relations, set systems and boolean functions","volume":"4","author":"M\u00f6hring","year":"1985","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.tcs.2019.01.007_br0430","first-page":"257","article-title":"Substitution decomposition for discrete structures and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"10.1016\/j.tcs.2019.01.007_br0440","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(02)00435-8","article-title":"PC trees and circular-ones arrangements","volume":"296","author":"Hsu","year":"2003","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2019.01.007_br0450","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.disc.2005.12.003","article-title":"Minimal triangulations of graphs: a survey","volume":"306","author":"Heggernes","year":"2006","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2019.01.007_br0460","series-title":"Path Graphs and PR-Trees","author":"Chaplick","year":"2012"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397519300209?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397519300209?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T16:33:58Z","timestamp":1712421238000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397519300209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":46,"alternative-id":["S0304397519300209"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2019.01.007","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2019,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fully dynamic representations of interval graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2019.01.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}