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 2022-06-01 to 2026-06-01.)

Article	Citations
The Parameterized Complexity of s-Club with Triangle and Seed Constraints	7
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance	6
Strategic Candidacy Equilibria for Common Voting Rules	5
An Lp-rounding Based Algorithm for Soft Capacitated Facility Location Problem with Submodular Penalties	4
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs	3
On the Transformation of LL(k)-linear to LL(1)-linear Grammars	3
Beyond the Existential Theory of the Reals	3
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete	3
New Results on the Remote Set Problem and Its Applications in Complexity Study	3
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings	3
Complexity Limitations on One-turn Quantum Refereed Games	3
Control Structures in Computable Numberings and the Completion Operator	2
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees	2
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes	2
Non-Existence of Stable Social Groups in Information-Driven Networks	2
Label Ranking Through Nonparametric Regression	2
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams	2
Algebraically Enhanced 3D Chaotic Map with Hash-Based Initialization for Secure Image Encryption	2
Submodular Functions and Rooted Trees	2
A Local Search Algorithm for the Radius-Constrained k-Median Problem	2
Space-Efficient SLP Encoding for $$O(\log N)$$-Time Random Access	2
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020	2
Rudin-Shapiro Sums Via Automata Theory and Logic	2
Individual Preference Facility Location: A Dual-Fitting Framework and Its Extensions	1
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning	1

Improved Methods to Solve Nonlinear Invariants with Low Algebraic Degree for Linear Transformation	1
The Complexity of the Distributed Constraint Satisfaction Problem	1
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus	1
String Attractors of Some Simple-Parry Automatic Sequences	1
The Power Word Problem in Graph Products	1
Correction to: How to Play Old Maid with Virtual Players	1
Approximation algorithms for node and element connectivity augmentation problems	1
Preface of STACS 2020 Special Issue	1
Cluster Editing for Multi-Layer and Temporal Graphs	1
Symmetric Linear Arc Monadic Datalog and Gadget Reductions	1
Ergodic Theorems and Converses for PSPACE Functions	1
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022	1
Testing Intersectingness of Uniform Families	1
Longest Common Subsequence with Gap Constraints	1
Jumping Automata over Infinite Words	1
On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes	1
One-Sided Markets with Externalities	1
The Complexity of Unavoidable Word Patterns	1
Minimum-Cost Mixed Graph Covers with Targeted Weight Constraints	1
Generalization of Repetitiveness Measures for Two-Dimensional Strings	1
Greedy Minimum-Energy Scheduling	1
Online Matching with Delays and Stochastic Arrival Times	1
b-Coloring Parameterized by Clique-Width	1
Preface of STACS 2021 Special Issue	1
Reflection on the Reflection Complexity	1
How to Play Old Maid with Virtual Players	1
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity	1
Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words	1
Degree 2 Lower Bound for Permanent in Arbitrary Characteristic	1
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms	1
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line	1
Placing Green Bridges Optimally, with a Multivariate Analysis	1
Gathering on Rings for Myopic Asynchronous Robots with Lights	1
Sampling and Optimal Preference Elicitation in Simple Mechanisms	1
Subsequence Matching and LCS under Cartesian-Tree Equivalence	1
Correction to: Farkas Bounds on Horn Constraint Systems	1
Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs	1
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions	1
On the Solution Sets of Three-Variable Word Equations	1
Space-Efficient B Trees via Load-Balancing	1
Computing String Covers in Sublinear Time	1
International Colloquium on Automata, Languages and Programming (ICALP 2020)	1
Decision Problems Concerning L Systems	1