External Links

    Journal: Int. J. Found. Comput. Sci.

    Volume 29, Issue 8

    1247 -- 1248Costas S. Iliopoulos, Fatima Vayani, Kamil Salikhov. Preface
    1249 -- 1255Kamil Salikhov. Improved Compression of DNA Sequencing Data with Cascading Bloom Filters
    1257 -- 1278Andreas Poyias, Simon J. Puglisi, Rajeev Raman. m-Bonsai: A Practical Compact Dynamic Trie
    1279 -- 1295Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi. Bidirectional Variable-Order de Bruijn Graphs
    1297 -- 1310Andreia Sofia Teixeira, Francisco Fernandes, Alexandre P. Francisco. SpliceTAPyR - An Efficient Method for Transcriptome Alignment
    1311 -- 1329Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Jakub Radoszewski. Palindromic Decompositions with Gaps and Errors
    1331 -- 1343Carl Barton, Chang Liu, Solon P. Pissis. Fast Average-Case Pattern Matching on Weighted Sequences
    1345 -- 1354Maryam Abdollahyan, Greg Elgar, Fabrizio Smeraldi. Identifying Potential Regulatory Elements by Transcription Factor Binding Site Alignment Using Partial Order Graphs
    1355 -- 1372Jamie J. Alnasir, Hugh P. Shanahan. Transcriptomics: Quantifying Non-Uniform Read Distribution Using MapReduce

    Volume 29, Issue 7

    1089 -- 1105Meng Zhang, Yi Zhang. Space-Efficient Representations for Glushkov Automata
    1107 -- 1117Hong Wang, Jie Guan, Lin Ding. On Equivalence Relations of State Diagram of Cascade Connection of an LFSR into an NFSR
    1119 -- 1142Ömür Kivanç Kürkçü, Ersin Aslan. A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
    1143 -- 1150Minjia Shi, Hongwei Zhu, Liqin Qian, Patrick Solé. On Self-Dual Four Circulant Codes
    1151 -- 1164Canan Çiftçi, Aysun Aytaç. Exponential Independence Number of Some Graphs
    1165 -- 1179Wen Chean Teh. Compositions of Functions and Permutations Specified by Minimal Reaction Systems
    1181 -- 1201Shuo Yan, Yun-Yong Zhang, Binfeng Yan, Lin Yan, Jinfeng Kou. Data Associations Between Two Hierarchy Trees
    1203 -- 1213Toshihiro Koga. Context-Freeness of Parsing Expression Languages is Undecidable
    1215 -- 1230Mehdy Roayaei, Mohammadreza Razzazi. Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
    1231 -- 1245Mostafa Nouri Baygi. The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem

    Volume 29, Issue 6

    951 -- 978Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi. An Efficient Algorithm for the Construction of the Equation Tree Automaton
    979 -- 993Andreas Darmann, Janosch Döcker, Britta Dorn. The Monotone Satisfiability Problem with Bounded Variable Appearances
    995 -- 1001Shuli Zhao, Weihua Yang, Shurong Zhang, Liqiong Xu. Component Edge Connectivity of Hypercubes
    1003 -- 1021Yu-Liang Liu, Jou-Ming Chang. Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks
    1023 -- 1044HeeWon Chung, Myungsun Kim. Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications
    1045 -- 1062Younes Guellouma, Hadda Cherroun. From Tree Automata to Rational Tree Expressions
    1063 -- 1088Caixue Zhou, Guangyong Gao, Zongmin Cui, Zhiqiang Zhao. Certificate-Based Generalized Ring Signcryption Scheme

    Volume 29, Issue 5

    701 -- 704Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer, Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy 0002, Dominique Perrin. Preface
    705 -- 720Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy 0002, Dominique Perrin. Rigidity and Substitutive Dendric Words
    721 -- 740Émilie Charlier, Wolfgang Steiner. Permutations and Negative Beta-Shifts
    741 -- 767Cédric Chauve, Julien Courtiel, Yann Ponty. Counting, Generating, Analyzing and Sampling Tree Alignments
    769 -- 799Nicolas Bedon. Complementation of Branching Automata for Scattered and Countable N-Free Posets
    801 -- 824Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier. Aperiodic String Transducers
    825 -- 843Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela. Degrees of Infinite Words, Polynomials and Atoms
    845 -- 860Daniil Gasnikov, Arseny M. Shur. Square-Free Partial Words with Many Wildcards
    861 -- 876Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej. Operations on Unambiguous Finite Automata
    877 -- 892Andreas Maletti. Compositions of Tree-to-Tree Statistical Machine Translation Models
    893 -- 909Florin Manea, Dirk Nowotka, Markus L. Schmid. On the Complexity of Solving Restricted Word Equations
    911 -- 933Henryk Michalewski, Michal Skrzypczak. On the Strength of Unambiguous Tree Automata
    935 -- 950Dirk Nowotka, Aleksi Saarela. One-Variable Word Equations and Three-Variable Constant-Free Word Equations

    Volume 29, Issue 4

    457 -- 459Jarkko Kari, Alexander Okhotin, Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis. Preface
    461 -- 480Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Valentino Di Donato, Maurizio Patrignani, Vincenzo Roselli, Ioannis G. Tollis. Algorithms and Bounds for L-Drawings of Directed Graphs
    481 -- 504Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev. A Combinatorial Model of Two-Sided Search
    505 -- 527Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano. Online Minimum Spanning Tree with Advice
    529 -- 549Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov. Reachability Problems for One-Dimensional Piecewise Affine Maps
    551 -- 569Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger. Online Graph Coloring Against a Randomized Adversary
    571 -- 590Maciej Gazda, Tim A. C. Willemse. Cooking Your Own Parity Game Preorders Through Matching Plays
    591 -- 621Jan Clemens Gehrke, Klaus Jansen, Stefan E. J. Kraft, Jakob Schikowski. A PTAS for Scheduling Unrelated Machines of Few Different Types
    623 -- 645Heikki Hyyrö, Shunsuke Inenaga. Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions
    647 -- 662Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh. Grover's Search with Faults on Some Marked Elements
    663 -- 685Kent Kwee, Friedrich Otto. Nondeterministic Ordered Restarting Automata
    687 -- 700Nikolajs Nahimovs, Alexander Rivosh. Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations

    Volume 29, Issue 3

    331 -- 356Michelangelo Bucci, Gwénaël Richomme. Greedy Palindromic Lengths
    357 -- 376Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh 0001, László Tóth. On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
    377 -- 390Parisa Derakhshan, Walter Hussak. Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs
    391 -- 402Pardis Kavand, Ali Mohades. A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
    403 -- 414Somnath Bera, Kalpana Mahalingam, K. G. Subramanian 0001. Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator
    415 -- 424Luan Carlos de S. M. Ozelim, André Luís B. Cavalcante. The Iota-Delta Function as an Alternative to Boolean Formalism
    425 -- 446Masaki Nakanishi. Quantum Pushdown Automata with Garbage Tape
    447 -- 0Zeynep Nihan Berberler, Esin Yigit. Link Vulnerability in Networks

    Volume 29, Issue 2

    139 -- 142Igor Potapov, Pavel Semukhin. Preface
    143 -- 164Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto. Diverse Palindromic Factorization is NP-Complete
    165 -- 186Dietmar Berwanger, Marie van den Bogaard. Consensus Game Acceptors and Iterated Transductions
    187 -- 212Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác. On the Size of Two-Way Reasonable Automata for the Liveness Problem
    213 -- 232Christopher Czyba, Wolfgang Thomas, Christopher Spinrath. Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
    233 -- 250Joey Eremondi, Oscar H. Ibarra, Ian McQuillan. On the Density of Context-Free and Counter Languages
    251 -- 270Markus Holzer 0001, Sebastian Jakobi, Martin Kutrib. Minimal Reversible Deterministic Finite Automata
    271 -- 296Ismaël Jecker, Emmanuel Filiot. Multi-Sequential Word Relations
    297 -- 314Ines Klimann, Matthieu Picantin, Dmytro Savchuk. A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
    315 -- 0Timothy Ng 0001, David Rappaport, Kai Salomaa. State Complexity of Neighbourhoods and Approximate Pattern Matching

    Volume 29, Issue 1

    1 -- 16Vojtech Vorel. On Basic Properties of Jumping Finite Automata
    17 -- 62Martin Lück. Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic
    63 -- 90Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram. A Family of Scheduling Algorithms for Hybrid Parallel Platforms
    91 -- 100Nianfeng Lin, Damei Lü, Jinhua Wang. L(2, 1)-Edge-Labelings of the Edge-Path-Replacement of a Graph
    101 -- 122Alejandro López-Ortiz, Cynthia B. Perez, Jazmín Romero. Arbitrary Overlap Constraints in Graph Packing Problems
    123 -- 138Ghajendran Poovanandran, Wen Chean Teh. On M-Equivalence and Strong M-Equivalence for Parikh Matrices
    runs on