Algorithmica
Algorithmica
ISSNs: 0178-4617
Additional searchable ISSN (electronic): 1432-0541
Springer, United States
Scopus rating (2023): CiteScore 2.8 SJR 0.905 SNIP 1.151
Journal
Research Output
- 2019
- Published
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
Chen, Z., Lin, G., Wang, L., Chen, Y. & Wang, D., Nov 2019, In: Algorithmica. 81, 11-12, p. 4167–4199Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 5 - Published
Network Pollution Games
Anastasiadis, E., Deng, X., Krysta, P., Li, M., Qiao, H. & Zhang, J., Jan 2019, In: Algorithmica. 81, 1, p. 124-166Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 7 - 2017
- Published
A Polynomial Time Approximation Scheme for the Closest Shared Center Problem
Li, W., Wang, L. & Cui, W., Jan 2017, In: Algorithmica. 77, 1, p. 65-83Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
- 2016
- Published
Randomized Fixed-Parameter Algorithms for the Closest String Problem
Chen, Z., Ma, B. & Wang, L., Jan 2016, In: Algorithmica. 74, 1, p. 466-484Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 5 - 2014
- Published
The parameterized complexity of the shared center problem
Chen, Z., Ma, W. & Wang, L., Jun 2014, In: Algorithmica. 69, 2, p. 269-293Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 2 - Published
Register Loading via Linear Programming
Calinescu, G. & Li, M., 30 May 2014, In: Algorithmica. 72, 4, p. 1011-1032Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 2 - 2011
- Published
Tighter approximation bounds for minimum CDS in unit disk graphs
Li, M., Wan, P. & Yao, F., Dec 2011, In: Algorithmica (New York). 61, 4, p. 1000-1021Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 23 - Published
On incentive compatible competitive selection protocols
Chen, X., Deng, X. & Liu, B. J., Oct 2011, In: Algorithmica (New York). 61, 2, p. 447-462Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 2 - Published
An approximation algorithm for the minimum co-path set problem
Chen, Z., Lin, G. & Wang, L., Aug 2011, In: Algorithmica (New York). 60, 4, p. 969-986Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 7 - 2010
- Published
Introduction to the Special Section on Internet and Network Economics
Deng, X. & Graham, F. C., Dec 2010, In: Algorithmica. 58, 4, p. 928-929Research output: Journal Publications and Reviews › Editorial Preface › peer-review
- Published
On Robustness of Forward-looking in Sponsored Search Auction
Bu, T., Liang, L. & Qi, Q., Dec 2010, In: Algorithmica. 58, 4, p. 970-989Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 8 - 2009
- Published
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
Chen, Z., Wang, L. & Wang, Z., Aug 2009, In: Algorithmica (New York). 54, 4, p. 501-529Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 3 - 2008
- Published
Preface
Deng, X. & Ye, Y., Sept 2008, In: Algorithmica. 52, 1, p. 1-2Research output: Journal Publications and Reviews › Editorial Preface
- Published
Embedding of cycles in twisted cubes with edge-pancyclic
Fan, J., Jia, X. & Lin, X., Jul 2008, In: Algorithmica (New York). 51, 3, p. 264-282Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 52 - Published
Preface
Deng, X. & Du, D., Jul 2008, In: Algorithmica. 51, 3, p. 237-238Research output: Journal Publications and Reviews › Editorial Preface
- Published
Space efficient algorithms for ordered tree comparison
Wang, L. & Zhang, K., Jul 2008, In: Algorithmica (New York). 51, 3, p. 283-297Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 8 - 2007
- Published
K-nearest-neighbor clustering and percolation theory
Teng, S. & Yao, F. F., Nov 2007, In: Algorithmica (New York). 49, 3, p. 192-211Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 13 - Published
Algorithmica (New York): Foreword
Wang, L., Jun 2007, In: Algorithmica (New York). 48, 2Research output: Journal Publications and Reviews › Editorial Preface
- Published
On Walrasian Price of CPU Time
Deng, X., Huang, L. & Li, M., Jun 2007, In: Algorithmica (New York). 48, 2, p. 159-172Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 5 - 2004
- Published
Minimum k arborescences with bandwidth constraints
Cai, M., Deng, X. & Wang, L., Jan 2004, In: Algorithmica (New York). 38, 4, p. 529-537Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Scopus citations: 10