Kawahara, Jun; Saitoh, Toshiki; Takeda, Hirokazu; Yoshinaka, Ryo; Yoshioka, Yui Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs. (English) Zbl 07770289 Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 151-163 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Kawahara} et al., Lect. Notes Comput. Sci. 13973, 151--163 (2023; Zbl 07770289) Full Text: DOI arXiv
Chaplick, Steven Intersection graphs of non-crossing paths. (English) Zbl 1515.05152 Discrete Math. 346, No. 8, Article ID 113498, 14 p. (2023). MSC: 05C76 05C38 05C45 05C69 05C05 05C75 PDFBibTeX XMLCite \textit{S. Chaplick}, Discrete Math. 346, No. 8, Article ID 113498, 14 p. (2023; Zbl 1515.05152) Full Text: DOI
Chandran, L. Sunil; Das, Sajal K.; Hell, Pavol; Padinhatteeri, Sajith; Pillai, Raji R. Template-driven rainbow coloring of proper interval graphs. (English) Zbl 1508.05054 Discrete Appl. Math. 328, 97-107 (2023). MSC: 05C15 68R10 68W10 68M14 68P05 PDFBibTeX XMLCite \textit{L. S. Chandran} et al., Discrete Appl. Math. 328, 97--107 (2023; Zbl 1508.05054) Full Text: DOI
Fiala, Jiří; Rutter, Ignaz; Stumpf, Peter; Zeman, Peter Extending partial representations of circular-arc graphs. (English) Zbl 07682413 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 230-243 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Fiala} et al., Lect. Notes Comput. Sci. 13453, 230--243 (2022; Zbl 07682413) Full Text: DOI arXiv
Adams, Henry; Coldren, Sophia; Willmot, Sean The persistent homology of cyclic graphs. (English) Zbl 07633849 Int. J. Comput. Geom. Appl. 32, No. 1-2, 1-37 (2022). MSC: 68U05 PDFBibTeX XMLCite \textit{H. Adams} et al., Int. J. Comput. Geom. Appl. 32, No. 1--2, 1--37 (2022; Zbl 07633849) Full Text: DOI arXiv
Dourado, Mitre C.; Penso, Lucia D.; Rautenbach, Dieter The hull number in the convexity of induced paths of order \(3\). (English) Zbl 07477132 Theor. Comput. Sci. 906, 52-63 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Theor. Comput. Sci. 906, 52--63 (2022; Zbl 07477132) Full Text: DOI
Chandran, L. Sunil; Das, Sajal K.; Hell, Pavol; Padinhatteeri, Sajith; Pillai, Raji R. Template-driven rainbow coloring of proper interval graphs. (English) Zbl 07497552 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 452-470 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{L. S. Chandran} et al., Lect. Notes Comput. Sci. 12601, 452--470 (2021; Zbl 07497552) Full Text: DOI
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
Soulignac, Francisco J. Total 2-domination of proper interval graphs. (English) Zbl 1509.05142 Discrete Appl. Math. 302, 256-262 (2021). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Discrete Appl. Math. 302, 256--262 (2021; Zbl 1509.05142) Full Text: DOI arXiv
Safe, Martín D. Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs. (English) Zbl 1462.05311 SIAM J. Discrete Math. 35, No. 2, 707-751 (2021). MSC: 05C75 05C62 05C85 05C20 PDFBibTeX XMLCite \textit{M. D. Safe}, SIAM J. Discrete Math. 35, No. 2, 707--751 (2021; Zbl 1462.05311) Full Text: DOI arXiv
Yamada, Takeshi; Uehara, Ryuhei Shortest reconfiguration of sliding tokens on subclasses of interval graphs. (English) Zbl 1497.68399 Theor. Comput. Sci. 863, 53-68 (2021). MSC: 68R10 05C62 05C69 68W40 PDFBibTeX XMLCite \textit{T. Yamada} and \textit{R. Uehara}, Theor. Comput. Sci. 863, 53--68 (2021; Zbl 1497.68399) Full Text: DOI
Chaplick, Steven; Golovach, Petr A.; Hartmann, Tim A.; Knop, Dušan Recognizing proper tree-graphs. (English) Zbl 07764099 Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 8, 15 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{S. Chaplick} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 8, 15 p. (2020; Zbl 07764099) Full Text: DOI arXiv
Konstantinidis, Athanasios L.; Papadopoulos, Charis Maximizing the strong triadic closure in split graphs and proper interval graphs. (English) Zbl 1446.05080 Discrete Appl. Math. 285, 79-95 (2020). MSC: 05C78 05C75 05C85 68Q17 91D30 PDFBibTeX XMLCite \textit{A. L. Konstantinidis} and \textit{C. Papadopoulos}, Discrete Appl. Math. 285, 79--95 (2020; Zbl 1446.05080) Full Text: DOI arXiv Link
Anand, Bijo S.; Chandran S. V., Ullas; Changat, Manoj; Dourado, Mitre C.; Hossein Nezhad, Ferdoos; Narasimha-Shenoi, Prasanth G. On the Carathéodory and exchange numbers of geodetic convexity in graphs. (English) Zbl 1442.05040 Theor. Comput. Sci. 804, 46-57 (2020). MSC: 05C10 05C62 68Q17 52A10 PDFBibTeX XMLCite \textit{B. S. Anand} et al., Theor. Comput. Sci. 804, 46--57 (2020; Zbl 1442.05040) Full Text: DOI
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
Groshaus, Marina; Guedes, André L. P.; Kolberg, Fabricio Schiavon Subclasses of circular-arc bigraphs: Helly, normal and proper. (English) Zbl 07515206 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 497-509 (2019). MSC: 05Cxx 90Cxx PDFBibTeX XMLCite \textit{M. Groshaus} et al., Electron. Notes Theor. Comput. Sci. 346, 497--509 (2019; Zbl 07515206) Full Text: DOI
Bonomo, Flavia; de Estrada, Diego On the thinness and proper thinness of a graph. (English) Zbl 1410.05155 Discrete Appl. Math. 261, 78-92 (2019). MSC: 05C69 PDFBibTeX XMLCite \textit{F. Bonomo} and \textit{D. de Estrada}, Discrete Appl. Math. 261, 78--92 (2019; Zbl 1410.05155) Full Text: DOI arXiv
Huang, Jing Lexicographic orientation algorithms. (English) Zbl 1407.05112 Bang-Jensen, Jørgen (ed.) et al., Classes of directed graphs. Cham: Springer. Springer Monogr. Math., 575-607 (2018). MSC: 05C20 05C38 05C12 PDFBibTeX XMLCite \textit{J. Huang}, in: Classes of directed graphs. Cham: Springer. 575--607 (2018; Zbl 1407.05112) Full Text: DOI
Ke, Yuping; Cao, Yixin; Ouyang, Xiating; Li, Wenjun; Wang, Jianxin Unit interval vertex deletion: fewer vertices are relevant. (English) Zbl 1391.68058 J. Comput. Syst. Sci. 95, 109-121 (2018). MSC: 68Q25 05C62 05C85 PDFBibTeX XMLCite \textit{Y. Ke} et al., J. Comput. Syst. Sci. 95, 109--121 (2018; Zbl 1391.68058) Full Text: DOI arXiv
Cook, Kathryn; Eschen, Elaine M.; Sritharan, R.; Wang, Xiaoqiang Completing colored graphs to meet a target property. (English) Zbl 1464.05147 Discrete Appl. Math. 223, 39-51 (2017). MSC: 05C15 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{K. Cook} et al., Discrete Appl. Math. 223, 39--51 (2017; Zbl 1464.05147) Full Text: DOI
Konstantinidis, Athanasios L.; Papadopoulos, Charis Maximizing the strong triadic closure in split graphs and proper interval graphs. (English) Zbl 1457.05098 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 53, 12 p. (2017). MSC: 05C78 05C62 05C75 05C85 68Q17 91D30 PDFBibTeX XMLCite \textit{A. L. Konstantinidis} and \textit{C. Papadopoulos}, LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 53, 12 p. (2017; Zbl 1457.05098) 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
Das, Ashok Kumar; Chakraborty, Ritapa Graphs and digraphs represented by intervals and circular arcs. (English) Zbl 1365.05107 Discrete Appl. Math. 228, 41-49 (2017). MSC: 05C20 PDFBibTeX XMLCite \textit{A. K. Das} and \textit{R. Chakraborty}, Discrete Appl. Math. 228, 41--49 (2017; Zbl 1365.05107) Full Text: DOI
Klavík, Pavel; Kratochvíl, Jan; Otachi, Yota; Rutter, Ignaz; Saitoh, Toshiki; Saumell, Maria; Vyskočil, Tomáš Extending partial representations of proper and unit interval graphs. (English) Zbl 1360.05167 Algorithmica 77, No. 4, 1071-1104 (2017). MSC: 05C85 05C62 68Q17 PDFBibTeX XMLCite \textit{P. Klavík} et al., Algorithmica 77, No. 4, 1071--1104 (2017; Zbl 1360.05167) Full Text: DOI arXiv
Cao, Yixin Unit interval editing is fixed-parameter tractable. (English) Zbl 1359.68230 Inf. Comput. 253, Part 1, 109-126 (2017). MSC: 68R10 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{Y. Cao}, Inf. Comput. 253, Part 1, 109--126 (2017; Zbl 1359.68230) Full Text: DOI arXiv
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg Circular-arc hypergraphs: rigidity via connectedness. (English) Zbl 1358.05204 Discrete Appl. Math. 217, Part 2, 220-228 (2017). MSC: 05C65 05C40 PDFBibTeX XMLCite \textit{J. Köbler} et al., Discrete Appl. Math. 217, Part 2, 220--228 (2017; Zbl 1358.05204) Full Text: DOI arXiv
Cao, Yixin; Grippo, Luciano N.; Safe, Martín D. Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection. (English) Zbl 1350.05104 Discrete Appl. Math. 216, Part 1, 67-83 (2017). MSC: 05C60 05C85 PDFBibTeX XMLCite \textit{Y. Cao} et al., Discrete Appl. Math. 216, Part 1, 67--83 (2017; Zbl 1350.05104) Full Text: DOI arXiv
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg Solving the canonical representation and star system problems for proper circular-arc graphs in logspace. (English) Zbl 1355.68124 J. Discrete Algorithms 38-41, 38-49 (2016). MSC: 68Q25 05C60 05C62 05C85 PDFBibTeX XMLCite \textit{J. Köbler} et al., J. Discrete Algorithms 38--41, 38--49 (2016; Zbl 1355.68124) Full Text: DOI arXiv Link
Yamada, Takeshi; Uehara, Ryuhei Shortest reconfiguration of sliding tokens on a caterpillar. (English) Zbl 1475.68254 Kaykobad, Mohammad (ed.) et al., WALCOM: algorithms and computation. 10th international workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9627, 236-248 (2016). MSC: 68R10 05C69 68W40 PDFBibTeX XMLCite \textit{T. Yamada} and \textit{R. Uehara}, Lect. Notes Comput. Sci. 9627, 236--248 (2016; Zbl 1475.68254) Full Text: DOI arXiv
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg On the isomorphism problem for Helly circular-arc graphs. (English) Zbl 1336.05093 Inf. Comput. 247, 266-277 (2016). MSC: 05C60 05C62 PDFBibTeX XMLCite \textit{J. Köbler} et al., Inf. Comput. 247, 266--277 (2016; Zbl 1336.05093) 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
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. A faster algorithm for the cluster editing problem on proper interval graphs. (English) Zbl 1338.68113 Inf. Process. Lett. 115, No. 12, 913-916 (2015). MSC: 68Q25 05C62 05C85 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Inf. Process. Lett. 115, No. 12, 913--916 (2015; Zbl 1338.68113) Full Text: DOI
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
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in claw-free graphs. (English) Zbl 1311.05090 SIAM J. Discrete Math. 29, No. 1, 348-375 (2015). MSC: 05C38 05C85 68R10 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., SIAM J. Discrete Math. 29, No. 1, 348--375 (2015; Zbl 1311.05090) Full Text: DOI arXiv Link
Klavík, Pavel; Kratochvíl, Jan; Otachi, Yota; Saitoh, Toshiki Extending partial representations of subclasses of chordal graphs. (English) Zbl 1311.05133 Theor. Comput. Sci. 576, 85-101 (2015). MSC: 05C62 PDFBibTeX XMLCite \textit{P. Klavík} et al., Theor. Comput. Sci. 576, 85--101 (2015; Zbl 1311.05133) Full Text: DOI
King, Andrew D.; Reed, Bruce A. Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\). (English) Zbl 1309.05076 J. Graph Theory 78, No. 3, 157-194 (2015). MSC: 05C15 05C60 05C70 PDFBibTeX XMLCite \textit{A. D. King} and \textit{B. A. Reed}, J. Graph Theory 78, No. 3, 157--194 (2015; Zbl 1309.05076) Full Text: DOI arXiv
Heggernes, Pinar; van ’t Hof, Pim; Meister, Daniel; Villanger, Yngve Induced subgraph isomorphism on proper interval and bipartite permutation graphs. (English) Zbl 1303.68060 Theor. Comput. Sci. 562, 252-269 (2015). MSC: 68Q17 05C60 68Q25 PDFBibTeX XMLCite \textit{P. Heggernes} et al., Theor. Comput. Sci. 562, 252--269 (2015; Zbl 1303.68060) Full Text: DOI
Gavruskin, Alexander; Khoussainov, Bakhadyr; Kokho, Mikhail; Liu, Jiamou Dynamic algorithms for monotonic interval scheduling problem. (English) Zbl 1303.68167 Theor. Comput. Sci. 562, 227-242 (2015). MSC: 68W40 68P05 90B35 PDFBibTeX XMLCite \textit{A. Gavruskin} et al., Theor. Comput. Sci. 562, 227--242 (2015; Zbl 1303.68167) Full Text: DOI arXiv
Edwards, Katherine; King, Andrew D. A superlocal version of Reed’s conjecture. (English) Zbl 1305.05074 Electron. J. Comb. 21, No. 4, Research Paper P4.48, 18 p. (2014). MSC: 05C15 05C72 PDFBibTeX XMLCite \textit{K. Edwards} and \textit{A. D. King}, Electron. J. Comb. 21, No. 4, Research Paper P4.48, 18 p. (2014; Zbl 1305.05074) Full Text: 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
Uehara, Ryuhei Tractabilities and intractabilities on geometric intersection graphs. (English) Zbl 1461.05148 Algorithms (Basel) 6, No. 1, 60-83 (2013). MSC: 05C62 PDFBibTeX XMLCite \textit{R. Uehara}, Algorithms (Basel) 6, No. 1, 60--83 (2013; Zbl 1461.05148) Full Text: DOI
Kennedy, Wm. Sean; King, Andrew D. Finding a smallest odd hole in a claw-free graph using global structure. (English) Zbl 1285.05155 Discrete Appl. Math. 161, No. 16-17, 2492-2498 (2013). MSC: 05C76 05C75 05C85 PDFBibTeX XMLCite \textit{Wm. S. Kennedy} and \textit{A. D. King}, Discrete Appl. Math. 161, No. 16--17, 2492--2498 (2013; Zbl 1285.05155) 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
Basu, Asim; Das, Sandip; Ghosh, Shamik; Sen, Malay Circular-arc bigraphs and its subclasses. (English) Zbl 1269.05025 J. Graph Theory 73, No. 3-4, 361-376 (2013). MSC: 05C10 05C20 PDFBibTeX XMLCite \textit{A. Basu} et al., J. Graph Theory 73, No. 3--4, 361--376 (2013; Zbl 1269.05025) Full Text: DOI
King, Andrew D.; Reed, Bruce Asymptotics of the chromatic number for quasi-line graphs. (English) Zbl 1269.05037 J. Graph Theory 73, No. 3-4, 327-341 (2013). MSC: 05C15 05C76 68W25 PDFBibTeX XMLCite \textit{A. D. King} and \textit{B. Reed}, J. Graph Theory 73, No. 3--4, 327--341 (2013; Zbl 1269.05037) Full Text: DOI arXiv
van ’t Hof, Pim; Villanger, Yngve Proper interval vertex deletion. (English) Zbl 1262.68052 Algorithmica 65, No. 4, 845-867 (2013). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{P. van 't Hof} and \textit{Y. Villanger}, Algorithmica 65, No. 4, 845--867 (2013; Zbl 1262.68052) 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
Heggernes, Pinar; Van ’t Hof, Pim; Paulusma, Daniël Computing role assignments of proper interval graphs in polynomial time. (English) Zbl 1247.05240 J. Discrete Algorithms 14, 173-188 (2012). MSC: 05C85 68W40 PDFBibTeX XMLCite \textit{P. Heggernes} et al., J. Discrete Algorithms 14, 173--188 (2012; Zbl 1247.05240) 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
Saitoh, Toshiki; Otachi, Yota; Yamanaka, Katsuhisa; Uehara, Ryuhei Random generation and enumeration of bipartite permutation graphs. (English) Zbl 1241.05050 J. Discrete Algorithms 10, 84-97 (2012). MSC: 05C30 05C70 05C60 PDFBibTeX XMLCite \textit{T. Saitoh} et al., J. Discrete Algorithms 10, 84--97 (2012; Zbl 1241.05050) Full Text: DOI
Eisenbrand, Friedrich; Niemeier, Martin Coloring fuzzy circular interval graphs. (English) Zbl 1236.05079 Eur. J. Comb. 33, No. 5, 893-904 (2012). MSC: 05C15 05C72 05C85 PDFBibTeX XMLCite \textit{F. Eisenbrand} and \textit{M. Niemeier}, Eur. J. Comb. 33, No. 5, 893--904 (2012; Zbl 1236.05079) Full Text: DOI
Fiala, Jiří; Kamiński, Marcin; Lidický, Bernard; Paulusma, Daniël The \(k\)-in-a-path problem for claw-free graphs. (English) Zbl 1236.68088 Algorithmica 62, No. 1-2, 499-519 (2012). MSC: 68Q17 05C85 PDFBibTeX XMLCite \textit{J. Fiala} et al., Algorithmica 62, No. 1--2, 499--519 (2012; Zbl 1236.68088) Full Text: DOI
Oriolo, Gianpaolo; Pietropaoli, Ugo; Stauffer, Gautier On the recognition of fuzzy circular interval graphs. (English) Zbl 1237.05173 Discrete Math. 312, No. 8, 1426-1435 (2012). MSC: 05C72 05C85 PDFBibTeX XMLCite \textit{G. Oriolo} et al., Discrete Math. 312, No. 8, 1426--1435 (2012; Zbl 1237.05173) Full Text: DOI
Gardi, Frédéric On partitioning interval graphs into proper interval subgraphs and related problems. (English) Zbl 1233.05157 J. Graph Theory 68, No. 1, 38-54 (2011). MSC: 05C70 05C85 05C35 68R10 PDFBibTeX XMLCite \textit{F. Gardi}, J. Graph Theory 68, No. 1, 38--54 (2011; Zbl 1233.05157) Full Text: DOI
Lin, Min Chih; Rautenbach, Dieter; Soulignac, Francisco Juan; Szwarcfiter, Jayme Luiz Powers of cycles, powers of paths, and distance graphs. (English) Zbl 1213.05148 Discrete Appl. Math. 159, No. 7, 621-627 (2011). MSC: 05C38 05C12 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Discrete Appl. Math. 159, No. 7, 621--627 (2011; Zbl 1213.05148) Full Text: DOI Link
Joeris, Benson L.; Lin, Min Chih; McConnell, Ross M.; Spinrad, Jeremy P.; Szwarcfiter, Jayme L. Linear-time recognition of Helly circular-arc models and graphs. (English) Zbl 1209.68376 Algorithmica 59, No. 2, 215-239 (2011). MSC: 68R10 PDFBibTeX XMLCite \textit{B. L. Joeris} et al., Algorithmica 59, No. 2, 215--239 (2011; Zbl 1209.68376) Full Text: DOI
Villanger, Yngve Proper interval vertex deletion. (English) Zbl 1309.68157 Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13–15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 228-238 (2010). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{Y. Villanger}, Lect. Notes Comput. Sci. 6478, 228--238 (2010; Zbl 1309.68157) 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
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. The clique operator on circular-arc graphs. (English) Zbl 1209.05246 Discrete Appl. Math. 158, No. 12, 1259-1267 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Discrete Appl. Math. 158, No. 12, 1259--1267 (2010; Zbl 1209.05246) Full Text: DOI
Alpert, Hannah; Koch, Christina; Laison, Joshua D. Obstacle numbers of graphs. (English) Zbl 1216.05088 Discrete Comput. Geom. 44, No. 1, 223-244 (2010). MSC: 05C62 PDFBibTeX XMLCite \textit{H. Alpert} et al., Discrete Comput. Geom. 44, No. 1, 223--244 (2010; Zbl 1216.05088) Full Text: DOI
Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L. Some remarks on the geodetic number of a graph. (English) Zbl 1209.05129 Discrete Math. 310, No. 4, 832-837 (2010). MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 310, No. 4, 832--837 (2010; Zbl 1209.05129) Full Text: DOI Link
Heggernes, Pinar; Meister, Daniel; Papadopoulos, Charis A new representation of proper interval graphs with an application to clique-width. (English) Zbl 1267.05176 Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 27-34 (2009). MSC: 05C62 05C12 PDFBibTeX XMLCite \textit{P. Heggernes} et al., Electron. Notes Discrete Math. 32, 27--34 (2009; Zbl 1267.05176) 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
Kaplan, Haim; Nussbaum, Yahav Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. (English) Zbl 1213.05248 Discrete Appl. Math. 157, No. 15, 3216-3230 (2009). MSC: 05C85 PDFBibTeX XMLCite \textit{H. Kaplan} and \textit{Y. Nussbaum}, Discrete Appl. Math. 157, No. 15, 3216--3230 (2009; Zbl 1213.05248) Full Text: DOI
Bonomo, F.; Durán, G.; Grippo, L. N.; Safe, M. D. Partial characterizations of circular-arc graphs. (English) Zbl 1197.05096 J. Graph Theory 61, No. 4, 289-306 (2009). MSC: 05C62 05C75 PDFBibTeX XMLCite \textit{F. Bonomo} et al., J. Graph Theory 61, No. 4, 289--306 (2009; Zbl 1197.05096) Full Text: DOI Link
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
Dourado, Mitre C.; Gimbel, John G.; Kratochvíl, Jan; Protti, Fábio; Szwarcfiter, Jayme L. On the computation of the hull number of a graph. (English) Zbl 1215.05184 Discrete Math. 309, No. 18, 5668-5674 (2009). MSC: 05C85 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 309, No. 18, 5668--5674 (2009; Zbl 1215.05184) Full Text: DOI
Lin, Min Chih; Szwarcfiter, Jayme L. Characterizations and recognition of circular-arc graphs and subclasses: a survey. (English) Zbl 1228.05218 Discrete Math. 309, No. 18, 5618-5635 (2009). MSC: 05C62 05C38 05C85 05-02 PDFBibTeX XMLCite \textit{M. C. Lin} and \textit{J. L. Szwarcfiter}, Discrete Math. 309, No. 18, 5618--5635 (2009; Zbl 1228.05218) Full Text: DOI
Gardi, Frédéric Mutual exclusion scheduling with interval graphs or related classes. I. (English) Zbl 1155.90381 Discrete Appl. Math. 157, No. 1, 19-35 (2009). MSC: 90B35 90C35 PDFBibTeX XMLCite \textit{F. Gardi}, Discrete Appl. Math. 157, No. 1, 19--35 (2009; Zbl 1155.90381) 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
King, Andrew D.; Reed, Bruce A. Bounding \(\chi\) in terms of \(\omega\) and \(\Delta\) for quasi-line graphs. (English) Zbl 1184.05045 J. Graph Theory 59, No. 3, 215-228 (2008). Reviewer: Ludovit Niepel (Safat) MSC: 05C15 05C76 05C69 PDFBibTeX XMLCite \textit{A. D. King} and \textit{B. A. Reed}, J. Graph Theory 59, No. 3, 215--228 (2008; Zbl 1184.05045) Full Text: DOI
Nussbaum, Yahav From a circular-arc model to a proper circular-arc model. (English) Zbl 1202.05139 Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 324-335 (2008). MSC: 05C85 05C62 68Q25 PDFBibTeX XMLCite \textit{Y. Nussbaum}, Lect. Notes Comput. Sci. 5344, 324--335 (2008; Zbl 1202.05139) Full Text: DOI
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs. (English) Zbl 1155.05339 Gudmundsson, Joachim (ed.), Algorithm theory – SWAT 2008. 11th Scandinavian workshop on algorithm theory, Gothenburg, Sweden, July 2–4, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69900-2/pbk). Lecture Notes in Computer Science 5124, 355-366 (2008). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Lect. Notes Comput. Sci. 5124, 355--366 (2008; Zbl 1155.05339) Full Text: DOI
Bonomo, F.; Durán, G.; Grippo, L. N.; Safe, M. D. Partial characterizations of circular-arc graphs. (English) Zbl 1341.05164 Liebling, Th. (ed.) et al., The IV Latin-American algorithms, graphs, and optimization symposium, Puerto Varas, Chile, November 25–29, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 30, 45-50 (2008). MSC: 05C60 05C35 PDFBibTeX XMLCite \textit{F. Bonomo} et al., Electron. Notes Discrete Math. 30, 45--50 (2008; Zbl 1341.05164) Full Text: DOI Link
Gutin, Gregory; Hell, Pavol; Rafiey, Arash; Yeo, Anders A dichotomy for minimum cost graph homomorphisms. (English) Zbl 1149.90164 Eur. J. Comb. 29, No. 4, 900-911 (2008). Reviewer: Rainer E. Burkard (Graz) MSC: 90C35 PDFBibTeX XMLCite \textit{G. Gutin} et al., Eur. J. Comb. 29, No. 4, 900--911 (2008; Zbl 1149.90164) Full Text: DOI
Lin, Min Chih; Soulignac, Francisco J.; Szwarcfiter, Jayme L. Proper Helly circular-arc graphs. (English) Zbl 1141.68539 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). Lecture Notes in Computer Science 4769, 248-257 (2007). MSC: 68R10 05C62 05C85 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Lect. Notes Comput. Sci. 4769, 248--257 (2007; Zbl 1141.68539) Full Text: DOI
Gardi, Frédéric The Roberts characterization of proper and unit interval graphs. (English) Zbl 1126.05084 Discrete Math. 307, No. 22, 2906-2908 (2007). MSC: 05C75 05C62 PDFBibTeX XMLCite \textit{F. Gardi}, Discrete Math. 307, No. 22, 2906--2908 (2007; Zbl 1126.05084) 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
Burzyn, Pablo; Bonomo, Flavia; Durán, Guillermo NP-completeness results for edge modification problems. (English) Zbl 1110.68094 Discrete Appl. Math. 154, No. 13, 1824-1844 (2006). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{P. Burzyn} et al., Discrete Appl. Math. 154, No. 13, 1824--1844 (2006; Zbl 1110.68094) Full Text: DOI
Saha, Anita; Pal, Madhumangal; Pal, Tapan K. An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs. (English) Zbl 1102.68137 J. Appl. Math. Comput. 17, No. 1-2, 1-23 (2005). MSC: 68W10 68Q25 68R10 PDFBibTeX XMLCite \textit{A. Saha} et al., J. Appl. Math. Comput. 17, No. 1--2, 1--23 (2005; Zbl 1102.68137) Full Text: DOI
Meister, Daniel Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. (English) Zbl 1077.68076 Discrete Appl. Math. 146, No. 3, 193-218 (2005). MSC: 68R10 05C85 05C78 PDFBibTeX XMLCite \textit{D. Meister}, Discrete Appl. Math. 146, No. 3, 193--218 (2005; Zbl 1077.68076) 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
Panda, B. S.; Das, Sajal K. A linear time recognition algorithm for proper interval graphs. (English) Zbl 1161.68855 Inf. Process. Lett. 87, No. 3, 153-161 (2003). MSC: 68W05 68R10 PDFBibTeX XMLCite \textit{B. S. Panda} and \textit{S. K. Das}, Inf. Process. Lett. 87, No. 3, 153--161 (2003; Zbl 1161.68855) Full Text: DOI
Pe’er, Itsik; Shamir, Ron Satisfiability problems on intervals and unit intervals. (English) Zbl 0903.68085 Theor. Comput. Sci. 175, No. 2, 349-372 (1997). MSC: 68W10 PDFBibTeX XMLCite \textit{I. Pe'er} and \textit{R. Shamir}, Theor. Comput. Sci. 175, No. 2, 349--372 (1997; Zbl 0903.68085) Full Text: DOI
Hell, Pavol; Huang, Jing Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. (English) Zbl 0835.05064 J. Graph Theory 20, No. 3, 361-374 (1995). Reviewer: H.Bodlaender (Utrecht) MSC: 05C85 05C20 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Huang}, J. Graph Theory 20, No. 3, 361--374 (1995; Zbl 0835.05064) Full Text: DOI