COMBINATORICS PROBABILITY & COMPUTING
Skrót:
COMB PROBAB COMPUT
ISSN:
0963-5483
Rok | Punkty ministerialne | Impact Factor | Eigenfactor | Article influence |
---|---|---|---|---|
2023 | 100 | 0.00217 | 0.992 | |
2022 | 100 | 0.00278 | 1.186 | |
2021 | 100 | 0.00292 | 1.275 | |
2020 | 100 | 0.00335 | 1.393 | |
2019 | 100 | 0.00362 | 1.203 | |
2018 | 25 | 0.00389 | 1.224 | |
2017 | 25 | 0.00372 | 1.098 | |
2016 | 25 | 0.00435 | 1.185 | |
2015 | 25 | 0.00476 | 1.234 | |
2014 | 25 | 0.00586 | 1.455 | |
2013 | 20 | 0.0055 | 1.274 | |
2012 | 25 | 0.00566 | 1.26 | |
2011 | 27 | 0.00542 | 1.155 | |
2010 | 27 | 0.00753 | 1.465 | |
2009 | 20 | 0.00623 | 1.142 | |
2008 | 20 | 0.00603 | 1.088 | |
2007 | 0 | 0.00498 | 0.889 |
Publikacje:
7.
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The excluded tree minor theorem revisited, Combinatorics Probability and Computing vol. 33 (2024), 85-90
6.
Andrzej Grzesik, Daniel Král, Oleg Pikhurko
Forcing generalised quasirandom graphs efficiently, Combinatorics Probability and Computing vol. 33 (1) (2024), 16-31
5.
Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec
On tripartite common graphs, Combinatorics Probability and Computing vol. 31 (5) (2022), 907-923
4.
Vida Dujmović, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood
Clustered 3-colouring graphs of bounded degree, Combinatorics Probability and Computing vol. 31 (2022), 123-135
3.
Marek Zaionc, Neininger Ralph, Hwang
Preface, Combinatorics Probability and Computing vol. 28(4) (2019), 483-484
2.
János Pach, Bartosz Walczak
1.
A graph-grabbing game, Combinatorics Probability and Computing vol. 20 (2011), 623-629