Ahn, Jungho; Jaffke, Lars; Kwon, O-joung; Lima, Paloma T. Well-partitioned chordal graphs. (English) Zbl 07541590 Discrete Math. 345, No. 10, Article ID 112985, 23 p. (2022). MSC: 05C70 05C40 68Q17 PDF BibTeX XML Cite \textit{J. Ahn} et al., Discrete Math. 345, No. 10, Article ID 112985, 23 p. (2022; Zbl 07541590) Full Text: DOI OpenURL
Zhu, Kailun; Kurowicka, Dorota Regular vines with strongly chordal pattern of (conditional) independence. (English) Zbl 07533761 Comput. Stat. Data Anal. 172, Article ID 107461, 24 p. (2022). MSC: 62-XX PDF BibTeX XML Cite \textit{K. Zhu} and \textit{D. Kurowicka}, Comput. Stat. Data Anal. 172, Article ID 107461, 24 p. (2022; Zbl 07533761) Full Text: DOI OpenURL
Baste, Julien; Thilikos, Dimitrios M. Contraction bidimensionality of geometric intersection graphs. (English) Zbl 07498369 Algorithmica 84, No. 2, 510-531 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Baste} and \textit{D. M. Thilikos}, Algorithmica 84, No. 2, 510--531 (2022; Zbl 07498369) Full Text: DOI OpenURL
Gavril, Fanica; Shalom, Mordechai; Zaks, Shmuel Approximation algorithms for maximum weight \(k\)-coverings of graphs by packings. (English) Zbl 07492720 Discrete Math. Algorithms Appl. 14, No. 1, Article ID 2150099, 14 p. (2022). Reviewer: K. Subramani (Morgantown) MSC: 68W25 05C70 05C85 68R10 68W40 PDF BibTeX XML Cite \textit{F. Gavril} et al., Discrete Math. Algorithms Appl. 14, No. 1, Article ID 2150099, 14 p. (2022; Zbl 07492720) Full Text: DOI OpenURL
Ganian, Robert; Hamm, Thekla; Talvitie, Topi An efficient algorithm for counting Markov equivalent DAGs. (English) Zbl 07482901 Artif. Intell. 304, Article ID 103648, 13 p. (2022). MSC: 68Txx PDF BibTeX XML Cite \textit{R. Ganian} et al., Artif. Intell. 304, Article ID 103648, 13 p. (2022; Zbl 07482901) Full Text: DOI OpenURL
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai On the maximum cardinality cut problem in proper interval graphs and related graph classes. (English) Zbl 07437220 Theor. Comput. Sci. 898, 20-29 (2022). MSC: 68Q27 05C62 05C70 PDF BibTeX XML Cite \textit{A. Boyacı} et al., Theor. Comput. Sci. 898, 20--29 (2022; Zbl 07437220) Full Text: DOI arXiv OpenURL
Ducoffe, Guillaume Beyond Helly graphs: the diameter problem on absolute retracts. (English) Zbl 07538587 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 321-335 (2021). MSC: 68R10 PDF BibTeX XML Cite \textit{G. Ducoffe}, Lect. Notes Comput. Sci. 12911, 321--335 (2021; Zbl 07538587) Full Text: DOI OpenURL
Blažej, Václav; Dvořák, Pavel; Opler, Michal Bears with hats and independence polynomials. (English) Zbl 07538584 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 283-295 (2021). MSC: 68R10 PDF BibTeX XML Cite \textit{V. Blažej} et al., Lect. Notes Comput. Sci. 12911, 283--295 (2021; Zbl 07538584) Full Text: DOI OpenURL
Leitert, Arne Computing the union join and subset graph of acyclic hypergraphs in subquadratic time. (English) Zbl 07498704 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 571-584 (2021). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{A. Leitert}, Lect. Notes Comput. Sci. 12808, 571--584 (2021; Zbl 07498704) Full Text: DOI OpenURL
Bergold, Helena; Hochstättler, Winfried; Mayer, Uwe The neighborhood polynomial of chordal graphs. (English) Zbl 07498675 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 158-171 (2021). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{H. Bergold} et al., Lect. Notes Comput. Sci. 12808, 158--171 (2021; Zbl 07498675) Full Text: DOI OpenURL
Groshaus, Marina; Montero, Leandro Structural properties of biclique graphs and the distance formula. (English) Zbl 1482.05236 Australas. J. Comb. 81, Part 2, 301-318 (2021). MSC: 05C60 05C70 05C12 PDF BibTeX XML Cite \textit{M. Groshaus} and \textit{L. Montero}, Australas. J. Comb. 81, Part 2, 301--318 (2021; Zbl 1482.05236) Full Text: arXiv Link OpenURL
Chaplick, Steven; Töpfer, Martin; Voborník, Jan; Zeman, Peter On \(H\)-topological intersection graphs. (English) Zbl 07431037 Algorithmica 83, No. 11, 3281-3318 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{S. Chaplick} et al., Algorithmica 83, No. 11, 3281--3318 (2021; Zbl 07431037) Full Text: DOI OpenURL
Kitamura, Naoki; Kitagawa, Hirotaka; Otachi, Yota; Izumi, Taisuke Low-congestion shortcut and graph parameters. (English) Zbl 07422104 Distrib. Comput. 34, No. 5, 349-365 (2021). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{N. Kitamura} et al., Distrib. Comput. 34, No. 5, 349--365 (2021; Zbl 07422104) Full Text: DOI arXiv OpenURL
Mukhopadhyay, Asish; Rahman, Md. Zamilur Algorithms for generating strongly chordal graphs. (English) Zbl 1473.68126 Gavrilova, Marina L. (ed.) et al., Transactions on Computational Science XXXVIII. Berlin: Springer. Lect. Notes Comput. Sci. 12620, 54-75 (2021). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{A. Mukhopadhyay} and \textit{Md. Z. Rahman}, Lect. Notes Comput. Sci. 12620, 54--75 (2021; Zbl 1473.68126) Full Text: DOI OpenURL
Carmeli, Nofar; Kenig, Batya; Kimelfeld, Benny; Kröll, Markus Efficiently enumerating minimal triangulations. (English) Zbl 1472.05070 Discrete Appl. Math. 303, 216-236 (2021). MSC: 05C30 05C70 68R10 68Q25 PDF BibTeX XML Cite \textit{N. Carmeli} et al., Discrete Appl. Math. 303, 216--236 (2021; Zbl 1472.05070) Full Text: DOI OpenURL
Casteigts, Arnaud; Himmel, Anne-Sophie; Molter, Hendrik; Zschoche, Philipp Finding temporal paths under waiting time constraints. (English) Zbl 07390201 Algorithmica 83, No. 9, 2754-2802 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{A. Casteigts} et al., Algorithmica 83, No. 9, 2754--2802 (2021; Zbl 07390201) Full Text: DOI arXiv OpenURL
Chacko, Daphna; Francis, Mathew C. Representing graphs as the intersection of cographs and threshold graphs. (English) Zbl 1467.05177 Electron. J. Comb. 28, No. 3, Research Paper P3.11, 22 p. (2021). MSC: 05C62 68R10 PDF BibTeX XML Cite \textit{D. Chacko} and \textit{M. C. Francis}, Electron. J. Comb. 28, No. 3, Research Paper P3.11, 22 p. (2021; Zbl 1467.05177) Full Text: DOI arXiv OpenURL
Fomin, Fedor V.; Golovach, Petr A. Subexponential parameterized algorithms and kernelization on almost chordal graphs. (English) Zbl 1467.05254 Algorithmica 83, No. 7, 2170-2214 (2021). MSC: 05C85 05C69 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} and \textit{P. A. Golovach}, Algorithmica 83, No. 7, 2170--2214 (2021; Zbl 1467.05254) Full Text: DOI arXiv OpenURL
Ekim, Tınaz; Shalom, Mordechai; Şeker, Oylum The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. (English) Zbl 1468.05192 J. Comb. Optim. 41, No. 3, 710-735 (2021). MSC: 05C62 05C05 05C85 68Q17 PDF BibTeX XML Cite \textit{T. Ekim} et al., J. Comb. Optim. 41, No. 3, 710--735 (2021; Zbl 1468.05192) Full Text: DOI arXiv OpenURL
Asahiro, Yuichi; Eto, Hiroshi; Hanaka, Tesshu; Lin, Guohui; Miyano, Eiji; Terabaru, Ippei Complexity and approximability of the happy set problem. (English) Zbl 1477.68195 Theor. Comput. Sci. 866, 123-144 (2021). MSC: 68R10 68Q17 68Q25 68W25 PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 866, 123--144 (2021; Zbl 1477.68195) Full Text: DOI OpenURL
Kuroda, Masamichi; Tsujie, Shuhei Unit ball graphs on geodesic spaces. (English) Zbl 1459.05216 Graphs Comb. 37, No. 1, 111-125 (2021). MSC: 05C62 05C75 05C45 PDF BibTeX XML Cite \textit{M. Kuroda} and \textit{S. Tsujie}, Graphs Comb. 37, No. 1, 111--125 (2021; Zbl 1459.05216) Full Text: DOI arXiv OpenURL
Bezáková, Ivona; Sun, Wenbo Mixing of Markov chains for independent sets on chordal graphs with bounded separators. (English) Zbl 07336143 Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 664-676 (2020). MSC: 68Rxx PDF BibTeX XML Cite \textit{I. Bezáková} and \textit{W. Sun}, Lect. Notes Comput. Sci. 12273, 664--676 (2020; Zbl 07336143) Full Text: DOI OpenURL
Sinha, Deepa; Sharma, Deepakshi Characterization of 2-path signed network. (English) Zbl 1454.05119 Complexity 2020, Article ID 1028941, 13 p. (2020). MSC: 05C82 05C22 90B10 90B18 PDF BibTeX XML Cite \textit{D. Sinha} and \textit{D. Sharma}, Complexity 2020, Article ID 1028941, 13 p. (2020; Zbl 1454.05119) Full Text: DOI OpenURL
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. Bidimensionality and kernels. (English) Zbl 1475.05161 SIAM J. Comput. 49, No. 6, 1397-1422 (2020). Reviewer: Steve Noble (London) MSC: 05C85 05C10 68R10 05C83 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., SIAM J. Comput. 49, No. 6, 1397--1422 (2020; Zbl 1475.05161) Full Text: DOI arXiv OpenURL
Banik, Aritra; Sahlot, Vibha; Saurabh, Saket Approximation algorithms for geometric conflict free covering problems. (English) Zbl 1444.68272 Comput. Geom. 89, Article ID 101591, 8 p. (2020). MSC: 68U05 05C62 68R10 68W25 PDF BibTeX XML Cite \textit{A. Banik} et al., Comput. Geom. 89, Article ID 101591, 8 p. (2020; Zbl 1444.68272) Full Text: DOI OpenURL
Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent On the tractability of optimization problems on \(H\)-graphs. (English) Zbl 1447.05142 Algorithmica 82, No. 9, 2432-2473 (2020). MSC: 05C62 05C85 05C69 68Q17 90C27 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., Algorithmica 82, No. 9, 2432--2473 (2020; Zbl 1447.05142) Full Text: DOI OpenURL
Brešar, Boštjan; Ferme, Jasmina; Klavžar, Sandi; Rall, Douglas F. A survey on packing colorings. (English) Zbl 1446.05031 Discuss. Math., Graph Theory 40, No. 4, 923-970 (2020). MSC: 05C15 05C12 05C69 05C70 68Q25 PDF BibTeX XML Cite \textit{B. Brešar} et al., Discuss. Math., Graph Theory 40, No. 4, 923--970 (2020; Zbl 1446.05031) Full Text: DOI OpenURL
Kamali, Shahin; Miller, Avery; Zhang, Kenny Burning two worlds. (English) Zbl 1440.68190 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 113-124 (2020). MSC: 68R10 05C85 68W25 91D30 PDF BibTeX XML Cite \textit{S. Kamali} et al., Lect. Notes Comput. Sci. 12011, 113--124 (2020; Zbl 1440.68190) Full Text: DOI OpenURL
De Caria, Pablo Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs. (English) Zbl 1440.05153 Discrete Appl. Math. 281, 151-161 (2020). MSC: 05C62 05C05 06A07 68Q17 PDF BibTeX XML Cite \textit{P. De Caria}, Discrete Appl. Math. 281, 151--161 (2020; Zbl 1440.05153) Full Text: DOI OpenURL
Bornstein, Claudson Ferreira; Coura Pinto, José Wilson; Rautenbach, Dieter; Szwarcfiter, Jayme Luiz Constant threshold intersection graphs of orthodox paths in trees. (English) Zbl 1440.05152 Discrete Appl. Math. 281, 61-68 (2020). MSC: 05C62 05C76 05C10 PDF BibTeX XML Cite \textit{C. F. Bornstein} et al., Discrete Appl. Math. 281, 61--68 (2020; Zbl 1440.05152) Full Text: DOI arXiv OpenURL
Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen; Saurabh, Saket Parameterized complexity of conflict-free matchings and paths. (English) Zbl 1442.68072 Algorithmica 82, No. 7, 1939-1965 (2020). MSC: 68Q27 68Q17 68R10 68W40 PDF BibTeX XML Cite \textit{A. Agrawal} et al., Algorithmica 82, No. 7, 1939--1965 (2020; Zbl 1442.68072) Full Text: DOI Link OpenURL
Dhanalakshmi, S.; Sadagopan, N. On strictly chordality-\(k\) graphs. (English) Zbl 1439.05050 Discrete Appl. Math. 280, 93-112 (2020). MSC: 05C05 05C38 PDF BibTeX XML Cite \textit{S. Dhanalakshmi} and \textit{N. Sadagopan}, Discrete Appl. Math. 280, 93--112 (2020; Zbl 1439.05050) Full Text: DOI arXiv OpenURL
Ducoffe, Guillaume; Legay, Sylvain; Nisse, Nicolas On the complexity of computing treebreadth. (English) Zbl 1433.68168 Algorithmica 82, No. 6, 1574-1600 (2020). MSC: 68Q25 05C70 68Q17 68R10 68W40 PDF BibTeX XML Cite \textit{G. Ducoffe} et al., Algorithmica 82, No. 6, 1574--1600 (2020; Zbl 1433.68168) Full Text: DOI Link OpenURL
Conte, Alessio; Kanté, Mamadou Moustapha; Otachi, Yota; Uno, Takeaki; Wasa, Kunihiro Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph. (English) Zbl 1437.05102 Theor. Comput. Sci. 818, 2-11 (2020). MSC: 05C30 05C60 05C05 05C42 PDF BibTeX XML Cite \textit{A. Conte} et al., Theor. Comput. Sci. 818, 2--11 (2020; Zbl 1437.05102) Full Text: DOI OpenURL
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Connected vertex cover for \((sP_1+P_5)\)-free graphs. (English) Zbl 1436.68245 Algorithmica 82, No. 1, 20-40 (2020). MSC: 68R10 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{M. Johnson} et al., Algorithmica 82, No. 1, 20--40 (2020; Zbl 1436.68245) Full Text: DOI Link OpenURL
Legay, Sylvain; Montero, Leandro On the iterated edge-biclique operator. (English) Zbl 07515213 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, 577-587 (2019). MSC: 05Cxx 90Cxx PDF BibTeX XML Cite \textit{S. Legay} and \textit{L. Montero}, Electron. Notes Theor. Comput. Sci. 346, 577--587 (2019; Zbl 07515213) Full Text: DOI OpenURL
Dobson, M. P.; Leoni, V.; Lopez Pujato, M. I. Tuple domination on graphs with the consecutive-zeros property. (English) Zbl 07515198 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, 401-411 (2019). MSC: 05Cxx 90Cxx PDF BibTeX XML Cite \textit{M. P. Dobson} et al., Electron. Notes Theor. Comput. Sci. 346, 401--411 (2019; Zbl 07515198) Full Text: DOI OpenURL
De Caria, Pablo Families of induced trees and their intersection graphs. (English) Zbl 07515186 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, 265-274 (2019). MSC: 05Cxx 90Cxx PDF BibTeX XML Cite \textit{P. De Caria}, Electron. Notes Theor. Comput. Sci. 346, 265--274 (2019; Zbl 07515186) Full Text: DOI OpenURL
Haralampiev, Vladislav Neural networks for facility location problems. (English) Zbl 1474.62336 God. Sofiĭ. Univ., Fak. Mat. Inform. 106, 3-10 (2019). MSC: 62M45 90C27 PDF BibTeX XML Cite \textit{V. Haralampiev}, God. Sofiĭ. Univ., Fak. Mat. Inform. 106, 3--10 (2019; Zbl 1474.62336) Full Text: Link OpenURL
Amarilli, Antoine; Bourhis, Pierre; Monet, Mikaël; Senellart, Pierre Evaluating Datalog via tree automata and cycluits. (English) Zbl 1430.68078 Theory Comput. Syst. 63, No. 7, 1620-1678 (2019). MSC: 68P15 68Q27 68Q45 PDF BibTeX XML Cite \textit{A. Amarilli} et al., Theory Comput. Syst. 63, No. 7, 1620--1678 (2019; Zbl 1430.68078) Full Text: DOI arXiv OpenURL
Chakraborty, Dibyayan; Das, Sandip; Mukherjee, Joydeep; Sahoo, Uma Kant Bounds on the bend number of split and cocomparability graphs. (English) Zbl 1420.05120 Theory Comput. Syst. 63, No. 6, 1336-1357 (2019). MSC: 05C62 68R10 05C10 68Q17 68M10 06A07 PDF BibTeX XML Cite \textit{D. Chakraborty} et al., Theory Comput. Syst. 63, No. 6, 1336--1357 (2019; Zbl 1420.05120) Full Text: DOI arXiv OpenURL
Diestel, Reinhard; Erde, Joshua; Weißauer, Daniel Structural submodularity and tangles in abstract separation systems. (English) Zbl 1417.05162 J. Comb. Theory, Ser. A 167, 155-180 (2019). MSC: 05C70 05C05 05C83 PDF BibTeX XML Cite \textit{R. Diestel} et al., J. Comb. Theory, Ser. A 167, 155--180 (2019; Zbl 1417.05162) Full Text: DOI arXiv OpenURL
Aharoni, Ron; Gorelik, Irina Weighted domination of independent sets. (English) Zbl 1416.05202 Graphs Comb. 35, No. 3, 719-727 (2019). MSC: 05C69 05C05 PDF BibTeX XML Cite \textit{R. Aharoni} and \textit{I. Gorelik}, Graphs Comb. 35, No. 3, 719--727 (2019; Zbl 1416.05202) Full Text: DOI arXiv OpenURL
Korhonen, Tuukka; Berg, Jeremias; Järvisalo, Matti Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm. (English) Zbl 07043418 ACM J. Exp. Algorithm. 24, No. 1, Article No. 1.9, 19 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{T. Korhonen} et al., ACM J. Exp. Algorithm. 24, No. 1, Article No. 1.9, 19 p. (2019; Zbl 07043418) Full Text: DOI OpenURL
Bermond, Jean-Claude; Moataz, Fatima Zahra On spectrum assignment in elastic optical tree-networks. (English) Zbl 1407.68053 Discrete Appl. Math. 257, 40-52 (2019). MSC: 68M11 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{J.-C. Bermond} and \textit{F. Z. Moataz}, Discrete Appl. Math. 257, 40--52 (2019; Zbl 1407.68053) Full Text: DOI Link OpenURL
Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent On the tractability of optimization problems on \(H\)-graphs. (English) Zbl 07378700 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 30, 14 p. (2018). MSC: 68Wxx PDF BibTeX XML Cite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 30, 14 p. (2018; Zbl 07378700) Full Text: DOI arXiv OpenURL
Baste, Julien; Thilikos, Dimitrios M. Contraction-bidimensionality of geometric intersection graphs. (English) Zbl 1448.05048 Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 5, 13 p. (2018). MSC: 05C10 05C75 PDF BibTeX XML Cite \textit{J. Baste} and \textit{D. M. Thilikos}, LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 5, 13 p. (2018; Zbl 1448.05048) Full Text: DOI OpenURL
Nikseresht, Ashkan Chordality of graphs associated to commutative rings. (English) Zbl 1424.13011 Turk. J. Math. 42, No. 5, 2202-2213 (2018). MSC: 13A99 05C25 13A15 PDF BibTeX XML Cite \textit{A. Nikseresht}, Turk. J. Math. 42, No. 5, 2202--2213 (2018; Zbl 1424.13011) Full Text: DOI OpenURL
Jamison, Robert E.; Mulder, Henry Martyn Dyadic representations of graphs. (English) Zbl 1395.05115 Discrete Math. 341, No. 11, 3021-3028 (2018). MSC: 05C62 05C40 PDF BibTeX XML Cite \textit{R. E. Jamison} and \textit{H. M. Mulder}, Discrete Math. 341, No. 11, 3021--3028 (2018; Zbl 1395.05115) Full Text: DOI OpenURL
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne Maximum matching width: new characterizations and a fast algorithm for dominating set. (English) Zbl 1395.05116 Discrete Appl. Math. 248, 114-124 (2018). MSC: 05C62 05C85 05C69 68Q25 PDF BibTeX XML Cite \textit{J. Jeong} et al., Discrete Appl. Math. 248, 114--124 (2018; Zbl 1395.05116) Full Text: DOI Link OpenURL
Jeong, Jisu; Ok, Seongmin; Suh, Geewon Characterizing graphs of maximum matching width at most 2. (English) Zbl 1395.05133 Discrete Appl. Math. 248, 102-113 (2018). MSC: 05C70 05C35 PDF BibTeX XML Cite \textit{J. Jeong} et al., Discrete Appl. Math. 248, 102--113 (2018; Zbl 1395.05133) Full Text: DOI arXiv OpenURL
Hofer-Temmel, Christoph; Lehner, Florian Clique trees of infinite locally finite chordal graphs. (English) Zbl 1391.05186 Electron. J. Comb. 25, No. 2, Research Paper P2.9, 15 p. (2018). MSC: 05C62 05C05 05C30 PDF BibTeX XML Cite \textit{C. Hofer-Temmel} and \textit{F. Lehner}, Electron. J. Comb. 25, No. 2, Research Paper P2.9, 15 p. (2018; Zbl 1391.05186) Full Text: arXiv Link OpenURL
Coudert, David; Ducoffe, Guillaume Revisiting decomposition by clique separators. (English) Zbl 1383.05256 SIAM J. Discrete Math. 32, No. 1, 682-694 (2018). MSC: 05C70 05C10 05C69 68Q17 68Q25 PDF BibTeX XML Cite \textit{D. Coudert} and \textit{G. Ducoffe}, SIAM J. Discrete Math. 32, No. 1, 682--694 (2018; Zbl 1383.05256) Full Text: DOI OpenURL
Cameron, Kathie; Chaplick, Steven; Hoàng, Chính T. On the structure of (pan, even hole)-free graphs. (English) Zbl 1387.05215 J. Graph Theory 87, No. 1, 108-129 (2018). MSC: 05C75 05C15 05C85 68W40 PDF BibTeX XML Cite \textit{K. Cameron} et al., J. Graph Theory 87, No. 1, 108--129 (2018; Zbl 1387.05215) Full Text: DOI arXiv OpenURL
Berry, Anne; Simonet, Geneviève Computing a clique tree with the algorithm maximal label search. (English) Zbl 1461.05203 Algorithms (Basel) 10, No. 1, Paper No. 20, 23 p. (2017). MSC: 05C85 05C78 68W05 PDF BibTeX XML Cite \textit{A. Berry} and \textit{G. Simonet}, Algorithms (Basel) 10, No. 1, Paper No. 20, 23 p. (2017; Zbl 1461.05203) Full Text: DOI arXiv OpenURL
Krawczyk, Tomasz; Walczak, Bartosz On-line approach to off-line coloring problems on graphs with geometric representations. (English) Zbl 1399.05077 Combinatorica 37, No. 6, 1139-1179 (2017). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C15 05C62 68W27 PDF BibTeX XML Cite \textit{T. Krawczyk} and \textit{B. Walczak}, Combinatorica 37, No. 6, 1139--1179 (2017; Zbl 1399.05077) Full Text: DOI arXiv OpenURL
De Caria, Pablo On the recognition of neighborhood inclusion posets. (English) Zbl 1383.05051 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 285-290 (2017). MSC: 05C05 06A07 68Q25 PDF BibTeX XML Cite \textit{P. De Caria}, Electron. Notes Discrete Math. 62, 285--290 (2017; Zbl 1383.05051) Full Text: DOI OpenURL
Linhares Sales, Cláudia; Sampaio, Leonardo; Silva, Ana The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity. (English) Zbl 1383.05273 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 261-266 (2017). MSC: 05C76 05C15 PDF BibTeX XML Cite \textit{C. Linhares Sales} et al., Electron. Notes Discrete Math. 62, 261--266 (2017; Zbl 1383.05273) Full Text: DOI OpenURL
Bornstein, Claudson Ferreira; Coura Pinto, José Wilson; Rautenbach, Dieter Intersection graphs of orthodox paths in trees. (English) Zbl 1383.05269 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 99-104 (2017). MSC: 05C76 05C10 05C85 PDF BibTeX XML Cite \textit{C. F. Bornstein} et al., Electron. Notes Discrete Math. 62, 99--104 (2017; Zbl 1383.05269) Full Text: DOI OpenURL
Kang, Dong Yeap; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne A width parameter useful for chordal and co-comparability graphs. (English) Zbl 1380.05151 Theor. Comput. Sci. 704, 1-17 (2017). MSC: 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{D. Y. Kang} et al., Theor. Comput. Sci. 704, 1--17 (2017; Zbl 1380.05151) Full Text: DOI arXiv OpenURL
Peterson, Eric; Wenger, Paul S. Unit hypercube visibility numbers of trees. (English) Zbl 1371.05192 Graphs Comb. 33, No. 4, 1023-1035 (2017). MSC: 05C62 05C05 PDF BibTeX XML Cite \textit{E. Peterson} and \textit{P. S. Wenger}, Graphs Comb. 33, No. 4, 1023--1035 (2017; Zbl 1371.05192) Full Text: DOI arXiv OpenURL
Gavril, Fanica New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs. (English) Zbl 1420.05167 Inf. Process. Lett. 128, 58-61 (2017). MSC: 05C85 05C69 PDF BibTeX XML Cite \textit{F. Gavril}, Inf. Process. Lett. 128, 58--61 (2017; Zbl 1420.05167) Full Text: DOI OpenURL
Şeker, Oylum; Heggernes, Pinar; Ekim, Tınaz; Taşkın, Z. Caner Linear-time generation of random chordal graphs. (English) Zbl 06751082 Fotakis, Dimitris (ed.) et al., Algorithms and complexity. 10th international conference, CIAC 2017, Athens, Greece, May 24–26, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10236, 442-453 (2017). MSC: 68R10 05C80 05C85 68W05 68W40 PDF BibTeX XML Cite \textit{O. Şeker} et al., Lect. Notes Comput. Sci. 10236, 442--453 (2017; Zbl 06751082) Full Text: DOI OpenURL
Adamaszek, Michał A note on independence complexes of chordal graphs and dismantling. (English) Zbl 1366.05123 Electron. J. Comb. 24, No. 2, Research Paper P2.34, 11 p. (2017). MSC: 05E45 55U10 05C75 PDF BibTeX XML Cite \textit{M. Adamaszek}, Electron. J. Comb. 24, No. 2, Research Paper P2.34, 11 p. (2017; Zbl 1366.05123) Full Text: arXiv Link OpenURL
Harvey, Daniel J.; Wood, David R. Parameters tied to treewidth. (English) Zbl 1359.05030 J. Graph Theory 84, No. 4, 364-385 (2017). MSC: 05C12 05C70 05C76 PDF BibTeX XML Cite \textit{D. J. Harvey} and \textit{D. R. Wood}, J. Graph Theory 84, No. 4, 364--385 (2017; Zbl 1359.05030) Full Text: DOI arXiv OpenURL
Chauhan, Astha; Narayanaswamy, N. S. A refined analysis of online path coloring in trees. (English) Zbl 1484.68338 Jansen, Klaus (ed.) et al., Approximation and online algorithms. 14th international workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10138, 142-154 (2017). MSC: 68W27 05C15 05C85 68R10 PDF BibTeX XML Cite \textit{A. Chauhan} and \textit{N. S. Narayanaswamy}, Lect. Notes Comput. Sci. 10138, 142--154 (2017; Zbl 1484.68338) Full Text: DOI OpenURL
Hell, Pavol; Hernández-Cruz, César Strict chordal and strict split digraphs. (English) Zbl 1358.05125 Discrete Appl. Math. 216, Part 3, 609-617 (2017). MSC: 05C20 05C85 PDF BibTeX XML Cite \textit{P. Hell} and \textit{C. Hernández-Cruz}, Discrete Appl. Math. 216, Part 3, 609--617 (2017; Zbl 1358.05125) Full Text: DOI OpenURL
Lauri, Juho Complexity of rainbow vertex connectivity problems for restricted graph classes. (English) Zbl 1354.05049 Discrete Appl. Math. 219, 132-146 (2017). MSC: 05C15 05C40 68Q17 PDF BibTeX XML Cite \textit{J. Lauri}, Discrete Appl. Math. 219, 132--146 (2017; Zbl 1354.05049) Full Text: DOI arXiv OpenURL
Cohen, Elad; Golumbic, Martin Charles; Lipshteyn, Marina; Stern, Michal Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2. (English) Zbl 1351.05051 Discrete Math. 340, No. 2, 209-222 (2017). MSC: 05C05 05C07 PDF BibTeX XML Cite \textit{E. Cohen} et al., Discrete Math. 340, No. 2, 209--222 (2017; Zbl 1351.05051) Full Text: DOI OpenURL
Kabela, Adam; Kaiser, Tomáš 10-tough chordal graphs are Hamiltonian. (English) Zbl 1350.05087 J. Comb. Theory, Ser. B 122, 417-427 (2017). MSC: 05C45 05C40 PDF BibTeX XML Cite \textit{A. Kabela} and \textit{T. Kaiser}, J. Comb. Theory, Ser. B 122, 417--427 (2017; Zbl 1350.05087) Full Text: DOI arXiv OpenURL
Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C.; Kwon, O-joung; Ok, Seongmin Characterizing width two for variants of treewidth. (English) Zbl 1350.05116 Discrete Appl. Math. 216, Part 1, 29-46 (2017). MSC: 05C69 05C70 05C05 03B15 PDF BibTeX XML Cite \textit{H. L. Bodlaender} et al., Discrete Appl. Math. 216, Part 1, 29--46 (2017; Zbl 1350.05116) Full Text: DOI arXiv OpenURL
Kim, Minki A note on the colorful fractional Helly theorem. (English) Zbl 1362.52003 Discrete Math. 340, No. 1, 3167-3170 (2017). Reviewer: Martin Tancer (Praha) MSC: 52A35 PDF BibTeX XML Cite \textit{M. Kim}, Discrete Math. 340, No. 1, 3167--3170 (2017; Zbl 1362.52003) Full Text: DOI arXiv OpenURL
Adcock, Aaron B.; Sullivan, Blair D.; Mahoney, Michael W. Tree decompositions and social graphs. (English) Zbl 1461.68139 Internet Math. 12, No. 5, 315-361 (2016). MSC: 68R10 05C05 05C70 68T20 91D30 PDF BibTeX XML Cite \textit{A. B. Adcock} et al., Internet Math. 12, No. 5, 315--361 (2016; Zbl 1461.68139) Full Text: DOI arXiv OpenURL
Aoki, Yusuke; Halldórsson, Bjarni V.; Halldórsson, Magnús M.; Ito, Takehiro; Konrad, Christian; Zhou, Xiao The minimum vulnerability problem on specific graph classes. (English) Zbl 1356.90148 J. Comb. Optim. 32, No. 4, 1288-1304 (2016). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{Y. Aoki} et al., J. Comb. Optim. 32, No. 4, 1288--1304 (2016; Zbl 1356.90148) Full Text: DOI OpenURL
Kanté, Mamadou Moustapha; Limouzy, Vincent; Mary, Arnaud; Nourine, Lhouari; Uno, Takeaki A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs. (English) Zbl 1417.05215 Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 138-153 (2016). MSC: 05C85 05C30 05C69 68Q25 PDF BibTeX XML Cite \textit{M. M. Kanté} et al., Lect. Notes Comput. Sci. 9224, 138--153 (2016; Zbl 1417.05215) Full Text: DOI arXiv Link OpenURL
De Caria, Pablo; Gutierrez, Marisa On basic chordal graphs and some of its subclasses. (English) Zbl 1339.05283 Discrete Appl. Math. 210, 261-276 (2016). MSC: 05C69 05C05 PDF BibTeX XML Cite \textit{P. De Caria} and \textit{M. Gutierrez}, Discrete Appl. Math. 210, 261--276 (2016; Zbl 1339.05283) Full Text: DOI OpenURL
Gutierrez, Marisa; Tondato, Silvia B. On models of directed path graphs non rooted directed path graphs. (English) Zbl 1339.05160 Graphs Comb. 32, No. 2, 663-684 (2016). MSC: 05C20 05C38 05C05 PDF BibTeX XML Cite \textit{M. Gutierrez} and \textit{S. B. Tondato}, Graphs Comb. 32, No. 2, 663--684 (2016; Zbl 1339.05160) Full Text: DOI Link OpenURL
Lauri, Juho Further hardness results on rainbow and strong rainbow connectivity. (English) Zbl 1329.05171 Discrete Appl. Math. 201, 191-200 (2016). MSC: 05C40 68Q17 PDF BibTeX XML Cite \textit{J. Lauri}, Discrete Appl. Math. 201, 191--200 (2016; Zbl 1329.05171) Full Text: DOI arXiv OpenURL
Groshaus, Marina; Guedes, André L. P.; Montero, Leandro Almost every graph is divergent under the biclique operator. (English) Zbl 1329.05280 Discrete Appl. Math. 201, 130-140 (2016). MSC: 05C85 05C60 PDF BibTeX XML Cite \textit{M. Groshaus} et al., Discrete Appl. Math. 201, 130--140 (2016; Zbl 1329.05280) Full Text: DOI arXiv OpenURL
Kabela, Adam; Kaiser, Tomáš 10-tough chordal graphs are Hamiltonian (extended abstract). (English) Zbl 1346.05152 Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 331-336, electronic only (2015). MSC: 05C45 05C38 05C65 05C70 PDF BibTeX XML Cite \textit{A. Kabela} and \textit{T. Kaiser}, Electron. Notes Discrete Math. 49, 331--336 (2015; Zbl 1346.05152) Full Text: DOI OpenURL
Gavril, Fanica Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs. (English) Zbl 1326.05153 J. Discrete Algorithms 35, 17-26 (2015). MSC: 05C85 05C69 PDF BibTeX XML Cite \textit{F. Gavril}, J. Discrete Algorithms 35, 17--26 (2015; Zbl 1326.05153) Full Text: DOI OpenURL
Xu, Shou-Jun; Gysel, Rob; Gusfield, Dan Minimum average distance clique trees. (English) Zbl 1337.68213 SIAM J. Discrete Math. 29, No. 3, 1706-1734 (2015). MSC: 68R10 05C12 05C69 05C85 92D15 PDF BibTeX XML Cite \textit{S.-J. Xu} et al., SIAM J. Discrete Math. 29, No. 3, 1706--1734 (2015; Zbl 1337.68213) Full Text: DOI OpenURL
Aharoni, Ron; Berger, Eli; Chudnovsky, Maria; Ziani, Juba Cliques in the union of graphs. (English) Zbl 1315.05096 J. Comb. Theory, Ser. B 114, 170-186 (2015). MSC: 05C69 05C35 05C76 PDF BibTeX XML Cite \textit{R. Aharoni} et al., J. Comb. Theory, Ser. B 114, 170--186 (2015; Zbl 1315.05096) Full Text: DOI OpenURL
Lin, Min-Sheng; Ting, Chao-Chun Computing the \(K\)-terminal reliability of directed path graphs. (English) Zbl 1329.68145 Inf. Process. Lett. 115, No. 10, 773-778 (2015). MSC: 68Q25 05C85 90B25 PDF BibTeX XML Cite \textit{M.-S. Lin} and \textit{C.-C. Ting}, Inf. Process. Lett. 115, No. 10, 773--778 (2015; Zbl 1329.68145) Full Text: DOI OpenURL
Bordewich, Magnus; Semple, Charles Defining a phylogenetic tree with the minimum number of \(r\)-state characters. (English) Zbl 1314.05037 SIAM J. Discrete Math. 29, No. 2, 835-853 (2015). MSC: 05C05 05B35 PDF BibTeX XML Cite \textit{M. Bordewich} and \textit{C. Semple}, SIAM J. Discrete Math. 29, No. 2, 835--853 (2015; Zbl 1314.05037) Full Text: DOI OpenURL
Chang, Maw-Shang; Ko, Ming-Tat; Lu, Hsueh-I Linear-time algorithms for tree root problems. (English) Zbl 1312.05131 Algorithmica 71, No. 2, 471-495 (2015). MSC: 05C85 05C05 05C12 05C35 05C69 68Q25 PDF BibTeX XML Cite \textit{M.-S. Chang} et al., Algorithmica 71, No. 2, 471--495 (2015; Zbl 1312.05131) Full Text: DOI Link OpenURL
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 PDF BibTeX XML Cite \textit{P. Klavík} et al., Theor. Comput. Sci. 576, 85--101 (2015; Zbl 1311.05133) Full Text: DOI OpenURL
Corneil, Derek G.; Stacho, Juraj Vertex ordering characterizations of graphs of bounded asteroidal number. (English) Zbl 1306.05056 J. Graph Theory 78, No. 1, 61-79 (2015). MSC: 05C15 05C75 PDF BibTeX XML Cite \textit{D. G. Corneil} and \textit{J. Stacho}, J. Graph Theory 78, No. 1, 61--79 (2015; Zbl 1306.05056) Full Text: DOI OpenURL
Lin, Min-Sheng; Su, Sheng-Huang Counting independent sets in a tolerance graph. (English) Zbl 1304.05106 Discrete Appl. Math. 181, 174-184 (2015). MSC: 05C69 05C35 05C85 PDF BibTeX XML Cite \textit{M.-S. Lin} and \textit{S.-H. Su}, Discrete Appl. Math. 181, 174--184 (2015; Zbl 1304.05106) Full Text: DOI OpenURL
Alcón, L.; Gutierrez, M.; Mazzoleni, M. P. Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs. (English) Zbl 1301.05194 Discrete Math. 338, No. 1, 103-110 (2015). MSC: 05C38 05C07 05C60 PDF BibTeX XML Cite \textit{L. Alcón} et al., Discrete Math. 338, No. 1, 103--110 (2015; Zbl 1301.05194) Full Text: DOI arXiv OpenURL
Zhao, Yancai; Liao, Zuhua; Miao, Lianying On the algorithmic complexity of edge total domination. (English) Zbl 1338.68123 Theor. Comput. Sci. 557, 28-33 (2014). MSC: 68Q25 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{Y. Zhao} et al., Theor. Comput. Sci. 557, 28--33 (2014; Zbl 1338.68123) Full Text: DOI OpenURL
Dragan, Feodor F.; Köhler, Ekkehard An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs. (English) Zbl 1303.05186 Algorithmica 69, No. 4, 884-905 (2014). MSC: 05C85 68W25 PDF BibTeX XML Cite \textit{F. F. Dragan} and \textit{E. Köhler}, Algorithmica 69, No. 4, 884--905 (2014; Zbl 1303.05186) Full Text: DOI OpenURL
Lozin, Vadim V.; Milanič, Martin; Purcell, Christopher Graphs without large apples and the maximum weight independent set problem. (English) Zbl 1298.05257 Graphs Comb. 30, No. 2, 395-410 (2014). MSC: 05C69 05C75 68R10 PDF BibTeX XML Cite \textit{V. V. Lozin} et al., Graphs Comb. 30, No. 2, 395--410 (2014; Zbl 1298.05257) Full Text: DOI OpenURL
Alcón, L.; Gutierrez, M.; Mazzoleni, M. P. Recognizing vertex intersection graphs of paths on bounded degree trees. (English) Zbl 1300.05190 Discrete Appl. Math. 162, 70-77 (2014). MSC: 05C62 05C05 05C15 68Q17 PDF BibTeX XML Cite \textit{L. Alcón} et al., Discrete Appl. Math. 162, 70--77 (2014; Zbl 1300.05190) Full Text: DOI OpenURL
Joos, Felix A characterization of substar graphs. (English) Zbl 1298.05276 Discrete Appl. Math. 175, 115-118 (2014). MSC: 05C76 05C60 PDF BibTeX XML Cite \textit{F. Joos}, Discrete Appl. Math. 175, 115--118 (2014; Zbl 1298.05276) Full Text: DOI arXiv OpenURL
Lan, James K.; Chang, Gerard Jennhwa On the algorithmic complexity of \(k\)-tuple total domination. (English) Zbl 1298.05254 Discrete Appl. Math. 174, 81-91 (2014). MSC: 05C69 05C85 05C35 68Q17 PDF BibTeX XML Cite \textit{J. K. Lan} and \textit{G. J. Chang}, Discrete Appl. Math. 174, 81--91 (2014; Zbl 1298.05254) Full Text: DOI OpenURL
Nederlof, Jesper; van Rooij, Johan M. M.; van Dijk, Thomas C. Inclusion/exclusion meets measure and conquer. (English) Zbl 1291.68441 Algorithmica 69, No. 3, 685-740 (2014). MSC: 68W40 68Q17 68R10 PDF BibTeX XML Cite \textit{J. Nederlof} et al., Algorithmica 69, No. 3, 685--740 (2014; Zbl 1291.68441) Full Text: DOI OpenURL
Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël Detecting fixed patterns in chordal graphs in polynomial time. (English) Zbl 1291.68173 Algorithmica 69, No. 3, 501-521 (2014). MSC: 68Q17 68Q25 68R10 05C83 PDF BibTeX XML Cite \textit{R. Belmonte} et al., Algorithmica 69, No. 3, 501--521 (2014; Zbl 1291.68173) Full Text: DOI Link OpenURL
Lin, Min-Sheng; Su, Sheng-Huang Counting maximal independent sets in directed path graphs. (English) Zbl 1371.68119 Inf. Process. Lett. 114, No. 10, 568-572 (2014). MSC: 68Q25 05C69 PDF BibTeX XML Cite \textit{M.-S. Lin} and \textit{S.-H. Su}, Inf. Process. Lett. 114, No. 10, 568--572 (2014; Zbl 1371.68119) Full Text: DOI OpenURL
Fomin, Fedor V.; Villanger, Yngve Searching for better fill-in. (English) Zbl 1311.68077 J. Comput. Syst. Sci. 80, No. 7, 1374-1383 (2014). MSC: 68Q25 05C62 68R10 PDF BibTeX XML Cite \textit{F. V. Fomin} and \textit{Y. Villanger}, J. Comput. Syst. Sci. 80, No. 7, 1374--1383 (2014; Zbl 1311.68077) Full Text: DOI OpenURL