Write in a clean editor, then format for SIAM Journal on Discrete Mathematics in one click — DocuGuru applies the official SIAM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
SIAM Journal on Discrete Mathematics is a peer-reviewed journal published by SIAM, covering Advanced Graph Theory Research, Limits and Structures in Graph Theory, Complexity and Algorithms in Graphs. Over its lifetime it has published 3,399 papers, which have received 68,790 citations.
| Publisher | SIAM |
|---|---|
| Reference style | Numbered (SIAM) Numbered — [1], [2] in the text [1] A. Smith, B. Jones, and C. Lee, A representative article title, SIAM Journal on Discrete Mathematics 12 (2023) 45–58.
Formats any DOI in the closest standard style — SIAM Journal on Discrete Mathematics has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Advanced Graph Theory Research Limits and Structures in Graph Theory Complexity and Algorithms in Graphs graph theory and CDMA systems Graph Labeling and Dimension Problems |
| ISSN | 0895-4801 |
| Citation impact (2-yr) | 1.08 |
| h-index | 109 |
| i10-index | 1,453 |
| Top institutions publishing here | Centre National de la Recherche Scientifique |
| Journal website | www.siam.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a zero-one polynomial programming problem, and then relinearizes it into an extended linear program. It is shown that the strength of the resulting reformulation depends on the degree of the terms used to produce the polynomial…
This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding asymptotic expansion for the Taylor coefficients of the function. This approach is based on contour integration using Cauchy’s formula and Hankel-like contours. It constitutes an alternative…
Given a simple graph $G = ( V,E )$ and a positive number d, an $L_d ( 2,1 )$-labelling of G is a function $f:V ( G ) \to [ 0,\infty )$ such that whenever $x,y \in V$ are adjacent, $| f ( x ) - f ( y ) | \geq 2d$, and whenever…
Motivated by several applications, we introduce various distance measures between "top k lists." Some of these distance measures are metrics, while others are not. For each of these latter distance measures, we show that they are "almost" a metric in the following two seemingly unrelated aspects: (i) they satisfy a relaxed version of the polygonal…
A mathematical model is proposed for scheduling activities of periodic type. First a model is proposed for scheduling periodic events with particular time constraints. This problem, which could be considered the extension to periodic phenomena of ordinary scheduling with precedence constraints, is shown to be NP-complete. An algorithm for it of implicit enumeration type is…
