Journal of Discrete Algorithms

Aims & Scope

Cessation.

Journal of Discrete Algorithms aimed to facilitate communication between researchers in theoretical computer science who were concerned with the design and analysis of discrete algorithms.

The Journal of Discrete Algorithms welcomed original papers in all areas of finite and discrete algorithm design and analysis.

The purpose of this journal was to feature new algorithms and data structures, new analyses or comparisons of known algorithms, complexity studies and well-focused review articles of currently-active subject areas.

Articles in other areas of theoretical computer science were also considered when there was a clear connection to computational issues.

The Journal of Discrete Algorithms has pledged to maintain high quality standards, an openness to all approaches to the subject, a transparent reviewing policy, and a minimal delay between submission and publication.

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Replacing suffix trees with enhanced suffix arrays

  Citation: 506

  Authors: Mohamed Ibrahim, Stefan, Enno

• Space efficient linear time construction of suffix arrays

  Citation: 133

  Authors: Pang, Srinivas

• Succinct data structures for flexible text retrieval systems

  Citation: 123

  Authors: Kunihiko

• On minimum metric dimension of honeycomb networks

  Citation: 111

  Authors: Paul, Rajan, Indra, Chris

• Two algorithms for the Student-Project Allocation problem

  Citation: 99

  Authors: David J., Robert W., David F.

• Wavelet trees for all

  Citation: 96

  Authors: Gonzalo

• An efficient fixed-parameter algorithm for 3-Hitting Set

  Citation: 90

  Authors: Rolf, Peter

• A note on the complexity of minimum dominating set

  Citation: 85

  Authors: Fabrizio

• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

  Citation: 72

  Authors: Vadim V., Martin

• Constructing suffix arrays in linear time

  Citation: 71

  Authors: Dong Kyue, Jeong Seop, Heejin, Kunsoo