ISSN: 0963-5483

Journal Guideline

Combinatorics Probability and Computing Q1 Unclaimed

Cambridge University Press United Kingdom

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

Combinatorics Probability and Computing is a journal indexed in SJR in Statistics and Probability and Applied Mathematics with an H index of 56. It has a price of 1626,56 €. It has an SJR impact factor of 1,016 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,016.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Applied Mathematics (Q1) Computational Theory and Mathematics (Q1) Statistics and Probability (Q1) Theoretical Computer Science (Q2)

Price

1626,56 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

1,016

SJR Impact factor

56

H Index

44

Total Docs (Last Year)

118

Total Docs (3 years)

1240

Total Refs

128

Total Cites (3 years)

118

Citable Docs (3 years)

1.1

Cites/Doc (2 years)

28.18

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Annals of Mathematics Q1
Annals of Statistics Q1
Journal of the Royal Statistical Society. Series B: Statistical Methodology Q1
Journal of the American Statistical Association Q1
Journal of Business and Economic Statistics Q1

Compare this journals

Aims and Scope

Best articles by citations

Concentration for Independent Permutations

On the Number of Convex Lattice Polygons

On a Square Packing Problem

Fast Unimodular Counting

On the Fluctuations of the Giant Component

On the Number of Edges in Random Planar Graphs

Isoperimetric Problems for r-sets

Singularity Probabilities for Random Matrices over Finite Fields

Critical Exponents, Colines, and Projective Geometries

The Turn Theorem for Random Graphs

Convergence of the Iterated Prisoner's Dilemma Game

Function Learning from Interpolation

SHOW MORE ARTICLES

Locally Thin Set Families

Descent Functions and Random Young Tableaux

Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs

On the Lock-in Probability

Dominating a Family of Graphs with Small Connected Subgraphs

Operations Which Preserve Path-Width at Most Two

A Subset Expansion of the Coloured Tutte Polynomial

Consistency of Natural Relations on Sets

On the Automorphism Groups

On the Circuit Cover Problem

The Number of Independent Sets in a Regular Graph

Algorithmic Aspects of Partial List Colourings