Discrete Applied Mathematics

Discrete Applied Mathematics

ISSNs: 0166-218X

Additional searchable ISSN (electronic): 1872-6771

Elsevier BV * North-Holland, Netherlands

Scopus rating (2023): CiteScore 2.3 SJR 0.657 SNIP 1.065

Journal

Journal Metrics

Research Output

  1. 2016
  2. Multitasking via alternate and shared processing: Algorithms and complexity

    Hall, N. G., Leung, J.Y.-T. & Li, C.-L., 31 Jul 2016, In: Discrete Applied Mathematics. 208, p. 41-58

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Scopus citations: 28
    Check@CityULib
  3. 2001
  4. Finding the k most vital edges with respect to minimum spanning trees for fixed k

    Liang, W., 15 Oct 2001, In: Discrete Applied Mathematics. 113, 2-3, p. 319-327

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Scopus citations: 21
    Check@CityULib
  5. Very fast parallel algorithms for approximate edge coloring

    Han, Y., Liang, W. & Shen, X., 15 Mar 2001, In: Discrete Applied Mathematics. 108, 3, p. 227-238

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Scopus citations: 2
    Check@CityULib
  6. 1996
  7. On the complexity of comparing evolutionary trees

    Hein, J., Jiang, T., Wang, L. & Zhang, K., Dec 1996, In: Discrete Applied Mathematics. 71, 1-3, p. 153-169

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Scopus citations: 171
    Check@CityULib
  8. On the fixed interval due-date scheduling problem

    Lee, C.-Y. & Li, C.-L., 12 Jun 1996, In: Discrete Applied Mathematics. 68, 1-2, p. 101-117

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Scopus citations: 8
    Check@CityULib
  9. 1992
  10. The point-to-point delivery and connection problems: complexity and algorithms

    Li, C.-L., McCormick, S. T. & Simchi-Levi, D., 28 May 1992, In: Discrete Applied Mathematics. 36, 3, p. 267-292

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Scopus citations: 26
    Check@CityULib
  11. 1990
  12. The complexity of finding two disjoint paths with min-max objective function

    Li, C.-L., McCormick, S. T. & Simchi-Levi, D., Jan 1990, In: Discrete Applied Mathematics. 26, 1, p. 105-115

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Scopus citations: 129
    Check@CityULib