ALGORITHMICA
ISSN:0178-4617

ALGORITHMICA

ALGORITHMICA
学科领域:计算机科学
是否预警:不在预警名单内
是否OA:
录用周期:偏慢,4-8周
新锐分区:计算机科学4区
年发文量:87
影响因子:0.7
JCR分区:Q3

基本信息

Algorithmica(英语:Algorithmica)是一份国际性期刊,发表关于算法的理论论文,解决实际领域中出现的问题,以及具有实际重要性或技术的实验论文。算法的发展是计算机科学的一个组成部分。随着计算机应用的复杂性和范围的不断扩大,设计有效的算法变得越来越重要。算法学涵盖了以下应用领域的算法:超大规模集成电路、分布式计算、并行处理、自动化设计、机器人、图形学、数据库设计、软件工具,以及诸如排序、搜索、数据结构、计算几何和线性规划等基础领域的算法。此外,该杂志还设有两个特别部分:应用经验,介绍从理论结果到实际情况的应用中获得的发现,和问题,提供简短的论文,介绍计算机科学的选定主题的问题。
0178-4617SCIE/Scopus收录
0.7
0.8
2026年3月发布
点击查看历史分区趋势    >
大类学科小类学科Top期刊综述期刊
计算机科学4区
COMPUTER SCIENCE, SOFTWARE ENGINEERING 计算机:软件工程
4区
MATHEMATICS, APPLIED 应用数学
4区
N/A
WOS期刊SCI分区  2024-2025最新升级版
按JIF指标学科分区收集子录JIF分区JIF排名百分位
学科:COMPUTER SCIENCE, SOFTWARE ENGINEERING
SCIE
Q4
114/129
学科:MATHEMATICS, APPLIED
SCIE
Q3
258/344
按JCR指标学科分区收集子录JCR分区JCR排名百分位
学科:COMPUTER SCIENCE, SOFTWARE ENGINEERING
SCIE
Q4
102/129
学科:MATHEMATICS, APPLIED
SCIE
Q4
278/344
67
87
-容易偏慢,4-8周-工程技术-计算机:软件工程
0%
时间预警情况
2026年03月发布的新锐学术版不在预警名单中
2025年03月发布的2025版不在预警名单中
2024年02月发布的2024版不在预警名单中
2023年01月发布的2023版不在预警名单中
2021年12月发布的2021版不在预警名单中
2020年12月发布的2020版不在预警名单中
100.00%44.89%1.4%
CiteScore:2.90
SJR:0.969
SNIP:1.106
学科类别分区排名百分位
大类:Computer Science
小类:Computer Science Applications
Q3
516 / 947
大类:Computer Science
小类:Applied Mathematics
Q2
235 / 665
大类:Computer Science
小类:General Computer Science
Q2
118 / 239

期刊高被引文献

A Unified Framework for Clustering Constrained Data Without Locality Property
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00616-2
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00603-7
Deleting Vertices to Graphs of Bounded Genus
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00592-7
QuickXsort: A Fast Sorting Scheme in Theory and Practice
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00634-0
Nested Convex Bodies are Chaseable
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00661-x
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00663-9
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00578-5
Local Algorithms for Sparse Spanning Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00612-6
A Constant-Time Algorithm for Middle Levels Gray Codes
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00640-2
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00614-4
A Tight Lower Bound for Planar Steiner Orientation
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00580-x
Stochastic Dominance and the Bijective Ratio of Online Algorithms
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00638-w
Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles)
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00551-2
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00628-y
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00656-8
Improving and Extending the Testing of Distributions for Shape-Restricted Properties
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00598-1
Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00629-x
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00554-z
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00633-1
Optimality Program in Segment and String Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00568-7
Parameterized Complexity of Geometric Covering Problems Having Conflicts
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00600-w
Two Approaches to Building Time-Windowed Geometric Data Structures
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00588-3
Consensus Strings with Small Maximum Distance and Small Distance Sum
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00647-9
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00567-8
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00545-0
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00649-7
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00624-2
Deterministic Dynamic Matching in O(1) Update Time
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00630-4
Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00573-w
Reachability Oracles for Directed Transmission Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00641-1
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
来源期刊:AlgorithmicaDOI:10.1007/s00453-018-00538-5
Subset Feedback Vertex Set in Chordal and Split Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00590-9
Connected Vertex Cover for $$(sP_1+P_5)$$(sP1+P5)-Free Graphs
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00601-9
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00610-8
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00599-0
An Algorithm to Compute the Nucleolus of Shortest Path Games
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00574-9
Approximately Coloring Graphs Without Long Induced Paths
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00577-6
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00639-9
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00593-6
Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00550-3
A Faster Algorithm for Truth Discovery via Range Cover
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00562-z
Asymptotic Analysis of Regular Sequences
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00631-3
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00591-8
Online Clique Clustering
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00625-1
Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00658-6
Preface to the Special Issue on Computing and Combinatorics
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00632-2
Dynamic Space Efficient Hashing
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00572-x
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00651-z
Making Bidirected Graphs Strongly Connected
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00613-5
Extended Learning Graphs for Triangle Finding
来源期刊:AlgorithmicaDOI:10.1007/s00453-019-00627-z

相关文章

2026年3月发布(新锐分区)
大类学科小类学科Top期刊综述期刊
计算机科学4区
COMPUTER SCIENCE, SOFTWARE ENGINEERING 计算机:软件工程
4区
MATHEMATICS, APPLIED 应用数学
4区
N/A
2025年3月升级版
大类学科小类学科Top期刊综述期刊
计算机科学4区
MATHEMATICS, APPLIED 应用数学
3区
COMPUTER SCIENCE, SOFTWARE ENGINEERING 计算机:软件工程
4区
2023年12月旧的升级版
大类学科小类学科Top期刊综述期刊
计算机科学4区
COMPUTER SCIENCE, SOFTWARE ENGINEERING 计算机:软件工程
4区
MATHEMATICS, APPLIED 应用数学
4区