Theoretical Computer Science

Article	Citations
Efficient card-based zero-knowledge proof for Sudoku	53
How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition	34
An analysis of architecture, framework, security and challenging aspects for data aggregation and routing techniques in IoT WSNs	31
Physical zero-knowledge proof for Ripple Effect	28
Community-based rumor blocking maximization in social networks: Algorithms and analysis	27
Optimizing hybrid metaheuristic algorithm with cluster head to improve performance metrics on the IoT	26
Securely computing the n-variable equality function with 2n cards	26
Deep learning and natural language processing in computation for offensive language detection in online social networks by feature selection and ensemble classification techniques	26
Card-based protocols for secure ranking computations	23
Maximum Nash welfare and other stories about EFX	23
Spiking neural P systems with target indications	23
Structure connectivity and substructure connectivity of wheel networks	23
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination	22
Identity-based encryption with equality test and datestamp-based authorization mechanism	21
Almost envy-freeness in group resource allocation	19
Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement	19
A Secure Energy Aware Meta-Heuristic Routing Protocol (SEAMHR) for sustainable IoT-Wireless Sensor Network (WSN)	19
Fault diagnosability of Bicube networks under the PMC diagnostic model	18
Structure and substructure connectivity of divide-and-swap cube	18
Arbitrary pattern formation by asynchronous opaque robots with lights	17
Continuous leakage-resilient certificate-based signcryption scheme and application in cloud computing	17
Collusion-resistant identity-based Proxy Re-encryption: Lattice-based constructions in Standard Model	17
An anomaly-based intrusion detection system using recursive feature elimination technique for improved attack detection	16
On cherry-picking and network containment	16
A combinatorial view on string attractors	15

How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys	14
Dynamical behavior of additive cellular automata over finite abelian groups	14
A proof system for disjoint parallel quantum programs	14
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization in linear time	14
Byzantine-tolerant causal broadcast	13
Rumor correction maximization problem in social networks	13
Enumeration of subtrees and BC-subtrees with maximum degree no more than k in trees	13
Measuring diversity in heterogeneous information networks	13
Improved lower bounds for the radio number of trees	13
The h-restricted connectivity of the generalized hypercubes	13
Hardness results for three kinds of colored connections of graphs	13
Embedded connectivity of ternary n-cubes	12
Component conditional fault tolerance of hierarchical folded cubic networks	12
On the performance of learned data structures	12
A constrained two-stage submodular maximization	12
Facility location games with optional preference	12
DESN: An unsupervised MR image denoising network with deep image prior	12
The 4-set tree connectivity of (n,k)-star networks	12
Gathering robots in graphs: The central role of synchronicity	12
Approximation algorithms for the minimum power cover problem with submodular/linear penalties	12
Connectivity and super connectivity of the divide-and-swap cube	12
Stagnation detection meets fast mutation	11
Constructing dual-CISTs of folded divide-and-swap cubes	11
Minimum power partial multi-cover on a line	11
Edge-fault-tolerant strong Menger edge connectivity on regular graphs	11
Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity	11
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries	11
Analysis on methods to effectively improve transfer learning performance	11
Fast algorithms for single and multiple pattern Cartesian tree matching	11
The generalized 3-connectivity of two kinds of regular networks	11
Attribute-based proxy re-encryption from standard lattices	11
NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data	11
Speech enhancement with noise estimation and filtration using deep learning models	10
Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponents	10
A logical and graphical framework for reaction systems	10
Small SNQ P Systems with multiple types of spikes	10
Chronic obstructive pulmonary disease prediction using Internet of things-spiro system and fuzzy-based quantum neural network classifier	10
Optimizing flight trajectory of UAV for efficient data collection in wireless sensor networks	10
Multistage graph problems on a global budget	10
An approximation algorithm for General Energy Restricted Sweep Coverage problem	10
Exponential slowdown for larger populations: The (μ + 1)-EA on monotone functions	10
Reversible computing from a programming language perspective	10
Formal verification of parallel prefix sum and stream compaction algorithms in CUDA	10
Structure fault tolerance of balanced hypercubes	10
A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes	10
Complexity of modification problems for best match graphs	9
Stable matching with uncertain pairwise preferences	9
Energy efficiency optimization for multiple chargers in Wireless Rechargeable Sensor Networks	9
k-Critical graphs in P5-free graphs	9
The complexity of dependency detection and discovery in relational databases	9

Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model	9
Joint realizability of monotone Boolean functions	9
Local certification of graphs on surfaces	9
Reliability and hybrid diagnosis of exchanged hypercube	9
Investigation of E-voting system using face recognition using convolutional neural network (CNN)	9
influence: A partizan scoring game on graphs	8
The t/s-diagnosability and t/s-diagnosis algorithm of folded hypercube under the PMC/MM* model	8
Matching influence maximization in social networks	8
Solving hard stable matching problems involving groups of similar agents	8
Generalised information systems capture L-domains	8
Blocking total dominating sets via edge contractions	8
Maximize a monotone function with a generic submodularity ratio	8
On the g-extra diagnosability of enhanced hypercubes	8
Cryptanalysis of the RSA variant based on cubic Pell equation	8
A new quantum random number generator certified by value indefiniteness	8
Novel algorithms for maximum DS decomposition	8
Unified graphical co-modeling, analysis and verification of cyber-physical systems by combining AADL and Simulink/Stateflow	8
Physarum-inspired multi-commodity flow dynamics	8
Optimal radio labellings of block graphs and line graphs of trees	8
Constrained synchronization and commutativity	8
Running time analysis of the (1+1)-EA for robust linear optimization	8
Arbitrary pattern formation on infinite regular tessellation graphs	8
A study on the effects of normalized TSP features for automated algorithm selection	8
Modelling of oppositional Aquila Optimizer with machine learning enabled secure access control in Internet of drones environment	8
The component connectivity, component diagnosability, and t/k-diagnosability of Bicube networks	8
An improved ranking methodology for malignant carcinoma in multicriterian decision making using hesitant VIKOR fuzzy	8
Reliability assessment of the divide-and-swap cube in terms of generalized connectivity	8
Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security	8
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints	8
Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation	8
Note on R-conditional diagnosability of hypercube	8
Time-free cell-like P systems with multiple promoters/inhibitors	8
Quantum algorithm for the multicollision problem	8
The vertex-pancyclicity of data center networks	8
Faster balanced clusterings in high dimension	7
Universal product learning with errors: A new variant of LWE for lattice-based cryptography	7
Control languages accepted by labeled spiking neural P systems with rules on synapses	7
Towards more efficient methods for solving regular-expression heavy string constraints	7
Absolutely no free lunches!	7
Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation	7
A hierarchy of local decision	7
Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences	7
Lattice-based public-key encryption with equality test supporting flexible authorization in standard model	7
Exponential upper bounds for the runtime of randomized search heuristics	7
Time sensitive sweep coverage with minimum UAVs	7
Tight security for the generic construction of identity-based signature (in the multi-instance setting)	7
Subnetwork reliability analysis of bubble-sort graph networks	7
Survivability development of wireless sensor networks using neuro fuzzy-clonal selection optimization	7
Computational power of dynamic threshold neural P systems for generating string languages	7
A topological perspective on distributed network algorithms	7
Online presentations of finitely generated structures	7
Simultaneous FPQ-ordering and hybrid planarity testing	7
The diagnosability of Möbius cubes for the g-extra condition	7
Model independent approach to probabilistic models	7
Efficient scheduling of a mobile charger in large-scale sensor networks	7
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes	7
Sequential reprogramming of biological network fate	7
Exploring the gap between treedepth and vertex cover through vertex integrity	7
Bicriteria algorithms to balance coverage and cost in team formation under online model	7
A trusted effective approach for forecasting the failure of data link and intrusion in wireless sensor networks	7
Computational power of sequential dendrite P systems	7
Variety of mutual-visibility problems in graphs	7
Multi-attribute based influence maximization in social networks: Algorithms and analysis	7
New bounds for energy complexity of Boolean functions	7
Computing longest palindromic substring after single-character or block-wise edits	6
On the complexity of solution extension of optimization problems	6
Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives	6
The perfect matching cut problem revisited	6
On approximation algorithm for the edge metric dimension problem	6
Determinisability of unary weighted automata over the rational numbers	6
Rewriting theory for the life sciences: A unifying theory of CTMC semantics	6
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership	6
Embedding algorithm of spined cube into grid structure and its wirelength computation	6
Finding patterns and periods in Cartesian tree matching	6
Fixed-parameter tractable algorithms for Tracking Shortest Paths	6
Power, positive closure, and quotients on convex languages	6
Approximation algorithms for the dynamic k-level facility location problems	6
Spectral concepts in genome informational analysis	6
Finding Cheeger cuts in hypergraphs via heat equation	6
New results for the k-secretary problem	6

A fixed point theorem in rough semi-linear uniform spaces	6
Multiple facility location games with envy ratio	6
The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networks	6
Parameterized algorithms and kernels for almost induced matching	6
Model checking QCTL plus on quantum Markov chains	6
Differential logical relations, part II increments and derivatives	6
Representable Markov categories and comparison of statistical experiments in categorical probability	6
Identity-based encryption with security against the KGC: A formal model and its instantiations	6
Tight FPT approximation for constrained k-center and k-supplier	6
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering	6
Physical ZKP protocols for Nurimisaki and Kurodoko	6
Puncturable identity-based and attribute-based encryption from lattices	6
Monotone k-submodular secretary problems: Cardinality and knapsack constraints	6
Chosen-ciphertext lattice-based public key encryption with equality test in standard model	6
Operator precedence temporal logic and model checking	6
On dispersable book embeddings	6
Cryptographic reverse firewalls for interactive proof systems	6
A unique secure multimodal biometrics-based user anonymous authenticated key management protocol (SMUAAKAP) based on block chain mechanism for generic HIoTNs	6
Computing a longest common almost-increasing subsequence of two sequences	6
Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions	6
Identity-based authenticated encryption with identity confidentiality	6
Connectivity and constructive algorithms of disjoint paths in dragonfly networks	6
Modified Schelling games	6
Multidimensional data organization and random access in large-scale DNA storage systems	6
Concentration of rainbow k-connectivity of a multiplex random graph	6
Disjoint paths and connected subgraphs for H-free graphs	6
Polynomial kernels for hitting forbidden minors under structural parameterizations	6
Uncertainty representation in dynamical systems using rough set theory	6
Two-way and one-way quantum and classical automata with advice for online minimization problems	6
Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus	6
Profit maximization for competitive social advertising	6
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification	6
Reallocating multiple facilities on the line	6
h-extra r-component connectivity of interconnection networks with application to hypercubes	5
On fan-crossing graphs	5
Two-stage pricing strategy with price discount in online social networks	5
Strongly Menger-edge-connectedness of DCell networks	5
Generating, computing and recognizing with virus machines	5
How to compute digraph width measures on directed co-graphs	5
A refinement on the structure of vertex-critical (P5, gem)-free graphs	5
An optimal online algorithm for single-processor scheduling problem with learning effect	5
Recognizing DAGs with page-number 2 is NP-complete	5
k-Circle formation by disoriented asynchronous robots	5
Collaborative coalitions-based joint service caching and task offloading for edge networks	5
Component edge connectivity of hypercube-like networks	5
Approximation algorithms for fuzzy C-means problem based on seeding method	5
Tracking routes in communication networks	5
Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes	5
New sufficient conditions on the degree sequences of uniform hypergraphs	5
On coresets for support vector machines	5
Satisfiability threshold for power law random 2-SAT in configuration model	5
On k-ary n-cubes and isometric words	5
Approximation algorithms for spherical k-means problem using local search scheme	5
Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs	5
Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix	5
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints	5
On invertible and stably reversible non-uniform cellular automata	5
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots	5
Alternation in two-way finite automata	5
Moment-based analysis of Bayesian network properties	5
A substructure based lower bound for eternal vertex cover number	5
A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations	5
Priority evacuation from a disk: The case of n ≥ 4	5
Experimental evaluation of algorithms for computing quasiperiods	5
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination	5
The R-conditional diagnosability of international networks	5
Two-machine open shop problem with a single server and set-up time considerations	5
Quantum clustering with k-Means: A hybrid approach	5
Step-by-step community detection in volume-regular graphs	5
QUBO formulations of the longest path problem	5
Complexity and approximability of the happy set problem	5
Online parameterized dictionary matching with one gap	5
Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph	5
Numerical spiking neural P systems with production functions on synapses	5
Efficient revocable identity-based encryption with short public parameters	5
Secure connected domination and secure total domination in unit disk graphs and rectangle graphs	5
The undirected repetition threshold and undirected pattern avoidance	5
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties	5
Vertex-pancyclicity of the (n,k)-bubble-sort networks	5
Polynomial kernels for paw-free edge modification problems	5
Injective coloring of planar graphs	5
Reliability analysis of the generalized balanced hypercube	5
Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination	5
Computing a metric basis of a bipartite distance-hereditary graph	5
A process algebraic approach to reaction systems	5
The longest cycle problem is polynomial on interval graphs	5
On the complexity of matching cut for graphs of bounded radius and H-free graphs	5
Privacy-preserving file sharing on cloud storage with certificateless signcryption	5
On the complexity of minimum maximal uniquely restricted matching	5
Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D	4
Temporal logic specification mining of programs	4
Local-entity resolution for building location-based social networks by using stay points	4
The Steiner k-eccentricity on trees	4
A process calculus approach to detection and mitigation of PLC malware	4
A data structure for substring-substring LCS length queries	4