Promote Sponsor
verified SJR 0,355 · Q3 • database Scopus / SJR & Web of Science indexed
Constraints
Netherlands · Springer Netherlands
workspace_premium Q3 — Software lock_open Open Access Unclaimed

Constraints

This journal provides a common forum for the many disciplines interested in constraint programming and constraint satisfaction and optimization, and the many application domains in which constraint technology is employed. It covers all aspects of computing with constraints, inclu...

ISSN: 1383-7133
Editorial: Springer Netherlands
Category: Software
Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Visitar Portal de la Editorial menu_book Guidelines NPD
schedule Datos CoP · solo campos en BD
SJR Impact Factor trending_up
0,355 Q3
H-index 49
Tasa de Aceptación pie_chart
31%
Fuente Acceptance_Rate
Tiempo a publicación hourglass_top
NPD
Campo Sin dato
Coste de Publicación (APC) payments
2.190 € Open Access
Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,355

H-index

49

Docs (year)

11

Docs 3y

39

Total refs

553

Cites 3y

58

Citable 3y

35

Cites/Doc 2y

1.47

Ref/Doc

50.27

Immediate OA

2190 €

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

A Comparison between SAT and CSP Techniques

View more

A General Qualitative Framework for Temporal and Spatial Reasoning

View more

Implementing a Test for Tractability

View more

Maintaining Longest Paths Incrementally

View more

On Benchmarking Constraint Logic Programming Platforms. Response to Fernandez and Hill's "A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains"

View more

Periodic Constraint Satisfaction Problems: Tractable Subclasses

View more

FAQS