ALGORITHMICA
Skrót:
ALGORITHMICA
ISSN:
0178-4617
Rok | Punkty ministerialne | Impact Factor | Eigenfactor | Article influence |
---|---|---|---|---|
2024 | 70 | |||
2023 | 70 | 0.00407 | 0.639 | |
2022 | 70 | 0.00397 | 0.622 | |
2021 | 70 | 0.00431 | 0.608 | |
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:
7.
Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
A Polynomial Kernel for Bipartite Permutation Vertex Deletion, Algorithmica vol. 84 (2022), 3246-3275
6.
Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs, Algorithmica vol. 84 (2022), 2271-2291
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.
Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta
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