INFORMATION PROCESSING LETTERS

Skrót:
INFORM PROCESS LETT

ISSN:
0020-0190

RokPunkty ministerialneImpact FactorEigenfactorArticle influence
2023700.001690.382
2022700.001930.373
2021700.002210.384
2020700.003290.452
2019700.003870.42
2018200.004060.41
2017200.00450.397
2016150.006250.493
2015150.006190.447
2014150.006650.408
2013200.00940.513
2012200.008630.454
2011200.008160.414
2010200.008760.443
2009150.008530.421
2008150.010090.492
200700.010440.477

Publikacje:

15.
Adam Polak, Maksym Zub
Learning-augmented maximum flow, Information Processing Letters vol. 186 (2024), 7
14.
Karol Kosiński, Robert Mercas, Dirk Nowotka
Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77], Information Processing Letters vol. 130 (2018), 63-65
13.
Adam Polak
Why is it hard to beat O(n^2) for Longest Common Weakly Increasing Subsequence?, Information Processing Letters vol. 132 (2018), 1-5
12.
Robert Janczewski, Krzysztof Turowski
On the hardness of computing span of subcubic graphs, Information Processing Letters vol. 116(1) (2016), 26-32
11.
Robert Janczewski, Krzysztof Turowski
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones, Information Processing Letters vol. 115(2) (2015), 232-236
10.
Michał Dębski, Jarosław Grytczuk, Małgorzata Śleszyńska-Nowak
The strong chromatic index of sparse graphs, Information Processing Letters vol. 115 (2015), 326–330
9.
Jarosław Grytczuk, Piotr Szafruga, Michał Zmarz
Online version of the theorem of Thue, Information Processing Letters vol. 113 (2013), 193-195
8.
Lech Duraj
A linear algorithm for 3-letter longest common weakly increasing subsequence, Information Processing Letters vol. 113 (2013), 94-99
7.
Jarosław Grytczuk, Mieczysław Borowiecki, Monika Pilśniak
Coloring chip configurations on graphs and digraphs, Information Processing Letters vol. 112 (2012), 1-4
6.
Adam Roman
NP-completeness of the Road Coloring Problem, Information Processing Letters vol. 111 (2011), 342-347
5.
Bartosz Walczak
A simple representation of subwords of the Fibonacci word, Information Processing Letters vol. 110 (2010), 956-960
4.
Jarosław Grytczuk, Sebastian Czerwiński, Wiktor Żelazny
Lucky labelings of graphs, Information Processing Letters vol. 109 (2009), 1078-1081
3.
Jarosław Grytczuk
Invisible runners in finite fields, Information Processing Letters vol. 108 (2008), 64-67
2.
Maciej Ślusarek
A note on the dynamic storage allocation problem, Information Processing Letters vol. 20 (1985), 223-227
1.
Jarosław Grytczuk
The strong chromatic index of sparse graphs, Information Processing Letters vol. 115 (), 326-330