verified SJR 1,269 · Q1 • database Scopus / SJR & Web of Science indexed

Germany · Janos Bolyai Mathematical So...

workspace_premium Q1 — Computational Mathematics lock Subscription Unclaimed

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 an SJR impact factor of 1,269 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,269.

ISSN: 0209-9683

Editorial: Janos Bolyai Mathematical Society

Category: Computational Mathematics

Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD

schedule Datos CoP · solo campos en BD

SJR Impact Factor trending_up

1,269 Q1

H-index 62

Tasa de Aceptación pie_chart

29% Selectiva

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

2.990 € Subscription

Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

1,269

H-index

Docs (year)

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.

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID * * Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Complexity of the Frobenius problem

Transitive Edge Coloring of Graphs and Dimension of Lattices

Erratum to: Punctured Combinatorial Nullstellensätze

Efficient representation of perm groups

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

Distributed near-optimal matching

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

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols

Dense graphs and edge reconstruction

Davenport-Schinzel Trees*

Critical Facets of the Stable Set Polytope

Concentration of Multivariate Polynomials and Its Applications

SHOW MORE ARTICLES

Computing the composition factors of a permutation group in polynomial time

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

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

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

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

Bounding the vertex cover number of a hypergraph

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

Bipartite subgraphs

Biased random walks

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

An analysis of a Monte Carlo algorithm for estimating the permanent

An algorithm for finding hamilton paths and cycles in random graphs

FAQS

In Country of Papers you can find SJR impact factor and other metrics to help you decide on a Journal.