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-05-01 to 2024-05-01.)

Article	Citations
Faster Parameterized Algorithm for Cluster Vertex Deletion	12
The Price of Fairness for Indivisible Goods	11
Forward Looking Huffman Coding	10
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences	7
Approximation Results for Makespan Minimization with Budgeted Uncertainty	6
FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints	6
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization	6
Derandomization for Sliding Window Algorithms with Strict Correctness∗	6
Computability of Products of Chainable Continua	5
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings	5
Semi-Oblivious Chase Termination: The Sticky Case	5
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets	5
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems	5
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria	5
Consistent Query Answering for Primary Keys in Datalog	4
Parameterized Complexity of Min-Power Asymmetric Connectivity	4
Multistage Vertex Cover	4
A Parameterized Complexity View on Collapsing k-Cores	4
Finite Sequentiality of Unambiguous Max-Plus Tree Automata	3
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion	3
Restart Strategies in a Continuous Setting	3
Target Set Selection Parameterized by Vertex Cover and More	3
Streaming Algorithms for Bin Packing and Vector Scheduling	3
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms	3
On the Relation Between Structured d-DNNFs and SDDs	3

Fast Scheduling in Distributed Transactional Memory	3
On the Expressive Power of Linear Algebra on Graphs	3
Impartial Selection with Additive Approximation Guarantees	3
On Triangle Estimation Using Tripartite Independent Set Queries	3
Analyzing Clustering and Partitioning Problems in Selected VLSI Models	2
Index-based, High-dimensional, Cosine Threshold Querying with Optimality Guarantees	2
The Non-hardness of Approximating Circuit Size	2
Typical Sequences Revisited — Computing Width Parameters of Graphs	2
On the Average Case of MergeInsertion	2
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs	2
Dichotomy for Holant∗ Problems on the Boolean Domain	2
Stable Divisorial Gonality is in NP	2
Computing the k-Visibility Region of a Point in a Polygon	2
An Automaton Group with PSPACE-Complete Word Problem	2
Managing Multiple Mobile Resources	2
Computing the Number of Affine Equivalent Classes on $\mathcal {R}(s,n)/\mathcal {R}(k,n)$	2
Fixed-Parameter Tractability of (n − k) List Coloring	2
On Decidability of Theories of Regular Languages	2
Constructing Antidictionaries of Long Texts in Output-Sensitive Space	2
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System	2
Parameterized Complexity of Conflict-Free Set Cover	2
On Envy-Free Revenue Approximation for Combinatorial Buyers with Budgets	1
Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs	1
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)	1
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes	1
On Tseitin Formulas, Read-Once Branching Programs and Treewidth	1
On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers	1
Expansivity and Periodicity in Algebraic Subshifts	1
Fixed-Parameter Algorithms for Unsplittable Flow Cover	1
Factorizing Strings into Repetitions	1
Exploration of Dynamic Cactuses with Sub-logarithmic Overhead	1
Subclasses of Ptime Interpreted by Programming Languages	1
On Polynomial Recursive Sequences	1
On the structure of solution-sets to regular word equations	1
Weighted Tree Automata with Constraints	1
The Space Complexity of Sum Labelling	1
Disentangling the Computational Complexity of Network Untangling	1
Nonuniform Reductions and NP-Completeness	1
Decidability and Periodicity of Low Complexity Tilings	1
Maximum Stable Matching with One-Sided Ties of Bounded Length	1
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata	1
Improved Bounds for Matching in Random-Order Streams	1
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows	1
Multiplication Algorithm Based on Collatz Function	1
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata	1
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs	1
Beyond the Existential Theory of the Reals	1
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model	1
Reachability Problems on Reliable and Lossy Queue Automata	1
A One Pass Streaming Algorithm for Finding Euler Tours	1

A Framework for Memory Efficient Context-Sensitive Program Analysis