International Journal of Learning Technologies and Learning Environments 2025

1 papers

Top Research Directions

The 1 research directions with International Journal of Learning Technologies and Learning Environments 2025 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.

#DirectionPapersShare
1Overcoming the Manual Grading Bottleneck1100.0%

Download all directions as CSV

Institutions

Institutions credited by International Journal of Learning Technologies and Learning Environments 2025 papers: a paper credits every institution named in its affiliations, once. 5 institutions share 1 credited papers.

#InstitutionPapersShare
105vv4xn30 1100.0%
2Institute of Science Tokyo 1100.0%
3The University of Tokyo 1100.0%
4University of Helsinki 1100.0%
5University of St Andrews 1100.0%

Download all institutions as CSV

About this data

Papers. International Journal of Learning Technologies and Learning Environments 2025 lists 1 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 1 of 1 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “International Journal of Learning Technologies and Learning Environments 2025”, https://lacuna.tiptreesystems.com/venue/international-journal-of-learning-technologies-and-learning/2025.

Top Authors

AuthorPapers
Hibiki Ito1

Papers

Title
Computerized Model of Assessment Procedures of Students’ Reading Capabilities Based on Abridgement Method Employing Two-Pointer Problem Solution and Dynamic Programming