default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Foundations of Computer Science, Volume 35
Volume 35, Numbers 1&2, January & February 2024
- Zoltán Fülöp
, George Rahonis, Kai Salomaa:
Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. 1 - Paula Steinby:
In Memoriam: Magnus Steinby (1941-2021). 3-5 - Arto Salomaa, Magnus Steinby:
Volume Edited by Magnus Steinby. 7-10 - Christof Löding, Wolfgang Thomas:
On the Boolean Closure of Deterministic Top-Down Tree Automata. 11-22 - Erik Paul:
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata. 23-49 - Zoltán Fülöp, Heiko Vogler:
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. 51-76 - Pierre Béaur, Jarkko Kari:
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata. 77-100 - Tero Harju:
A Note on Squares in Binary Words. 101-106 - Andreas Maletti:
Compositions of Weighted Extended Tree Transducers - The Unambiguous Case. 107-127 - Vesa Halava, Stepan Holub:
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. 129-144 - Manfred Droste, Gustav Grabolle, George Rahonis:
Weighted Linear Dynamic Logic. 145-177 - Emmanuel Filiot, Sarah Winter:
Synthesizing Computable Functions from Rational Specifications Over Infinite Words. 179-214 - Henrik Björklund, Johanna Björklund, Petter Ericson:
Tree-Based Generation of Restricted Graph Languages. 215-243
Volume 35, Number 3, April 2024
- Fei Guo, Zilong Wang:
Balanced Even-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity, Maximum Algebraic Degree and Higher Nonlinearity. 245-270 - Baohua Niu, Shuming Zhou, Hong Zhang:
Influential Node Identification of Network Based on Agglomeration Operation. 271-295 - Xiangdong Cheng, Xiwang Cao, Liqin Qian:
Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring. 297-311 - Xianyong Li, Jiaming Huang, Yajun Du, Yongquan Fan, Xiaoliang Chen:
The g-Good-Neighbor Conditional Diagnosabilities of Hypermesh Optical Interconnection Networks Under the PMC and Comparison Models. 313-325 - Ruyan Guo, Yan Wang, Jianxi Fan, Weibei Fan:
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength. 327-352 - Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri:
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs. 353-374
Volume 35, Number 4, June 2024
- Zeynep Nihan Berberler, Aysun Aytaç:
Node and Link Vulnerability in Complete Multipartite Networks. 375-385 - Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
Approximation Algorithms for Partial Vertex Covers in Trees. 387-407 - A. Berin Greeni, R. Sundara Rajan, Paul Immanuel:
Embedding Augmented Cube into Certain Trees and Windmill Graphs. 409-434 - Baohua Niu, Shuming Zhou, Tao Tian, Qifan Zhang:
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube. 435-451 - Hosein Salami, Mostafa Nouri Baygi:
A Simple and Efficient Method for Accelerating Construction of the Gap-Greedy Spanner. 453-481 - Huifen Ge, Shumin Zhang, Chengfu Ye:
The Structure Fault Tolerance of Alternating Group Networks. 483-500
Volume 35, Number 5, August 2024
- Giuseppe D'Alconzo:
On Two Modifications of the McEliece PKE and the CFS Signature Scheme. 501-512 - Zhiwei Wang, Chen Tian, Zhanlin Wang, Yuhang Wang:
Robust Subgroup Multisignature with One-Time Public Keys in Order. 513-533 - Hsin-Jung Lin, Shyue-Ming Tang, Kung-Jui Pai, Jou-Ming Chang:
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks. 535-550 - Jingui Huang, Jie Chen, Yunlong Liu, Guang Xiao, Jianxin Wang:
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge. 551-577 - Zhecheng Yu, Liqiong Xu, Xuemin Wu, Chuanye Zheng:
On the Super (Edge)-Connectivity of Generalized Johnson Graphs. 579-593 - Ching-Lueh Chang, Chun-Wei Chang:
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces. 595-603
Volume 35, Number 6, September 2024
- Donglei Du, Lu Han, Rolf H. Möhring, Chenchen Wu:
Preface - Special Issue: Research in Combinatorial Optimization and Applications of COCOA 2021. 605-607 - Yunlong Liu, Yixuan Li, Jingui Huang:
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover. 609-629 - Min Cui, Donglei Du, Ling Gai, Ruiqi Yang:
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions. 631-650 - Raffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza:
Parameterized Complexity Classes Defined by Threshold Circuits and Their Connection with Sorting Networks. 651-668 - Pooja Goyal, Bhawani Sankar Panda:
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. 669-703 - Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs. 705-722 - R. Inkulu, Pawan Kumar:
Routing Among Convex Polygonal Obstacles in the Plane. 723-739 - Tom Davot, Rodolphe Giroudeau, Jean-Claude König:
On the Shared Transportation Problem: Computational Hardness and Exact Approach. 741-756 - Sai Ji, Yukun Cheng, Jingjing Tan, Zhongrui Zhao:
An Improved Approximation Algorithm for the Capacitated Correlation Clustering Problem. 757-774
Volume 35, Number 7, November 2024
- Hui Dong:
Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number. 775-789 - Subhasis Koley, Sasthi C. Ghosh:
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid. 791-813 - Zhenghua Xu, Lijing Zheng, Chonghui Huang:
Two New Classes of (Almost) Perfect c-Nonlinear Permutations. 815-821 - Zengtai Gong, Lele He:
Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications. 823-839 - Satoshi Fujita:
Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks. 841-856 - H. Naresh Kumar, Mustapha Chellali, Yanamandram B. Venkatakrishnan:
Algorithmic Aspects of Total Vertex-Edge Domination in Graphs. 857-869 - Miroslaw Kowaluk, Andrzej Lingas:
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. 871-886 - Manjay Kumar, P. Venkata Subba Reddy:
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms. 887-906
Volume 35, Number 8, December 2024
- Hong Gao, Yunlei Zhang, Yuqi Wang, Yuanyuan Guo, Xing Liu, Renbang Liu, Changqing Xi, Yuansheng Yang:
Rainbow Domination in Cartesian Product of Paths and Cycles. 907-928 - Md Ajaharul Hossain, Ramakrishna Bandi:
A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes. 929-948 - Markus Hittmeir:
Smooth Subsum Search A Heuristic for Practical Integer Factorization. 949-974 - Wantao Ning, Litao Guo:
The Generalized 3-Connectivity of Exchanged Crossed Cube. 975-985 - Alexey Lebedev, Christian Deppe:
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects. 987-1006 - Jinjie Ma, Mingzu Zhang, Chenxi Li, Hengji Qiao, Yang Fan:
A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults. 1007-1019
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-16 23:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
