Open Access
Efficient Generation of some Greedy Binary Gray codes
RAIRO-Theor. Inf. Appl., 59 (2025) 16
Published online: 07 November 2025
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)
RAIRO: ITA is a section of RAIRO, Revue d'Automatique, d'Informatique et de Recherche Opérationnelle. RAIRO is an international journal devoted to high-level pure and applied research on the use of scientific methods and information processing in business and industry. Read more
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) is being published under Subscribe to Open. All articles are published in open access free of charge under a CC-BY 4.0 license.
More information and FAQs are available here. To discuss or join the programme, please contact us.
More information and FAQs are available here. To discuss or join the programme, please contact us.
-
-
Open Access
On local limit theorems for q-multinomial distributions
RAIRO-Theor. Inf. Appl., 59 (2025) 14Published online: 29 October 2025 -
Open Access
Quorum colorings of maximum cardinality in linear time for a subclass of perfect trees
RAIRO-Theor. Inf. Appl., 59 (2025) 15Published online: 29 October 2025 -
Open Access
Pattern avoiding and q-decreasing binary words
RAIRO-Theor. Inf. Appl., 59 (2025) 13Published online: 17 October 2025 -
Open Access
Efficient counting of k-convex polyominoes
RAIRO-Theor. Inf. Appl., 59 (2025) 11Published online: 15 October 2025 -
Open Access
Superfluous Arcs and Confluent Reductions in the Minimum Feedback Vertex Set Problem
RAIRO-Theor. Inf. Appl., 59 (2025) 12Published online: 15 October 2025
|
Free Access
Upper bound for palindromic and factor complexity of rich wordsRAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
|
|
Open Access
Synchronizing series-parallel deterministic finite automata with loops and related problemsRAIRO-Theor. Inf. Appl., 55 (2021) 7
Published online: 22 July 2021
|
|
Open Access
Quorum colorings of maximum cardinality in linear time for a subclass of perfect treesRAIRO-Theor. Inf. Appl., 59 (2025) 15
Published online: 29 October 2025
|
|
Free Access
The complexity of the travelling repairman problemRAIRO-Theor. Inf. Appl., 20 1 (1986) 79-87
Published online: 01 February 2017
|
|
Free Access
Enumerating Davenport-Schinzel sequencesRAIRO-Theor. Inf. Appl., 26 5 (1992) 387-402
Published online: 01 February 2017
|
Recent articles (published in the past 5 years)
Linear automata with translucent letters and linear context-free trace languagesRAIRO-Theor. Inf. Appl., 54 (2020) 3
Published online: 10 April 2020
|
|
Open Access
Non-returning deterministic and nondeterministic finite automata with translucent lettersRAIRO-Theor. Inf. Appl., 57 (2023) 8
Published online: 18 October 2023
|
Total edge–vertex dominationRAIRO-Theor. Inf. Appl., 54 (2020) 1
Published online: 28 February 2020
|
|
Open Access
Explicit values of a q-multiple zeta-star function at roots of unityRAIRO-Theor. Inf. Appl., 59 (2025) 5
Published online: 19 August 2025
|
|
Open Access
Human-verifiable proofs in the theory of word-representable graphsRAIRO-Theor. Inf. Appl., 58 (2024) 9
Published online: 26 March 2024
|
