Random Structures & Algorithms

Journal Abbreviation: RANDOM STRUCT ALGOR
Journal ISSN: 1042-9832

About Random Structures & Algorithms

    It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness.<br/><br/>Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs.
Year Impact Factor (IF) Total Articles Total Cites
2022 (2023 update) 1.0 - 1930
2021 1.057 - 1889
2020 1.131 110 1989
2019 1.047 69 1565
2018 1.008 53 1597
2017 0.985 54 1450
2016 1.243 66 1384
2015 1.011 69 1196
2014 0.924 46 1039
2013 0.656 43 982
2012 1.048 49 1059
2011 1.034 41 986
2010 0.717 42 1093