Römer, Tim; Saeedi Madani, Sara Cycle algebras and polytopes of matroids. (English) Zbl 07808726 J. Pure Appl. Algebra 228, No. 6, Article ID 107574, 23 p. (2024). MSC: 05E40 05B35 52B20 52B12 52B40 90C27 PDFBibTeX XMLCite \textit{T. Römer} and \textit{S. Saeedi Madani}, J. Pure Appl. Algebra 228, No. 6, Article ID 107574, 23 p. (2024; Zbl 07808726) Full Text: DOI arXiv
Hu, Hao; Li, Xinxin; Wu, Jiageng A note on the SDP relaxation of the minimum cut problem. (English) Zbl 1526.05115 J. Glob. Optim. 87, No. 2-4, 857-876 (2023). MSC: 05C70 90C22 90C27 90C35 PDFBibTeX XMLCite \textit{H. Hu} et al., J. Glob. Optim. 87, No. 2--4, 857--876 (2023; Zbl 1526.05115) Full Text: DOI
Chimani, Markus; Juhnke-Kubitzke, Martina; Nover, Alexander On the bond polytope. (English) Zbl 1526.05061 Adv. Geom. 23, No. 4, 461-480 (2023). MSC: 05C22 05C70 90C27 52B99 PDFBibTeX XMLCite \textit{M. Chimani} et al., Adv. Geom. 23, No. 4, 461--480 (2023; Zbl 1526.05061) Full Text: DOI arXiv
Miyazaki, Mitsuhiro Non-Gorenstein locus and almost Gorenstein property of the Ehrhart ring of the stable set polytope of a cycle graph. (English) Zbl 07721301 Taiwanese J. Math. 27, No. 3, 441-459 (2023). MSC: 13H10 52B20 05E40 05C17 05C38 PDFBibTeX XMLCite \textit{M. Miyazaki}, Taiwanese J. Math. 27, No. 3, 441--459 (2023; Zbl 07721301) Full Text: DOI arXiv
Beideman, Calvin; Chandrasekaran, Karthekeyan; Xu, Chao Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs. (English) Zbl 1514.90197 Math. Program. 197, No. 1 (A), 27-69 (2023). MSC: 90C27 90C29 05C65 PDFBibTeX XMLCite \textit{C. Beideman} et al., Math. Program. 197, No. 1 (A), 27--69 (2023; Zbl 1514.90197) Full Text: DOI arXiv
Ishii, Toshimasa; Kawamura, Akitoshi; Kobayashi, Yusuke; Makino, Kazuhisa Trade-offs among degree, diameter, and number of paths. (English) Zbl 1506.05049 Discrete Appl. Math. 327, 96-100 (2023). MSC: 05C07 05C12 05C35 05C40 90C35 90C27 PDFBibTeX XMLCite \textit{T. Ishii} et al., Discrete Appl. Math. 327, 96--100 (2023; Zbl 1506.05049) Full Text: DOI
Furini, Fabio; Ljubić, Ivana; Malaguti, Enrico; Paronuzzi, Paolo Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem. (English) Zbl 1503.91039 Oper. Res. 70, No. 4, 2399-2420 (2022). MSC: 91A65 91A05 05C90 90C27 PDFBibTeX XMLCite \textit{F. Furini} et al., Oper. Res. 70, No. 4, 2399--2420 (2022; Zbl 1503.91039) Full Text: DOI
Sinjorgo, Lennart; Sotirov, Renata On the generalized \(\vartheta\)-number and related problems for highly symmetric graphs. (English) Zbl 1494.05048 SIAM J. Optim. 32, No. 2, 1344-1378 (2022). MSC: 05C15 05E30 05C76 90C35 PDFBibTeX XMLCite \textit{L. Sinjorgo} and \textit{R. Sotirov}, SIAM J. Optim. 32, No. 2, 1344--1378 (2022; Zbl 1494.05048) Full Text: DOI arXiv
Neto, José A polyhedral view to a generalization of multiple domination. (English) Zbl 1486.05232 Discrete Appl. Math. 313, 1-17 (2022). MSC: 05C69 90C10 90C35 PDFBibTeX XMLCite \textit{J. Neto}, Discrete Appl. Math. 313, 1--17 (2022; Zbl 1486.05232) Full Text: DOI
Conforti, Michele; Fiorini, Samuel; Huynh, Tony; Weltge, Stefan Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. (English) Zbl 1489.90151 Math. Program. 192, No. 1-2 (B), 547-566 (2022). MSC: 90C27 90C10 05C21 05C85 PDFBibTeX XMLCite \textit{M. Conforti} et al., Math. Program. 192, No. 1--2 (B), 547--566 (2022; Zbl 1489.90151) Full Text: DOI arXiv
Koley, Mitra; Römer, Tim Seminormality, canonical modules, and regularity of cut polytopes. (English) Zbl 1507.13007 J. Pure Appl. Algebra 226, No. 1, Article ID 106797, 22 p. (2022). MSC: 13C05 14M25 52B20 05E40 PDFBibTeX XMLCite \textit{M. Koley} and \textit{T. Römer}, J. Pure Appl. Algebra 226, No. 1, Article ID 106797, 22 p. (2022; Zbl 1507.13007) Full Text: DOI arXiv
Kerivin, Hervé; Wagler, Annegret On superperfection of edge intersection graphs of paths. (English) Zbl 1479.05311 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 79-91 (2021). MSC: 05C76 05C15 05C90 05C82 PDFBibTeX XMLCite \textit{H. Kerivin} and \textit{A. Wagler}, AIRO Springer Ser. 5, 79--91 (2021; Zbl 1479.05311) Full Text: DOI Link
O’Donnell, Ryan; Schramm, Tselil Sherali-Adams strikes back. (English) Zbl 1528.68317 Theory Comput. 17, Paper No. 9, 30 p. (2021). MSC: 68R10 05C50 05C80 68Q25 90C05 90C27 90C35 PDFBibTeX XMLCite \textit{R. O'Donnell} and \textit{T. Schramm}, Theory Comput. 17, Paper No. 9, 30 p. (2021; Zbl 1528.68317) Full Text: DOI arXiv
Manthey, Bodo; Reijnders, Victor M. J. J. Probabilistic properties of highly connected random geometric graphs. (English) Zbl 1476.05198 Discrete Appl. Math. 305, 366-376 (2021). MSC: 05D40 05C82 90B18 90B80 68M10 PDFBibTeX XMLCite \textit{B. Manthey} and \textit{V. M. J. J. Reijnders}, Discrete Appl. Math. 305, 366--376 (2021; Zbl 1476.05198) Full Text: DOI Link
Hommelsheim, Felix; Muehlenthaler, Moritz; Schaudt, Oliver How to secure matchings against edge failures. (English) Zbl 1528.68295 SIAM J. Discrete Math. 35, No. 3, 2265-2292 (2021). MSC: 68R10 05C40 05C70 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{F. Hommelsheim} et al., SIAM J. Discrete Math. 35, No. 3, 2265--2292 (2021; Zbl 1528.68295) Full Text: DOI arXiv
Li, Xinxin; Pong, Ting Kei; Sun, Hao; Wolkowicz, Henry A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem. (English) Zbl 1465.05146 Comput. Optim. Appl. 78, No. 3, 853-891 (2021). MSC: 05C70 90C22 90C25 90C27 90C59 PDFBibTeX XMLCite \textit{X. Li} et al., Comput. Optim. Appl. 78, No. 3, 853--891 (2021; Zbl 1465.05146) Full Text: DOI
Lewis, R.; Thiruvady, D.; Morgan, K. The maximum happy induced subgraph problem: bounds and algorithms. (English) Zbl 1510.68081 Comput. Oper. Res. 126, Article ID 105114, 15 p. (2021). MSC: 68R10 05C15 05C85 90C27 PDFBibTeX XMLCite \textit{R. Lewis} et al., Comput. Oper. Res. 126, Article ID 105114, 15 p. (2021; Zbl 1510.68081) Full Text: DOI
Marinelli, Fabrizio; Pizzuti, Andrea; Rossi, Fabrizio LP-based dual bounds for the maximum quasi-clique problem. (English) Zbl 1464.90083 Discrete Appl. Math. 296, 118-140 (2021). MSC: 90C27 90C11 05C69 PDFBibTeX XMLCite \textit{F. Marinelli} et al., Discrete Appl. Math. 296, 118--140 (2021; Zbl 1464.90083) Full Text: DOI
Bianchi, Silvia; Nasini, Graciela; Tolomei, Paola; Torres, Luis Miguel On dominating set polyhedra of circular interval graphs. (English) Zbl 1460.05143 Discrete Math. 344, No. 4, Article ID 112283, 21 p. (2021). MSC: 05C69 05B40 PDFBibTeX XMLCite \textit{S. Bianchi} et al., Discrete Math. 344, No. 4, Article ID 112283, 21 p. (2021; Zbl 1460.05143) Full Text: DOI arXiv
Gaul, Daniela; Schmidt, Daniel R. Chvátal-Gomory cuts for the Steiner tree problem. (English) Zbl 1464.05039 Discrete Appl. Math. 291, 188-200 (2021). Reviewer: Xueliang Li (Tianjin) MSC: 05C05 05C82 90B10 90C05 PDFBibTeX XMLCite \textit{D. Gaul} and \textit{D. R. Schmidt}, Discrete Appl. Math. 291, 188--200 (2021; Zbl 1464.05039) Full Text: DOI
Conforti, Michele; Fiorini, Samuel; Huynh, Tony; Weltge, Stefan Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. (English) Zbl 1508.68263 Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 21st international conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12125, 104-116 (2020). MSC: 68R10 05C38 05C85 68W40 90C27 90C35 PDFBibTeX XMLCite \textit{M. Conforti} et al., Lect. Notes Comput. Sci. 12125, 104--116 (2020; Zbl 1508.68263) Full Text: DOI
Sharifov, F.; Hulianytskyi, L. Cuts in undirected graphs. I. (English. Russian original) Zbl 1472.05043 Cybern. Syst. Anal. 56, No. 4, 559-565 (2020); translation from Kibern. Sist. Anal. 2020, No. 4, 46-55 (2020). MSC: 05C10 52B05 PDFBibTeX XMLCite \textit{F. Sharifov} and \textit{L. Hulianytskyi}, Cybern. Syst. Anal. 56, No. 4, 559--565 (2020; Zbl 1472.05043); translation from Kibern. Sist. Anal. 2020, No. 4, 46--55 (2020) Full Text: DOI
Arslan, Okan; Jabali, Ola; Laporte, Gilbert A flexible, natural formulation for the network design problem with vulnerability constraints. (English) Zbl 1451.90024 INFORMS J. Comput. 32, No. 1, 120-134 (2020). MSC: 90B10 05C82 90C35 90C57 PDFBibTeX XMLCite \textit{O. Arslan} et al., INFORMS J. Comput. 32, No. 1, 120--134 (2020; Zbl 1451.90024) Full Text: DOI
Kawarabayashi, Ken-ichi; Xu, Chao Minimum violation vertex maps and their applications to cut problems. (English) Zbl 1453.05072 SIAM J. Discrete Math. 34, No. 4, 2183-2207 (2020). MSC: 05C60 05C75 05C85 05C20 PDFBibTeX XMLCite \textit{K.-i. Kawarabayashi} and \textit{C. Xu}, SIAM J. Discrete Math. 34, No. 4, 2183--2207 (2020; Zbl 1453.05072) Full Text: DOI
Altmanová, Kateřina; Kolman, Petr; Voborník, Jan On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow. (English) Zbl 1447.05192 J. Graph Algorithms Appl. 24, No. 3, 303-322 (2020). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{K. Altmanová} et al., J. Graph Algorithms Appl. 24, No. 3, 303--322 (2020; Zbl 1447.05192) Full Text: DOI arXiv
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana A polyhedral study of the diameter constrained minimum spanning tree problem. (English) Zbl 1450.90013 Discrete Appl. Math. 285, 364-379 (2020). MSC: 90C10 90C35 05C05 PDFBibTeX XMLCite \textit{L. Gouveia} et al., Discrete Appl. Math. 285, 364--379 (2020; Zbl 1450.90013) Full Text: DOI Link
Furini, Fabio; Ljubić, Ivana; Malaguti, Enrico; Paronuzzi, Paolo On integer and bilevel formulations for the \(k\)-vertex cut problem. (English) Zbl 1447.90011 Math. Program. Comput. 12, No. 2, 133-164 (2020). MSC: 90B10 90C10 90C05 90C27 90C57 90C35 05C85 PDFBibTeX XMLCite \textit{F. Furini} et al., Math. Program. Comput. 12, No. 2, 133--164 (2020; Zbl 1447.90011) Full Text: DOI
Takayama, Koki; Kobayashi, Yusuke On the number of edges in a graph with many two-hop disjoint paths. (English) Zbl 1442.05097 Discrete Appl. Math. 283, 718-723 (2020). MSC: 05C30 05C40 05C38 05C07 05C35 PDFBibTeX XMLCite \textit{K. Takayama} and \textit{Y. Kobayashi}, Discrete Appl. Math. 283, 718--723 (2020; Zbl 1442.05097) Full Text: DOI
Braga, M.; Delle Donne, D.; Escalante, M. S.; Marenco, J.; Ugarte, M. E.; Varaldo, M. C. The minimum chromatic violation problem: a polyhedral approach. (English) Zbl 1440.05080 Discrete Appl. Math. 281, 69-80 (2020). MSC: 05C15 90C10 90C35 52B99 PDFBibTeX XMLCite \textit{M. Braga} et al., Discrete Appl. Math. 281, 69--80 (2020; Zbl 1440.05080) Full Text: DOI
Anjos, Miguel F.; Neto, José A class of spectral bounds for max \(k\)-cut. (English) Zbl 1439.05133 Discrete Appl. Math. 279, 12-24 (2020). MSC: 05C50 05C35 05C22 05C10 PDFBibTeX XMLCite \textit{M. F. Anjos} and \textit{J. Neto}, Discrete Appl. Math. 279, 12--24 (2020; Zbl 1439.05133) Full Text: DOI
Bastubbe, Michael; Lübbecke, Marco E. A branch-and-price algorithm for capacitated hypergraph vertex separation. (English) Zbl 1437.90133 Math. Program. Comput. 12, No. 1, 39-68 (2020). MSC: 90C27 90C09 49M27 90C35 90C57 90C10 05C65 PDFBibTeX XMLCite \textit{M. Bastubbe} and \textit{M. E. Lübbecke}, Math. Program. Comput. 12, No. 1, 39--68 (2020; Zbl 1437.90133) Full Text: DOI
Deza, Michel; Dutour Sikirić, Mathieu Generalized cut and metric polytopes of graphs and simplicial complexes. (English) Zbl 1442.05253 Optim. Lett. 14, No. 2, 273-289 (2020). MSC: 05E45 52B12 90C27 90C57 PDFBibTeX XMLCite \textit{M. Deza} and \textit{M. Dutour Sikirić}, Optim. Lett. 14, No. 2, 273--289 (2020; Zbl 1442.05253) Full Text: DOI arXiv
Chen, Xujin; Ding, Guoli; Zang, Wenan; Zhao, Qiulan Ranking tournaments with no errors. II: Minimax relation. (English) Zbl 1437.05085 J. Comb. Theory, Ser. B 142, 244-275 (2020). MSC: 05C20 05C22 90C05 PDFBibTeX XMLCite \textit{X. Chen} et al., J. Comb. Theory, Ser. B 142, 244--275 (2020; Zbl 1437.05085) Full Text: DOI
Lin, Ruizhi; Zhang, Heping Fractional matching preclusion number of graphs and the perfect matching polytope. (English) Zbl 1435.05162 J. Comb. Optim. 39, No. 3, 915-932 (2020). MSC: 05C70 05C72 05C76 90C27 90C35 90C57 PDFBibTeX XMLCite \textit{R. Lin} and \textit{H. Zhang}, J. Comb. Optim. 39, No. 3, 915--932 (2020; Zbl 1435.05162) Full Text: DOI
Chen, Xujin; Ding, Guoli; Zang, Wenan; Zhao, Qiulan Ranking tournaments with no errors. I: Structural description. (English) Zbl 1430.05047 J. Comb. Theory, Ser. B 141, 264-294 (2020). MSC: 05C20 05C22 05C90 05C38 PDFBibTeX XMLCite \textit{X. Chen} et al., J. Comb. Theory, Ser. B 141, 264--294 (2020; Zbl 1430.05047) Full Text: DOI
O’Donnell, Ryan; Schramm, Tselil Sherali-Adams strikes back. (English) Zbl 1528.68318 Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 8, 30 p. (2019). MSC: 68R10 05C50 05C80 68Q25 90C05 90C27 90C35 PDFBibTeX XMLCite \textit{R. O'Donnell} and \textit{T. Schramm}, LIPIcs -- Leibniz Int. Proc. Inform. 137, Article 8, 30 p. (2019; Zbl 1528.68318) Full Text: DOI
Hommelsheim, Felix; Mühlenthaler, Moritz; Schaudt, Oliver How to secure matchings against edge failures. (English) Zbl 1528.68296 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 38, 16 p. (2019). MSC: 68R10 05C40 05C70 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{F. Hommelsheim} et al., LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 38, 16 p. (2019; Zbl 1528.68296) Full Text: DOI
Dell’Amico, Mauro; Neto, José On \(f\)-domination: polyhedral and algorithmic results. (English) Zbl 1419.05166 Math. Methods Oper. Res. 90, No. 1, 1-22 (2019). MSC: 05C69 51M20 68Q25 90C10 PDFBibTeX XMLCite \textit{M. Dell'Amico} and \textit{J. Neto}, Math. Methods Oper. Res. 90, No. 1, 1--22 (2019; Zbl 1419.05166) Full Text: DOI
Neto, José; Ben-Ameur, Walid On fractional cut covers. (English) Zbl 1416.05233 Discrete Appl. Math. 265, 168-181 (2019). MSC: 05C70 05C85 68W20 PDFBibTeX XMLCite \textit{J. Neto} and \textit{W. Ben-Ameur}, Discrete Appl. Math. 265, 168--181 (2019; Zbl 1416.05233) Full Text: DOI
Cornaz, Denis; Grappe, Roland; Lacroix, Mathieu Trader multiflow and box-TDI systems in series-parallel graphs. (English) Zbl 1474.90374 Discrete Optim. 31, 103-114 (2019). MSC: 90C27 90C57 05C70 05C85 PDFBibTeX XMLCite \textit{D. Cornaz} et al., Discrete Optim. 31, 103--114 (2019; Zbl 1474.90374) Full Text: DOI
Figueiredo, Rosa; Frota, Yuri; Labbé, Martine A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph. (English) Zbl 1410.05200 Discrete Appl. Math. 261, 164-185 (2019). MSC: 05C85 05C22 05C70 91D30 90C10 PDFBibTeX XMLCite \textit{R. Figueiredo} et al., Discrete Appl. Math. 261, 164--185 (2019; Zbl 1410.05200) Full Text: DOI
Dell’Amico, Mauro; Neto, José On total \(f\)-domination: polyhedral and algorithmic results. (English) Zbl 1407.05175 Discrete Appl. Math. 258, 97-104 (2019). MSC: 05C69 05C05 05C85 90C39 PDFBibTeX XMLCite \textit{M. Dell'Amico} and \textit{J. Neto}, Discrete Appl. Math. 258, 97--104 (2019; Zbl 1407.05175) Full Text: DOI
Wang, Zhao; Mao, Yaping; Cheng, Eddie; Zou, Jinyu Matching preclusion number of graphs. (English) Zbl 1410.68308 Theor. Comput. Sci. 759, 61-71 (2019). MSC: 68R10 05C70 68M10 PDFBibTeX XMLCite \textit{Z. Wang} et al., Theor. Comput. Sci. 759, 61--71 (2019; Zbl 1410.68308) Full Text: DOI arXiv
Bendali, F.; Mailfert, J. The weakly connected independent set polytope in corona and join of graphs. (English) Zbl 1410.05104 J. Comb. Optim. 36, No. 3, 1007-1023 (2018). MSC: 05C40 05C69 05C76 90C57 90C35 PDFBibTeX XMLCite \textit{F. Bendali} and \textit{J. Mailfert}, J. Comb. Optim. 36, No. 3, 1007--1023 (2018; Zbl 1410.05104) Full Text: DOI
Chekuri, Chandra; Xu, Chao Minimum cuts and sparsification in hypergraphs. (English) Zbl 1409.90156 SIAM J. Comput. 47, No. 6, 2118-2156 (2018). MSC: 90C27 68Q25 05C65 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{C. Xu}, SIAM J. Comput. 47, No. 6, 2118--2156 (2018; Zbl 1409.90156) Full Text: DOI
Zhao, Shuang; Zhang, Heping Anti-forcing polynomials for benzenoid systems with forcing edges. (English) Zbl 1398.05167 Discrete Appl. Math. 250, 342-356 (2018). MSC: 05C70 05C31 PDFBibTeX XMLCite \textit{S. Zhao} and \textit{H. Zhang}, Discrete Appl. Math. 250, 342--356 (2018; Zbl 1398.05167) Full Text: DOI
Dvořák, Pavel; Knop, Dušan Parameterized complexity of length-bounded cuts and multicuts. (English) Zbl 1400.90258 Algorithmica 80, No. 12, 3597-3617 (2018). MSC: 90C27 90C35 05C12 PDFBibTeX XMLCite \textit{P. Dvořák} and \textit{D. Knop}, Algorithmica 80, No. 12, 3597--3617 (2018; Zbl 1400.90258) Full Text: DOI arXiv
Munaro, Andrea Triangle packings and transversals of some \(K_{4}\)-free graphs. (English) Zbl 1404.05140 Graphs Comb. 34, No. 4, 647-668 (2018). Reviewer: Linda Lesniak (Kalamazoo) MSC: 05C65 05C70 05D15 PDFBibTeX XMLCite \textit{A. Munaro}, Graphs Comb. 34, No. 4, 647--668 (2018; Zbl 1404.05140) Full Text: DOI
Amaral, Barbara; Duarte, Cristhiano; Oliveira, Roberto I. Necessary conditions for extended noncontextuality in general sets of random variables. (English) Zbl 1394.81023 J. Math. Phys. 59, No. 7, 072202, 21 p. (2018). MSC: 81P13 05C90 PDFBibTeX XMLCite \textit{B. Amaral} et al., J. Math. Phys. 59, No. 7, 072202, 21 p. (2018; Zbl 1394.81023) Full Text: DOI arXiv
Del Pia, Alberto; Khajavirad, Aida On decomposability of multilinear sets. (English) Zbl 1446.90114 Math. Program. 170, No. 2 (A), 387-415 (2018). Reviewer: Karel Zimmermann (Praha) MSC: 90C11 90C26 90C57 05C65 PDFBibTeX XMLCite \textit{A. Del Pia} and \textit{A. Khajavirad}, Math. Program. 170, No. 2 (A), 387--415 (2018; Zbl 1446.90114) Full Text: DOI
Kolman, Petr On algorithms employing treewidth for \(L\)-bounded cut problems. (English) Zbl 1384.05147 J. Graph Algorithms Appl. 22, No. 2, 177-191 (2018). MSC: 05C85 05C10 68Q25 68W25 PDFBibTeX XMLCite \textit{P. Kolman}, J. Graph Algorithms Appl. 22, No. 2, 177--191 (2018; Zbl 1384.05147) Full Text: DOI arXiv
Cornaz, D.; Kerivin, H.; Mahjoub, A. R. Minimal arc-sets spanning dicycles. (English) Zbl 1383.05129 Discrete Appl. Math. 240, 33-43 (2018). MSC: 05C20 05C38 90C05 PDFBibTeX XMLCite \textit{D. Cornaz} et al., Discrete Appl. Math. 240, 33--43 (2018; Zbl 1383.05129) Full Text: DOI
Mao, Yaping; Wang, Zhao; Cheng, Eddie; Melekian, Christopher Strong matching preclusion number of graphs. (English) Zbl 1387.05209 Theor. Comput. Sci. 713, 11-20 (2018). MSC: 05C70 05C82 68R10 PDFBibTeX XMLCite \textit{Y. Mao} et al., Theor. Comput. Sci. 713, 11--20 (2018; Zbl 1387.05209) Full Text: DOI
Römer, Tim; Saeedi Madani, Sara Retracts and algebraic properties of cut algebras. (English) Zbl 1376.05166 Eur. J. Comb. 69, 214-236 (2018). MSC: 05E15 13P10 52B20 13F55 PDFBibTeX XMLCite \textit{T. Römer} and \textit{S. Saeedi Madani}, Eur. J. Comb. 69, 214--236 (2018; Zbl 1376.05166) Full Text: DOI arXiv
Boria, Nicolas; Murat, Cécile; Paschos, Vangelis Th. The probabilistic minimum dominating set problem. (English) Zbl 1376.05107 Discrete Appl. Math. 234, 93-113 (2018). MSC: 05C69 05C82 05C90 68Q17 PDFBibTeX XMLCite \textit{N. Boria} et al., Discrete Appl. Math. 234, 93--113 (2018; Zbl 1376.05107) Full Text: DOI
Fairbrother, Jamie; Letchford, Adam N. Projection results for the \(k\)-partition problem. (English) Zbl 1387.90213 Discrete Optim. 26, 97-111 (2017). MSC: 90C27 90C22 90C57 05C85 PDFBibTeX XMLCite \textit{J. Fairbrother} and \textit{A. N. Letchford}, Discrete Optim. 26, 97--111 (2017; Zbl 1387.90213) Full Text: DOI
Nguyen, Dang Phuong; Minoux, Michel; Nguyen, Viet Hung; Nguyen, Thanh Hai; Sirdey, Renaud Improved compact formulations for a wide class of graph partitioning problems in sparse graphs. (English) Zbl 1387.05255 Discrete Optim. 25, 175-188 (2017). MSC: 05C85 05C70 90B10 PDFBibTeX XMLCite \textit{D. P. Nguyen} et al., Discrete Optim. 25, 175--188 (2017; Zbl 1387.05255) Full Text: DOI
Chaourar, Brahim A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs. (English) Zbl 1387.90259 Adv. Oper. Res. 2017, Article ID 1267108, 4 p. (2017). MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{B. Chaourar}, Adv. Oper. Res. 2017, Article ID 1267108, 4 p. (2017; Zbl 1387.90259) Full Text: DOI arXiv
Datta, Alak Kumar; Debnath, Chinmay Spanning cactus: complexity and extensions. (English) Zbl 1372.05218 Discrete Appl. Math. 233, 19-28 (2017). MSC: 05C85 68W25 05C05 05C35 68Q25 PDFBibTeX XMLCite \textit{A. K. Datta} and \textit{C. Debnath}, Discrete Appl. Math. 233, 19--28 (2017; Zbl 1372.05218) Full Text: DOI
Bruhn, Henning; Fuchs, Elke \(t\)-perfection in \(P_5\)-free graphs. (English) Zbl 1368.05044 SIAM J. Discrete Math. 31, No. 3, 1616-1633 (2017). MSC: 05C15 05C17 05C83 PDFBibTeX XMLCite \textit{H. Bruhn} and \textit{E. Fuchs}, SIAM J. Discrete Math. 31, No. 3, 1616--1633 (2017; Zbl 1368.05044) Full Text: DOI arXiv
Riedl, Wolfgang F. A complete characterization of jump inequalities for the hop-constrained shortest path problem. (English) Zbl 1361.05038 Discrete Appl. Math. 225, 95-113 (2017). MSC: 05C12 05C38 05C35 PDFBibTeX XMLCite \textit{W. F. Riedl}, Discrete Appl. Math. 225, 95--113 (2017; Zbl 1361.05038) Full Text: DOI
Engel, Konrad; Kalinowski, Thomas; Savelsbergh, Martin W. P. Incremental network design with minimum spanning trees. (English) Zbl 1358.05262 J. Graph Algorithms Appl. 21, No. 4, 417-432 (2017). MSC: 05C82 05C05 05C22 PDFBibTeX XMLCite \textit{K. Engel} et al., J. Graph Algorithms Appl. 21, No. 4, 417--432 (2017; Zbl 1358.05262) Full Text: DOI arXiv
Marinelli, Fabrizio; Parente, Angelo A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem. (English) Zbl 1349.90819 Comput. Oper. Res. 69, 68-78 (2016). MSC: 90C35 05C85 90C59 PDFBibTeX XMLCite \textit{F. Marinelli} and \textit{A. Parente}, Comput. Oper. Res. 69, 68--78 (2016; Zbl 1349.90819) Full Text: DOI
Ales, Zacharie; Knippel, Arnaud; Pauchet, Alexandre Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables. (English) Zbl 1348.05160 Discrete Appl. Math. 211, 1-14 (2016). MSC: 05C70 05C22 05C85 PDFBibTeX XMLCite \textit{Z. Ales} et al., Discrete Appl. Math. 211, 1--14 (2016; Zbl 1348.05160) Full Text: DOI
Solus, Liam; Uhler, Caroline; Yoshida, Ruriko Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors. (English) Zbl 1348.52010 Linear Algebra Appl. 509, 247-275 (2016). MSC: 52B12 52B20 05C10 PDFBibTeX XMLCite \textit{L. Solus} et al., Linear Algebra Appl. 509, 247--275 (2016; Zbl 1348.52010) Full Text: DOI
Ben-Ameur, Walid; Glorieux, Antoine; Neto, José From graph orientation to the unweighted maximum cut. (English) Zbl 1476.68192 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 370-384 (2016). MSC: 68R10 05C20 90C11 90C35 PDFBibTeX XMLCite \textit{W. Ben-Ameur} et al., Lect. Notes Comput. Sci. 9797, 370--384 (2016; Zbl 1476.68192) Full Text: DOI HAL
Baïou, Mourad; Barahona, Francisco Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs. (English) Zbl 1338.05052 SIAM J. Discrete Math. 30, No. 2, 1290-1301 (2016). MSC: 05C10 05C22 05C85 90C27 68Q17 PDFBibTeX XMLCite \textit{M. Baïou} and \textit{F. Barahona}, SIAM J. Discrete Math. 30, No. 2, 1290--1301 (2016; Zbl 1338.05052) Full Text: DOI
Tolomei, Paola B.; Torres, Luis M. Generalized minor inequalities for the set covering polyhedron related to circulant matrices. (English) Zbl 1339.05378 Discrete Appl. Math. 210, 214-222 (2016). MSC: 05C83 05B20 90C27 PDFBibTeX XMLCite \textit{P. B. Tolomei} and \textit{L. M. Torres}, Discrete Appl. Math. 210, 214--222 (2016; Zbl 1339.05378) Full Text: DOI arXiv
Bruhn, Henning; Schaudt, Oliver Claw-free \(t\)-perfect graphs can be recognized in polynomial time. (English) Zbl 1335.05071 SIAM J. Discrete Math. 30, No. 2, 832-855 (2016). MSC: 05C17 05C83 05C85 PDFBibTeX XMLCite \textit{H. Bruhn} and \textit{O. Schaudt}, SIAM J. Discrete Math. 30, No. 2, 832--855 (2016; Zbl 1335.05071) Full Text: DOI
Neto, José On the diameter of cut polytopes. (English) Zbl 1338.52003 Discrete Math. 339, No. 5, 1605-1612 (2016). MSC: 52A10 90C27 05C35 05C10 90C35 PDFBibTeX XMLCite \textit{J. Neto}, Discrete Math. 339, No. 5, 1605--1612 (2016; Zbl 1338.52003) Full Text: DOI
van Dam, E. R.; Sotirov, R. New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph. (English) Zbl 1326.05089 Linear Algebra Appl. 488, 216-234 (2016). MSC: 05C50 05C70 05C15 05E30 90C22 90C35 PDFBibTeX XMLCite \textit{E. R. van Dam} and \textit{R. Sotirov}, Linear Algebra Appl. 488, 216--234 (2016; Zbl 1326.05089) Full Text: DOI arXiv
Borne, Sylvie; Fouilhoux, Pierre; Grappe, Roland; Lacroix, Mathieu; Pesneau, Pierre Circuit and bond polytopes on series-parallel graphs. (English) Zbl 1387.90208 Discrete Optim. 17, 55-68 (2015). MSC: 90C27 52B12 90C35 05C38 05C85 PDFBibTeX XMLCite \textit{S. Borne} et al., Discrete Optim. 17, 55--68 (2015; Zbl 1387.90208) Full Text: DOI
Aissi, Hassene; Mahjoub, A. Ridha; McCormick, S. Thomas; Queyranne, Maurice Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. (English) Zbl 1328.90131 Math. Program. 154, No. 1-2 (B), 3-28 (2015). MSC: 90C29 90C31 05C40 05C85 PDFBibTeX XMLCite \textit{H. Aissi} et al., Math. Program. 154, No. 1--2 (B), 3--28 (2015; Zbl 1328.90131) Full Text: DOI
Lakshmanan S., Aparna; Bujtás, Csilla; Tuza, Zsolt Generalized line graphs: Cartesian products and complexity of recognition. (English) Zbl 1323.05109 Electron. J. Comb. 22, No. 3, Research Paper P3.33, 19 p. (2015). MSC: 05C76 05C62 68Q17 PDFBibTeX XMLCite \textit{A. Lakshmanan S.} et al., Electron. J. Comb. 22, No. 3, Research Paper P3.33, 19 p. (2015; Zbl 1323.05109) Full Text: Link
Sharifiv, Firdovsi; Kutucu, Hakan A network design problem with two-edge matching failures. (English) Zbl 1328.90020 RAIRO, Oper. Res. 49, No. 2, 297-312 (2015). MSC: 90B10 05C70 90C11 90C35 90C59 PDFBibTeX XMLCite \textit{F. Sharifiv} and \textit{H. Kutucu}, RAIRO, Oper. Res. 49, No. 2, 297--312 (2015; Zbl 1328.90020) Full Text: DOI
Didi Biha, Mohamed; Kerivin, Hervé L. M.; Ng, Peh H. Polyhedral study of the connected subgraph problem. (English) Zbl 1301.05232 Discrete Math. 338, No. 1, 80-92 (2015). MSC: 05C60 05C40 05C70 90C27 PDFBibTeX XMLCite \textit{M. Didi Biha} et al., Discrete Math. 338, No. 1, 80--92 (2015; Zbl 1301.05232) Full Text: DOI
Gouveia, João; Pfeiffer, James A semidefinite approach to the \(K_i\)-cover problem. (English) Zbl 1408.05098 Oper. Res. Lett. 42, No. 2, 156-160 (2014). MSC: 05C69 05C70 90C22 90C27 PDFBibTeX XMLCite \textit{J. Gouveia} and \textit{J. Pfeiffer}, Oper. Res. Lett. 42, No. 2, 156--160 (2014; Zbl 1408.05098) Full Text: DOI arXiv
Figueiredo, Rosa; Frota, Yuri The maximum balanced subgraph of a signed graph: applications and solution approaches. (English) Zbl 1317.90305 Eur. J. Oper. Res. 236, No. 2, 473-487 (2014). MSC: 90C35 90C27 05C22 05C85 90C59 PDFBibTeX XMLCite \textit{R. Figueiredo} and \textit{Y. Frota}, Eur. J. Oper. Res. 236, No. 2, 473--487 (2014; Zbl 1317.90305) Full Text: DOI HAL
Galluccio, A.; Gentile, C.; Ventura, P. The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect. (English) Zbl 1297.05196 J. Comb. Theory, Ser. B 107, 92-122 (2014). MSC: 05C72 05C76 05C38 52B99 PDFBibTeX XMLCite \textit{A. Galluccio} et al., J. Comb. Theory, Ser. B 107, 92--122 (2014; Zbl 1297.05196) Full Text: DOI
Neto, José On the polyhedral structure of uniform cut polytopes. (English) Zbl 1298.05267 Discrete Appl. Math. 175, 62-70 (2014). MSC: 05C70 05C35 52B12 PDFBibTeX XMLCite \textit{J. Neto}, Discrete Appl. Math. 175, 62--70 (2014; Zbl 1298.05267) Full Text: DOI
Aguilera, Néstor E.; Escalante, Mariana S.; Fekete, Pablo G. On the facets of lift-and-project relaxations under graph operations. (English) Zbl 1288.05211 Discrete Appl. Math. 164, Part 2, 360-372 (2014). MSC: 05C76 05C69 05C35 90C10 90C27 PDFBibTeX XMLCite \textit{N. E. Aguilera} et al., Discrete Appl. Math. 164, Part 2, 360--372 (2014; Zbl 1288.05211) Full Text: DOI
Puerto, Justo; Ricca, Federica; Scozzari, Andrea Unreliable point facility location problems on networks. (English) Zbl 1283.05258 Discrete Appl. Math. 166, 188-203 (2014). MSC: 05C85 05C50 68Q17 90B80 90C35 PDFBibTeX XMLCite \textit{J. Puerto} et al., Discrete Appl. Math. 166, 188--203 (2014; Zbl 1283.05258) Full Text: DOI
Galluccio, Anna; Gentile, Claudio; Ventura, Paolo 2-clique-bond of stable set polyhedra. (English) Zbl 1286.05167 Discrete Appl. Math. 161, No. 13-14, 1988-2000 (2013). MSC: 05C85 52B05 PDFBibTeX XMLCite \textit{A. Galluccio} et al., Discrete Appl. Math. 161, No. 13--14, 1988--2000 (2013; Zbl 1286.05167) Full Text: DOI
Dziubiński, Marcin; Goyal, Sanjeev Network design and defence. (English) Zbl 1281.91044 Games Econ. Behav. 79, 30-43 (2013). MSC: 91A40 91A43 90B10 91A05 05C82 PDFBibTeX XMLCite \textit{M. Dziubiński} and \textit{S. Goyal}, Games Econ. Behav. 79, 30--43 (2013; Zbl 1281.91044) Full Text: DOI Link
Bondarenko, V. A.; Nikolaev, A. V. Combinatorial and geometric properties of the max-cut and min-cut problems. (English. Russian original) Zbl 1291.90198 Dokl. Math. 88, No. 2, 516-517 (2013); translation from Dokl. Akad. Nauk. 452, No. 2, 127-129 (2013). Reviewer: Václav Koubek (Praha) MSC: 90C27 05C35 05C10 05C21 05C40 90C35 PDFBibTeX XMLCite \textit{V. A. Bondarenko} and \textit{A. V. Nikolaev}, Dokl. Math. 88, No. 2, 516--517 (2013; Zbl 1291.90198); translation from Dokl. Akad. Nauk. 452, No. 2, 127--129 (2013) Full Text: DOI
E.-Nagy, Marianna; Laurent, Monique; Varvitsiotis, Antonios Complexity of the positive semidefinite matrix completion problem with a rank constraint. (English) Zbl 1272.68140 Bezdek, Károly (ed.) et al., Discrete geometry and optimization. Selected papers based on the presentations at the conference and workshop, Toronto, Canada, September 19–23, 2011. New York, NY: Springer (ISBN 978-3-319-00199-9/hbk; 978-3-319-00200-2/ebook). Fields Institute Communications 69, 105-120 (2013). MSC: 68Q17 90C22 05C62 PDFBibTeX XMLCite \textit{M. E. -Nagy} et al., Fields Inst. Commun. 69, 105--120 (2013; Zbl 1272.68140) Full Text: DOI arXiv
Ben-Ameur, Walid; Hadji, Makhlouf; Ouorou, Adam Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. (English) Zbl 1269.90087 Networks 61, No. 4, 335-355 (2013). MSC: 90C27 05C90 05B35 PDFBibTeX XMLCite \textit{W. Ben-Ameur} et al., Networks 61, No. 4, 335--355 (2013; Zbl 1269.90087) Full Text: DOI
Engström, Alexander; Norén, Patrik Ideals of graph homomorphisms. (English) Zbl 1263.05063 Ann. Comb. 17, No. 1, 71-103 (2013). MSC: 05C60 05C25 68W30 13P25 13P10 14M25 62H17 PDFBibTeX XMLCite \textit{A. Engström} and \textit{P. Norén}, Ann. Comb. 17, No. 1, 71--103 (2013; Zbl 1263.05063) Full Text: DOI arXiv
Shen, Siqian; Smith, J. Cole Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. (English) Zbl 1251.90376 Networks 60, No. 2, 103-119 (2012). MSC: 90C35 05C85 68R10 90C39 PDFBibTeX XMLCite \textit{S. Shen} and \textit{J. C. Smith}, Networks 60, No. 2, 103--119 (2012; Zbl 1251.90376) Full Text: DOI
Kerivin, H. L. M.; Lacroix, M.; Mahjoub, A. R. On the complexity of the Eulerian closed walk with precedence path constraints problem. (English) Zbl 1280.68098 Theor. Comput. Sci. 439, 16-29 (2012). MSC: 68Q17 05C85 05C45 05C38 PDFBibTeX XMLCite \textit{H. L. M. Kerivin} et al., Theor. Comput. Sci. 439, 16--29 (2012; Zbl 1280.68098) Full Text: DOI
Bruhn, Henning; Stein, Maya On claw-free \(t\)-perfect graphs. (English) Zbl 1245.05055 Math. Program. 133, No. 1-2 (A), 461-480 (2012). MSC: 05C17 05C83 05C15 05C75 PDFBibTeX XMLCite \textit{H. Bruhn} and \textit{M. Stein}, Math. Program. 133, No. 1--2 (A), 461--480 (2012; Zbl 1245.05055) Full Text: DOI
Lacroix, Mathieu; Mahjoub, A. Ridha; Martin, Sébastien; Picouleau, Christophe On the NP-completeness of the perfect matching free subgraph problem. (English) Zbl 1237.68089 Theor. Comput. Sci. 423, 25-29 (2012). MSC: 68Q17 05C85 05C70 PDFBibTeX XMLCite \textit{M. Lacroix} et al., Theor. Comput. Sci. 423, 25--29 (2012; Zbl 1237.68089) Full Text: DOI
Aguilera, Néstor E.; Escalante, Mariana S.; Fekete, Pablo G. On the facets of the lift-and-project relaxations of graph subdivisions. (English) Zbl 1268.05188 Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 201-206 (2011). MSC: 05C85 90C27 PDFBibTeX XMLCite \textit{N. E. Aguilera} et al., Electron. Notes Discrete Math. 37, 201--206 (2011; Zbl 1268.05188) Full Text: DOI
Xavier, Álinson S.; Campêlo, Manoel A new facet generating procedure for the stable set polytope. (English) Zbl 1268.05216 Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 183-188 (2011). MSC: 05C85 05C69 52B12 PDFBibTeX XMLCite \textit{Á. S. Xavier} and \textit{M. Campêlo}, Electron. Notes Discrete Math. 37, 183--188 (2011; Zbl 1268.05216) Full Text: DOI
Januschowski, Tim; Pfetsch, Marc E. The maximum \(k\)-colorable subgraph problem and orbitopes. (English) Zbl 1233.90240 Discrete Optim. 8, No. 3, 478-494 (2011). MSC: 90C27 90C10 05C15 PDFBibTeX XMLCite \textit{T. Januschowski} and \textit{M. E. Pfetsch}, Discrete Optim. 8, No. 3, 478--494 (2011; Zbl 1233.90240) Full Text: DOI
Feremans, Corinne; Labbé, Martine; Letchford, Adam N.; Salazar-González, Juan-José Generalized network design polyhedra. (English) Zbl 1233.90066 Networks 58, No. 2, 125-136 (2011). MSC: 90B06 90C27 90B10 05C85 PDFBibTeX XMLCite \textit{C. Feremans} et al., Networks 58, No. 2, 125--136 (2011; Zbl 1233.90066) Full Text: DOI
Cornaz, Denis Max-multiflow/min-multicut for G+H series-parallel. (English) Zbl 1223.05105 Discrete Math. 311, No. 17, 1957-1967 (2011). MSC: 05C21 05C40 05C35 PDFBibTeX XMLCite \textit{D. Cornaz}, Discrete Math. 311, No. 17, 1957--1967 (2011; Zbl 1223.05105) Full Text: DOI
Neto, José From equipartition to uniform cut polytopes: extended polyhedral results. (English) Zbl 1222.05215 Discrete Math. 311, No. 8-9, 705-714 (2011). MSC: 05C70 PDFBibTeX XMLCite \textit{J. Neto}, Discrete Math. 311, No. 8--9, 705--714 (2011; Zbl 1222.05215) Full Text: DOI
Akgün, İbrahim New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll’s tightened Miller-Tucker-Zemlin constraints. (English) Zbl 1231.90363 Comput. Oper. Res. 38, No. 1, 277-286 (2011). MSC: 90C35 05C85 05C90 PDFBibTeX XMLCite \textit{İ. Akgün}, Comput. Oper. Res. 38, No. 1, 277--286 (2011; Zbl 1231.90363) Full Text: DOI
Bianchi, S.; Nasini, G.; Tolomei, P. The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. (English) Zbl 1274.90448 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 1185-1192 (2010). MSC: 90C35 05C69 05C70 90C57 PDFBibTeX XMLCite \textit{S. Bianchi} et al., Electron. Notes Discrete Math. 36, 1185--1192 (2010; Zbl 1274.90448) Full Text: Link