Kamiyama, Naoyuki A note on submodular function minimization with covering type linear constraints. (English) Zbl 1402.90150 Algorithmica 80, No. 10, 2957-2971 (2018). MSC: 90C27 PDFBibTeX XMLCite \textit{N. Kamiyama}, Algorithmica 80, No. 10, 2957--2971 (2018; Zbl 1402.90150) Full Text: DOI
Nonner, Tim Clique clustering yields a PTAS for max-coloring interval graphs. (English) Zbl 1391.68060 Algorithmica 80, No. 10, 2941-2956 (2018). MSC: 68Q25 05C15 05C62 68W25 PDFBibTeX XMLCite \textit{T. Nonner}, Algorithmica 80, No. 10, 2941--2956 (2018; Zbl 1391.68060) Full Text: DOI
Bliem, Bernhard; Woltran, Stefan Complexity of secure sets. (English) Zbl 1391.68047 Algorithmica 80, No. 10, 2909-2940 (2018). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{B. Bliem} and \textit{S. Woltran}, Algorithmica 80, No. 10, 2909--2940 (2018; Zbl 1391.68047) Full Text: DOI arXiv
Feige, Uriel; Hitron, Yael The ordered covering problem. (English) Zbl 1459.05256 Algorithmica 80, No. 10, 2874-2908 (2018). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{U. Feige} and \textit{Y. Hitron}, Algorithmica 80, No. 10, 2874--2908 (2018; Zbl 1459.05256) Full Text: DOI
Grimmer, Benjamin Dual-based approximation algorithms for cut-based network connectivity problems. (English) Zbl 1392.68324 Algorithmica 80, No. 10, 2849-2873 (2018). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{B. Grimmer}, Algorithmica 80, No. 10, 2849--2873 (2018; Zbl 1392.68324) Full Text: DOI arXiv
Ziedan, Emile; Rajendraprasad, Deepak; Mathew, Rogers; Golumbic, Martin Charles; Dusart, Jérémie The induced separation dimension of a graph. (English) Zbl 1392.05094 Algorithmica 80, No. 10, 2834-2848 (2018). MSC: 05C75 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{E. Ziedan} et al., Algorithmica 80, No. 10, 2834--2848 (2018; Zbl 1392.05094) Full Text: DOI
van Ee, Martijn; Sitters, René The A priori traveling repairman problem. (English) Zbl 1402.90162 Algorithmica 80, No. 10, 2818-2833 (2018). MSC: 90C27 90C15 PDFBibTeX XMLCite \textit{M. van Ee} and \textit{R. Sitters}, Algorithmica 80, No. 10, 2818--2833 (2018; Zbl 1402.90162) Full Text: DOI
AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard; Zamaraev, Viktor Upper domination: towards a dichotomy through boundary properties. (English) Zbl 1391.05241 Algorithmica 80, No. 10, 2799-2817 (2018). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{H. AbouEisha} et al., Algorithmica 80, No. 10, 2799--2817 (2018; Zbl 1391.05241) Full Text: DOI arXiv
Murray, Riley; Khuller, Samir; Chao, Megan Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms. (English) Zbl 1391.68015 Algorithmica 80, No. 10, 2777-2798 (2018). MSC: 68M20 68W25 PDFBibTeX XMLCite \textit{R. Murray} et al., Algorithmica 80, No. 10, 2777--2798 (2018; Zbl 1391.68015) Full Text: DOI arXiv Link
Meesum, Syed M.; Saurabh, Saket Rank reduction of oriented graphs by vertex and edge deletions. (English) Zbl 1391.68091 Algorithmica 80, No. 10, 2757-2776 (2018). MSC: 68R10 05C20 05C50 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. M. Meesum} and \textit{S. Saurabh}, Algorithmica 80, No. 10, 2757--2776 (2018; Zbl 1391.68091) Full Text: DOI
Rahmati, Zahed; Chan, Timothy M. A clustering-based approach to kinetic closest pair. (English) Zbl 1391.68115 Algorithmica 80, No. 10, 2742-2756 (2018). MSC: 68U05 68P05 PDFBibTeX XMLCite \textit{Z. Rahmati} and \textit{T. M. Chan}, Algorithmica 80, No. 10, 2742--2756 (2018; Zbl 1391.68115) Full Text: DOI Link
Nagao, Atsuki; Seto, Kazuhisa; Teruyama, Junichi A moderately exponential time algorithm for \(k\)-IBDD satisfiability. (English) Zbl 1391.68101 Algorithmica 80, No. 10, 2725-2741 (2018). MSC: 68T20 PDFBibTeX XMLCite \textit{A. Nagao} et al., Algorithmica 80, No. 10, 2725--2741 (2018; Zbl 1391.68101) Full Text: DOI