Theory of Computing Systems

0.5(top 50%)

impact factor

1.4K(top 20%)

papers

13.8K(top 20%)

citations

47(top 20%)

h-index

0.6(top 50%)

impact factor

1.6K

all documents

14.8K

doc citations

75(top 20%)

g-index

Top Articles

#	Title	Journal	Year	Citations
1	Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width	Theory of Computing Systems	2000	551
2	Balanced Graph Partitioning	Theory of Computing Systems	2006	252
3	Compressed Suffix Trees with Full Functionality	Theory of Computing Systems	2007	227
4	Generating Shorter Bases for Hard Random Lattices	Theory of Computing Systems	2011	226
5	Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization	Theory of Computing Systems	2006	201
6	On covering problems of codes	Theory of Computing Systems	1997	155
7	Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation	Theory of Computing Systems	2005	144
8	First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing	Theory of Computing Systems	1998	114
9	Polynomial closure and unambiguous product	Theory of Computing Systems	1997	102
10	Accessing Nearby Copies of Replicated Objects in a Distributed Environment	Theory of Computing Systems	1999	98
11	Thread Scheduling for Multiprogrammed Multiprocessors	Theory of Computing Systems	2001	98
12	Crown Structures for Vertex Cover Kernelization	Theory of Computing Systems	2007	97
13	Parameterized Complexity of Vertex Cover Variants	Theory of Computing Systems	2007	94
14	The Data Locality of Work Stealing	Theory of Computing Systems	2002	93
15	Space Efficient Hash Tables with Worst Case Constant Access Time	Theory of Computing Systems	2005	90
16	Verification of Quantum Computation: An Overview of Existing Approaches	Theory of Computing Systems	2019	88
17	Approximate Equilibria and Ball Fusion	Theory of Computing Systems	2003	87
18	Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems	Theory of Computing Systems	2006	83
19	Network Design with Weighted Players	Theory of Computing Systems	2009	82
20	Speed Scaling of Tasks with Precedence Constraints	Theory of Computing Systems	2008	80
21	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number	Theory of Computing Systems	2009	75
22	On Approximation Properties of the Independent Set Problem for Low Degree Graphs	Theory of Computing Systems	1999	74
23	Fixed-Parameter Algorithms for Cluster Vertex Deletion	Theory of Computing Systems	2010	74
24	Finite Presentations of Infinite Structures: Automata and Interpretations	Theory of Computing Systems	2004	73
25	On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction	Theory of Computing Systems	2008	72
26	The Efficiency of Fair Division	Theory of Computing Systems	2012	72
27	Diffusion Schemes for Load Balancing on Heterogeneous Networks	Theory of Computing Systems	2002	66
28	A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction	Theory of Computing Systems	1998	65
29	Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment	Theory of Computing Systems	2004	65
30	Vertex Cover Kernelization Revisited	Theory of Computing Systems	2013	65
31	Undecidable Problems for Probabilistic Automata of Fixed Dimension	Theory of Computing Systems	2003	63
32	Exact Complexity of the Winner Problem for Young Elections	Theory of Computing Systems	2003	60
33	A Cubic Kernel for Feedback Vertex Set and Loop Cutset	Theory of Computing Systems	2010	59
34	An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem	Theory of Computing Systems	2007	56
35	Vertex Cover Problem Parameterized Above and Below Tight Bounds	Theory of Computing Systems	2011	56
36	Dynamic Programming for Minimum Steiner Trees	Theory of Computing Systems	2007	54
37	Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications	Theory of Computing Systems	2009	54
38	Nash Equilibria and the Price of Anarchy for Flows over Time	Theory of Computing Systems	2011	54
39	Clique-Width for 4-Vertex Forbidden Subgraphs	Theory of Computing Systems	2006	53
40	Towards a Scalable and Robust DHT	Theory of Computing Systems	2009	53
41	Elimination Trees and the Construction of Pools and Stacks	Theory of Computing Systems	1997	52
42	On Multidimensional Curves with Hilbert Property	Theory of Computing Systems	2000	52
43	Numeration Systems on a Regular Language	Theory of Computing Systems	2000	51
44	Algebraic Results on Quantum Automata	Theory of Computing Systems	2006	51
45	Applying Modular Decomposition to Parameterized Cluster Editing Problems	Theory of Computing Systems	2009	51
46	Fixed Points, Nash Equilibria, and the Existential Theory of the Reals	Theory of Computing Systems	2017	51
47	DNA Computing Based on Splicing: The Existence of Universal Computers	Theory of Computing Systems	1999	49
48	Characterizing the Existence of Potential Functions in Weighted Congestion Games	Theory of Computing Systems	2011	49
49	Equational Elements in Additive Algebras	Theory of Computing Systems	1999	48
50	Selfish Routing with Incomplete Information	Theory of Computing Systems	2008	48

Scientometrics

Overviews

Citing Bodies

Theory of Computing Systems

Top Articles