default search action
Information Processing Letters, Volume 179
Volume 179, January 2023
- Szymon Grabowski
, Dominik Köppl
Space-efficient Huffman codes revisited. 106274 - Dario Fiorenza, Daniele Gorla
Polynomial recognition of vulnerable multi-commodities. 106282 - Jorge C. Lucero
A note on the class of languages generated by F-systems over regular languages. 106283 - Thorben Tröbst
A real polynomial for bipartite graph minimum weight perfect matchings. 106286 - Tim Zeitz
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times. 106287 - Kenji Mikawa, Ken Tanaka:
Efficient linear-time ranking and unranking of derangements. 106288 - Sotirios Dimos
Escaping Braess's paradox through approximate Caratheodory's theorem. 106289 - Peter Kostolányi
On some decidability questions concerning supports of rational series. 106290 - Robert Cummings, Jeffrey O. Shallit
Mesosome avoidance. 106291 - Felice Ciccarelli
A note on the satisfactory partition problem: Constant size requirement. 106292 - Carl Feghali:
A note on matching-cut in Pt-free graphs. 106294 - Aniruddha Biswas
On the "majority is least stable" conjecture. 106295 - Moonju Park, Hyeongboo Baek:
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions. 106296 - Toshihiro Fujito
A note on approximations of directed edge dominating set. 106303 - Michel Raynal, Gadi Taubenfeld:
Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938]. 106304 - Abhishek Singh
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times. 106305 - Gilad Baruch, Shmuel T. Klein
Guided blocks WOM codes. 106312 - Xiangwen Li
Strong edge-colorings of sparse graphs with 3Δ - 1 colors. 106313 - Artur Czumaj, Andrzej Lingas:
On parallel time in population protocols. 106314 - Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan
Polynomial kernels for tracking shortest paths. 106315 - Riccardo Dondi, Danny Hermelin:
Computing the k densest subgraphs of a graph. 106316 - Dekel Tsur
Faster deterministic algorithm for Cactus Vertex Deletion. 106317 - Alessandro Cimatti, Luca Geatti
GR(1) is equivalent to R(1). 106319 - Debrup Chakraborty
On the security of TrCBC. 106320
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-25 22:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: