CountryOfPapers CountryOfPapers
Journal list Promote
verified COP 1,3 · Q2 • database Scopus / SJR & Web of Science indexed
Combinatorica
Germany · Janos Bolyai Mathematical So...
workspace_premium Q2 — Discrete Mathematics and Combinatorics lock Subscription

Combinatorica

Combinatorica is a journal indexed in SJR in Computational Mathematics and Discrete Mathematics and Combinatorics with an H index of 62. It has a price of 2990 €. It has a COP Index of 1,3 (best band Q2). It is published in English. It has a COP Index of 1,3.

ISSN: 0209-9683
Publisher: Janos Bolyai Mathematical Society
Category: Computational Mathematics
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Portal NPD menu_book Guidelines NPD
schedule CountryOfPapers database fields
COP Index trending_up
1,3 Q2

19 of 75 journals in Discrete Mathematics and Combinatorics

H-index · SJR 62 · 1,269
Acceptance rate pie_chart
29% Selective
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
2.990 € Subscription
Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

COP Index

1,3

Q2

SJR Impact

1,269

H-index

62

Docs (year)

62

Docs 3y

152

Total refs

1518

Cites 3y

216

Citable 3y

152

Cites/Doc 2y

1.28

Ref/Doc

24.48

Immediate OA

2990 €

Embargoed OA

NPD

Non OA / Submission

0 €

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Complexity of the Frobenius problem

View more

Transitive Edge Coloring of Graphs and Dimension of Lattices

View more

Erratum to: Punctured Combinatorial Nullstellensätze

View more

Efficient representation of perm groups

View more

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

View more

Distributed near-optimal matching

View more

Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity

View more

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols

View more

Dense graphs and edge reconstruction

View more

Davenport-Schinzel Trees*

View more

Critical Facets of the Stable Set Polytope

View more

Concentration of Multivariate Polynomials and Its Applications

View more
SHOW MORE ARTICLES

Computing the composition factors of a permutation group in polynomial time

View more

A short proof of Gowers' lower bound for the regularity lemma

View more

Classes of graphs that exclude a tree and a clique and are not vertex ramsey

View more

Bounds on the Chv'tal Rank of Polytopes in the 0/1-Cube*

View more

Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph

View more

Bounding the vertex cover number of a hypergraph

View more

Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in

View more

Bipartite subgraphs

View more

Biased random walks

View more

Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

View more

An analysis of a Monte Carlo algorithm for estimating the permanent

View more

An algorithm for finding hamilton paths and cycles in random graphs

View more

FAQs