Algorithmica
短名 | Algorithmica. |
Journal Impact | 0.99 |
国际分区 | MATHEMATICS, APPLIED(Q3) |
期刊索引 | SCI Q3中科院 4 区 |
ISSN | 0178-4617, 1432-0541 |
h-index | 81 |
国内分区 | 计算机科学(4区)计算机科学计算机软件工程(4区)计算机科学应用数学(4区) |
ALGORITHMICA 是一本国际期刊,发表有关解决实际领域中出现的问题的算法的理论论文,以及对实际重要性或技术具有普遍吸引力的实验论文。算法的发展是计算机科学的一个组成部分。计算机应用程序的复杂性和范围不断增加,使得高效算法的设计变得必不可少。ALGORITHMICA 涵盖应用领域的算法,例如:VLSI、分布式计算、并行处理、自动化设计、机器人、图形、数据库设计、软件工具,以及排序、搜索、数据结构、计算几何和线性规划等基础领域的算法。此外,该杂志还设有两个特殊部分:应用经验,展示从理论结果应用于实际情况中获得的发现,以及问题,提供简短的提出有关计算机科学选定主题的问题的论文。
期刊主页投稿网址涉及主题 | 计算机科学数学算法程序设计语言计算理论组合数学离散数学理论计算机科学数学分析数学优化工程类操作系统图形几何学物理人工智能哲学 |
出版信息 | 出版商: Springer New York,出版周期: Monthly,期刊类型: journal |
基本数据 | 创刊年份: 1986,原创研究文献占比: 100.00%,自引率:11.10%, Gold OA占比: 39.29% |
平均审稿周期 | 网友分享经验:偏慢,4-8周 |
平均录用比例 | 网友分享经验:容易 |
期刊引文格式
这些示例是对学术期刊文章的引用,以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章,因此这些字段是可选的。有些电子期刊不提供页面范围,而是列出文章标识符。在这种情况下,使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用,以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
2024-9-14
On the Parameterized Complexity of Compact Set Packing
2024-9-13
Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs
2024-9-12
Testing Connectedness of Images
2024-9-12
Romeo and Juliet Meeting in Forest Like Regions
2024-9-3
Connected k-Center and k-Diameter Clustering
2024-9-2
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited
2024-9-2
A Framework for Adversarial Streaming Via Differential Privacy and Difference Estimators
2024-8-31
Reconfiguring Shortest Paths in Graphs
2024-8-27
Parameterized Complexity of Reconfiguration of Atoms
2024-8-26
Runtime Analysis of Quality Diversity Algorithms
2024-8-13
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
2024-8-4
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation
2024-7-31
Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs
2024-7-29
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints
2024-7-22
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
2024-7-22
On a Traveling Salesman Problem for Points in the Unit Cube
2024-7-18
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
2024-7-18
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
2024-7-18
Sublinear Algorithms in T-Interval Dynamic Networks
2024-7-12
Stagnation Detection in Highly Multimodal Fitness Landscapes
2024-7-2
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
2024-6-19
Parameterized Complexity of Streaming Diameter and Connectivity Problems
2024-6-19
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication
2024-6-17
Online Unit Profit Knapsack with Predictions
2024-6-13
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle
2024-6-12
Online Geometric Covering and Piercing
2024-6-3
Slim Tree-Cut Width
2024-6-1
Approximating Long Cycle Above Dirac’s Guarantee
2024-5-30
New Algorithms for Steiner Tree Reoptimization
2024-5-29
Approximation Algorithms for Covering Vertices by Long Paths
2024-5-28
Parity Permutation Pattern Matching
2024-5-22
Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
2024-5-20
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants
2024-5-13
Sample-Based Distance-Approximation for Subsequence-Freeness
2024-5-13
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
2024-5-10
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data
2024-5-9
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
2024-5-9
Online Multiset Submodular Cover
2024-5-8
Runtime Analysis of Competitive Co-evolutionary Algorithms for Maximin Optimisation of a Bilinear Function
2024-4-27
Analysing Equilibrium States for Population Diversity
2024-4-16
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs
2024-4-12
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
2024-4-6
The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly
2024-4-3
Generalized Coloring of Permutations
2024-3-29
Extending Partial Representations of Circle Graphs in Near-Linear Time
2024-3-26
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
2024-3-25
On The Closures of Monotone Algebraic Classes and Variants of the Determinant
2024-3-25
Embedding Arbitrary Boolean Circuits into Fungal Automata
2024-3-21
The Near Exact Bin Covering Problem
2024-3-19
帮你贴心管理全部的文献
研飞ivySCI,高效的论文管理
投稿经验分享
分享我的经验,帮你走得更远