Borowiecki, Piotr Computational aspects of greedy partitioning of graphs. (English) Zbl 1385.68016 J. Comb. Optim. 35, No. 2, 641-665 (2018). MSC: 68Q25 05C15 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{P. Borowiecki}, J. Comb. Optim. 35, No. 2, 641--665 (2018; Zbl 1385.68016) Full Text: DOI
Nong, Q. Q.; Sun, T.; Cheng, T. C. E.; Fang, Q. Z. Bin packing game with a price of anarchy of \(\frac{3}{2}\). (English) Zbl 1390.91022 J. Comb. Optim. 35, No. 2, 632-640 (2018). MSC: 91A10 90C70 PDF BibTeX XML Cite \textit{Q. Q. Nong} et al., J. Comb. Optim. 35, No. 2, 632--640 (2018; Zbl 1390.91022) Full Text: DOI
Pradhan, D.; Jha, Anupriya On computing a minimum secure dominating set in block graphs. (English) Zbl 1386.05143 J. Comb. Optim. 35, No. 2, 613-631 (2018). MSC: 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{D. Pradhan} and \textit{A. Jha}, J. Comb. Optim. 35, No. 2, 613--631 (2018; Zbl 1386.05143) Full Text: DOI
Wu, Biao; Peng, Yuejian Two extremal problems related to orders. (English) Zbl 1415.05091 J. Comb. Optim. 35, No. 2, 588-612 (2018). MSC: 05C35 05C65 90C27 PDF BibTeX XML Cite \textit{B. Wu} and \textit{Y. Peng}, J. Comb. Optim. 35, No. 2, 588--612 (2018; Zbl 1415.05091) Full Text: DOI
Béal, Sylvain; Khmelnitskaya, Anna; Solal, Philippe Two-step values for games with two-level communication structure. (English) Zbl 1390.91026 J. Comb. Optim. 35, No. 2, 563-587 (2018). MSC: 91A12 91A43 PDF BibTeX XML Cite \textit{S. Béal} et al., J. Comb. Optim. 35, No. 2, 563--587 (2018; Zbl 1390.91026) Full Text: DOI
Wang, Haiying; Wu, Jianliang List-edge-coloring of planar graphs without 6-cycles with three chords. (English) Zbl 1386.05071 J. Comb. Optim. 35, No. 2, 555-562 (2018). MSC: 05C15 05C10 05C38 PDF BibTeX XML Cite \textit{H. Wang} and \textit{J. Wu}, J. Comb. Optim. 35, No. 2, 555--562 (2018; Zbl 1386.05071) Full Text: DOI
Xu, Yi; Peng, Jigen; Wang, Wencheng; Zhu, Binhai The connected disk covering problem. (English) Zbl 1393.90105 J. Comb. Optim. 35, No. 2, 538-554 (2018). MSC: 90C27 PDF BibTeX XML Cite \textit{Y. Xu} et al., J. Comb. Optim. 35, No. 2, 538--554 (2018; Zbl 1393.90105) Full Text: DOI
Gai, Ling; Zhang, Guochuan Online lazy bureaucrat scheduling with a machine deadline. (English) Zbl 1393.90054 J. Comb. Optim. 35, No. 2, 530-537 (2018). MSC: 90B35 PDF BibTeX XML Cite \textit{L. Gai} and \textit{G. Zhang}, J. Comb. Optim. 35, No. 2, 530--537 (2018; Zbl 1393.90054) Full Text: DOI
Christman, Ananya; Forcier, William; Poudel, Aayam From theory to practice: maximizing revenues for on-line dial-a-ride. (English) Zbl 1393.90125 J. Comb. Optim. 35, No. 2, 512-529 (2018). MSC: 90B06 90C27 90C90 68W27 PDF BibTeX XML Cite \textit{A. Christman} et al., J. Comb. Optim. 35, No. 2, 512--529 (2018; Zbl 1393.90125) Full Text: DOI
Jiang, Yanjun; Xu, Dachuan; Du, Donglei; Wu, Chenchen; Zhang, Dongmei An approximation algorithm for soft capacitated \(k\)-facility location problem. (English) Zbl 1394.90484 J. Comb. Optim. 35, No. 2, 493-511 (2018). MSC: 90C27 90C59 90B80 PDF BibTeX XML Cite \textit{Y. Jiang} et al., J. Comb. Optim. 35, No. 2, 493--511 (2018; Zbl 1394.90484) Full Text: DOI
Nayak, Rupaj Kumar; Biswal, Mahendra Prasad A low complexity semidefinite relaxation for large-scale MIMO detection. (English) Zbl 1393.90080 J. Comb. Optim. 35, No. 2, 473-492 (2018). MSC: 90C20 90C09 90C22 PDF BibTeX XML Cite \textit{R. K. Nayak} and \textit{M. P. Biswal}, J. Comb. Optim. 35, No. 2, 473--492 (2018; Zbl 1393.90080) Full Text: DOI
Goddard, Wayne; Melville, Robert Properly colored trails, paths, and bridges. (English) Zbl 1386.05058 J. Comb. Optim. 35, No. 2, 463-472 (2018). MSC: 05C15 05C38 05C35 PDF BibTeX XML Cite \textit{W. Goddard} and \textit{R. Melville}, J. Comb. Optim. 35, No. 2, 463--472 (2018; Zbl 1386.05058) Full Text: DOI
Zhu, Junlei; Bu, Yuehua; Dai, Yun Upper bounds for adjacent vertex-distinguishing edge coloring. (English) Zbl 1392.05046 J. Comb. Optim. 35, No. 2, 454-462 (2018). Reviewer: Andrea Semanicova-Fenovcikova (Košice) MSC: 05C15 PDF BibTeX XML Cite \textit{J. Zhu} et al., J. Comb. Optim. 35, No. 2, 454--462 (2018; Zbl 1392.05046) Full Text: DOI
Ćustić, Ante; Punnen, Abraham P. A characterization of linearizable instances of the quadratic minimum spanning tree problem. (English) Zbl 1394.90544 J. Comb. Optim. 35, No. 2, 436-453 (2018). MSC: 90C35 90C20 90C09 PDF BibTeX XML Cite \textit{A. Ćustić} and \textit{A. P. Punnen}, J. Comb. Optim. 35, No. 2, 436--453 (2018; Zbl 1394.90544) Full Text: DOI
Lu, Changhong; Wang, Bing; Wang, Kan Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs. (English) Zbl 1386.05137 J. Comb. Optim. 35, No. 2, 424-435 (2018). MSC: 05C69 05C85 68Q17 05C15 PDF BibTeX XML Cite \textit{C. Lu} et al., J. Comb. Optim. 35, No. 2, 424--435 (2018; Zbl 1386.05137) Full Text: DOI
Han, Lu; Xu, Dachuan; Du, Donglei; Zhang, Dongmei A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem. (English) Zbl 1393.90103 J. Comb. Optim. 35, No. 2, 409-423 (2018). MSC: 90C27 90B80 PDF BibTeX XML Cite \textit{L. Han} et al., J. Comb. Optim. 35, No. 2, 409--423 (2018; Zbl 1393.90103) Full Text: DOI
Subramani, K.; Wojciechowski, Piotr A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. (English) Zbl 1394.90499 J. Comb. Optim. 35, No. 2, 389-408 (2018). MSC: 90C27 PDF BibTeX XML Cite \textit{K. Subramani} and \textit{P. Wojciechowski}, J. Comb. Optim. 35, No. 2, 389--408 (2018; Zbl 1394.90499) Full Text: DOI
Lužar, Borut; Petruševski, Mirko; Škrekovski, Riste On vertex-parity edge-colorings. (English) Zbl 1401.05123 J. Comb. Optim. 35, No. 2, 373-388 (2018). Reviewer: Geir Agnarsson (Fairfax) MSC: 05C15 PDF BibTeX XML Cite \textit{B. Lužar} et al., J. Comb. Optim. 35, No. 2, 373--388 (2018; Zbl 1401.05123) Full Text: DOI
Cai, Hua; Wu, Jianliang; Sun, Lin Vertex arboricity of planar graphs without intersecting 5-cycles. (English) Zbl 1386.05053 J. Comb. Optim. 35, No. 2, 365-372 (2018). MSC: 05C15 05C35 05C10 05C38 PDF BibTeX XML Cite \textit{H. Cai} et al., J. Comb. Optim. 35, No. 2, 365--372 (2018; Zbl 1386.05053) Full Text: DOI
Békési, József; Galambos, Gábor Tight bounds for NF-based bounded-space online bin packing algorithms. (English) Zbl 1393.90100 J. Comb. Optim. 35, No. 2, 350-364 (2018). MSC: 90C27 PDF BibTeX XML Cite \textit{J. Békési} and \textit{G. Galambos}, J. Comb. Optim. 35, No. 2, 350--364 (2018; Zbl 1393.90100) Full Text: DOI
Stȩpień, Zofia; Szymaszkiewicz, Lucjan Arcs in \(\mathbb Z^2_{2p}\). (English) Zbl 1386.05024 J. Comb. Optim. 35, No. 2, 341-349 (2018). MSC: 05B30 51E22 PDF BibTeX XML Cite \textit{Z. Stȩpień} and \textit{L. Szymaszkiewicz}, J. Comb. Optim. 35, No. 2, 341--349 (2018; Zbl 1386.05024) Full Text: DOI
He, Xiaozhou; Xu, Yinfeng The longest commonly positioned increasing subsequences problem. (English) Zbl 1394.90483 J. Comb. Optim. 35, No. 2, 331-340 (2018). MSC: 90C27 PDF BibTeX XML Cite \textit{X. He} and \textit{Y. Xu}, J. Comb. Optim. 35, No. 2, 331--340 (2018; Zbl 1394.90483) Full Text: DOI