Saettler, Aline; Laber, Eduardo; Cicalese, Ferdinando Correction to: “Trading off worst and expected cost in decision tree problems”. (English) Zbl 1407.68554 Algorithmica 80, No. 11, 3431-3436 (2018). MSC: 68W25 90C27 PDF BibTeX XML Cite \textit{A. Saettler} et al., Algorithmica 80, No. 11, 3431--3436 (2018; Zbl 1407.68554) Full Text: DOI
Schlotter, Ildikó; Cechlárová, Katarína Correction to: “A connection between sports and matroids: how many teams can we beat?”. (English) Zbl 1412.05034 Algorithmica 80, No. 11, 3428-3430 (2018). MSC: 05B35 05C78 52B40 PDF BibTeX XML Cite \textit{I. Schlotter} and \textit{K. Cechlárová}, Algorithmica 80, No. 11, 3428--3430 (2018; Zbl 1412.05034) Full Text: DOI
Bringmann, Karl; Friedrich, Tobias; Krohmer, Anton De-anonymization of heterogeneous random graphs in quasilinear time. (English) Zbl 1414.05263 Algorithmica 80, No. 11, 3397-3427 (2018). MSC: 05C80 05C82 05C85 68W40 91D30 PDF BibTeX XML Cite \textit{K. Bringmann} et al., Algorithmica 80, No. 11, 3397--3427 (2018; Zbl 1414.05263) Full Text: DOI
Reitzig, Raphael; Wild, Sebastian Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks. (English) Zbl 1417.91300 Algorithmica 80, No. 11, 3365-3396 (2018). MSC: 91B32 PDF BibTeX XML Cite \textit{R. Reitzig} and \textit{S. Wild}, Algorithmica 80, No. 11, 3365--3396 (2018; Zbl 1417.91300) Full Text: DOI
Qian, Jiawei; Umboh, Seeun William; Williamson, David P. Online constrained forest and prize-collecting network design. (English) Zbl 1412.68302 Algorithmica 80, No. 11, 3335-3364 (2018). MSC: 68W27 68R10 PDF BibTeX XML Cite \textit{J. Qian} et al., Algorithmica 80, No. 11, 3335--3364 (2018; Zbl 1412.68302) Full Text: DOI
Aronov, Boris; Bose, Prosenjit; Demaine, Erik D.; Gudmundsson, Joachim; Iacono, John; Langerman, Stefan; Smid, Michiel Data structures for halfplane proximity queries and incremental Voronoi diagrams. (English) Zbl 1410.68361 Algorithmica 80, No. 11, 3316-3334 (2018). MSC: 68U05 68P05 PDF BibTeX XML Cite \textit{B. Aronov} et al., Algorithmica 80, No. 11, 3316--3334 (2018; Zbl 1410.68361) Full Text: DOI
Boyar, Joan; Epstein, Leah; Favrholdt, Lene M.; Larsen, Kim S.; Levin, Asaf Batch coloring of graphs. (English) Zbl 1414.05109 Algorithmica 80, No. 11, 3293-3315 (2018). MSC: 05C15 68W27 PDF BibTeX XML Cite \textit{J. Boyar} et al., Algorithmica 80, No. 11, 3293--3315 (2018; Zbl 1414.05109) Full Text: DOI
Fukunaga, Takuro Approximation algorithms for highly connected multi-dominating sets in unit disk graphs. (English) Zbl 1414.05224 Algorithmica 80, No. 11, 3270-3292 (2018). MSC: 05C69 05C22 68W25 PDF BibTeX XML Cite \textit{T. Fukunaga}, Algorithmica 80, No. 11, 3270--3292 (2018; Zbl 1414.05224) Full Text: DOI
de Berg, Mark; Gudmundsson, Joachim; Mehrabi, Ali D. Finding pairwise intersections inside a query range. (English) Zbl 1410.68367 Algorithmica 80, No. 11, 3253-3269 (2018). MSC: 68U05 68P05 PDF BibTeX XML Cite \textit{M. de Berg} et al., Algorithmica 80, No. 11, 3253--3269 (2018; Zbl 1410.68367) Full Text: DOI
Baveja, Alok; Chavan, Amit; Nikiforov, Andrei; Srinivasan, Aravind; Xu, Pan Improved bounds in stochastic matching and optimization. (English) Zbl 1423.90158 Algorithmica 80, No. 11, 3225-3252 (2018). MSC: 90C15 90C27 68W20 68W25 PDF BibTeX XML Cite \textit{A. Baveja} et al., Algorithmica 80, No. 11, 3225--3252 (2018; Zbl 1423.90158) Full Text: DOI
Bille, Philip; Christiansen, Anders Roy; Cording, Patrick Hagge; Gørtz, Inge Li; Skjoldjensen, Frederik Rye; Vildhøj, Hjalte Wedel; Vind, Søren Dynamic relative compression, dynamic partial sums, and substring concatenation. (English) Zbl 1410.68415 Algorithmica 80, No. 11, 3207-3224 (2018). MSC: 68W32 68P30 PDF BibTeX XML Cite \textit{P. Bille} et al., Algorithmica 80, No. 11, 3207--3224 (2018; Zbl 1410.68415) Full Text: DOI
Afshani, Peyman; Tsakalidis, Konstantinos Optimal deterministic shallow cuttings for 3-d dominance ranges. (English) Zbl 1412.68285 Algorithmica 80, No. 11, 3192-3206 (2018). MSC: 68U05 68P05 68Q25 PDF BibTeX XML Cite \textit{P. Afshani} and \textit{K. Tsakalidis}, Algorithmica 80, No. 11, 3192--3206 (2018; Zbl 1412.68285) Full Text: DOI
Biniaz, Ahmad; Bose, Prosenjit; Eppstein, David; Maheshwari, Anil; Morin, Pat; Smid, Michiel Spanning trees in multipartite geometric graphs. (English) Zbl 1410.68280 Algorithmica 80, No. 11, 3177-3191 (2018). MSC: 68R10 05C85 68U05 PDF BibTeX XML Cite \textit{A. Biniaz} et al., Algorithmica 80, No. 11, 3177--3191 (2018; Zbl 1410.68280) Full Text: DOI
Luo, Wenchang; Xu, Yao; Gu, Boyuan; Tong, Weitian; Goebel, Randy; Lin, Guohui Algorithms for communication scheduling in data gathering network with data compression. (English) Zbl 1410.68069 Algorithmica 80, No. 11, 3158-3176 (2018). MSC: 68M20 68P30 68W25 PDF BibTeX XML Cite \textit{W. Luo} et al., Algorithmica 80, No. 11, 3158--3176 (2018; Zbl 1410.68069) Full Text: DOI
Boros, Endre; Elbassioni, Khaled; Fouz, Mahmoud; Gurvich, Vladimir; Makino, Kazuhisa; Manthey, Bodo Approximation schemes for stochastic mean payoff games with perfect information and few random positions. (English) Zbl 1417.91070 Algorithmica 80, No. 11, 3132-3157 (2018). MSC: 91A15 91A05 68Q25 PDF BibTeX XML Cite \textit{E. Boros} et al., Algorithmica 80, No. 11, 3132--3157 (2018; Zbl 1417.91070) Full Text: DOI
Auletta, Vincenzo; Ferraioli, Diodato; Pasquale, Francesco; Persiano, Giuseppe Metastability of logit dynamics for coordination games. (English) Zbl 1417.91092 Algorithmica 80, No. 11, 3078-3131 (2018). MSC: 91A22 91A26 60J20 PDF BibTeX XML Cite \textit{V. Auletta} et al., Algorithmica 80, No. 11, 3078--3131 (2018; Zbl 1417.91092) Full Text: DOI
Carmi, Paz; Chaitman-Yerushalmi, Lilach; Trabelsi, Ohad Bounded-hop communication networks. (English) Zbl 1410.68366 Algorithmica 80, No. 11, 3050-3077 (2018). MSC: 68U05 68W25 90B18 90C35 PDF BibTeX XML Cite \textit{P. Carmi} et al., Algorithmica 80, No. 11, 3050--3077 (2018; Zbl 1410.68366) Full Text: DOI
Chakraborty, Maitri; Milani, Alessia; Mosteiro, Miguel A. A faster exact-counting protocol for anonymous dynamic networks. (English) Zbl 1410.68047 Algorithmica 80, No. 11, 3023-3049 (2018). MSC: 68M12 68R10 68W15 PDF BibTeX XML Cite \textit{M. Chakraborty} et al., Algorithmica 80, No. 11, 3023--3049 (2018; Zbl 1410.68047) Full Text: DOI
van Iersel, Leo; Kelk, Steven; Stamoulis, Georgios; Stougie, Leen; Boes, Olivier On unrooted and root-uncertain variants of several well-known phylogenetic network problems. (English) Zbl 1410.68178 Algorithmica 80, No. 11, 2993-3022 (2018). MSC: 68Q25 68Q17 92D15 PDF BibTeX XML Cite \textit{L. van Iersel} et al., Algorithmica 80, No. 11, 2993--3022 (2018; Zbl 1410.68178) Full Text: DOI
Fernandes, Cristina G.; Schouery, Rafael C. S. Approximation algorithms for the max-buying problem with limited supply. (English) Zbl 1412.91027 Algorithmica 80, No. 11, 2973-2992 (2018). MSC: 91B26 68W20 68W25 91B24 91B42 PDF BibTeX XML Cite \textit{C. G. Fernandes} and \textit{R. C. S. Schouery}, Algorithmica 80, No. 11, 2973--2992 (2018; Zbl 1412.91027) Full Text: DOI