Das, Ashok Kumar; Sahu, Rajkamal A characterization of unit interval bigraphs of open and closed intervals. (English) Zbl 07794332 Discrete Appl. Math. 342, 231-243 (2024). MSC: 05C76 05C62 05C75 PDFBibTeX XMLCite \textit{A. K. Das} and \textit{R. Sahu}, Discrete Appl. Math. 342, 231--243 (2024; Zbl 07794332) Full Text: DOI
Beisegel, Jesse; Köhler, Ekkehard; Scheffler, Robert; Strehler, Martin Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs. (English) Zbl 07729250 Algorithmica 85, No. 8, 2454-2481 (2023). MSC: 68Wxx 05Cxx 05C85 05C45 68R10 PDFBibTeX XMLCite \textit{J. Beisegel} et al., Algorithmica 85, No. 8, 2454--2481 (2023; Zbl 07729250) Full Text: DOI
Dumas, Maël; Perez, Anthony; Todinca, Ioan A cubic vertex-kernel for Trivially Perfect Editing. (English) Zbl 07673396 Algorithmica 85, No. 4, 1091-1110 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. Dumas} et al., Algorithmica 85, No. 4, 1091--1110 (2023; Zbl 07673396) Full Text: DOI arXiv
Paul, Sanchita; Ghosh, Shamik On some subclasses of interval catch digraphs. (English) Zbl 1487.05106 Electron. J. Graph Theory Appl. 10, No. 1, 157-171 (2022). MSC: 05C20 05C62 05C75 PDFBibTeX XMLCite \textit{S. Paul} and \textit{S. Ghosh}, Electron. J. Graph Theory Appl. 10, No. 1, 157--171 (2022; Zbl 1487.05106) Full Text: DOI
Hilmer, Kieran; Pinchasi, Rom; Ponomarenko, Vadim A theorem on indifference graphs. (English) Zbl 1498.05063 PUMP J. Undergrad. Res. 4, 161-167 (2021). MSC: 05C07 05C25 20M14 PDFBibTeX XMLCite \textit{K. Hilmer} et al., PUMP J. Undergrad. Res. 4, 161--167 (2021; Zbl 1498.05063) Full Text: Link
Soulignac, Francisco J. A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. (English) Zbl 1517.05170 Theor. Comput. Sci. 889, 105-134 (2021). MSC: 05C85 05C62 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Theor. Comput. Sci. 889, 105--134 (2021; Zbl 1517.05170) Full Text: DOI arXiv
Rutter, Ignaz; Strash, Darren; Stumpf, Peter; Vollmer, Michael Simultaneous representation of proper and unit interval graphs. (English) Zbl 07525517 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 80, 15 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{I. Rutter} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 80, 15 p. (2019; Zbl 07525517) Full Text: DOI arXiv
Crespelle, Christophe Fully dynamic representations of interval graphs. (English) Zbl 1403.68158 Theor. Comput. Sci. 759, 14-49 (2019). MSC: 68R10 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{C. Crespelle}, Theor. Comput. Sci. 759, 14--49 (2019; Zbl 1403.68158) Full Text: DOI
Laurent, M.; Seminaroti, M. A Lex-BFS-based recognition algorithm for Robinsonian matrices. (English) Zbl 1396.05051 Discrete Appl. Math. 222, 151-165 (2017). MSC: 05C30 05C65 05C85 PDFBibTeX XMLCite \textit{M. Laurent} and \textit{M. Seminaroti}, Discrete Appl. Math. 222, 151--165 (2017; Zbl 1396.05051) Full Text: DOI arXiv
Laurent, Monique; Seminaroti, Matteo A Lex-BFS-based recognition algorithm for Robinsonian matrices. (English) Zbl 1383.68067 Paschos, Vangelis Th. (ed.) et al., Algorithms and complexity. 9th international conference, CIAC 2015, Paris, France, May 20–22, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-18172-1/pbk; 978-3-319-18173-8/ebook). Lecture Notes in Computer Science 9079, 325-338 (2015). MSC: 68T10 62H20 68R10 68T20 PDFBibTeX XMLCite \textit{M. Laurent} and \textit{M. Seminaroti}, Lect. Notes Comput. Sci. 9079, 325--338 (2015; Zbl 1383.68067) Full Text: DOI arXiv
Köbler, Johannes; Kuhnert, Sebastian; Watanabe, Osamu Interval graph representation with given interval and intersection lengths. (English) Zbl 1336.05134 J. Discrete Algorithms 34, 108-117 (2015). MSC: 05C85 05C62 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Köbler} et al., J. Discrete Algorithms 34, 108--117 (2015; Zbl 1336.05134) Full Text: DOI
Soulignac, Francisco J. Fully dynamic recognition of proper circular-arc graphs. (English) Zbl 1323.05125 Algorithmica 71, No. 4, 904-968 (2015). Reviewer: Vladimír Lacko (Košice) MSC: 05C85 05C62 05C40 68Q25 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Algorithmica 71, No. 4, 904--968 (2015; Zbl 1323.05125) Full Text: DOI arXiv Link
Nussbaum, Yahav Recognition of probe proper interval graphs. (English) Zbl 1284.05218 Discrete Appl. Math. 167, 228-238 (2014). MSC: 05C70 05C69 PDFBibTeX XMLCite \textit{Y. Nussbaum}, Discrete Appl. Math. 167, 228--238 (2014; Zbl 1284.05218) Full Text: DOI
Bessy, Stéphane; Perez, Anthony Polynomial kernels for proper interval completion and related problems. (English) Zbl 1358.68117 Inf. Comput. 231, 89-108 (2013). MSC: 68Q25 05C62 PDFBibTeX XMLCite \textit{S. Bessy} and \textit{A. Perez}, Inf. Comput. 231, 89--108 (2013; Zbl 1358.68117) Full Text: DOI
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. Normal Helly circular-arc graphs and its subclasses. (English) Zbl 1263.05064 Discrete Appl. Math. 161, No. 7-8, 1037-1059 (2013). MSC: 05C62 05C75 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Discrete Appl. Math. 161, No. 7--8, 1037--1059 (2013; Zbl 1263.05064) Full Text: DOI
Le, Van Bang; Rautenbach, Dieter Integral mixed unit interval graphs. (English) Zbl 1262.05107 Discrete Appl. Math. 161, No. 7-8, 1028-1036 (2013). MSC: 05C62 05C75 PDFBibTeX XMLCite \textit{V. B. Le} and \textit{D. Rautenbach}, Discrete Appl. Math. 161, No. 7--8, 1028--1036 (2013; Zbl 1262.05107) Full Text: DOI
Rautenbach, Dieter; Szwarcfiter, Jayme L. Unit interval graphs of open and closed intervals. (English) Zbl 1261.05070 J. Graph Theory 72, No. 3-4, 418-429 (2013). MSC: 05C62 05C90 PDFBibTeX XMLCite \textit{D. Rautenbach} and \textit{J. L. Szwarcfiter}, J. Graph Theory 72, No. 3--4, 418--429 (2013; Zbl 1261.05070) Full Text: DOI
Dourado, Mitre C.; Le, Van Bang; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L. Mixed unit interval graphs. (English) Zbl 1251.05037 Discrete Math. 312, No. 22, 3357-3363 (2012). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 312, No. 22, 3357--3363 (2012; Zbl 1251.05037) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas; Papadopoulos, Charis A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs. (English) Zbl 1246.05152 Theor. Comput. Sci. 439, 41-57 (2012). MSC: 05C85 05C42 05C62 05C05 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} et al., Theor. Comput. Sci. 439, 41--57 (2012; Zbl 1246.05152) Full Text: DOI
Gioan, Emeric; Paul, Christophe Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs. (English) Zbl 1236.05162 Discrete Appl. Math. 160, No. 6, 708-733 (2012). MSC: 05C70 05C78 05C05 05C12 PDFBibTeX XMLCite \textit{E. Gioan} and \textit{C. Paul}, Discrete Appl. Math. 160, No. 6, 708--733 (2012; Zbl 1236.05162) Full Text: DOI
Rautenbach, Dieter; Szwarcfiter, Jayme L. Unit interval graphs: a story with open ends. (English) Zbl 1274.05405 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 737-742 (2011). MSC: 05C75 05C62 PDFBibTeX XMLCite \textit{D. Rautenbach} and \textit{J. L. Szwarcfiter}, Electron. Notes Discrete Math. 38, 737--742 (2011; Zbl 1274.05405) Full Text: Link
Lozin, Vadim V. Minimal classes of graphs of unbounded clique-width. (English) Zbl 1234.05191 Ann. Comb. 15, No. 4, 707-722 (2011). MSC: 05C75 05C69 05C35 PDFBibTeX XMLCite \textit{V. V. Lozin}, Ann. Comb. 15, No. 4, 707--722 (2011; Zbl 1234.05191) Full Text: DOI
Lozin, Vadim V.; Mayhill, Colin Canonical antichains of unit interval and bipartite permutation graphs. (English) Zbl 1234.05222 Order 28, No. 3, 513-522 (2011). MSC: 05C83 05A05 PDFBibTeX XMLCite \textit{V. V. Lozin} and \textit{C. Mayhill}, Order 28, No. 3, 513--522 (2011; Zbl 1234.05222) Full Text: DOI
Habib, Michel; Paul, Christophe A survey of the algorithmic aspects of modular decomposition. (English) Zbl 1302.68140 Comput. Sci. Rev. 4, No. 1, 41-59 (2010). MSC: 68Q25 05C70 05C85 05C90 68R10 68-02 05-02 PDFBibTeX XMLCite \textit{M. Habib} and \textit{C. Paul}, Comput. Sci. Rev. 4, No. 1, 41--59 (2010; Zbl 1302.68140) Full Text: DOI Link
Mertzios, George B.; Unger, Walter An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs. (English) Zbl 1205.05226 Math. Comput. Sci. 3, No. 1, 85-96 (2010). MSC: 05C85 05C38 68R10 05C62 05C70 PDFBibTeX XMLCite \textit{G. B. Mertzios} and \textit{W. Unger}, Math. Comput. Sci. 3, No. 1, 85--96 (2010; Zbl 1205.05226) Full Text: DOI
Ibarra, Louis A fully dynamic graph algorithm for recognizing interval graphs. (English) Zbl 1200.05227 Algorithmica 58, No. 3, 637-678 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{L. Ibarra}, Algorithmica 58, No. 3, 637--678 (2010; Zbl 1200.05227) Full Text: DOI
Crespelle, Christophe; Paul, Christophe Fully dynamic algorithm for recognition and modular decomposition of permutation graphs. (English) Zbl 1205.68258 Algorithmica 58, No. 2, 405-432 (2010). MSC: 68R10 05C85 68P05 PDFBibTeX XMLCite \textit{C. Crespelle} and \textit{C. Paul}, Algorithmica 58, No. 2, 405--432 (2010; Zbl 1205.68258) Full Text: DOI Link
Asdre, Katerina; Nikolopoulos, Stavros D. A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs. (English) Zbl 1222.05117 Theor. Comput. Sci. 411, No. 7-9, 967-975 (2010). MSC: 05C38 05C85 PDFBibTeX XMLCite \textit{K. Asdre} and \textit{S. D. Nikolopoulos}, Theor. Comput. Sci. 411, No. 7--9, 967--975 (2010; Zbl 1222.05117) Full Text: DOI
Ibarra, Louis A simple algorithm to find Hamiltonian cycles in proper interval graphs. (English) Zbl 1197.05085 Inf. Process. Lett. 109, No. 18, 1105-1108 (2009). MSC: 05C45 05C85 PDFBibTeX XMLCite \textit{L. Ibarra}, Inf. Process. Lett. 109, No. 18, 1105--1108 (2009; Zbl 1197.05085) Full Text: DOI
Morgan, David A dynamic distributed approach to representing proper interval graphs. (English) Zbl 1210.05085 Discrete Math. 309, No. 18, 5697-5702 (2009). MSC: 05C62 PDFBibTeX XMLCite \textit{D. Morgan}, Discrete Math. 309, No. 18, 5697--5702 (2009; Zbl 1210.05085) Full Text: DOI
Ibarra, Louis The clique-separator graph for chordal graphs. (English) Zbl 1173.05036 Discrete Appl. Math. 157, No. 8, 1737-1749 (2009). MSC: 05C69 PDFBibTeX XMLCite \textit{L. Ibarra}, Discrete Appl. Math. 157, No. 8, 1737--1749 (2009; Zbl 1173.05036) Full Text: DOI
Heggernes, Pinar; Mancini, Federico Dynamically maintaining split graphs. (English) Zbl 1179.05106 Discrete Appl. Math. 157, No. 9, 2057-2069 (2009). MSC: 05C85 05C69 05C76 68R10 PDFBibTeX XMLCite \textit{P. Heggernes} and \textit{F. Mancini}, Discrete Appl. Math. 157, No. 9, 2057--2069 (2009; Zbl 1179.05106) Full Text: DOI
Ibarra, Louis A fully dynamic graph algorithm for recognizing proper interval graphs. (English) Zbl 1211.68288 Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 190-201 (2009). MSC: 68R10 05C40 05C85 PDFBibTeX XMLCite \textit{L. Ibarra}, Lect. Notes Comput. Sci. 5431, 190--201 (2009; Zbl 1211.68288) Full Text: DOI
Saitoh, Toshiki; Yamanaka, Katsuhisa; Kiyomi, Masashi; Uehara, Ryuhei Random generation and enumeration of proper interval graphs. (English) Zbl 1211.68291 Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 177-189 (2009). MSC: 68R10 05C30 05C85 PDFBibTeX XMLCite \textit{T. Saitoh} et al., Lect. Notes Comput. Sci. 5431, 177--189 (2009; Zbl 1211.68291) Full Text: DOI
Gioan, Emeric; Paul, Christophe Dynamic distance hereditary graphs using split decomposition. (English) Zbl 1193.68191 Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 41-51 (2007). MSC: 68R10 05C12 PDFBibTeX XMLCite \textit{E. Gioan} and \textit{C. Paul}, Lect. Notes Comput. Sci. 4835, 41--51 (2007; Zbl 1193.68191) Full Text: DOI
Bang-Jensen, Jørgen; Huang, Jing; Ibarra, Louis Recognizing and representing proper interval graphs in parallel using merging and sorting. (English) Zbl 1109.68079 Discrete Appl. Math. 155, No. 4, 442-456 (2007). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Appl. Math. 155, No. 4, 442--456 (2007; Zbl 1109.68079) Full Text: DOI
Hsieh, Sun-Yuan The interval-merging problem. (English) Zbl 1142.68332 Inf. Sci. 177, No. 2, 519-524 (2007). MSC: 68P05 68W10 68W40 PDFBibTeX XMLCite \textit{S.-Y. Hsieh}, Inf. Sci. 177, No. 2, 519--524 (2007; Zbl 1142.68332) Full Text: DOI
Crespelle, C.; Paul, C. Fully dynamic recognition algorithm and certificate for directed cographs. (English) Zbl 1110.68096 Discrete Appl. Math. 154, No. 12, 1722-1741 (2006). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{C. Crespelle} and \textit{C. Paul}, Discrete Appl. Math. 154, No. 12, 1722--1741 (2006; Zbl 1110.68096) Full Text: DOI
Corneil, Derek G. A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. (English) Zbl 1042.05067 Discrete Appl. Math. 138, No. 3, 371-379 (2004). MSC: 05C60 05C85 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil}, Discrete Appl. Math. 138, No. 3, 371--379 (2004; Zbl 1042.05067) Full Text: DOI
Shamir, Ron; Sharan, Roded A fully dynamic algorithm for modular decomposition and recognition of cographs. (English) Zbl 1062.68092 Discrete Appl. Math. 136, No. 2-3, 329-340 (2004). MSC: 68R10 05C62 05C70 PDFBibTeX XMLCite \textit{R. Shamir} and \textit{R. Sharan}, Discrete Appl. Math. 136, No. 2--3, 329--340 (2004; Zbl 1062.68092) Full Text: DOI