Theory of Computing Systems

Papers
(The TQCC of Theory of Computing Systems is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-03-01 to 2024-03-01.)
ArticleCitations
Faster Parameterized Algorithm for Cluster Vertex Deletion12
Token Sliding on Split Graphs12
Forward Looking Huffman Coding10
The Price of Fairness for Indivisible Goods10
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization6
Derandomization for Sliding Window Algorithms with Strict Correctness∗6
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences6
FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints6
Semi-Oblivious Chase Termination: The Sticky Case5
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets5
Approximation Results for Makespan Minimization with Budgeted Uncertainty5
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria5
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems5
Computability of Products of Chainable Continua5
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings5
A Parameterized Complexity View on Collapsing k-Cores4
First-Order Orbit Queries4
Parameterized Complexity of Min-Power Asymmetric Connectivity4
Multistage Vertex Cover4
Consistent Query Answering for Primary Keys in Datalog4
Finite Sequentiality of Unambiguous Max-Plus Tree Automata3
On the Expressive Power of Linear Algebra on Graphs3
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms3
Restart Strategies in a Continuous Setting3
Streaming Algorithms for Bin Packing and Vector Scheduling3
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion3
Impartial Selection with Additive Approximation Guarantees3
An Improved FPT Algorithm for Independent Feedback Vertex Set3
Fast Scheduling in Distributed Transactional Memory3
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures3
Unpopularity Factor in the Marriage and Roommates Problems3
On the Relation Between Structured d-DNNFs and SDDs3
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System2
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs2
Dichotomy for Holant∗ Problems on the Boolean Domain2
The Non-hardness of Approximating Circuit Size2
Typical Sequences Revisited — Computing Width Parameters of Graphs2
Managing Multiple Mobile Resources2
Santha-Vazirani sources, deterministic condensers and very strong extractors2
Fixed-Parameter Tractability of (n − k) List Coloring2
Computing the k-Visibility Region of a Point in a Polygon2
On Triangle Estimation Using Tripartite Independent Set Queries2
Target Set Selection Parameterized by Vertex Cover and More2
Parameterized Complexity of Conflict-Free Set Cover2
Computing the Number of Affine Equivalent Classes on $\mathcal {R}(s,n)/\mathcal {R}(k,n)$2
Index-based, High-dimensional, Cosine Threshold Querying with Optimality Guarantees2
Constructing Antidictionaries of Long Texts in Output-Sensitive Space2
0.020411968231201