About
Technology
Issues
FAQ
Title
Abstract
Text
Figure Captions
Table Cells
Section Titles
Keywords
Subjects
Authors
From
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1995
1990
1985
1980
1975
1970
1960
1950
1940
1930
1920
1910
1900
1850
1800
1700
1600
To
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1995
1990
1985
1980
1975
1970
1960
1950
1940
1930
1920
1910
1900
1850
1800
1700
1600
All Types
Articles
Communications
Reviews
Discussions
Case Reports
Chapters
Books
News
Editorials
Order By
Order By Year ASC
Order By Year DESC
Order By Citations ASC
Order By Citations DESC
Go
Scientometrics
Impact Factor
Discipline Ranks
H-Index
G-Index
Articles
Citations
Article Citations
Citation Distribution
Search This Journal
Overviews
Top Institutions
Top Schools
Top Authors
Prolific Authors
Top Articles
exaly
›
Journals
›
Discrete Applied Mathematics
›
Top Articles
Discrete Applied Mathematics
Mathematics
,
Applied Mathematics
1
(top 14%)
Impact Factor
1
(top 14%)
extended IF
101
(top 3%)
H-Index
2.6K
authors
8.7K
papers
100.8K
citations
3.2K
citing journals
17.7K
citing authors
Most Cited Articles of Discrete Applied Mathematics
Title
Year
Citations
Scheduling subject to resource constraints: classification and complexity
1983
892
Complement reducible graphs
1981
503
Pseudo-Boolean optimization
2002
430
Resolvability in graphs and the metric dimension of a graph
2000
416
A survey of very large-scale neighborhood search techniques
2002
403
Pairings for cryptographers
2008
399
Reverse search for enumeration
1996
395
Upper bounds to the clique width of graphs
2000
388
Landmarks in graphs
1996
378
Linear time algorithms for NP-hard problems restricted to partial k-trees
1989
362
A fast algorithm for the maximum clique problem
2002
351
Signed graphs
1982
347
Directed hypergraphs and applications
1993
334
A survey of scheduling with controllable processing times
2007
282
A branch and bound algorithm for the job-shop scheduling problem
1994
272
The Riordan group
1991
250
The selective travelling salesman problem
1990
250
Some remarks on the stable matching problem
1985
245
Methods and problems of communication in usual networks
1994
243
Models, relaxations and exact approaches for the capacitated vehicle routing problem
2002
223
On some counting polynomials in chemistry
1988
220
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
1992
215
The maximum edge biclique problem is NP-complete
2003
213
A game of cops and robbers
1984
213
Scheduling jobs with fixed start and end times
1987
211
previous
1988
1989
1990
How are inpact factors calculated?
The impact factor (IF) is calculated by counting citations from peer-reviewed journals only.
extended IF
also counts citations from books and conference papers. However, no patent, abstract, working papers, online documents, etc., are covered.
site/software ©
exaly
; All materials licenced under
CC by-SA
.