SIAM Journal on Discrete Mathematics
短名 | SIAM J. Discrete Math. |
Journal Impact | 1.07 |
国际分区 | MATHEMATICS, APPLIED(Q3) |
期刊索引 | SCI Q4中科院 3 区 |
ISSN | 0895-4801, 1095-7146 |
h-index | 69 |
国内分区 | 数学(3区)数学应用数学(3区) |
SIAM 离散数学杂志 (SIDMA) 发表在纯数学和应用离散数学方面质量卓越的研究论文,并进行了广泛的解释。该杂志的重点主要是理论而非实证,但编辑欢迎从现实问题演变而来或可能应用于现实世界问题的论文。提交的论文必须写得清楚并做出重大贡献。主题包括但不限于:属性离散结构的极端问题和极值问题组合优化,包括逼近算法代数和枚举组合编码和信息论加法、解析组合和数论组合矩阵理论和谱图论离散结构算法的设计和分析计算复杂性中的离散问题计算生物学中的离散和计算几何离散方法,以及生物信息学概率方法和随机算法。
期刊主页投稿网址涉及主题 | 数学组合数学离散数学计算机科学理论计算机科学图形数学分析物理几何学程序设计语言算法工程类纯数学哲学 |
出版信息 | 出版商: Society for Industrial and Applied Mathematics Publications,出版周期: Quarterly,期刊类型: journal |
基本数据 | 创刊年份: 1996,原创研究文献占比: 100.00%,自引率:11.10%, Gold OA占比: 0.98% |
平均审稿周期 | 网友分享经验:偏慢,4-8周 |
平均录用比例 | 网友分享经验:容易 |
期刊引文格式
这些示例是对学术期刊文章的引用,以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章,因此这些字段是可选的。有些电子期刊不提供页面范围,而是列出文章标识符。在这种情况下,使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用,以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
On the Turán Number of Edge Blow-Ups of Cliques
2024-9-13
On the Generalized Turán Problem for Odd Cycles
2024-9-10
Search-Space Reduction via Essential Vertices
2024-8-30
Bounds on Maximum Weight Directed Cut
2024-8-29
Rainbow Thresholds
2024-8-29
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
2024-8-27
Off-Diagonal Commonality of Graphs via Entropy
2024-8-27
On Multicolor Turán Numbers
2024-8-26
A Linear Bound for the Colin de Verdière Parameter \(\boldsymbol{\mu }\) for Graphs Embedded on Surfaces
2024-8-12
Generalized Tuza’s Conjecture for Random Hypergraphs
2024-7-30
Phase Transitions for the Minimizers of the \(p\)-Frame Potentials in \(\mathbb{R}^{2}\)
2024-7-26
Solving the Maximum Popular Matching Problem with Matroid Constraints
2024-7-24
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling
2024-7-23
Optimal Adjacency Labels for Subgraphs of Cartesian Products
2024-7-22
Additive Energy of Polynomial Images
2024-7-18
Two-Colored Ramsey–Turán Densities Involving Triangles
2024-7-15
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz
2024-7-11
Product Structure Extension of the Alon–Seymour–Thomas Theorem
2024-7-9
A Simple Proof of the Nonuniform Kahn–Kalai Conjecture
2024-7-4
Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
2024-7-4
Partial Reflections and Globally Linked Pairs in Rigid Graphs
2024-7-3
Functors on Relational Structures Which Admit Both Left and Right Adjoints
2024-7-3
Erratum: Multitasking Capacity: Hardness Results and Improved Constructions
2024-6-26
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
2024-6-25
The Tropical Critical Points of an Affine Matroid
2024-6-24
On the Weisfeiler–Leman Dimension of Permutation Graphs
2024-6-21
Phase Transitions of Structured Codes of Graphs
2024-6-19
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs
2024-6-13
On Graphs Coverable by \({k}\) Shortest Paths
2024-6-10
Brillouin Zones of Integer Lattices and Their Perturbations
2024-6-7
Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures
2024-6-7
A Stability Result of the Pósa Lemma
2024-6-6
A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs
2024-6-6
Which is the Worst-Case Nash Equilibrium?
2024-6-5
On Book Crossing Numbers of the Complete Graph
2024-6-3
Tuza’s Conjecture for Binary Geometries
2024-5-29
Topology of Cut Complexes of Graphs
2024-5-24
Left-Cut-Percolation and Induced-Sidorenko Bigraphs
2024-5-23
Concepts of Dimension for Convex Geometries
2024-5-22
Bounding and Computing Obstacle Numbers of Graphs
2024-5-20
An Axiomatization of Matroids and Oriented Matroids as Conditional Independence Models
2024-5-17
Rainbow Bases in Matroids
2024-5-7
The Maximal Running Time of Hypergraph Bootstrap Percolation
2024-5-7
A Simple Path to Component Sizes in Critical Random Graphs
2024-5-7
A Precise Condition for Independent Transversals in Bipartite Covers
2024-5-6
A Menger-Type Theorem for Two Induced Paths
2024-5-3
Hypergraph Horn Functions
2024-5-2
Sárközy’s Theorem in Various Finite Field Settings
2024-4-29
Random Necklaces Require Fewer Cuts
2024-4-26
On the Chromatic Number of Random Regular Hypergraphs
2024-4-24
帮你贴心管理全部的文献
研飞ivySCI,高效的论文管理
投稿经验分享
分享我的经验,帮你走得更远