Nagarajan, Viswanath; Ravi, R. The directed orienteering problem. (English) Zbl 1279.90177 Algorithmica 60, No. 4, 1017-1030 (2011). MSC: 90C35 05C20 68R10 68W25 PDFBibTeX XMLCite \textit{V. Nagarajan} and \textit{R. Ravi}, Algorithmica 60, No. 4, 1017--1030 (2011; Zbl 1279.90177) Full Text: DOI
Gudmundsson, Joachim; Morin, Pat; Smid, Michiel Algorithms for marketing-mix optimization. (English) Zbl 1217.90129 Algorithmica 60, No. 4, 1004-1016 (2011). MSC: 90B60 68U05 68W25 PDFBibTeX XMLCite \textit{J. Gudmundsson} et al., Algorithmica 60, No. 4, 1004--1016 (2011; Zbl 1217.90129) Full Text: DOI arXiv
Koutsonas, Athanassios; Thilikos, Dimitrios M. Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms. (English) Zbl 1219.68123 Algorithmica 60, No. 4, 987-1003 (2011). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{A. Koutsonas} and \textit{D. M. Thilikos}, Algorithmica 60, No. 4, 987--1003 (2011; Zbl 1219.68123) Full Text: DOI
Chen, Zhi-Zhong; Lin, Guohui; Wang, Lusheng An approximation algorithm for the minimum co-path set problem. (English) Zbl 1216.68337 Algorithmica 60, No. 4, 969-986 (2011). MSC: 68W25 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{Z.-Z. Chen} et al., Algorithmica 60, No. 4, 969--986 (2011; Zbl 1216.68337) Full Text: DOI
Buresh-Oppenheim, Joshua; Davis, Sashka; Impagliazzo, Russell A stronger model of dynamic programming algorithms. (English) Zbl 1220.90155 Algorithmica 60, No. 4, 938-968 (2011). MSC: 90C39 05C70 PDFBibTeX XMLCite \textit{J. Buresh-Oppenheim} et al., Algorithmica 60, No. 4, 938--968 (2011; Zbl 1220.90155) Full Text: DOI
Angelini, Patrizio; Di Battista, Giuseppe; Patrignani, Maurizio Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time. (English) Zbl 1217.05064 Algorithmica 60, No. 4, 890-937 (2011). MSC: 05C10 05C60 05C85 68W40 PDFBibTeX XMLCite \textit{P. Angelini} et al., Algorithmica 60, No. 4, 890--937 (2011; Zbl 1217.05064) Full Text: DOI
Bansal, Nikhil; Bunde, David P.; Chan, Ho-Leung; Pruhs, Kirk Average rate speed scaling. (English) Zbl 1216.68060 Algorithmica 60, No. 4, 877-889 (2011). MSC: 68M20 68W27 PDFBibTeX XMLCite \textit{N. Bansal} et al., Algorithmica 60, No. 4, 877--889 (2011; Zbl 1216.68060) Full Text: DOI
Ghodsi, Mohammad; Mahini, Hamid; Mirrokni, Vahab S.; Zadimoghaddam, Morteza Permutation betting markets: singleton betting with extra information. (English) Zbl 1217.91065 Algorithmica 60, No. 4, 853-876 (2011). MSC: 91B26 68Q17 90C05 PDFBibTeX XMLCite \textit{M. Ghodsi} et al., Algorithmica 60, No. 4, 853--876 (2011; Zbl 1217.91065) Full Text: DOI Link
Djordjevic, Bojan; Gudmundsson, Joachim; Pham, Anh; Wolle, Thomas Detecting regular visit patterns. (English) Zbl 1216.68354 Algorithmica 60, No. 4, 829-852 (2011). MSC: 68W32 68P05 68U05 68W25 PDFBibTeX XMLCite \textit{B. Djordjevic} et al., Algorithmica 60, No. 4, 829--852 (2011; Zbl 1216.68354) Full Text: DOI Link
Dąbrowski, Robert; Plandowski, Wojciech On word equations in one variable. (English) Zbl 1216.68125 Algorithmica 60, No. 4, 819-828 (2011). MSC: 68Q25 68R15 PDFBibTeX XMLCite \textit{R. Dąbrowski} and \textit{W. Plandowski}, Algorithmica 60, No. 4, 819--828 (2011; Zbl 1216.68125) Full Text: DOI
Arnold, Michael; Ohlebusch, Enno Linear time algorithms for generalizations of the longest common substring problem. (English) Zbl 1219.68126 Algorithmica 60, No. 4, 806-818 (2011). MSC: 68R15 68W32 PDFBibTeX XMLCite \textit{M. Arnold} and \textit{E. Ohlebusch}, Algorithmica 60, No. 4, 806--818 (2011; Zbl 1219.68126) Full Text: DOI
Fischer, Eldar; Yahalom, Orly Testing convexity properties of tree colorings. (English) Zbl 1217.05088 Algorithmica 60, No. 4, 766-805 (2011). MSC: 05C15 05C05 05C85 68R10 68Q17 PDFBibTeX XMLCite \textit{E. Fischer} and \textit{O. Yahalom}, Algorithmica 60, No. 4, 766--805 (2011; Zbl 1217.05088) Full Text: DOI
Hoefer, Martin Competitive cost sharing with economies of scale. (English) Zbl 1217.91028 Algorithmica 60, No. 4, 743-765 (2011). MSC: 91A80 91A10 91B32 90B80 PDFBibTeX XMLCite \textit{M. Hoefer}, Algorithmica 60, No. 4, 743--765 (2011; Zbl 1217.91028) Full Text: DOI
Kortsarz, Guy; Mirrokni, Vahab S.; Nutov, Zeev; Tsanko, Elena Approximating minimum-power degree and connectivity problems. (English) Zbl 1216.68045 Algorithmica 60, No. 4, 735-742 (2011). MSC: 68M10 68R10 68W25 PDFBibTeX XMLCite \textit{G. Kortsarz} et al., Algorithmica 60, No. 4, 735--742 (2011; Zbl 1216.68045) Full Text: DOI
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