ACM Transactions on Algorithms

1.4(top 50%)

impact factor

813(top 20%)

papers

14.4K(top 20%)

citations

57(top 10%)

h-index

1.4(top 50%)

impact factor

953

all documents

15.5K

doc citations

86(top 10%)

g-index

Top Articles

#	Title	Journal	Year	Citations
1	Multiplierless multiple constant multiplication	ACM Transactions on Algorithms	2007	321
2	Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets	ACM Transactions on Algorithms	2007	292
3	Skip graphs	ACM Transactions on Algorithms	2007	273
4	Compressed representations of sequences and full-text indexes	ACM Transactions on Algorithms	2007	271
5	Algorithmic construction of sets for k -restrictions	ACM Transactions on Algorithms	2006	218
6	Frugal path mechanisms	ACM Transactions on Algorithms	2007	185
7	Fast sparse matrix multiplication	ACM Transactions on Algorithms	2005	173
8	A new approximation algorithm for the asymmetric TSP with triangle inequality	ACM Transactions on Algorithms	2008	158
9	Algorithms for power savings	ACM Transactions on Algorithms	2007	151
10	Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm	ACM Transactions on Algorithms	2010	148
11	A 4 k ² kernel for feedback vertex set	ACM Transactions on Algorithms	2010	146
12	Finding the k shortest simple paths	ACM Transactions on Algorithms	2007	143
13	Energy-efficient algorithms for flow time minimization	ACM Transactions on Algorithms	2007	140
14	A better approximation ratio for the vertex cover problem	ACM Transactions on Algorithms	2009	129
15	Improved algorithms for orienteering and related problems	ACM Transactions on Algorithms	2012	128
16	Fully Functional Static and Dynamic Succinct Trees	ACM Transactions on Algorithms	2014	121
17	Faster Parameterized Algorithms Using Linear Programming	ACM Transactions on Algorithms	2014	109
18	An optimal decomposition algorithm for tree edit distance	ACM Transactions on Algorithms	2009	108
19	Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs	ACM Transactions on Algorithms	2005	103
20	Cache-Oblivious Algorithms	ACM Transactions on Algorithms	2012	100
21	Kernelization Lower Bounds Through Colors and IDs	ACM Transactions on Algorithms	2014	100
22	The string edit distance matching problem with moves	ACM Transactions on Algorithms	2007	97
23	Tight bounds for worst-case equilibria	ACM Transactions on Algorithms	2007	95
24	Convergence time to Nash equilibrium in load balancing	ACM Transactions on Algorithms	2007	94
25	Perfect matchings via uniform sampling in regular bipartite graphs	ACM Transactions on Algorithms	2010	92
26	Computing almost shortest paths	ACM Transactions on Algorithms	2005	89
27	The priority R-tree	ACM Transactions on Algorithms	2008	88
28	Faster fixed parameter tractable algorithms for finding feedback vertex sets	ACM Transactions on Algorithms	2006	81
29	Nearest-neighbor-preserving embeddings	ACM Transactions on Algorithms	2007	80
30	Multicommodity demand flow in a tree and packing integer programs	ACM Transactions on Algorithms	2007	80
31	Maintaining information in fully dynamic trees with top trees	ACM Transactions on Algorithms	2005	76
32	Dynamic entropy-compressed sequences and full-text indexes	ACM Transactions on Algorithms	2008	76
33	Combinatorial bounds via measure and conquer	ACM Transactions on Algorithms	2008	76
34	Secure multiparty computation of approximations	ACM Transactions on Algorithms	2006	74
35	Approximating rank-width and clique-width quickly	ACM Transactions on Algorithms	2008	74
36	Additive spanners and (α, β)-spanners	ACM Transactions on Algorithms	2010	74
37	A general approach to online network optimization problems	ACM Transactions on Algorithms	2006	73
38	Approximate distance oracles for unweighted graphs in expected O ( n 2 ) time	ACM Transactions on Algorithms	2006	72
39	When indexing equals compression	ACM Transactions on Algorithms	2006	72
40	Rank-maximal matchings	ACM Transactions on Algorithms	2006	70
41	Algorithms for distributed functional monitoring	ACM Transactions on Algorithms	2011	70
42	Succinct ordinal trees with level-ancestor queries	ACM Transactions on Algorithms	2006	69
43	Compressed indexes for dynamic text collections	ACM Transactions on Algorithms	2007	69
44	Achieving anonymity via clustering	ACM Transactions on Algorithms	2010	68
45	Label-guided graph exploration by a finite automaton	ACM Transactions on Algorithms	2008	66
46	How to meet asynchronously (almost) everywhere	ACM Transactions on Algorithms	2012	66
47	Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions	ACM Transactions on Algorithms	2016	65
48	Provably good moving least squares	ACM Transactions on Algorithms	2008	64
49	An O ( n log n ) approximation scheme for Steiner tree in planar graphs	ACM Transactions on Algorithms	2009	64
50	The compressed permuterm index	ACM Transactions on Algorithms	2010	64

Scientometrics

Overviews

Citing Bodies

ACM Transactions on Algorithms

Top Articles