Albers, Susanne; Janke, Maximilian Scheduling in the random-order model. (English) Zbl 1519.90067 Algorithmica 83, No. 9, 2803-2832 (2021). MSC: 90B35 68W27 PDFBibTeX XMLCite \textit{S. Albers} and \textit{M. Janke}, Algorithmica 83, No. 9, 2803--2832 (2021; Zbl 1519.90067) Full Text: DOI arXiv
Baum, Moritz; Dibbelt, Julian; Pajor, Thomas; Sauer, Jonas; Wagner, Dorothea; Zündorf, Tobias Energy-optimal routes for battery electric vehicles. (English) Zbl 1435.90013 Algorithmica 82, No. 5, 1490-1546 (2020). MSC: 90B06 90C59 90B10 PDFBibTeX XMLCite \textit{M. Baum} et al., Algorithmica 82, No. 5, 1490--1546 (2020; Zbl 1435.90013) Full Text: DOI
Friggstad, Zachary; Rezapour, Mohsen; Salavatipour, Mohammad R.; Soto, Jose A. LP-based approximation algorithms for facility location in buy-at-bulk network design. (English) Zbl 1418.68242 Algorithmica 81, No. 3, 1075-1095 (2019). MSC: 68W25 90B10 90B80 90C10 PDFBibTeX XMLCite \textit{Z. Friggstad} et al., Algorithmica 81, No. 3, 1075--1095 (2019; Zbl 1418.68242) Full Text: DOI
Dieudonné, Yoann; Pelc, Andrzej Impact of knowledge on election time in anonymous networks. (English) Zbl 1410.68057 Algorithmica 81, No. 1, 238-288 (2019). MSC: 68M14 68M10 68W15 PDFBibTeX XMLCite \textit{Y. Dieudonné} and \textit{A. Pelc}, Algorithmica 81, No. 1, 238--288 (2019; Zbl 1410.68057) Full Text: DOI arXiv
Jansen, Klaus; Land, Kati; Maack, Marten Estimating the makespan of the two-valued restricted assignment problem. (English) Zbl 1393.90057 Algorithmica 80, No. 4, 1357-1382 (2018). Reviewer: Jaroslav Janáček (Žilina) MSC: 90B35 90B80 PDFBibTeX XMLCite \textit{K. Jansen} et al., Algorithmica 80, No. 4, 1357--1382 (2018; Zbl 1393.90057) Full Text: DOI Link
Ivanyos, Gábor; Karpinski, Marek; Santha, Miklos; Saxena, Nitin; Shparlinski, Igor E. Polynomial interpolation and identity testing from high powers over finite fields. (English) Zbl 1390.11128 Algorithmica 80, No. 2, 560-575 (2018). MSC: 11T06 11Y16 68Q12 68Q25 PDFBibTeX XMLCite \textit{G. Ivanyos} et al., Algorithmica 80, No. 2, 560--575 (2018; Zbl 1390.11128) Full Text: DOI arXiv
Albers, Susanne; Hellwig, Matthias On the value of job migration in online makespan minimization. (English) Zbl 1372.68039 Algorithmica 79, No. 2, 598-623 (2017). MSC: 68M20 68W27 90B35 PDFBibTeX XMLCite \textit{S. Albers} and \textit{M. Hellwig}, Algorithmica 79, No. 2, 598--623 (2017; Zbl 1372.68039) Full Text: DOI arXiv
Dieudonné, Yoann; Pelc, Andrzej Anonymous meeting in networks. (English) Zbl 1336.68196 Algorithmica 74, No. 2, 908-946 (2016). MSC: 68R10 68M10 68M14 68T42 PDFBibTeX XMLCite \textit{Y. Dieudonné} and \textit{A. Pelc}, Algorithmica 74, No. 2, 908--946 (2016; Zbl 1336.68196) Full Text: DOI arXiv
Ebenlendr, Tomáš; Krčál, Marek; Sgall, Jiří Graph balancing: a special case of scheduling unrelated parallel machines. (English) Zbl 1295.68214 Algorithmica 68, No. 1, 62-80 (2014). Reviewer: Roberto Solis-Oba (London) MSC: 68W25 90B35 68M20 05C85 PDFBibTeX XMLCite \textit{T. Ebenlendr} et al., Algorithmica 68, No. 1, 62--80 (2014; Zbl 1295.68214) Full Text: DOI
Makino, Kazuhisa; Tamaki, Suguru; Yamamoto, Masaki Derandomizing the HSSW algorithm for 3-SAT. (English) Zbl 1277.68097 Algorithmica 67, No. 2, 112-124 (2013). MSC: 68Q25 68W40 68W20 PDFBibTeX XMLCite \textit{K. Makino} et al., Algorithmica 67, No. 2, 112--124 (2013; Zbl 1277.68097) Full Text: DOI arXiv
Fusco, Emanuele G.; Pelc, Andrzej Trade-offs between the size of advice and broadcasting time in trees. (English) Zbl 1216.68042 Algorithmica 60, No. 4, 719-734 (2011). MSC: 68M07 68M14 68R10 68Q17 05C05 PDFBibTeX XMLCite \textit{E. G. Fusco} and \textit{A. Pelc}, Algorithmica 60, No. 4, 719--734 (2011; Zbl 1216.68042) Full Text: DOI Link
Cho, Sung-woo; Goel, Ashish Pricing for fairness: distributed resource allocation for multiple objectives. (English) Zbl 1344.68273 Algorithmica 57, No. 4, 873-892 (2010). MSC: 68W15 68M12 68W25 90B10 91B32 PDFBibTeX XMLCite \textit{S.-w. Cho} and \textit{A. Goel}, Algorithmica 57, No. 4, 873--892 (2010; Zbl 1344.68273) Full Text: DOI
Degener, Bastian; Gehweiler, Joachim; Lammersen, Christiane Kinetic facility location. (English) Zbl 1201.68041 Algorithmica 57, No. 3, 562-584 (2010). MSC: 68P05 90B80 PDFBibTeX XMLCite \textit{B. Degener} et al., Algorithmica 57, No. 3, 562--584 (2010; Zbl 1201.68041) Full Text: DOI
Ishii, Toshimasa; Akiyama, Yoko; Nagamochi, Hiroshi Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs. (English) Zbl 1187.05042 Algorithmica 56, No. 4, 413-436 (2010). MSC: 05C40 05C85 68R10 PDFBibTeX XMLCite \textit{T. Ishii} et al., Algorithmica 56, No. 4, 413--436 (2010; Zbl 1187.05042) Full Text: DOI Link
Eisenbrand, Friedrich; Karrenbauer, Andreas; Skutella, Martin; Xu, Chihao Multiline addressing by network flow. (English) Zbl 1168.90358 Algorithmica 53, No. 4, 583-596 (2009). MSC: 90B10 90C27 PDFBibTeX XMLCite \textit{F. Eisenbrand} et al., Algorithmica 53, No. 4, 583--596 (2009; Zbl 1168.90358) Full Text: DOI
Xu, Ying An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks. (English) Zbl 1045.68026 Algorithmica 36, No. 1, 93-96 (2003). MSC: 68M14 68M10 PDFBibTeX XMLCite \textit{Y. Xu}, Algorithmica 36, No. 1, 93--96 (2003; Zbl 1045.68026) Full Text: DOI
Radzik, Tomasz; Goldberg, Andrew V. Tight bounds on the number of minimum-mean cycle cancellations and related results. (English) Zbl 0795.68098 Algorithmica 11, No. 3, 226-242 (1994). MSC: 68Q25 68R10 90B10 PDFBibTeX XMLCite \textit{T. Radzik} and \textit{A. V. Goldberg}, Algorithmica 11, No. 3, 226--242 (1994; Zbl 0795.68098) Full Text: DOI
Goldfarb, Donald; Hao, Jianxiu Polynomial-time primal simplex algorithms for the minimum cost network flow problem. (English) Zbl 0761.90037 Algorithmica 8, No. 2, 145-160 (1992). MSC: 90B10 90C05 90C60 90-08 52B12 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{J. Hao}, Algorithmica 8, No. 2, 145--160 (1992; Zbl 0761.90037) Full Text: DOI