OOIR: Observatory of International Research

Papers

(The TQCC of Theory of Computing Systems is 1. 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-10-01 to 2024-10-01.)

Article	Citations
Faster Parameterized Algorithm for Cluster Vertex Deletion	12
The Price of Fairness for Indivisible Goods	11
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems	7
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences	7
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization	6
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets	6
Approximation Results for Makespan Minimization with Budgeted Uncertainty	6
Multistage Vertex Cover	6
Computability of Products of Chainable Continua	6
FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints	6
A Parameterized Complexity View on Collapsing k-Cores	5
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria	5
Restart Strategies in a Continuous Setting	4
Finite Sequentiality of Unambiguous Max-Plus Tree Automata	4
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms	4
Parameterized Complexity of Conflict-Free Set Cover	4
Impartial Selection with Additive Approximation Guarantees	4
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System	4
On the Expressive Power of Linear Algebra on Graphs	4
Streaming Algorithms for Bin Packing and Vector Scheduling	3
Constructing Antidictionaries of Long Texts in Output-Sensitive Space	3
Fast Scheduling in Distributed Transactional Memory	3
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion	3
On Triangle Estimation Using Tripartite Independent Set Queries	3
Target Set Selection Parameterized by Vertex Cover and More	3

Typical Sequences Revisited — Computing Width Parameters of Graphs	3
Subclasses of Ptime Interpreted by Programming Languages	2
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows	2
Weighted Tree Automata with Constraints	2
Fixed-Parameter Tractability of (n − k) List Coloring	2
Stable Divisorial Gonality is in NP	2
An Automaton Group with PSPACE-Complete Word Problem	2
On Polynomial Recursive Sequences	2
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs	2
Index-based, High-dimensional, Cosine Threshold Querying with Optimality Guarantees	2
A Framework for Memory Efficient Context-Sensitive Program Analysis	2
Managing Multiple Mobile Resources	2
Computing the Number of Affine Equivalent Classes on $\mathcal {R}(s,n)/\mathcal {R}(k,n)$	2
Factorizing Strings into Repetitions	2
Reachability Problems on Reliable and Lossy Queue Automata	1
Maximum Stable Matching with One-Sided Ties of Bounded Length	1
Second-Order Finite Automata	1
Well-Covered Graphs With Constraints On $$\Delta $$ And $$\delta $$	1
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)	1
The Space Complexity of Sum Labelling	1
On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers	1
The Complexity of Counting CSPd	1
Subgroup Membership in GL(2,Z)	1
Expansivity and Periodicity in Algebraic Subshifts	1
A One Pass Streaming Algorithm for Finding Euler Tours	1
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions	1
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata	1
Improved Bounds for Matching in Random-Order Streams	1
On the Decision Tree Complexity of Threshold Functions	1
On Tseitin Formulas, Read-Once Branching Programs and Treewidth	1
Disentangling the Computational Complexity of Network Untangling	1
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model	1
Quantum Algorithm for Lexicographically Minimal String Rotation	1
Decidability and Periodicity of Low Complexity Tilings	1
The Power Word Problem in Graph Products	1
Polynomially Ambiguous Unary Weighted Automata over Fields	1
Performing Regular Operations with 1-Limited Automata	1
On the structure of solution-sets to regular word equations	1
Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs	1
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes	1
Nonuniform Reductions and NP-Completeness	1
Beyond the Existential Theory of the Reals	1
Stable Multi-Level Monotonic Eroders	1
Fixed-Parameter Algorithms for Unsplittable Flow Cover	1