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 2021-08-01 to 2025-08-01.)

Article	Citations
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity	12
Observation and Distinction: Representing Information in Infinite Games	11
The Parameterized Complexity of s-Club with Triangle and Seed Constraints	8
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance	7
Complexity Limitations on One-turn Quantum Refereed Games	6
Strategic Candidacy Equilibria for Common Voting Rules	6
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings	5
Beyond the Existential Theory of the Reals	4
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs	4
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs	4
New Results on the Remote Set Problem and Its Applications in Complexity Study	3
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete	3
On the Transformation of LL(k)-linear to LL(1)-linear Grammars	3
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes	2
Submodular Functions and Rooted Trees	2
On the structure of solution-sets to regular word equations	2
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020	2
Label Ranking Through Nonparametric Regression	2
Control Structures in Computable Numberings and the Completion Operator	2
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees	2
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams	2
Non-Existence of Stable Social Groups in Information-Driven Networks	2
Rudin-Shapiro Sums Via Automata Theory and Logic	2
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)	2
Ergodic Theorems and Converses for PSPACE Functions	1

Maximum Stable Matching with One-Sided Ties of Bounded Length	1
The Complexity of the Distributed Constraint Satisfaction Problem	1
Approximation Algorithms for the MAXSPACE Advertisement Problem	1
Quantum Algorithm for Lexicographically Minimal String Rotation	1
One-Sided Markets with Externalities	1
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems	1
Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs	1
The Complexity of Unavoidable Word Patterns	1
Preface of STACS 2021 Special Issue	1
Correction to: How to Play Old Maid with Virtual Players	1
Longest Common Subsequence with Gap Constraints	1
How to Play Old Maid with Virtual Players	1
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity	1
Stable Multi-Level Monotonic Eroders	1
Jumping Automata over Infinite Words	1
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning	1
The Power Word Problem in Graph Products	1
Placing Green Bridges Optimally, with a Multivariate Analysis	1
Approximation algorithms for node and element connectivity augmentation problems	1
Online Matching with Delays and Stochastic Arrival Times	1
On the Solution Sets of Three-Variable Word Equations	1
Cluster Editing for Multi-Layer and Temporal Graphs	1
International Colloquium on Automata, Languages and Programming (ICALP 2020)	1
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022	1
A Local Search Algorithm for the Radius-Constrained k-Median Problem	1
Preface of STACS 2020 Special Issue	1
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms	1
Improved Methods to Solve Nonlinear Invariants with Low Algebraic Degree for Linear Transformation	1
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus	1
Greedy Minimum-Energy Scheduling	1
String Attractors of Some Simple-Parry Automatic Sequences	1
b-Coloring Parameterized by Clique-Width	1
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions	1
Correction to: Farkas Bounds on Horn Constraint Systems	1
Gathering on Rings for Myopic Asynchronous Robots with Lights	1