Journal of Computer and System Sciences

Article	Citations
A constant-factor approximation for weighted bond cover	30
The maximal coordination principle in regulatory Boolean networks	15
Etherless Ethereum tokens: Simulating native tokens in Ethereum	14
Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations	13
Solving problems on generalized convex graphs via mim-width	12
Deterministic non-adaptive contention resolution on a shared channel	12
Rectilinear-upward planarity testing of digraphs	12
Editorial Board	10
Temporal Reachability Dominating Sets: Contagion in temporal graphs	10
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem	9
Editorial Board	8
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis	8
Parameterized complexity of dominating set variants in almost cluster and split graphs	8
Editorial Board	8
Arithmetical complexity of the language of generic limit sets of cellular automata	7
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs	7
Succinct representation for (non)deterministic finite automata	7
Complexity of fixed point counting problems in Boolean networks	6
Corrections to “On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164–194]”	6
Galactic token sliding	6
Performance modeling and analysis for randomly walking mobile users with Markov chains	6
Global reliable diagnosis of networks based on self-comparative diagnosis model and g-good-neighbor property	6
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited	6
Parameterized complexity of multi-node hubs	5
Dual domination problems in graphs	5

Editorial Board	5
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs	5
Editorial Board	5
Gap preserving reductions between reconfiguration problems	5
Monitoring the edges of a graph using distances with given girth	4
Decomposing finite-valued two-way finite transducers	4
A divide and conquer algorithm for deciding group cellular automata dynamics	4
Editorial Board	4
Perpetual maintenance of machines with different urgency requirements	4
The parameterized complexity of the survivable network design problem	4
Temporal reachability minimization: Delaying vs. deleting	4
On the parameterized complexity of computing good edge-labelings	4
Routing few robots in a crowded network	4
Cutting corners	4
A comparative study of the smallest probability intervals for which a binary sequence is random	4
Backdoor DNFs	4
A constant-factor approximation for directed latency in quasi-polynomial time	4
Complexity of deciding the equality of matching numbers	3
Dense graph partitioning on sparse and dense graphs	3
Polynomially ambiguous probabilistic automata on restricted languages	3
Editorial Board	3
Time-sharing scheduling with tolerance capacities	3
Editorial Board	3
Finding and counting patterns in sparse graphs	3
A linear delay algorithm in SD set system and its application to subgraph enumeration	3
Modular SAT-based techniques for reasoning tasks in team semantics	3
The satisfiability problem for a quantitative fragment of PCTL	3
Editorial Board	3
Computational complexity of covering multigraphs with semi-edges: Small cases	3
Redundancy of information: Lowering effective dimension	3
Approximate realizations for outerplanaric degree sequences	3
On the parallel complexity of group isomorphism via Weisfeiler–Leman	3
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems	3
Parameterised temporal exploration problems	3
Faster winner determination algorithms for (Colored) Arc Kayles	3
The power of knowledge in linear search for an escaping target	3
A maximum clique based approximation algorithm for wireless link scheduling under SINR model	3
On the parameterized complexity of Grid Contraction	3
Approximate selection with unreliable comparisons in sublinear time	2
Participatory budgeting with project groups	2
On minimum vertex bisection of random d-regular graphs	2
Scheduling lower bounds via AND subset sum	2
Decomposing permutation automata	2
On the parameterized complexity of clustering problems for incomplete data	2
Exploring wedges of an oriented grid by an automaton with pebbles	2
Medians in median graphs and their cube complexes in linear time	2
The possible winner with uncertain weights problem	2
Packing arc-disjoint cycles in oriented graphs	2
A near-linear kernel for bounded-state parsimony distance	2
Grid recognition: Classical and parameterized computational perspectives	2

Forbidden patterns in temporal graphs resulting from encounters in a corridor	2
Editorial Board	2
Mengerian graphs: Characterization and recognition	2
Absolute convergence and error thresholds in non-active adaptive sampling	2
On the parameterized complexity of interval scheduling with eligible machine sets	2
Editorial Board	2
Towards declarative comparabilities: Application to functional dependencies	2
Relating description complexity to entropy	2
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs	2
Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network	1
Weighted group search on the disk & improved lower bounds for priority evacuation	1
Bringing memory to Boolean networks: A unifying framework	1
Instability of backoff protocols with arbitrary arrival rates	1
Editorial Board	1
The complexity of online bribery in sequential elections	1
Editorial Board	1
A modeling approach for estimating performance and energy consumption of storage systems	1
Addition machines, automatic functions and open problems of Floyd and Knuth	1
Core stability in additively separable hedonic games of low treewidth	1
Search-space reduction via essential vertices revisited: Vertex multicut and cograph deletion	1
Online computation with untrusted advice	1
Reducing the vertex cover number via edge contractions	1
PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data	1
Editorial Board	1
The complexity of transitively orienting temporal graphs	1
Exploration of graphs with excluded minors	1
Quantum and classical query complexities for determining connectedness of matroids	1
The weighted HOM-problem over fields	1
Quantum random access stored-program machines	1
On coresets for fair clustering in metric and Euclidean spaces and their applications	1
The complexity of binary matrix completion under diameter constraints	1
Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts	1
Single-exponential FPT algorithms for enumerating secluded F-free subgraphs a	1
Dynamic programming on bipartite tree decompositions	1
Algorithms and hardness for Metric Dimension on digraphs	1
Lower bounds for Boolean circuits of bounded negation width	1
Reconstructing semi-directed level-1 networks using few quarnets	1
Improved IP lookup technology for trie-based data structures	1
An optimal absolute approximation algorithm for computing k disjoint restricted shortest paths	1
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings	1
Decentralized deadlock-free enforcement of message orderings in message-based systems	1
A new temporal interpretation of cluster editing	1
Induced minor models. I. Structural properties and algorithmic consequences	1
Priority Promotion with Parysian flair	1
Editorial Board	1
How to tamper with a Parliament: Strategic campaigns in apportionment elections	1
Editorial Board	0
Minmax optimal list searching with	0
Parameterized complexity of graph planarity with restricted cyclic orders	0
On the structural parameterized complexity of defective coloring	0
On the binary and Boolean rank of regular matrices	0
The complexity of growing a graph	0
Languages given by finite automata over the unary alphabet	0
Approximation algorithms for two extensions of min-k-union	0
Building large k-cores from sparse graphs	0
Making the interval membership width of temporal graphs connected and bidirectional	0
Length-bounded cuts: Proper interval graphs and structural parameters	0
Complexity of the multilevel critical node problem	0
Computing Weighted Subset Odd Cycle Transversals in H-free graphs	0
Automata for the commutative closure of regular languages	0
Unlabeled sample compression schemes and corner peelings for ample and maximum classes	0
Deletion to scattered graph classes I - Case of finite number of graph classes	0
AdapBlinker: Robust adaptive median filter approach to detect subtle eye blinks	0
Monitoring the edges of product networks using distances	0
Multistage knapsack	0
A secure searchable encryption scheme for cloud using hash-based indexing	0
Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes	0
On convergence and threshold properties of discrete Lotka-Volterra population protocols	0
Preprocessing to reduce the search space: Antler structures for feedback vertex set	0
Markov chains and unambiguous automata	0
Finding diameter-reducing shortcuts in trees	0
Kernelization for orthogonality dimension	0
Non-essential arcs in phylogenetic networks	0
Orienting undirected phylogenetic networks	0
Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree	0
On kernels for d-path vertex cover	0
Complexity of verification in self-assembly with prebuilt assemblies	0
Complexity of word problems for HNN-extensions	0
Building squares with optimal state complexity in restricted active self-assembly	0
Linear-time 2-party secure merge from additively homomorphic encryption	0

Lifting query complexity to time-space complexity for two-way finite automata	0
O is an n-MCFL	0
Bounded incentives in manipulating the probabilistic serial rule	0
Editorial Board	0
Acyclic, star and injective colouring: A complexity picture for H-free graphs	0
Backwards-reachability for cooperating multi-pushdown systems	0
Online bin covering with limited migration	0
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)	0
SAT backdoors: Depth beats size	0
On finding short reconfiguration sequences between independent sets	0
Interaction graphs of isomorphic automata networks II: Universal dynamics	0
Editorial Board	0
Approximation algorithms for clustering with dynamic points	0
On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves	0
Approximate Turing kernelization for problems parameterized by treewidth	0
Sequentially swapping tokens: Further on graph classes	0
Restrained medium access control on adversarial shared channels	0
Editorial Board	0
Quasi-isometric reductions between infinite strings	0
A cop and robber game on edge-periodic temporal graphs	0
Controlling entity integrity with key sets	0
Editorial Board	0
Editorial Board	0
Editorial Board	0
Parameterized results on acyclic matchings with implications for related problems	0
Minimum separator reconfiguration	0
A physically universal Turing machine	0
Approximately covering vertices by order-5 or longer paths	0
Weighted online search	0
On the complexity of computing the co-lexicographic width of a regular language	0
Morphing graph drawings in the presence of point obstacles	0
Triangle evacuation of 2 agents in the wireless model & the power of choosing a starting point	0
Editorial Board	0
An FPT algorithm for timeline cover	0
Near-optimal dispersion on arbitrary anonymous graphs	0
Almost optimal query algorithm for hitting set using a subset query	0
Algorithms and hardness results for the (k,ℓ)-cover problem	0
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms	0
The edit distance to k-subsequence universality	0
Corrigendum to “Homomorphism preservation on quasi-wide classes” [J. Comput. Syst. Sci. 76 (5) (2010) 324–332]	0
Detours in directed graphs	0
Labeled sample compression schemes for complexes of oriented matroids	0
Bankrupting Sybil despite churn	0
The Normal Domination Game in graphs	0
Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms	0
Covering metric spaces by few trees	0
Compact distributed certification of geometric graph classes	0
A dichotomy for bounded degree graph homomorphisms with nonnegative weights	0
Computing maximum matchings in temporal graphs	0
Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs	0
Editorial Board	0
On finding separators in temporal split and permutation graphs	0
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies	0
How heavy independent sets help to find arborescences with many leaves in DAGs	0
Corrigendum to “Prediction, learning, uniform convergence, and scale-sensitive dimensions” [J. Comput. Syst. Sci. 56 (2) (1998) 174–190]	0
Balanced allocation on hypergraphs	0
Bipartite 3-regular counting problems with mixed signs	0
A linear algorithm for radio k-coloring of powers of paths having small diameters	0
Online knapsack with removal and recourse	0
The g-extra connectivity of graph products	0
Fast and succinct population protocols for Presburger arithmetic	0
Finding k-secluded trees faster	0
Dominator coloring and CD coloring in almost cluster graphs	0
Parameterized analysis of the cops and robber problem	0
Synchronizing Boolean networks asynchronously	0
Exact and parameterized algorithms for the independent cutset problem	0
Parameterized approaches to orthogonal compaction	0
Induced tree covering and the generalized Yutsis property	0
Editorial Board	0
Editorial Board	0
Decidable problems in substitution shifts	0
On the structure of Hamiltonian graphs with small independence number	0
From symmetry to asymmetry: Generalizing TSP approximations by parametrization	0
Renaissance: A self-stabilizing distributed SDN control plane using in-band communications	0
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU	0
On the complexity of the storyplan problem	0
Adapting stable matchings to forced and forbidden pairs	0
Editorial Board	0
On computing optimal temporal branchings and spanning subgraphs	0
Quantum data structure for range minimum query	0
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles	0
Blackout-tolerant temporal spanners	0
Editorial Board	0
Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength	0
On the complexity of rainbow vertex colouring diametral path graphs	0
Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics	0
Parameterized complexity of categorical clustering with size constraints	0
Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words	0
On solution discovery via reconfiguration	0
The complexity of (P,P)-arrowing	0
State complexity of one-way quantum finite automata together with classical states	0
Editorial Board	0
On computing large temporal (unilateral) connected components	0
On the exact amount of missing information that makes finding possible winners hard	0
Latency, capacity, and distributed minimum spanning trees	0