ALGORITHMICA
Skrót:
ALGORITHMICA
ISSN:
0178-4617
| Rok | Punkty ministerialne | Impact Factor | Eigenfactor | Article influence |
|---|---|---|---|---|
| 2021 | 70 | |||
| 2020 | 70 | 0.00414 | 0.56 | |
| 2019 | 70 | 0.00466 | 0.545 | |
| 2018 | 25 | 0.00574 | 0.694 | |
| 2017 | 25 | 0.00533 | 0.64 | |
| 2016 | 25 | 0.00516 | 0.604 | |
| 2015 | 20 | 0.00603 | 0.68 | |
| 2014 | 20 | 0.00559 | 0.624 | |
| 2013 | 25 | 0.00684 | 0.764 | |
| 2012 | 30 | 0.00619 | 0.742 | |
| 2011 | 27 | 0.00479 | 0.616 | |
| 2010 | 27 | 0.00499 | 0.721 | |
| 2009 | 20 | 0.00469 | 0.668 | |
| 2008 | 20 | 0.00559 | 0.8 | |
| 2007 | 0 | 0.0056 | 0.721 |
Publikacje:
5.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs, ALGORITHMICA vol. 83 (2021), 2634-2650
4.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Compression of Dynamic Graphs Generated by a Duplication Model, ALGORITHMICA vol. 82 (2020), 2687-2707
3.
Lech Duraj, Marvin Künnemann, Adam Polak
2.
The Partial Visibility Representation Extension Problem, ALGORITHMICA vol. 80 (8) (2018), 2286-2323
1.
Piotr Micek, Veit Wiechert
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths, ALGORITHMICA vol. 77 (2017), 1060-1070