Peters, Dominik; Yu, Lan; Chan, Hau; Elkind, Edith Preferences single-peaked on a tree: multiwinner elections and structural results. (English) Zbl 07470386 J. Artif. Intell. Res. (JAIR) 73, 231-276 (2022). MSC: 68Txx PDF BibTeX XML Cite \textit{D. Peters} et al., J. Artif. Intell. Res. (JAIR) 73, 231--276 (2022; Zbl 07470386) Full Text: DOI arXiv OpenURL
Beisegel, Jesse; Chudnovsky, Maria; Gurvich, Vladimir; Milanič, Martin; Servatius, Mary Avoidable vertices and edges in graphs: existence, characterization, and applications. (English) Zbl 1480.05039 Discrete Appl. Math. 309, 285-300 (2022). MSC: 05C12 05C38 68R10 68P05 PDF BibTeX XML Cite \textit{J. Beisegel} et al., Discrete Appl. Math. 309, 285--300 (2022; Zbl 1480.05039) Full Text: DOI 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
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
Dudek, Jeffrey M.; Phan, Vu H. N.; Vardi, Moshe Y. ProCount: weighted projected model counting with graded project-join trees. (English) Zbl 07495571 Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 152-170 (2021). MSC: 68Q25 68R07 68T20 PDF BibTeX XML Cite \textit{J. M. Dudek} et al., Lect. Notes Comput. Sci. 12831, 152--170 (2021; Zbl 07495571) Full Text: DOI OpenURL
Ducoffe, Guillaume; Habib, Michel; Viennot, Laurent Fast diameter computation within split graphs. (English) Zbl 1481.05040 Discrete Math. Theor. Comput. Sci. 23, No. 3, Paper No. 11, 16 p. (2021). MSC: 05C12 05C85 68R10 68Q25 PDF BibTeX XML Cite \textit{G. Ducoffe} et al., Discrete Math. Theor. Comput. Sci. 23, No. 3, Paper No. 11, 16 p. (2021; Zbl 1481.05040) Full Text: DOI Link OpenURL
Aprile, Manuel; Drescher, Matthew; Fiorini, Samuel; Huynh, Tony A tight approximation algorithm for the cluster vertex deletion problem. (English) Zbl 1482.90176 Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 340-353 (2021). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{M. Aprile} et al., Lect. Notes Comput. Sci. 12707, 340--353 (2021; Zbl 1482.90176) Full Text: DOI arXiv OpenURL
Sioutis, Michael; Wolter, Diedrich Dynamic branching in qualitative constraint-based reasoning via counting local models. (English) Zbl 07433309 Inf. Comput. 281, Article ID 104787, 15 p. (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Sioutis} and \textit{D. Wolter}, Inf. Comput. 281, Article ID 104787, 15 p. (2021; Zbl 07433309) Full Text: DOI OpenURL
Reynolds, David; Carvalho, Luis Latent association graph inference for binary transaction data. (English) Zbl 07422732 Comput. Stat. Data Anal. 160, Article ID 107229, 17 p. (2021). MSC: 62-XX PDF BibTeX XML Cite \textit{D. Reynolds} and \textit{L. Carvalho}, Comput. Stat. Data Anal. 160, Article ID 107229, 17 p. (2021; Zbl 07422732) Full Text: DOI OpenURL
Sioutis, Michael; Paparrizou, Anastasia; Janhunen, Tomi On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning. (English) Zbl 07398014 Inf. Comput. 280, Article ID 104638, 17 p. (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Sioutis} et al., Inf. Comput. 280, Article ID 104638, 17 p. (2021; Zbl 07398014) Full Text: DOI OpenURL
Fourie, Dehann; Terán Espinoza, Antonio; Kaess, Michael; Leonard, John Characterizing marginalization and incremental operations on the Bayes tree. (English) Zbl 1469.68123 Lavalle, Steven M. (ed.) et al., Algorithmic foundations of robotics XIV. Proceedings of the fourteenth workshop on the algorithmic foundations of robotics. Cham: Springer. Springer Proc. Adv. Robot. 17, 227-242 (2021). MSC: 68T40 PDF BibTeX XML Cite \textit{D. Fourie} et al., Springer Proc. Adv. Robot. 17, 227--242 (2021; Zbl 1469.68123) 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
Li, Yang; Allison, Lloyd; Korb, Kevin B. The difficulty of being moral. (English) Zbl 07391549 Theor. Comput. Sci. 885, 77-90 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{Y. Li} et al., Theor. Comput. Sci. 885, 77--90 (2021; Zbl 07391549) Full Text: DOI 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
Beisegel, Jesse; Denkert, Carolin; Köhler, Ekkehard; Krnc, Matjaž; Pivač, Nevena; Scheffler, Robert; Strehler, Martin The recognition problem of graph search trees. (English) Zbl 1467.05032 SIAM J. Discrete Math. 35, No. 2, 1418-1446 (2021). MSC: 05C05 05C85 68P10 68W05 PDF BibTeX XML Cite \textit{J. Beisegel} et al., SIAM J. Discrete Math. 35, No. 2, 1418--1446 (2021; Zbl 1467.05032) Full Text: DOI OpenURL
Guttmann-Beck, Nili; Rozen, Roni; Stern, Michal Vertices removal for feasibility of clustered spanning trees. (English) Zbl 1464.90077 Discrete Appl. Math. 296, 68-84 (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{N. Guttmann-Beck} et al., Discrete Appl. Math. 296, 68--84 (2021; Zbl 1464.90077) Full Text: DOI 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
Feuilloley, Laurent; Habib, Michel Graph classes and forbidden patterns on three vertices. (English) Zbl 07325840 SIAM J. Discrete Math. 35, No. 1, 55-90 (2021). MSC: 03D15 05C85 05C62 68R10 PDF BibTeX XML Cite \textit{L. Feuilloley} and \textit{M. Habib}, SIAM J. Discrete Math. 35, No. 1, 55--90 (2021; Zbl 07325840) Full Text: DOI arXiv OpenURL
Asahiro, Yuichi; Eto, Hiroshi; Hanaka, Tesshu; Lin, Guohui; Miyano, Eiji; Terabaru, Ippei Graph classes and approximability of the happy set problem. (English) Zbl 07336116 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, 335-346 (2020). MSC: 68Rxx PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Lect. Notes Comput. Sci. 12273, 335--346 (2020; Zbl 07336116) Full Text: DOI OpenURL
Nadarajah, Selvaprabu; Cire, Andre A. Network-based approximate linear programming for discrete optimization. (English) Zbl 1457.90095 Oper. Res. 68, No. 6, 1767-1786 (2020). MSC: 90C10 90C35 PDF BibTeX XML Cite \textit{S. Nadarajah} and \textit{A. A. Cire}, Oper. Res. 68, No. 6, 1767--1786 (2020; Zbl 1457.90095) Full Text: DOI OpenURL
Del Pia, Alberto; Khajavirad, Aida; Sahinidis, Nikolaos V. On the impact of running intersection inequalities for globally solving polynomial optimization problems. (English) Zbl 1441.90097 Math. Program. Comput. 12, No. 2, 165-191 (2020). MSC: 90C11 90C26 90C57 PDF BibTeX XML Cite \textit{A. Del Pia} et al., Math. Program. Comput. 12, No. 2, 165--191 (2020; Zbl 1441.90097) Full Text: DOI OpenURL
Klusowski, Jason M.; Wu, Yihong Estimating the number of connected components in a graph via subgraph sampling. (English) Zbl 1440.62043 Bernoulli 26, No. 3, 1635-1664 (2020). Reviewer: Kurt Marti (München) MSC: 62D05 05C90 62C20 PDF BibTeX XML Cite \textit{J. M. Klusowski} and \textit{Y. Wu}, Bernoulli 26, No. 3, 1635--1664 (2020; Zbl 1440.62043) Full Text: DOI arXiv Euclid OpenURL
Laurent, Monique; Tanigawa, Shin-Ichi Perfect elimination orderings for symmetric matrices. (English) Zbl 1442.05080 Optim. Lett. 14, No. 2, 339-353 (2020). MSC: 05C22 05C99 05B20 PDF BibTeX XML Cite \textit{M. Laurent} and \textit{S.-I. Tanigawa}, Optim. Lett. 14, No. 2, 339--353 (2020; Zbl 1442.05080) Full Text: DOI arXiv 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
Zheng, Yang; Fantuzzi, Giovanni; Papachristodoulou, Antonis; Goulart, Paul; Wynn, Andrew Chordal decomposition in operator-splitting methods for sparse semidefinite programs. (English) Zbl 1434.90126 Math. Program. 180, No. 1-2 (A), 489-532 (2020). MSC: 90C22 90C25 49M27 49M29 PDF BibTeX XML Cite \textit{Y. Zheng} et al., Math. Program. 180, No. 1--2 (A), 489--532 (2020; Zbl 1434.90126) Full Text: DOI arXiv OpenURL
Ouali, Abdelkader; Allouche, David; de Givry, Simon; Loudni, Samir; Lebbah, Yahia; Loukil, Lakhdar; Boizumault, Patrice Variable neighborhood search for graphical model energy minimization. (English) Zbl 1478.68329 Artif. Intell. 278, Article ID 103194, 22 p. (2020). MSC: 68T20 62H22 92D20 PDF BibTeX XML Cite \textit{A. Ouali} et al., Artif. Intell. 278, Article ID 103194, 22 p. (2020; Zbl 1478.68329) Full Text: DOI OpenURL
Preißer, Johanna E.; Schmidt, Jens M. Computing vertex-disjoint paths in large graphs using MAOs. (English) Zbl 1436.68256 Algorithmica 82, No. 1, 146-162 (2020). MSC: 68R10 05C38 05C40 05C85 68W40 PDF BibTeX XML Cite \textit{J. E. Preißer} and \textit{J. M. Schmidt}, Algorithmica 82, No. 1, 146--162 (2020; Zbl 1436.68256) Full Text: DOI Link OpenURL
Beisegel, Jesse; Denkert, Carolin; Köhler, Ekkehard; Krnc, Matjaž; Pivač, Nevena; Scheffler, Robert; Strehler, Martin Recognizing graph search trees. (English) Zbl 07515172 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, 99-110 (2019). MSC: 05Cxx 90Cxx PDF BibTeX XML Cite \textit{J. Beisegel} et al., Electron. Notes Theor. Comput. Sci. 346, 99--110 (2019; Zbl 07515172) Full Text: DOI OpenURL
Bergman, David; Cardonha, Carlos H.; Cire, Andre A.; Raghunathan, Arvind U. On the minimum chordal completion polytope. (English) Zbl 1455.90141 Oper. Res. 67, No. 2, 532-547 (2019). MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{D. Bergman} et al., Oper. Res. 67, No. 2, 532--547 (2019; Zbl 1455.90141) Full Text: DOI arXiv OpenURL
Sioutis, Michael; Paparrizou, Anastasia; Condotta, Jean-François Collective singleton-based consistency for qualitative constraint networks: theory and practice. (English) Zbl 1435.68322 Theor. Comput. Sci. 797, 17-41 (2019). MSC: 68T30 68T20 PDF BibTeX XML Cite \textit{M. Sioutis} et al., Theor. Comput. Sci. 797, 17--41 (2019; Zbl 1435.68322) Full Text: DOI HAL OpenURL
Minh, Do Le Paul; Duong, Truong Thi Thuy Bayesian networks: the minimal triangulations of a graph. (English) Zbl 1434.68367 Theor. Comput. Sci. 795, 1-8 (2019). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{D. Le P. Minh} and \textit{T. T. T. Duong}, Theor. Comput. Sci. 795, 1--8 (2019; Zbl 1434.68367) Full Text: DOI 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
Skibski, Oskar; Rahwan, Talal; Michalak, Tomasz P.; Yokoo, Makoto Attachment centrality: measure for connectivity in networks. (English) Zbl 1478.68261 Artif. Intell. 274, 151-179 (2019). MSC: 68R10 05C40 05C57 68Q25 90B18 PDF BibTeX XML Cite \textit{O. Skibski} et al., Artif. Intell. 274, 151--179 (2019; Zbl 1478.68261) Full Text: DOI OpenURL
Benjumeda, Marco; Bielza, Concha; Larrañaga, Pedro Learning tractable Bayesian networks in the space of elimination orders. (English) Zbl 1478.68280 Artif. Intell. 274, 66-90 (2019). MSC: 68T05 62H22 68Q25 PDF BibTeX XML Cite \textit{M. Benjumeda} et al., Artif. Intell. 274, 66--90 (2019; Zbl 1478.68280) Full Text: DOI Link OpenURL
Chakraborty, Sankardeep; Satti, Srinivasa Rao Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. (English) Zbl 1420.90076 J. Comb. Optim. 37, No. 2, 465-481 (2019). MSC: 90C35 PDF BibTeX XML Cite \textit{S. Chakraborty} and \textit{S. R. Satti}, J. Comb. Optim. 37, No. 2, 465--481 (2019; Zbl 1420.90076) Full Text: DOI 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
Ravanmehr, Vida; Puleo, Gregory J.; Bolouki, Sadegh; Milenković, Olgica Paired threshold graphs. (English) Zbl 1398.05189 Discrete Appl. Math. 250, 291-308 (2018). MSC: 05C82 05C85 05C12 PDF BibTeX XML Cite \textit{V. Ravanmehr} et al., Discrete Appl. Math. 250, 291--308 (2018; Zbl 1398.05189) Full Text: DOI arXiv OpenURL
Kovkov, D. V.; Lemtyuzhnikova, D. V. Decomposition in multidimensional Boolean-optimization problems with sparse matrices. (English. Russian original) Zbl 1391.90413 J. Comput. Syst. Sci. Int. 57, No. 1, 97-108 (2018); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2018, No. 1, 98-110 (2018). MSC: 90C09 PDF BibTeX XML Cite \textit{D. V. Kovkov} and \textit{D. V. Lemtyuzhnikova}, J. Comput. Syst. Sci. Int. 57, No. 1, 97--108 (2018; Zbl 1391.90413); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2018, No. 1, 98--110 (2018) Full Text: DOI OpenURL
Ali, Niran Abbas; Kilicman, Adem; Trao, Hazim Michman Restricted triangulation on circulant graphs. (English) Zbl 1392.05029 Open Math. 16, 358-369 (2018). MSC: 05C10 PDF BibTeX XML Cite \textit{N. A. Ali} et al., Open Math. 16, 358--369 (2018; Zbl 1392.05029) Full Text: DOI OpenURL
Wang, Jian-fang; Xu, Xin Homology cycles and dependent cycles of hypergraphs. (English) Zbl 1387.05173 Acta Math. Appl. Sin., Engl. Ser. 34, No. 2, 237-248 (2018). MSC: 05C65 05C38 PDF BibTeX XML Cite \textit{J.-f. Wang} and \textit{X. Xu}, Acta Math. Appl. Sin., Engl. Ser. 34, No. 2, 237--248 (2018; Zbl 1387.05173) Full Text: DOI 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
Reddy, K. Krishna Mohan; Renjith, P.; Sadagopan, N. Listing all spanning trees in Halin graphs – sequential and parallel view. (English) Zbl 1380.05106 Discrete Math. Algorithms Appl. 10, No. 1, Article ID 1850005, 17 p. (2018). MSC: 05C30 05C85 05C05 PDF BibTeX XML Cite \textit{K. K. M. Reddy} et al., Discrete Math. Algorithms Appl. 10, No. 1, Article ID 1850005, 17 p. (2018; Zbl 1380.05106) 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
Jégou, Philippe; Terrioux, Cyril Combining restarts, nogoods and bag-connected decompositions for solving csps. (English) Zbl 1384.90113 Constraints 22, No. 2, 191-229 (2017). MSC: 90C35 PDF BibTeX XML Cite \textit{P. Jégou} and \textit{C. Terrioux}, Constraints 22, No. 2, 191--229 (2017; Zbl 1384.90113) Full Text: DOI Link OpenURL
Greco, Gianluigi; Scarcello, Francesco The power of local consistency in conjunctive queries and constraint satisfaction problems. (English) Zbl 1371.68061 SIAM J. Comput. 46, No. 3, 1111-1145 (2017). MSC: 68P15 68P05 PDF BibTeX XML Cite \textit{G. Greco} and \textit{F. Scarcello}, SIAM J. Comput. 46, No. 3, 1111--1145 (2017; Zbl 1371.68061) Full Text: DOI OpenURL
Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh Improved bounds for poset sorting in the forbidden-comparison regime. (English) Zbl 1485.68087 Gaur, Daya (ed.) et al., Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10156, 50-59 (2017). MSC: 68P10 06A06 68R10 68W05 68W40 PDF BibTeX XML Cite \textit{A. Biswas} et al., Lect. Notes Comput. Sci. 10156, 50--59 (2017; Zbl 1485.68087) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{Y. Cao} et al., Discrete Appl. Math. 216, Part 1, 67--83 (2017; Zbl 1350.05104) 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
van Bevern, René; Kanj, Iyad; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel Twins in subdivision drawings of hypergraphs. (English) Zbl 1483.68262 Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 67-80 (2016). MSC: 68R10 05C65 68Q27 68U05 68W05 PDF BibTeX XML Cite \textit{R. van Bevern} et al., Lect. Notes Comput. Sci. 9801, 67--80 (2016; Zbl 1483.68262) Full Text: DOI arXiv OpenURL
Leitert, Arne; Dragan, Feodor F. On strong tree-breadth. (English) Zbl 1427.68248 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 62-76 (2016). MSC: 68R10 68Q17 68Q25 PDF BibTeX XML Cite \textit{A. Leitert} and \textit{F. F. Dragan}, Lect. Notes Comput. Sci. 10043, 62--76 (2016; Zbl 1427.68248) Full Text: DOI OpenURL
Barceló, Pablo; Romero, Miguel; Vardi, Moshe Y. Semantic acyclicity on graph databases. (English) Zbl 1407.68123 SIAM J. Comput. 45, No. 4, 1339-1376 (2016). MSC: 68P15 PDF BibTeX XML Cite \textit{P. Barceló} et al., SIAM J. Comput. 45, No. 4, 1339--1376 (2016; Zbl 1407.68123) Full Text: DOI OpenURL
Corneil, Derek G.; Dusart, Jérémie; Habib, Michel; Köhler, Ekkehard On the power of graph searching for cocomparability graphs. (English) Zbl 1333.05285 SIAM J. Discrete Math. 30, No. 1, 569-591 (2016). MSC: 05C85 68R10 06A07 PDF BibTeX XML Cite \textit{D. G. Corneil} et al., SIAM J. Discrete Math. 30, No. 1, 569--591 (2016; Zbl 1333.05285) Full Text: DOI OpenURL
Corneil, Derek G.; Dusart, Jérémie; Habib, Michel; Mamcarz, Antoine; de Montgolfier, Fabien A tie-break model for graph search. (English) Zbl 1326.05151 Discrete Appl. Math. 199, 89-100 (2016). MSC: 05C85 PDF BibTeX XML Cite \textit{D. G. Corneil} et al., Discrete Appl. Math. 199, 89--100 (2016; Zbl 1326.05151) Full Text: DOI arXiv OpenURL
Butz, Cory J.; Oliveira, Jhonatan S.; Madsen, Anders L. Bayesian network inference using marginal trees. (English) Zbl 1347.68328 Int. J. Approx. Reasoning 68, 127-152 (2016). MSC: 68T37 05C90 62H12 PDF BibTeX XML Cite \textit{C. J. Butz} et al., Int. J. Approx. Reasoning 68, 127--152 (2016; Zbl 1347.68328) Full Text: DOI OpenURL
Doan, Xuan Vinh; Li, Xiaobo; Natarajan, Karthik Robustness to dependency in portfolio optimization using overlapping marginals. (English) Zbl 1347.91227 Oper. Res. 63, No. 6, 1468-1488 (2015). MSC: 91G10 90C05 PDF BibTeX XML Cite \textit{X. V. Doan} et al., Oper. Res. 63, No. 6, 1468--1488 (2015; Zbl 1347.91227) Full Text: DOI Link OpenURL
Stingo, Francesco; Marchetti, Giovanni M. Efficient local updates for undirected graphical models. (English) Zbl 1331.62166 Stat. Comput. 25, No. 1, 159-171 (2015). MSC: 62F15 62A09 62M40 92D10 PDF BibTeX XML Cite \textit{F. Stingo} and \textit{G. M. Marchetti}, Stat. Comput. 25, No. 1, 159--171 (2015; Zbl 1331.62166) Full Text: DOI OpenURL
Wainwright, Martin J. Graphical models and message-passing algorithms: some introductory lectures. (English) Zbl 1338.62017 Fagnani, Fabio (ed.) et al., Mathematical foundations of complex networked information systems. Lectures of the CIME course. Politecnico di Torino, Verrès, Italy 2009. Cham: Springer; Florence: Fondazione CIME (ISBN 978-3-319-16966-8/pbk; 978-3-319-16967-5/ebook). Lecture Notes in Mathematics 2141. CIME Foundation Subseries, 51-108 (2015). MSC: 62A09 62Hxx 62-01 05C90 68Q10 68Q87 68R10 PDF BibTeX XML Cite \textit{M. J. Wainwright}, Lect. Notes Math. 2141, 51--108 (2015; Zbl 1338.62017) Full Text: DOI OpenURL
Xiang, Ruoxuan; Khare, Kshitij; Ghosh, Malay High dimensional posterior convergence rates for decomposable graphical models. (English) Zbl 1329.62152 Electron. J. Stat. 9, No. 2, 2828-2854 (2015). MSC: 62F15 62A09 62G20 PDF BibTeX XML Cite \textit{R. Xiang} et al., Electron. J. Stat. 9, No. 2, 2828--2854 (2015; Zbl 1329.62152) Full Text: DOI Euclid OpenURL
Turner, Lara; Groß, Dwi Poetranto; Hamacher, Horst W.; Krumke, Sven O. Static and dynamic source locations in undirected networks. (English) Zbl 1327.90030 Top 23, No. 3, 619-646 (2015). MSC: 90B10 90B80 90C59 PDF BibTeX XML Cite \textit{L. Turner} et al., Top 23, No. 3, 619--646 (2015; Zbl 1327.90030) Full Text: DOI OpenURL
Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Paul, Christophe Hadwiger number of graphs with small chordality. (English) Zbl 1327.05322 SIAM J. Discrete Math. 29, No. 3, 1427-1451 (2015). MSC: 05C85 68R10 68Q17 68Q25 68W40 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., SIAM J. Discrete Math. 29, No. 3, 1427--1451 (2015; Zbl 1327.05322) Full Text: DOI arXiv OpenURL
Chang, Hsien-Chih; Lu, Hsueh-I A faster algorithm to recognize even-hole-free graphs. (English) Zbl 1315.05107 J. Comb. Theory, Ser. B 113, 141-161 (2015). MSC: 05C70 05C85 05C69 PDF BibTeX XML Cite \textit{H.-C. Chang} and \textit{H.-I Lu}, J. Comb. Theory, Ser. B 113, 141--161 (2015; Zbl 1315.05107) Full Text: DOI arXiv 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
Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Manne, Fredrik; Paulusma, Daniël; Pilipczuk, Michał Modifying a graph using vertex elimination. (English) Zbl 1314.68232 Algorithmica 72, No. 1, 99-125 (2015). MSC: 68R10 05C76 68Q17 68Q25 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., Algorithmica 72, No. 1, 99--125 (2015; Zbl 1314.68232) Full Text: DOI Link 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
Bruhn, Henning; Charbit, Pierre; Schaudt, Oliver; Telle, Jan Arne The graph formulation of the union-closed sets conjecture. (English) Zbl 1301.05183 Eur. J. Comb. 43, 210-219 (2015). MSC: 05C35 05D05 PDF BibTeX XML Cite \textit{H. Bruhn} et al., Eur. J. Comb. 43, 210--219 (2015; Zbl 1301.05183) Full Text: DOI arXiv OpenURL
Nosov, Yu. L. The Wiener index of maximal outerplane graphs. (Russian. English summary) Zbl 07310280 Prikl. Diskretn. Mat. 2014, No. 4(26), 112-122 (2014). MSC: 68-XX 05-XX PDF BibTeX XML Cite \textit{Yu. L. Nosov}, Prikl. Diskretn. Mat. 2014, No. 4(26), 112--122 (2014; Zbl 07310280) Full Text: MNR OpenURL
Li, Meng; Otachi, Yota; Tokuyama, Takeshi Efficient algorithms for network localization using cores of underlying graphs. (English) Zbl 1360.68649 Theor. Comput. Sci. 553, 18-26 (2014). MSC: 68R10 05C62 05C69 05C85 PDF BibTeX XML Cite \textit{M. Li} et al., Theor. Comput. Sci. 553, 18--26 (2014; Zbl 1360.68649) Full Text: DOI OpenURL
Berry, Anne; Pogorelcnik, Romain; Simonet, Geneviève Organizing the atoms of the clique separator decomposition into an atom tree. (English) Zbl 1297.05051 Discrete Appl. Math. 177, 1-13 (2014). MSC: 05C05 05C85 PDF BibTeX XML Cite \textit{A. Berry} et al., Discrete Appl. Math. 177, 1--13 (2014; Zbl 1297.05051) Full Text: DOI OpenURL
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Rafiey, Arash Finding clubs in graph classes. (English) Zbl 1298.05092 Discrete Appl. Math. 174, 57-65 (2014). MSC: 05C12 05C75 05C69 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., Discrete Appl. Math. 174, 57--65 (2014; Zbl 1298.05092) 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
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
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Paul, Christophe Contracting chordal graphs and bipartite graphs to paths and trees. (English) Zbl 1288.05060 Discrete Appl. Math. 164, Part 2, 444-449 (2014). MSC: 05C10 05C85 68Q17 PDF BibTeX XML Cite \textit{P. Heggernes} et al., Discrete Appl. Math. 164, Part 2, 444--449 (2014; Zbl 1288.05060) Full Text: DOI OpenURL
Bachrach, Yoram; Parkes, David C.; Rosenschein, Jeffrey S. Computing cooperative solution concepts in coalitional skill games. (English) Zbl 1334.91007 Artif. Intell. 204, 1-21 (2013). MSC: 91A12 68Q17 68Q25 68R10 PDF BibTeX XML Cite \textit{Y. Bachrach} et al., Artif. Intell. 204, 1--21 (2013; Zbl 1334.91007) Full Text: DOI OpenURL
Szántai, Tamás; Kovács, Edith Discovering a junction tree behind a Markov network by a greedy algorithm. (English) Zbl 1294.65013 Optim. Eng. 14, No. 4, 503-518 (2013). MSC: 65C50 65K10 90C35 PDF BibTeX XML Cite \textit{T. Szántai} and \textit{E. Kovács}, Optim. Eng. 14, No. 4, 503--518 (2013; Zbl 1294.65013) Full Text: DOI arXiv OpenURL
Xu, Shou-Jun; Li, Xianyue; Liang, Ronghua Moplex orderings generated by the LexDFs algorithm. (English) Zbl 1287.05153 Discrete Appl. Math. 161, No. 13-14, 2189-2195 (2013). MSC: 05C85 05C69 PDF BibTeX XML Cite \textit{S.-J. Xu} et al., Discrete Appl. Math. 161, No. 13--14, 2189--2195 (2013; Zbl 1287.05153) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{S. Bessy} and \textit{A. Perez}, Inf. Comput. 231, 89--108 (2013; Zbl 1358.68117) Full Text: DOI OpenURL
Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan Satisfiability of acyclic and almost acyclic CNF formulas. (English) Zbl 1291.68182 Theor. Comput. Sci. 481, 85-99 (2013). MSC: 68Q25 03B05 05C85 05C65 PDF BibTeX XML Cite \textit{S. Ordyniak} et al., Theor. Comput. Sci. 481, 85--99 (2013; Zbl 1291.68182) Full Text: DOI OpenURL
Chiang, Chun-Ying; Huang, Liang-Hao; Li, Bo-Jr; Wu, Jiaojiao; Yeh, Hong-Gwa Some results on the target set selection problem. (English) Zbl 1273.90224 J. Comb. Optim. 25, No. 4, 702-715 (2013). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{C.-Y. Chiang} et al., J. Comb. Optim. 25, No. 4, 702--715 (2013; Zbl 1273.90224) Full Text: DOI arXiv Link OpenURL
Malvestuto, Francesco M. Decomposable convexities in graphs and hypergraphs. (English) Zbl 1264.05089 ISRN Comb. 2013, Article ID 453808, 9 p. (2013). MSC: 05C65 05C70 PDF BibTeX XML Cite \textit{F. M. Malvestuto}, ISRN Comb. 2013, Article ID 453808, 9 p. (2013; Zbl 1264.05089) Full Text: DOI OpenURL
Brešar, Boštjan; Chalopin, Jérémie; Chepoi, Victor; Kovše, Matjaž; Labourel, Arnaud; Vaxès, Yann Retracts of products of chordal graphs. (English) Zbl 1264.05113 J. Graph Theory 73, No. 1-2, 161-180 (2013). MSC: 05C76 05C12 PDF BibTeX XML Cite \textit{B. Brešar} et al., J. Graph Theory 73, No. 1--2, 161--180 (2013; Zbl 1264.05113) Full Text: DOI Link OpenURL
Guillemot, Sylvain; Havet, Frédéric; Paul, Christophe; Perez, Anthony On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems. (English) Zbl 1262.68048 Algorithmica 65, No. 4, 900-926 (2013). MSC: 68Q25 90C35 05C85 PDF BibTeX XML Cite \textit{S. Guillemot} et al., Algorithmica 65, No. 4, 900--926 (2013; Zbl 1262.68048) Full Text: DOI OpenURL
Chang, Hsien-Chih; Lu, Hsueh-I A faster algorithm to recognize even-hole-free graphs. (English) Zbl 1423.05129 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1286-1297 (2012). MSC: 05C70 05C69 05C85 68W40 PDF BibTeX XML Cite \textit{H.-C. Chang} and \textit{H.-I Lu}, in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1286--1297 (2012; Zbl 1423.05129) Full Text: Link OpenURL
Loudni, Samir; Fontaine, Mathieu; Boizumault, Patrice Exploiting separators for guiding VNS. (English) Zbl 1268.68152 Sifaleras, Angelo (ed.) et al., Selected papers of the 28th EURO mini conference (MEC XXVIII) on variable neighborhood search, Herceg Novi, Mentenegro, October 4–7, 2012. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 39, 265-272 (2012). MSC: 68T20 PDF BibTeX XML Cite \textit{S. Loudni} et al., Electron. Notes Discrete Math. 39, 265--272 (2012; Zbl 1268.68152) Full Text: DOI HAL OpenURL
Zhu, Mingmin; Liu, Sanyang A decomposition algorithm for learning Bayesian networks based on scoring function. (English) Zbl 1263.62046 J. Appl. Math. 2012, Article ID 974063, 17 p. (2012). MSC: 62F15 68T05 05C90 65C60 PDF BibTeX XML Cite \textit{M. Zhu} and \textit{S. Liu}, J. Appl. Math. 2012, Article ID 974063, 17 p. (2012; Zbl 1263.62046) Full Text: DOI OpenURL
Malvestuto, Francesco M. A backward selection procedure for approximating a discrete probability distribution by decomposable models. (English) Zbl 1262.05113 Kybernetika 48, No. 5, 825-844 (2012). MSC: 05C65 62A09 68R10 68T05 PDF BibTeX XML Cite \textit{F. M. Malvestuto}, Kybernetika 48, No. 5, 825--844 (2012; Zbl 1262.05113) Full Text: Link OpenURL
Wermuth, Nanny; Sadeghi, Kayvan Sequences of regressions and their independences. (English) Zbl 1259.62063 Test 21, No. 2, 215-252 (2012). MSC: 62J99 05C90 60J99 65C60 PDF BibTeX XML Cite \textit{N. Wermuth} and \textit{K. Sadeghi}, Test 21, No. 2, 215--252 (2012; Zbl 1259.62063) Full Text: DOI arXiv OpenURL
Xu, Ping-feng; Guo, Jian-hua A new algorithm for decomposition of graphical models. (English) Zbl 1254.05190 Acta Math. Appl. Sin., Engl. Ser. 28, No. 3, 571-582 (2012). MSC: 05C85 68R10 68W05 62H99 PDF BibTeX XML Cite \textit{P.-f. Xu} and \textit{J.-h. Guo}, Acta Math. Appl. Sin., Engl. Ser. 28, No. 3, 571--582 (2012; Zbl 1254.05190) Full Text: DOI OpenURL
Lévêque, Benjamin; de Werra, Dominique Graph transformations preserving the stability number. (English) Zbl 1254.05166 Discrete Appl. Math. 160, No. 18, 2752-2759 (2012). MSC: 05C76 05C69 05C17 PDF BibTeX XML Cite \textit{B. Lévêque} and \textit{D. de Werra}, Discrete Appl. Math. 160, No. 18, 2752--2759 (2012; Zbl 1254.05166) Full Text: DOI OpenURL
Khanafer, Ali; Clautiaux, François; Talbi, El-Ghazali Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. (English) Zbl 1251.90282 Comput. Oper. Res. 39, No. 1, 54-63 (2012). MSC: 90C10 90C27 90B80 90C59 PDF BibTeX XML Cite \textit{A. Khanafer} et al., Comput. Oper. Res. 39, No. 1, 54--63 (2012; Zbl 1251.90282) Full Text: DOI OpenURL
Bao, Forrest Sheng; Zhang, Yuanlin A review of tree convex sets test. (English) Zbl 1251.91034 Comput. Intell. 28, No. 3, 358-372 (2012). MSC: 91B26 05C90 90C35 PDF BibTeX XML Cite \textit{F. S. Bao} and \textit{Y. Zhang}, Comput. Intell. 28, No. 3, 358--372 (2012; Zbl 1251.91034) Full Text: DOI OpenURL
Brandes, Ulrik; Cornelsen, Sabine; Pampel, Barbara; Sallaberry, Arnaud Path-based supports for hypergraphs. (English) Zbl 1247.05235 J. Discrete Algorithms 14, 248-261 (2012). MSC: 05C85 05C65 05C90 05C62 68U05 PDF BibTeX XML Cite \textit{U. Brandes} et al., J. Discrete Algorithms 14, 248--261 (2012; Zbl 1247.05235) Full Text: DOI OpenURL
Mezzini, Mauro Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time. (English) Zbl 1246.68173 Theor. Comput. Sci. 445, 82-92 (2012). MSC: 68R10 68P05 90C39 68W05 PDF BibTeX XML Cite \textit{M. Mezzini}, Theor. Comput. Sci. 445, 82--92 (2012; Zbl 1246.68173) Full Text: DOI OpenURL
Chee, Yeow Meng; Ji, Lijun; Lim, Andrew; Tung, Anthony K. H. Arboricity: an acyclic hypergraph decomposition problem motivated by database theory. (English) Zbl 1237.68071 Discrete Appl. Math. 160, No. 1-2, 100-107 (2012). MSC: 68P15 68R10 05C65 05B07 PDF BibTeX XML Cite \textit{Y. M. Chee} et al., Discrete Appl. Math. 160, No. 1--2, 100--107 (2012; Zbl 1237.68071) Full Text: DOI OpenURL
Berry, Anne; Pogorelcnik, Romain A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph. (English) Zbl 1259.05158 Inf. Process. Lett. 111, No. 11, 508-511 (2011). MSC: 05C85 05C69 05C35 PDF BibTeX XML Cite \textit{A. Berry} and \textit{R. Pogorelcnik}, Inf. Process. Lett. 111, No. 11, 508--511 (2011; Zbl 1259.05158) Full Text: DOI HAL OpenURL
Bartels, Chris D.; Bilmes, Jeff A. Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models. (English) Zbl 1446.62163 Mach. Learn. 84, No. 3, 249-289 (2011). MSC: 62H22 68T05 68Q17 68R10 05C69 PDF BibTeX XML Cite \textit{C. D. Bartels} and \textit{J. A. Bilmes}, Mach. Learn. 84, No. 3, 249--289 (2011; Zbl 1446.62163) Full Text: DOI arXiv OpenURL
Malvestuto, Francesco M.; Mezzini, Mauro; Moscarini, Marina Equivalence between hypergraph convexities. (English) Zbl 1238.05186 ISRN Discrete Math. 2011, Article ID 806193, 22 p. (2011). MSC: 05C65 52A20 PDF BibTeX XML Cite \textit{F. M. Malvestuto} et al., ISRN Discrete Math. 2011, Article ID 806193, 22 p. (2011; Zbl 1238.05186) Full Text: DOI OpenURL
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve Faster parameterized algorithms for Minimum Fill-in. (English) Zbl 1230.68100 Algorithmica 61, No. 4, 817-838 (2011). MSC: 68Q25 68W40 05C85 PDF BibTeX XML Cite \textit{H. L. Bodlaender} et al., Algorithmica 61, No. 4, 817--838 (2011; Zbl 1230.68100) Full Text: DOI OpenURL