Abdi, Ahmad; Cornuéjols, Gérard The max-flow min-cut property and \(\pm 1\)-resistant sets. (English) Zbl 07289404 Discrete Appl. Math. 289, 455-476 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{A. Abdi} and \textit{G. Cornuéjols}, Discrete Appl. Math. 289, 455--476 (2021; Zbl 07289404) Full Text: DOI
Chen, Xi; Guo, Chenghao; Vlatakis-Gkaragkounis, Emmanouil V.; Yannakakis, Mihalis; Zhang, Xinzhi Smoothed complexity of local max-cut and binary max-CSP. (English) Zbl 07298309 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1052-1065 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{X. Chen} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1052--1065 (2020; Zbl 07298309) Full Text: DOI
Mohanty, Sidhanth; Raghavendra, Prasad; Xu, Jeff Lifting sum-of-squares lower bounds: degree-2 to degree-4. (English) Zbl 07298292 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 840-853 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. Mohanty} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 840--853 (2020; Zbl 07298292) Full Text: DOI
Gaar, Elisabeth; Rendl, Franz A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring. (English) Zbl 1450.90022 Math. Program. 183, No. 1-2 (B), 283-308 (2020). MSC: 90C22 90C27 PDF BibTeX XML Cite \textit{E. Gaar} and \textit{F. Rendl}, Math. Program. 183, No. 1--2 (B), 283--308 (2020; Zbl 1450.90022) Full Text: DOI
Carosi, Raffaello; Monaco, Gianpiero Generalized graph \(k\)-coloring games. (English) Zbl 1446.05065 Theory Comput. Syst. 64, No. 6, 1028-1041 (2020). MSC: 05C57 05C15 91A43 91A10 91D30 PDF BibTeX XML Cite \textit{R. Carosi} and \textit{G. Monaco}, Theory Comput. Syst. 64, No. 6, 1028--1041 (2020; Zbl 1446.05065) 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 PDF BibTeX XML Cite \textit{M. F. Anjos} and \textit{J. Neto}, Discrete Appl. Math. 279, 12--24 (2020; Zbl 1439.05133) 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 PDF BibTeX XML Cite \textit{M. Deza} and \textit{M. Dutour Sikirić}, Optim. Lett. 14, No. 2, 273--289 (2020; Zbl 1442.05253) Full Text: DOI
Jarre, Florian; Lieder, Felix; Liu, Ya-Feng; Lu, Cheng Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting. (English) Zbl 07181878 J. Glob. Optim. 76, No. 4, 913-932 (2020). MSC: 90C20 90C22 PDF BibTeX XML Cite \textit{F. Jarre} et al., J. Glob. Optim. 76, No. 4, 913--932 (2020; Zbl 07181878) Full Text: DOI
Nayak, Rupaj Kumar; Mohanty, Nirmalya Kumar Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation. (English) Zbl 1441.90093 J. Comb. Optim. 39, No. 3, 792-825 (2020). MSC: 90C09 90C20 PDF BibTeX XML Cite \textit{R. K. Nayak} and \textit{N. K. Mohanty}, J. Comb. Optim. 39, No. 3, 792--825 (2020; Zbl 1441.90093) Full Text: DOI
Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav Fixed-parameter tractable algorithm and polynomial kernel for Max-Cut Above Spanning Tree. (English) Zbl 1434.68748 Theory Comput. Syst. 64, No. 1, 62-100 (2020). MSC: 68W40 05C85 68Q27 68R10 PDF BibTeX XML Cite \textit{J. Madathil} et al., Theory Comput. Syst. 64, No. 1, 62--100 (2020; Zbl 1434.68748) Full Text: DOI
Yang, Qingzhi; Li, Yiyong; Huang, Pengfei A novel formulation of the max-cut problem and related algorithm. (English) Zbl 1433.90106 Appl. Math. Comput. 371, Article ID 124970, 6 p. (2020). MSC: 90C20 90C26 90C35 90C22 90C27 PDF BibTeX XML Cite \textit{Q. Yang} et al., Appl. Math. Comput. 371, Article ID 124970, 6 p. (2020; Zbl 1433.90106) Full Text: DOI
Carosi, Raffaello; Fioravanti, Simone; Gualà, Luciano; Monaco, Gianpiero Coalition resilient outcomes in max \(k\)-cut games. (English) Zbl 1446.91029 Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 94-107 (2019). MSC: 91A43 PDF BibTeX XML Cite \textit{R. Carosi} et al., Lect. Notes Comput. Sci. 11376, 94--107 (2019; Zbl 1446.91029) Full Text: DOI
Loebl, Martin The precise complexity of finding rainbow even matchings. (English) Zbl 1434.68189 Ćirić, Miroslav (ed.) et al., Algebraic informatics. 8th international conference, CAI 2019, Niš, Serbia, June 30 – July 4, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11545, 190-201 (2019). MSC: 68Q17 05C70 68Q25 PDF BibTeX XML Cite \textit{M. Loebl}, Lect. Notes Comput. Sci. 11545, 190--201 (2019; Zbl 1434.68189) Full Text: DOI
Kobayashi, Yasuaki; Kobayashi, Yusuke; Miyazaki, Shuichi; Tamaki, Suguru An improved fixed-parameter algorithm for max-cut parameterized by crossing number. (English) Zbl 07173542 Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-25004-1/pbk; 978-3-030-25005-8/ebook). Lecture Notes in Computer Science 11638, 327-338 (2019). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{Y. Kobayashi} et al., Lect. Notes Comput. Sci. 11638, 327--338 (2019; Zbl 07173542) Full Text: DOI
Gaar, Elisabeth; Rendl, Franz A bundle approach for SDPs with exact subgraph constraints. (English) Zbl 1436.90100 Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 20th international conference, IPCO 2019, Ann Arbor, MI, USA, May 22–24, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11480, 205-218 (2019). MSC: 90C22 90C35 PDF BibTeX XML Cite \textit{E. Gaar} and \textit{F. Rendl}, Lect. Notes Comput. Sci. 11480, 205--218 (2019; Zbl 1436.90100) Full Text: DOI
Kapralov, Michael; Krachun, Dmitry An optimal space lower bound for approximating MAX-CUT. (English) Zbl 1433.68621 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 277-288 (2019). MSC: 68W27 68Q17 68R10 68W20 68W25 PDF BibTeX XML Cite \textit{M. Kapralov} and \textit{D. Krachun}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 277--288 (2019; Zbl 1433.68621) Full Text: DOI
Furini, Fabio; Traversi, Emiliano Theoretical and computational study of several linearisation techniques for binary quadratic problems. (English) Zbl 1434.90115 Ann. Oper. Res. 279, No. 1-2, 387-411 (2019). MSC: 90C20 90C09 PDF BibTeX XML Cite \textit{F. Furini} and \textit{E. Traversi}, Ann. Oper. Res. 279, No. 1--2, 387--411 (2019; Zbl 1434.90115) Full Text: DOI
Barthe, Gilles; Espitau, Thomas; Hsu, Justin; Sato, Tetsuya; Strub, Pierre-Yves Relational \(\star\)-liftings for differential privacy. (English) Zbl 1442.68099 Log. Methods Comput. Sci. 15, No. 4, Paper No. 18, 32 p. (2019). MSC: 68Q60 68P27 PDF BibTeX XML Cite \textit{G. Barthe} et al., Log. Methods Comput. Sci. 15, No. 4, Paper No. 18, 32 p. (2019; Zbl 1442.68099) Full Text: arXiv
Bäumler, Johannes Uniqueness and non-uniqueness for spin-Glass ground states on trees. (English) Zbl 07089015 Electron. J. Probab. 24, Paper No. 77, 17 p. (2019). MSC: 60K37 05C21 05C81 82B44 PDF BibTeX XML Cite \textit{J. Bäumler}, Electron. J. Probab. 24, Paper No. 77, 17 p. (2019; Zbl 07089015) Full Text: DOI Euclid arXiv
Martínez-Bernal, José; Morey, Susan; Villarreal, Rafael H.; Vivares, Carlos E. Depth and regularity of monomial ideals via polarization and combinatorial optimization. (English) Zbl 1427.13025 Acta Math. Vietnam. 44, No. 1, 243-268 (2019). Reviewer: Kuei-Nuan Lin (McKeesport) MSC: 13F20 05C22 05E40 13H10 PDF BibTeX XML Cite \textit{J. Martínez-Bernal} et al., Acta Math. Vietnam. 44, No. 1, 243--268 (2019; Zbl 1427.13025) Full Text: DOI arXiv
Dunning, Iain; Gupta, Swati; Silberholz, John What works best when? A systematic evaluation of heuristics for max-cut and QUBO. (English) Zbl 07277784 INFORMS J. Comput. 30, No. 3, 608-624 (2018). MSC: 90C PDF BibTeX XML Cite \textit{I. Dunning} et al., INFORMS J. Comput. 30, No. 3, 608--624 (2018; Zbl 07277784) Full Text: DOI
Scarsini, Marco; Schröder, Marc; Tomala, Tristan Dynamic atomic congestion games with seasonal flows. (English) Zbl 07255246 Oper. Res. 66, No. 2, 327-339 (2018). MSC: 91A14 91A25 91A43 PDF BibTeX XML Cite \textit{M. Scarsini} et al., Oper. Res. 66, No. 2, 327--339 (2018; Zbl 07255246) Full Text: DOI
Xiu, Yu; Shen, Weiwei; Wang, Zhongqun; Liu, Sanmin; Wang, Jun Multiple graph regularized graph transduction via greedy gradient Max-Cut. (English) Zbl 1436.68316 Inf. Sci. 423, 187-199 (2018). MSC: 68T05 68R10 PDF BibTeX XML Cite \textit{Y. Xiu} et al., Inf. Sci. 423, 187--199 (2018; Zbl 1436.68316) Full Text: DOI
Koutecký, Martin; Lee, Jon; Nagarajan, Viswanath; Shen, Xiangkun Approximating max-cut under graph-MSO constraints. (English) Zbl 07165735 Oper. Res. Lett. 46, No. 6, 592-598 (2018). MSC: 90 PDF BibTeX XML Cite \textit{M. Koutecký} et al., Oper. Res. Lett. 46, No. 6, 592--598 (2018; Zbl 07165735) Full Text: DOI
Newman, Alantha Complex semidefinite programming and Max-\(k\)-Cut. (English) Zbl 1434.90124 Seidel, Raimund (ed.), 1st symposium on simplicity in algorithms. SOSA 2018, January 7–10, 2018, New Orleans, LA, USA. Co-located with the 29th ACM-SIAM symposium on discrete algorithms (SODA 2018). Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 61, Article 13, 11 p. (2018). MSC: 90C22 90C35 PDF BibTeX XML Cite \textit{A. Newman}, OASIcs -- OpenAccess Ser. Inform. 61, Article 13, 11 p. (2018; Zbl 1434.90124) Full Text: DOI
Kaparis, Konstantinos; Letchford, Adam N. A note on the 2-circulant inequalities for the MAX-cut problem. (English) Zbl 1452.90269 Oper. Res. Lett. 46, No. 4, 443-447 (2018). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{K. Kaparis} and \textit{A. N. Letchford}, Oper. Res. Lett. 46, No. 4, 443--447 (2018; Zbl 1452.90269) Full Text: DOI
Braun, Gábor; Pokutta, Sebastian; Roy, Aurko Strong reductions for extended formulations. (English) Zbl 1411.90211 Math. Program. 172, No. 1-2 (B), 591-620 (2018). MSC: 90C05 68Q17 PDF BibTeX XML Cite \textit{G. Braun} et al., Math. Program. 172, No. 1--2 (B), 591--620 (2018; Zbl 1411.90211) Full Text: DOI
Baïou, Mourad; Barahona, Francisco Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. (English) Zbl 1406.90102 Math. Program. 172, No. 1-2 (B), 59-75 (2018). MSC: 90C27 PDF BibTeX XML Cite \textit{M. Baïou} and \textit{F. Barahona}, Math. Program. 172, No. 1--2 (B), 59--75 (2018; Zbl 1406.90102) Full Text: DOI
Kim, Sejong The order properties and Karcher barycenters of probability measures on the open convex cone. (English) Zbl 06965361 Taiwanese J. Math. 22, No. 1, 79-94 (2018). MSC: 47B65 15B48 PDF BibTeX XML Cite \textit{S. Kim}, Taiwanese J. Math. 22, No. 1, 79--94 (2018; Zbl 06965361) Full Text: DOI Euclid
Saurabh, Saket; Zehavi, Meirav \((k,n-k)\)-Max-Cut: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel. (English) Zbl 1406.90122 Algorithmica 80, No. 12, 3844-3860 (2018). MSC: 90C35 PDF BibTeX XML Cite \textit{S. Saurabh} and \textit{M. Zehavi}, Algorithmica 80, No. 12, 3844--3860 (2018; Zbl 1406.90122) Full Text: DOI
Brouwer, Andries E.; Cioabă, Sebastian M.; Ihringer, Ferdinand; McGinnis, Matt The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. (English) Zbl 1397.05098 J. Comb. Theory, Ser. B 133, 88-121 (2018). MSC: 05C50 05C12 PDF BibTeX XML Cite \textit{A. E. Brouwer} et al., J. Comb. Theory, Ser. B 133, 88--121 (2018; Zbl 1397.05098) Full Text: DOI arXiv
Gishboliner, Lior; Krivelevich, Michael; Kronenberg, Gal On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. (English) Zbl 1394.05033 Random Struct. Algorithms 52, No. 4, 545-559 (2018). MSC: 05C15 05C80 PDF BibTeX XML Cite \textit{L. Gishboliner} et al., Random Struct. Algorithms 52, No. 4, 545--559 (2018; Zbl 1394.05033) Full Text: DOI arXiv
Jagannath, Aukosh; Ko, Justin; Sen, Subhabrata MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass. (English) Zbl 1423.90227 Ann. Appl. Probab. 28, No. 3, 1536-1572 (2018). MSC: 90C27 82D30 82B44 60K35 60G15 90C06 PDF BibTeX XML Cite \textit{A. Jagannath} et al., Ann. Appl. Probab. 28, No. 3, 1536--1572 (2018; Zbl 1423.90227) Full Text: DOI Euclid
Etscheid, Michael; Mnich, Matthias Linear kernels and linear-time algorithms for finding large cuts. (English) Zbl 1396.68056 Algorithmica 80, No. 9, 2574-2615 (2018). MSC: 68Q25 05C85 68R10 PDF BibTeX XML Cite \textit{M. Etscheid} and \textit{M. Mnich}, Algorithmica 80, No. 9, 2574--2615 (2018; Zbl 1396.68056) Full Text: DOI
Headrick, Matthew; Hubeny, Veronika E. Riemannian and Lorentzian flow-cut theorems. (English) Zbl 1391.83016 Classical Quantum Gravity 35, No. 10, Article ID 105012, 30 p. (2018). MSC: 83C05 53Z05 81P40 47N10 35Q93 PDF BibTeX XML Cite \textit{M. Headrick} and \textit{V. E. Hubeny}, Classical Quantum Gravity 35, No. 10, Article ID 105012, 30 p. (2018; Zbl 1391.83016) Full Text: DOI
Wu, Shufei; Hou, Jianfeng Partitioning dense uniform hypergraphs. (English) Zbl 1386.05158 J. Comb. Optim. 35, No. 1, 48-63 (2018). MSC: 05C70 05C42 05C35 05C65 PDF BibTeX XML Cite \textit{S. Wu} and \textit{J. Hou}, J. Comb. Optim. 35, No. 1, 48--63 (2018; Zbl 1386.05158) Full Text: DOI
Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Sucupira, Rubens Improved kernels for Signed Max Cut parameterized above lower bound on \((r,\ell)\)-graphs. (English) Zbl 1400.05105 Discrete Math. Theor. Comput. Sci. 19, No. 1, Paper No. 14, 20 p. (2017). MSC: 05C22 05C85 05C10 PDF BibTeX XML Cite \textit{L. Faria} et al., Discrete Math. Theor. Comput. Sci. 19, No. 1, Paper No. 14, 20 p. (2017; Zbl 1400.05105) Full Text: Link arXiv
Gouveia, Luis; Simonetti, Luidi Spanning trees with a constraint on the number of leaves. A new formulation. (English) Zbl 1391.90604 Comput. Oper. Res. 81, 257-268 (2017). MSC: 90C35 90C10 90C57 68R10 90B10 PDF BibTeX XML Cite \textit{L. Gouveia} and \textit{L. Simonetti}, Comput. Oper. Res. 81, 257--268 (2017; Zbl 1391.90604) Full Text: DOI
Nguyen, Viet Hung; Minoux, Michel; Nguyen, Dang Phuong Reduced-size formulations for metric and cut polyhedra in sparse graphs. (English) Zbl 1388.05106 Networks 69, No. 1, 142-150 (2017). MSC: 05C42 PDF BibTeX XML Cite \textit{V. H. Nguyen} et al., Networks 69, No. 1, 142--150 (2017; Zbl 1388.05106) Full Text: DOI
Zhou, Xuegang An algorithm for monomial geometric programming with fuzzy relation inequality constraints. (Chinese. English summary) Zbl 1399.90263 Acta Math. Appl. Sin. 40, No. 6, 906-914 (2017). MSC: 90C30 90C70 90C57 PDF BibTeX XML Cite \textit{X. Zhou}, Acta Math. Appl. Sin. 40, No. 6, 906--914 (2017; Zbl 1399.90263)
Kim, Sunyoung; Kojima, Masakazu Binary quadratic optimization problems that are difficult to solve by conic relaxations. (English) Zbl 1387.90175 Discrete Optim. 24, 170-183 (2017). MSC: 90C20 90C22 90C10 PDF BibTeX XML Cite \textit{S. Kim} and \textit{M. Kojima}, Discrete Optim. 24, 170--183 (2017; Zbl 1387.90175) Full Text: DOI
Sucupira, Rubens; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S. Maximum cuts in edge-colored graphs. (English) Zbl 1383.05122 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, 87-92 (2017). MSC: 05C15 05C10 68Q25 PDF BibTeX XML Cite \textit{R. Sucupira} et al., Electron. Notes Discrete Math. 62, 87--92 (2017; Zbl 1383.05122) Full Text: DOI
Le, Ian; O’Dorney, Evan Geometry of positive configurations in affine buildings. (English) Zbl 1383.51009 Doc. Math. 22, 1519-1538 (2017). MSC: 51E24 14T05 05E10 PDF BibTeX XML Cite \textit{I. Le} and \textit{E. O'Dorney}, Doc. Math. 22, 1519--1538 (2017; Zbl 1383.51009) Full Text: DOI arXiv
Adams, Elspeth; Anjos, Miguel F. Exact separation of \(k\)-projection polytope constraints. (English) Zbl 1383.49014 Takáč, Martin (ed.) et al., Modeling and optimization: theory and applications. MOPTA, Bethlehem, PA, USA, August 17–19, 2016. Selected contributions. Cham: Springer (ISBN 978-3-319-66615-0/hbk; 978-3-319-66616-7/ebook). Springer Proceedings in Mathematics & Statistics 213, 119-141 (2017). MSC: 49J45 90C11 PDF BibTeX XML Cite \textit{E. Adams} and \textit{M. F. Anjos}, in: Modeling and optimization: theory and applications. MOPTA, Bethlehem, PA, USA, August 17--19, 2016. Selected contributions. Cham: Springer. 119--141 (2017; Zbl 1383.49014) Full Text: DOI
Nicodemos, Diego; Stehlík, Matěj Packing and covering odd cycles in cubic plane graphs with small faces. (English) Zbl 1378.05034 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 925-931 (2017). MSC: 05C10 05C69 PDF BibTeX XML Cite \textit{D. Nicodemos} and \textit{M. Stehlík}, Electron. Notes Discrete Math. 61, 925--931 (2017; Zbl 1378.05034) Full Text: DOI
Dhara, Souvik; Mukherjee, Debankur; Sen, Subhabrata Phase transitions of extremal cuts for the configuration model. (English) Zbl 1372.05198 Electron. J. Probab. 22, Paper No. 86, 29 p. (2017). MSC: 05C80 05C85 PDF BibTeX XML Cite \textit{S. Dhara} et al., Electron. J. Probab. 22, Paper No. 86, 29 p. (2017; Zbl 1372.05198) Full Text: DOI Euclid arXiv
Dembo, Amir; Montanari, Andrea; Sen, Subhabrata Extremal cuts of sparse random graphs. (English) Zbl 1372.05196 Ann. Probab. 45, No. 2, 1190-1217 (2017). MSC: 05C80 05C42 68R10 82B44 PDF BibTeX XML Cite \textit{A. Dembo} et al., Ann. Probab. 45, No. 2, 1190--1217 (2017; Zbl 1372.05196) Full Text: DOI Euclid arXiv
Hou, Jianfeng; Zeng, Qinghou Judicious partitioning of hypergraphs with edges of size at most 2. (English) Zbl 1371.05229 Comb. Probab. Comput. 26, No. 2, 267-284 (2017). MSC: 05C70 05C65 05C12 05C35 05C75 68Q25 PDF BibTeX XML Cite \textit{J. Hou} and \textit{Q. Zeng}, Comb. Probab. Comput. 26, No. 2, 267--284 (2017; Zbl 1371.05229) Full Text: DOI
Angel, Omer; Bubeck, Sébastien; Peres, Yuval; Wei, Fan Local max-cut in smoothed polynomial time. (English) Zbl 1369.68226 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 429-437 (2017). MSC: 68Q25 68T20 91A10 PDF BibTeX XML Cite \textit{O. Angel} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 429--437 (2017; Zbl 1369.68226) Full Text: DOI
Hou, Jianfeng; Zeng, Qinghou On a problem of judicious \(k\)-partitions of graphs. (English) Zbl 1367.05168 J. Graph Theory 85, No. 3, 619-643 (2017). MSC: 05C70 PDF BibTeX XML Cite \textit{J. Hou} and \textit{Q. Zeng}, J. Graph Theory 85, No. 3, 619--643 (2017; Zbl 1367.05168) Full Text: DOI
Filtser, Arnold; Krauthgamer, Robert Sparsification of two-variable valued constraint satisfaction problems. (English) Zbl 1371.68112 SIAM J. Discrete Math. 31, No. 2, 1263-1276 (2017). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{A. Filtser} and \textit{R. Krauthgamer}, SIAM J. Discrete Math. 31, No. 2, 1263--1276 (2017; Zbl 1371.68112) Full Text: DOI
Zeng, Qing Hou; Hou, Jian Feng; Deng, Jin; Lei, Xia Biased partitions and judicious \(k\)-partitions of graphs. (English) Zbl 1362.05108 Acta Math. Sin., Engl. Ser. 33, No. 5, 668-680 (2017). MSC: 05C70 05C35 PDF BibTeX XML Cite \textit{Q. H. Zeng} et al., Acta Math. Sin., Engl. Ser. 33, No. 5, 668--680 (2017; Zbl 1362.05108) Full Text: DOI
Abbasi-Parizi, Saeid; Aminnayeri, Majid; Bashiri, Mahdi Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment. (English) Zbl 1361.90039 J. Ind. Manag. Optim. 13, No. 3, 1449-1473 (2017). MSC: 90B80 90C15 90C70 90C47 90C57 PDF BibTeX XML Cite \textit{S. Abbasi-Parizi} et al., J. Ind. Manag. Optim. 13, No. 3, 1449--1473 (2017; Zbl 1361.90039) Full Text: DOI
Ma, Fuda; Hao, Jin-Kao A multiple search operator heuristic for the max-k-cut problem. (English) Zbl 1357.90122 Ann. Oper. Res. 248, No. 1-2, 365-403 (2017). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{F. Ma} and \textit{J.-K. Hao}, Ann. Oper. Res. 248, No. 1--2, 365--403 (2017; Zbl 1357.90122) Full Text: DOI
Backman, Spencer Riemann-Roch theory for graph orientations. (English) Zbl 1355.05140 Adv. Math. 309, 655-691 (2017). MSC: 05C38 05C25 14H15 PDF BibTeX XML Cite \textit{S. Backman}, Adv. Math. 309, 655--691 (2017; Zbl 1355.05140) Full Text: DOI arXiv
Hungerländer, Philipp New semidefinite programming relaxations for the linear ordering and the traveling salesman problem. (English) Zbl 1358.90117 Discrete Appl. Math. 217, Part 1, 19-39 (2017). MSC: 90C27 PDF BibTeX XML Cite \textit{P. Hungerländer}, Discrete Appl. Math. 217, Part 1, 19--39 (2017; Zbl 1358.90117) Full Text: DOI
Lasserre, Jean B. A MAX-CUT formulation of 0/1 programs. (English) Zbl 1408.90222 Oper. Res. Lett. 44, No. 2, 158-164 (2016). MSC: 90C20 90C10 90C22 PDF BibTeX XML Cite \textit{J. B. Lasserre}, Oper. Res. Lett. 44, No. 2, 158--164 (2016; Zbl 1408.90222) Full Text: DOI
Joormann, Imke; Orlin, James B.; Pfetsch, Marc E. A characterization of irreducible infeasible subsystems in flow networks. (English) Zbl 1390.90110 Networks 68, No. 2, 121-129 (2016). MSC: 90B10 90C05 PDF BibTeX XML Cite \textit{I. Joormann} et al., Networks 68, No. 2, 121--129 (2016; Zbl 1390.90110) Full Text: DOI
Etscheid, Michael; Mnich, Matthias Linear kernels and linear-time algorithms for finding large cuts. (English) Zbl 1398.68229 Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 31, 13 p. (2016). MSC: 68Q25 05C85 68R10 PDF BibTeX XML Cite \textit{M. Etscheid} and \textit{M. Mnich}, LIPIcs -- Leibniz Int. Proc. Inform. 64, Article 31, 13 p. (2016; Zbl 1398.68229) Full Text: DOI
Sun, Ting; Li, Gaidi; Xu, Wenqing Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations. (Chinese. English summary) Zbl 1374.90425 Oper. Res. Trans. 20, No. 3, 21-32 (2016). MSC: 90C59 90C22 90C27 PDF BibTeX XML Cite \textit{T. Sun} et al., Oper. Res. Trans. 20, No. 3, 21--32 (2016; Zbl 1374.90425) Full Text: DOI
Veiga Pocai, Rafael The complexity of SIMPLE MAX-CUT on comparability graphs. (English) Zbl 1356.05093 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 161-164 (2016). MSC: 05C60 05C35 PDF BibTeX XML Cite \textit{R. Veiga Pocai}, Electron. Notes Discrete Math. 55, 161--164 (2016; Zbl 1356.05093) Full Text: DOI
De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F. A nonmonotone GRASP. (English) Zbl 1349.90710 Math. Program. Comput. 8, No. 3, 271-309 (2016). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{M. De Santis} et al., Math. Program. Comput. 8, No. 3, 271--309 (2016; Zbl 1349.90710) Full Text: DOI
Aliannezhadi, Samaneh; Abbasi Molai, Ali; Hedayatfar, Behnaz Linear optimization with bipolar max-parametric Hamacher fuzzy relation equation constraints. (English) Zbl 1399.90195 Kybernetika 52, No. 4, 531-557 (2016). MSC: 90C05 90C70 90C57 PDF BibTeX XML Cite \textit{S. Aliannezhadi} et al., Kybernetika 52, No. 4, 531--557 (2016; Zbl 1399.90195) Full Text: DOI
Guenin, Bertrand; Stuive, Leanne Single commodity-flow algorithms for lifts of graphic and cographic matroids. (English) Zbl 1344.05040 SIAM J. Discrete Math. 30, No. 3, 1775-1797 (2016). MSC: 05B35 05C22 90C05 90C47 68Q25 PDF BibTeX XML Cite \textit{B. Guenin} and \textit{L. Stuive}, SIAM J. Discrete Math. 30, No. 3, 1775--1797 (2016; Zbl 1344.05040) Full Text: DOI
Baïou, Mourad; Barahona, Francisco Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. (English) Zbl 1419.90110 Louveaux, Quentin (ed.) et al., Integer programming and combinatorial optimization. 18th international conference, IPCO 2016, Liège, Belgium, June 1–3, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9682, 63-76 (2016). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{M. Baïou} and \textit{F. Barahona}, Lect. Notes Comput. Sci. 9682, 63--76 (2016; Zbl 1419.90110) Full Text: DOI
Nikiforov, V. Max \(k\)-cut and the smallest eigenvalue. (English) Zbl 1338.05168 Linear Algebra Appl. 504, 462-467 (2016). MSC: 05C50 PDF BibTeX XML Cite \textit{V. Nikiforov}, Linear Algebra Appl. 504, 462--467 (2016; Zbl 1338.05168) Full Text: DOI arXiv
Mu, Xuewen; Liu, Wenlong An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions. (English) Zbl 1345.90060 Optim. Lett. 10, No. 3, 485-497 (2016). MSC: 90C10 90C20 PDF BibTeX XML Cite \textit{X. Mu} and \textit{W. Liu}, Optim. Lett. 10, No. 3, 485--497 (2016; Zbl 1345.90060) Full Text: DOI
Bouchet, Élodie; Ramírez, Alejandro F.; Sabot, Christophe Sharp ellipticity conditions for ballistic behavior of random walks in random environment. (English) Zbl 1337.60249 Bernoulli 22, No. 2, 969-994 (2016). Reviewer: Marius Iosifescu (Bucureşti) MSC: 60K37 60G50 PDF BibTeX XML Cite \textit{É. Bouchet} et al., Bernoulli 22, No. 2, 969--994 (2016; Zbl 1337.60249) Full Text: DOI Euclid arXiv
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 PDF BibTeX XML Cite \textit{E. R. van Dam} and \textit{R. Sotirov}, Linear Algebra Appl. 488, 216--234 (2016; Zbl 1326.05089) Full Text: DOI arXiv
Lin, Geng; Zhu, Wenxing A memetic algorithm for the max-cut problem. (English) Zbl 1453.68139 Int. J. Comput. Sci. Math. 6, No. 1, 69-77 (2015). MSC: 68R10 68T20 68W50 90C27 90C59 PDF BibTeX XML Cite \textit{G. Lin} and \textit{W. Zhu}, Int. J. Comput. Sci. Math. 6, No. 1, 69--77 (2015; Zbl 1453.68139) Full Text: DOI
Henry, Marc; Méango, Romuald; Queyranne, Maurice Combinatorial approach to inference in partially identified incomplete structural models. (English) Zbl 1396.91018 Quant. Econ. 6, No. 2, 499-529 (2015). MSC: 91A10 62G09 90C27 91A80 PDF BibTeX XML Cite \textit{M. Henry} et al., Quant. Econ. 6, No. 2, 499--529 (2015; Zbl 1396.91018) Full Text: DOI
Kogan, Dmitry; Krauthgamer, Robert Sketching cuts in graphs and hypergraphs. (English) Zbl 1365.68469 Proceedings of the 6th conference on innovations in theoretical computer science, ITCS’15, Rehovot, Israel, January 11–13, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3333-7). 367-376 (2015). MSC: 68W25 05C65 05C85 68Q25 PDF BibTeX XML Cite \textit{D. Kogan} and \textit{R. Krauthgamer}, in: Proceedings of the 6th conference on innovations in theoretical computer science, ITCS'15, Rehovot, Israel, January 11--13, 2015. New York, NY: Association for Computing Machinery (ACM). 367--376 (2015; Zbl 1365.68469) Full Text: DOI
da Cunha, Alexandre Salles; Simonetti, Luidi; Lucena, Abilio Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem. (English) Zbl 1346.90725 Eur. J. Oper. Res. 246, No. 2, 392-399 (2015). MSC: 90C27 90C35 90C57 PDF BibTeX XML Cite \textit{A. S. da Cunha} et al., Eur. J. Oper. Res. 246, No. 2, 392--399 (2015; Zbl 1346.90725) Full Text: DOI
Xie, Min; Yang, Fan; Zeng, Xuan A partition-based IP protection algorithm for analog circuits. (Chinese. English summary) Zbl 1349.94170 J. Fudan Univ., Nat. Sci. 54, No. 5, 559-568 (2015). MSC: 94C05 94C15 PDF BibTeX XML Cite \textit{M. Xie} et al., J. Fudan Univ., Nat. Sci. 54, No. 5, 559--568 (2015; Zbl 1349.94170) Full Text: DOI
Albin, Nathan; Brunner, Megan; Perez, Roberto; Poggi-Corradini, Pietro; Wiens, Natalie Modulus on graphs as a generalization of standard graph theoretic quantities. (English) Zbl 1332.90322 Conform. Geom. Dyn. 19, 298-317 (2015). MSC: 90C35 PDF BibTeX XML Cite \textit{N. Albin} et al., Conform. Geom. Dyn. 19, 298--317 (2015; Zbl 1332.90322) Full Text: DOI arXiv
Furini, Fabio; Iori, Manuel; Martello, Silvano; Yagiura, Mutsunori Heuristic and exact algorithms for the interval \(\min\)-\(\max\) regret knapsack problem. (English) Zbl 1329.90119 INFORMS J. Comput. 27, No. 2, 392-405 (2015). MSC: 90C27 90C47 PDF BibTeX XML Cite \textit{F. Furini} et al., INFORMS J. Comput. 27, No. 2, 392--405 (2015; Zbl 1329.90119) Full Text: DOI
Soto, José A. Improved analysis of a Max-Cut algorithm based on spectral partitioning. (English) Zbl 1331.68297 SIAM J. Discrete Math. 29, No. 1, 259-268 (2015). MSC: 68W25 05C50 68W40 PDF BibTeX XML Cite \textit{J. A. Soto}, SIAM J. Discrete Math. 29, No. 1, 259--268 (2015; Zbl 1331.68297) Full Text: DOI
DeMarco, B.; Kahn, J. Mantel’s theorem for random graphs. (English) Zbl 1328.05169 Random Struct. Algorithms 47, No. 1, 59-72 (2015). Reviewer: David B. Penman (Colchester) MSC: 05C80 05C35 PDF BibTeX XML Cite \textit{B. DeMarco} and \textit{J. Kahn}, Random Struct. Algorithms 47, No. 1, 59--72 (2015; Zbl 1328.05169) Full Text: DOI
Lieder, Felix; Rad, Fatemeh Bani Asadi; Jarre, Florian Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques. (English) Zbl 1346.90603 Comput. Optim. Appl. 61, No. 3, 669-688 (2015). MSC: 90C09 90C22 PDF BibTeX XML Cite \textit{F. Lieder} et al., Comput. Optim. Appl. 61, No. 3, 669--688 (2015; Zbl 1346.90603) Full Text: DOI
Mossel, Elchanan; Neeman, Joe Robust optimality of Gaussian noise stability. (English) Zbl 1384.60062 J. Eur. Math. Soc. (JEMS) 17, No. 2, 433-482 (2015). Reviewer: Ruhollah Jahanipur (Kashan) MSC: 60E15 26D10 68Q87 60G10 PDF BibTeX XML Cite \textit{E. Mossel} and \textit{J. Neeman}, J. Eur. Math. Soc. (JEMS) 17, No. 2, 433--482 (2015; Zbl 1384.60062) Full Text: DOI arXiv
Li, Li Selected applications of convex optimization. (English) Zbl 1321.90005 Springer Optimization and Its Applications 103. Beijing: Tsinghua University Press; Berlin: Springer (ISBN 978-7-302-39029-9/pbk; 978-3-662-46355-0/pbk; 978-3-662-46356-7/ebook). x, 140 p. (2015). Reviewer: Rembert Reemtsen (Cottbus) MSC: 90-02 90C25 90C90 00A69 PDF BibTeX XML Cite \textit{L. Li}, Selected applications of convex optimization. Beijing: Tsinghua University Press; Berlin: Springer (2015; Zbl 1321.90005) Full Text: DOI
O’Donnell, Ryan Social choice, computational complexity, Gaussian geometry, and Boolean functions. (English) Zbl 1375.91074 Jang, Sun Young (ed.) et al., Proceedings of the International Congress of Mathematicians (ICM 2014), Seoul, Korea, August 13–21, 2014. Vol. IV: Invited lectures. Seoul: KM Kyung Moon Sa (ISBN 978-89-6105-807-0/hbk; 978-89-6105-803-2/set). 633-658 (2014). MSC: 91B14 68Q87 94C10 60G15 PDF BibTeX XML Cite \textit{R. O'Donnell}, in: Proceedings of the International Congress of Mathematicians (ICM 2014), Seoul, Korea, August 13--21, 2014. Vol. IV: Invited lectures. Seoul: KM Kyung Moon Sa. 633--658 (2014; Zbl 1375.91074) Full Text: arXiv
Wagler, Annegret K. Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow. (English) Zbl 1314.90071 Benner, Peter (ed.) et al., Large-scale networks in engineering and life sciences. Based on the summer school, Magdeburg, Germany, September 26–30, 2011. Heidelberg: Birkhäuser/Springer (ISBN 978-3-319-08436-7/hbk; 978-3-319-08437-4/ebook). Modeling and Simulation in Science, Engineering and Technology, 225-262 (2014). MSC: 90C27 90C35 90C05 90C10 PDF BibTeX XML Cite \textit{A. K. Wagler}, in: Large-scale networks in engineering and life sciences. Based on the summer school, Magdeburg, Germany, September 26--30, 2011. Heidelberg: Birkhäuser/Springer. 225--262 (2014; Zbl 1314.90071) Full Text: DOI
Letchford, Adam N.; Sørensen, Michael M. A new separation algorithm for the Boolean quadric and cut polytopes. (English) Zbl 1308.90209 Discrete Optim. 14, 61-71 (2014). MSC: 90C57 90C20 90C09 PDF BibTeX XML Cite \textit{A. N. Letchford} and \textit{M. M. Sørensen}, Discrete Optim. 14, 61--71 (2014; Zbl 1308.90209) Full Text: DOI
Xu, BaoGang; Yu, XingXing; Zhang, XiaoYan; Zhang, Zan-Bo An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance. (English) Zbl 1335.49053 Sci. China, Math. 57, No. 12, 2437-2462 (2014). MSC: 49M37 90C22 90C27 68W20 PDF BibTeX XML Cite \textit{B. Xu} et al., Sci. China, Math. 57, No. 12, 2437--2462 (2014; Zbl 1335.49053) Full Text: DOI
Goerigk, Marc A note on upper bounds to the robust knapsack problem with discrete scenarios. (English) Zbl 1306.90127 Ann. Oper. Res. 223, 461-469 (2014). MSC: 90C27 90C47 90C57 PDF BibTeX XML Cite \textit{M. Goerigk}, Ann. Oper. Res. 223, 461--469 (2014; Zbl 1306.90127) Full Text: DOI
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket Almost optimal lower bounds for problems parameterized by clique-width. (English) Zbl 1306.05181 SIAM J. Comput. 43, No. 5, 1541-1563 (2014). MSC: 05C69 05C85 05C12 68R10 68Q17 68Q25 68W40 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., SIAM J. Comput. 43, No. 5, 1541--1563 (2014; Zbl 1306.05181) Full Text: DOI
Lin, Geng; Zhu, Wenxing Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem. (English) Zbl 1307.90190 J. Oper. Res. Soc. China 2, No. 2, 237-262 (2014). MSC: 90C35 PDF BibTeX XML Cite \textit{G. Lin} and \textit{W. Zhu}, J. Oper. Res. Soc. China 2, No. 2, 237--262 (2014; Zbl 1307.90190) Full Text: DOI
Fan, Genghua; Hou, Jianfeng; Zeng, Qinghou A bound for judicious \(k\)-partitions of graphs. (English) Zbl 1303.05152 Discrete Appl. Math. 179, 86-99 (2014). MSC: 05C70 05C35 PDF BibTeX XML Cite \textit{G. Fan} et al., Discrete Appl. Math. 179, 86--99 (2014; Zbl 1303.05152) Full Text: DOI
Heilman, Steven Euclidean partitions optimizing noise stability. (English) Zbl 1364.60010 Electron. J. Probab. 19, Paper No. 71, 37 p. (2014). MSC: 60A10 60G15 68Q15 68Q25 PDF BibTeX XML Cite \textit{S. Heilman}, Electron. J. Probab. 19, Paper No. 71, 37 p. (2014; Zbl 1364.60010) Full Text: DOI arXiv
Bonato, Thorsten; Jünger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni Lifting and separation procedures for the cut polytope. (English) Zbl 1297.90133 Math. Program. 146, No. 1-2 (A), 351-378 (2014). MSC: 90C27 90C57 90C20 90C09 82D30 PDF BibTeX XML Cite \textit{T. Bonato} et al., Math. Program. 146, No. 1--2 (A), 351--378 (2014; Zbl 1297.90133) Full Text: DOI
Yuan, Jing; Bae, Egil; Tai, Xue-Cheng; Boykov, Yuri A spatially continuous max-flow and min-cut framework for binary labeling problems. (English) Zbl 1290.49060 Numer. Math. 126, No. 3, 559-587 (2014). MSC: 49M29 49M20 65K10 68U10 PDF BibTeX XML Cite \textit{J. Yuan} et al., Numer. Math. 126, No. 3, 559--587 (2014; Zbl 1290.49060) Full Text: DOI
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. (English) Zbl 1312.68105 J. Comput. Syst. Sci. 80, No. 7, 1384-1403 (2014). MSC: 68Q25 05C40 05C85 PDF BibTeX XML Cite \textit{M. Mnich} et al., J. Comput. Syst. Sci. 80, No. 7, 1384--1403 (2014; Zbl 1312.68105) Full Text: DOI arXiv
Cerf, Raphaël; Théret, Marie Maximal stream and minimal cutset for first passage percolation through a domain of \(\mathbb{R}^{d}\). (English) Zbl 1302.60132 Ann. Probab. 42, No. 3, 1054-1120 (2014). Reviewer: Utkir A. Rozikov (Tashkent) MSC: 60K35 49K20 35Q35 82B20 PDF BibTeX XML Cite \textit{R. Cerf} and \textit{M. Théret}, Ann. Probab. 42, No. 3, 1054--1120 (2014; Zbl 1302.60132) Full Text: DOI Euclid arXiv
Lange, Alexander R.; Radziszowski, Stanislaw P.; Xu, Xiaodong Use of MAX-CUT for Ramsey arrowing of triangles. (English) Zbl 1293.05113 J. Comb. Math. Comb. Comput. 88, 61-71 (2014). MSC: 05C15 05C75 05C55 90C22 PDF BibTeX XML Cite \textit{A. R. Lange} et al., J. Comb. Math. Comb. Comput. 88, 61--71 (2014; Zbl 1293.05113)
Crowston, Robert; Jones, Mark; Muciaccia, Gabriele; Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket Polynomial kernels for \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. (English) Zbl 1359.68125 Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 43-54 (2013). MSC: 68Q25 05C60 05C85 PDF BibTeX XML Cite \textit{R. Crowston} et al., LIPIcs -- Leibniz Int. Proc. Inform. 24, 43--54 (2013; Zbl 1359.68125) Full Text: DOI arXiv
Wu, Qinghua; Hao, Jin-Kao Memetic search for the max-bisection problem. (English) Zbl 1349.90828 Comput. Oper. Res. 40, No. 1, 166-179 (2013). MSC: 90C35 90C59 05C22 PDF BibTeX XML Cite \textit{Q. Wu} and \textit{J.-K. Hao}, Comput. Oper. Res. 40, No. 1, 166--179 (2013; Zbl 1349.90828) Full Text: DOI
Lee, James R.; Poore, Daniel E. On the 2-sum embedding conjecture. (English) Zbl 1305.05153 Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2031-3). 197-206 (2013). MSC: 05C60 05C10 05C85 68U05 PDF BibTeX XML Cite \textit{J. R. Lee} and \textit{D. E. Poore}, in: Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17--20, 2013. New York, NY: Association for Computing Machinery (ACM). 197--206 (2013; Zbl 1305.05153) Full Text: DOI
Pansu, Pierre Difficulty of approximation (after Khot, Kindler, Mossel, O’Donnell, …). (Difficulté d’approximation (d’après Khot, Kindler, Mossel, O’Donnell, …).) (French) Zbl 1448.68479 Séminaire Bourbaki. Volume 2011/2012. Exposés 1043–1058. Paris: Société Mathématique de France (SMF). Astérisque 352, 83-120, Exp. No. 1045 (2013). MSC: 68W25 68Q17 68R10 90C22 PDF BibTeX XML Cite \textit{P. Pansu}, Astérisque 352, 83--120, Exp. No. 1045 (2013; Zbl 1448.68479)
Goto, H. A lightweight model predictive controller for repetitive discrete event systems. (English) Zbl 1286.93116 Asian J. Control 15, No. 4, 1081-1090 (2013). MSC: 93C65 93B40 15A80 90C57 PDF BibTeX XML Cite \textit{H. Goto}, Asian J. Control 15, No. 4, 1081--1090 (2013; Zbl 1286.93116) Full Text: DOI