Hoffmann, Stefan State complexity of permutation and the language inclusion problem up to Parikh equivalence on alphabetical pattern constraints and partially ordered NFAs. (English) Zbl 07770237 Int. J. Found. Comput. Sci. 34, No. 8, 959-986 (2023). MSC: 68Qxx 20Mxx 68-XX PDFBibTeX XMLCite \textit{S. Hoffmann}, Int. J. Found. Comput. Sci. 34, No. 8, 959--986 (2023; Zbl 07770237) Full Text: DOI
Bondar, Eugenija A.; Casas, David; Volkov, Mikhail V. Completely reachable automata: an interplay between automata, graphs, and trees. (English) Zbl 07749893 Int. J. Found. Comput. Sci. 34, No. 6, 655-690 (2023). MSC: 68Qxx 20Mxx 05Cxx PDFBibTeX XMLCite \textit{E. A. Bondar} et al., Int. J. Found. Comput. Sci. 34, No. 6, 655--690 (2023; Zbl 07749893) Full Text: DOI arXiv
Asano, Tetsuo Transportation problem allowing sending and bringing back. (English) Zbl 07729636 Int. J. Found. Comput. Sci. 34, No. 5, 487-505 (2023). MSC: 68R10 90C05 90C39 05C99 PDFBibTeX XMLCite \textit{T. Asano}, Int. J. Found. Comput. Sci. 34, No. 5, 487--505 (2023; Zbl 07729636) Full Text: DOI
Chen, Yen Hung The clustered selected-internal Steiner tree problem. (English) Zbl 1522.68393 Int. J. Found. Comput. Sci. 33, No. 1, 55-66 (2022). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{Y. H. Chen}, Int. J. Found. Comput. Sci. 33, No. 1, 55--66 (2022; Zbl 1522.68393) Full Text: DOI arXiv
Fleischmann, Pamela; Lejeune, Marie; Manea, Florin; Nowotka, Dirk; Rigo, Michel Reconstructing words from right-bounded-block words. (English) Zbl 07726950 Int. J. Found. Comput. Sci. 32, No. 6, 619-640 (2021). Reviewer: Gabriele Fici (Palermo) MSC: 68R15 68Q25 PDFBibTeX XMLCite \textit{P. Fleischmann} et al., Int. J. Found. Comput. Sci. 32, No. 6, 619--640 (2021; Zbl 07726950) Full Text: DOI
Ko, Sang-Ki; Han, Yo-Sub; Salomaa, Kai Generalizations of code languages with marginal errors. (English) Zbl 1522.68277 Int. J. Found. Comput. Sci. 32, No. 5, 509-529 (2021). MSC: 68Q45 94A45 PDFBibTeX XMLCite \textit{S.-K. Ko} et al., Int. J. Found. Comput. Sci. 32, No. 5, 509--529 (2021; Zbl 1522.68277) Full Text: DOI
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Ono, Hirotaka; Sandhya, T. P. Graph orientation with edge modifications. (English) Zbl 1458.68138 Int. J. Found. Comput. Sci. 32, No. 2, 209-233 (2021). MSC: 68R10 05C20 05C21 05C85 68W40 PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Int. J. Found. Comput. Sci. 32, No. 2, 209--233 (2021; Zbl 1458.68138) Full Text: DOI
Chen, Ke; Dumitrescu, Adrian Selection algorithms with small groups. (English) Zbl 1458.68292 Int. J. Found. Comput. Sci. 31, No. 3, 355-369 (2020). MSC: 68W40 68R05 PDFBibTeX XMLCite \textit{K. Chen} and \textit{A. Dumitrescu}, Int. J. Found. Comput. Sci. 31, No. 3, 355--369 (2020; Zbl 1458.68292) Full Text: DOI arXiv
Lavado, Giovanna J.; Prigioniero, Luca Concise representations of reversible automata. (English) Zbl 1427.68149 Int. J. Found. Comput. Sci. 30, No. 6-7, 1157-1175 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. J. Lavado} and \textit{L. Prigioniero}, Int. J. Found. Comput. Sci. 30, No. 6--7, 1157--1175 (2019; Zbl 1427.68149) Full Text: DOI
Keeler, Chris; Salomaa, Kai Branching measures and nearly acyclic NFAs. (English) Zbl 1427.68148 Int. J. Found. Comput. Sci. 30, No. 6-7, 1135-1155 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{C. Keeler} and \textit{K. Salomaa}, Int. J. Found. Comput. Sci. 30, No. 6--7, 1135--1155 (2019; Zbl 1427.68148) Full Text: DOI
Gelle, Kitti; Iván, Szabolcs Recognizing union-find trees is NP-complete, even without rank info. (English) Zbl 1427.68059 Int. J. Found. Comput. Sci. 30, No. 6-7, 1029-1045 (2019). MSC: 68P05 68Q17 PDFBibTeX XMLCite \textit{K. Gelle} and \textit{S. Iván}, Int. J. Found. Comput. Sci. 30, No. 6--7, 1029--1045 (2019; Zbl 1427.68059) Full Text: DOI
Tokat, Hüseyin; Kirlangiç, Alpay On the domination integrity. (English) Zbl 1427.05169 Int. J. Found. Comput. Sci. 30, No. 5, 811-826 (2019). MSC: 05C69 05C76 PDFBibTeX XMLCite \textit{H. Tokat} and \textit{A. Kirlangiç}, Int. J. Found. Comput. Sci. 30, No. 5, 811--826 (2019; Zbl 1427.05169) Full Text: DOI
Große, Ulrike; Knauer, Christian; Stehn, Fabian; Gudmundsson, Joachim; Smid, Michiel Fast algorithms for diameter-optimally augmenting paths and trees. (English) Zbl 1415.68254 Int. J. Found. Comput. Sci. 30, No. 2, 293-313 (2019). MSC: 68U05 68R10 68W40 PDFBibTeX XMLCite \textit{U. Große} et al., Int. J. Found. Comput. Sci. 30, No. 2, 293--313 (2019; Zbl 1415.68254) Full Text: DOI arXiv
Nouri-Baygi, Mostafa The computational complexity of and approximation algorithms for variants of the component selection problem. (English) Zbl 1415.68112 Int. J. Found. Comput. Sci. 29, No. 7, 1231-1245 (2018). MSC: 68Q25 68W25 PDFBibTeX XMLCite \textit{M. Nouri-Baygi}, Int. J. Found. Comput. Sci. 29, No. 7, 1231--1245 (2018; Zbl 1415.68112) Full Text: DOI
Chen, Guaning; Yi, Chih-Wei; Sun, Min-Te; Liu, Fang-Chu; Lan, Wei-Chi Minimum local disk cover sets for broadcasting in heterogeneous multihop wireless networks. (English) Zbl 1255.68039 Int. J. Found. Comput. Sci. 23, No. 5, 1147-1172 (2012). MSC: 68M10 68M20 68U05 PDFBibTeX XMLCite \textit{G. Chen} et al., Int. J. Found. Comput. Sci. 23, No. 5, 1147--1172 (2012; Zbl 1255.68039) Full Text: DOI
Gao, Yuan; Yu, Sheng State complexity and approximation. (English) Zbl 1255.68094 Int. J. Found. Comput. Sci. 23, No. 5, 1085-1098 (2012). MSC: 68Q45 68Q19 PDFBibTeX XMLCite \textit{Y. Gao} and \textit{S. Yu}, Int. J. Found. Comput. Sci. 23, No. 5, 1085--1098 (2012; Zbl 1255.68094) Full Text: DOI
Lee, Young Choon; Taheri, Javid; Zomaya, Albert Y. A parallel metaheuristic framework based on harmony search for scheduling in distributed computing systems. (English) Zbl 1245.68174 Int. J. Found. Comput. Sci. 23, No. 2, 445-464 (2012). MSC: 68T20 68M20 68M14 68W10 PDFBibTeX XMLCite \textit{Y. C. Lee} et al., Int. J. Found. Comput. Sci. 23, No. 2, 445--464 (2012; Zbl 1245.68174) Full Text: DOI
Zhou, Junping; Yin, Minghao; Li, Xiangtao; Wang, Jinyan Phase transitions of EXPSPACE-complete problems: a further step. (English) Zbl 1246.68206 Int. J. Found. Comput. Sci. 23, No. 1, 173-184 (2012). MSC: 68T20 68Q17 PDFBibTeX XMLCite \textit{J. Zhou} et al., Int. J. Found. Comput. Sci. 23, No. 1, 173--184 (2012; Zbl 1246.68206) Full Text: DOI
Han, Yo-Sub; Salomaa, Kai Overlap-free languages and solid codes. (English) Zbl 1222.68105 Int. J. Found. Comput. Sci. 22, No. 5, 1197-1209 (2011). MSC: 68Q45 68P30 68R10 PDFBibTeX XMLCite \textit{Y.-S. Han} and \textit{K. Salomaa}, Int. J. Found. Comput. Sci. 22, No. 5, 1197--1209 (2011; Zbl 1222.68105) Full Text: DOI
Chen, Danny Z.; Wang, Haitao Processing an offline insertion-query sequence with applications. (English) Zbl 1222.68396 Int. J. Found. Comput. Sci. 22, No. 6, 1439-1456 (2011). MSC: 68U05 68W05 PDFBibTeX XMLCite \textit{D. Z. Chen} and \textit{H. Wang}, Int. J. Found. Comput. Sci. 22, No. 6, 1439--1456 (2011; Zbl 1222.68396) Full Text: DOI
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Ono, Hirotaka Graph orientation to maximize the minimum weighted outdegree. (English) Zbl 1216.68114 Int. J. Found. Comput. Sci. 22, No. 3, 583-601 (2011). MSC: 68Q17 05C22 05C85 68R10 PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Int. J. Found. Comput. Sci. 22, No. 3, 583--601 (2011; Zbl 1216.68114) Full Text: DOI
Zhou, Junping; Huang, Ping; Yin, Minghao; Zhou, Chunguang Phase transitions of EXPSPACE-complete problems. (English) Zbl 1215.68162 Int. J. Found. Comput. Sci. 21, No. 6, 1073-1088 (2010). MSC: 68Q87 68Q17 68T20 PDFBibTeX XMLCite \textit{J. Zhou} et al., Int. J. Found. Comput. Sci. 21, No. 6, 1073--1088 (2010; Zbl 1215.68162) Full Text: DOI
Manea, Florin; Mitrana, Victor; Yokomori, Takashi Some remarks on the hairpin completion. (English) Zbl 1213.68356 Int. J. Found. Comput. Sci. 21, No. 5, 859-872 (2010). MSC: 68Q45 68Q25 68Q70 PDFBibTeX XMLCite \textit{F. Manea} et al., Int. J. Found. Comput. Sci. 21, No. 5, 859--872 (2010; Zbl 1213.68356) Full Text: DOI
Gawrychowski, Paweł; Krieger, Dalia; Rampersad, Narad; Shallit, Jeffrey Finding the growth rate of a regular or context-free language in polynomial time. (English) Zbl 1206.68172 Int. J. Found. Comput. Sci. 21, No. 4, 597-618 (2010). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Gawrychowski} et al., Int. J. Found. Comput. Sci. 21, No. 4, 597--618 (2010; Zbl 1206.68172) Full Text: DOI
Badr, Andrew Hyper-minimization in \(O(n^{2})\). (English) Zbl 1180.68166 Int. J. Found. Comput. Sci. 20, No. 4, 735-746 (2009). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Badr}, Int. J. Found. Comput. Sci. 20, No. 4, 735--746 (2009; Zbl 1180.68166) Full Text: DOI
Shakhlevich, Natalia; Shioura, Akiyoshi; Strusevich, Vitaly A. Single machine scheduling with controllable processing times by submodular optimization. (English) Zbl 1170.90399 Int. J. Found. Comput. Sci. 20, No. 2, 247-269 (2009). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{N. Shakhlevich} et al., Int. J. Found. Comput. Sci. 20, No. 2, 247--269 (2009; Zbl 1170.90399) Full Text: DOI
Watson, Bruce W.; Kourie, Derrick G.; Strauss, Tinus; Ketcha, Ernest; Cleophas, Loek Efficient automata constructions and approximate automata. (English) Zbl 1169.68026 Int. J. Found. Comput. Sci. 19, No. 1, 185-193 (2008). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. W. Watson} et al., Int. J. Found. Comput. Sci. 19, No. 1, 185--193 (2008; Zbl 1169.68026) Full Text: DOI
Lin, Cho-Chin A framework for solving sequence problem of multiple input streams. (English) Zbl 1202.68037 Int. J. Found. Comput. Sci. 18, No. 5, 1043-1064 (2007). MSC: 68M10 PDFBibTeX XMLCite \textit{C.-C. Lin}, Int. J. Found. Comput. Sci. 18, No. 5, 1043--1064 (2007; Zbl 1202.68037) Full Text: DOI
Ito, Yasuaki; Nakano, Koji; Yamagishi, Youhei Efficient hardware algorithms for \(n\) choose \(k\) counters using the bitonic merger. (English) Zbl 1117.68094 Int. J. Found. Comput. Sci. 18, No. 3, 517-528 (2007). MSC: 68W35 PDFBibTeX XMLCite \textit{Y. Ito} et al., Int. J. Found. Comput. Sci. 18, No. 3, 517--528 (2007; Zbl 1117.68094) Full Text: DOI
Han, Yo-Sub; Wang, Yajun; Wood, Derick Infix-free regular expressions and languages. (English) Zbl 1093.68051 Int. J. Found. Comput. Sci. 17, No. 2, 379-393 (2006). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y.-S. Han} et al., Int. J. Found. Comput. Sci. 17, No. 2, 379--393 (2006; Zbl 1093.68051) Full Text: DOI
Leporati, Alberto; Zandron, Claudio; Gutiérrez-Naranjo, Miguel A. P systems with input in binary form. (English) Zbl 1088.68059 Int. J. Found. Comput. Sci. 17, No. 1, 127-146 (2006). MSC: 68Q10 68Q17 PDFBibTeX XMLCite \textit{A. Leporati} et al., Int. J. Found. Comput. Sci. 17, No. 1, 127--146 (2006; Zbl 1088.68059) Full Text: DOI
Czyzowicz, Jurek; Fraczak, Wojciech; Pelc, Andrzej; Rytter, Wojciech Linear-time prime decomposition of regular prefix codes. (English) Zbl 1101.68646 Int. J. Found. Comput. Sci. 14, No. 6, 1019-1031 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Czyzowicz} et al., Int. J. Found. Comput. Sci. 14, No. 6, 1019--1031 (2003; Zbl 1101.68646) Full Text: DOI
Grimmell, William C.; Rao, Nageswara S. V. On source-based route computation for quickest paths underdynamic bandwidth constraints. (English) Zbl 1075.68551 Int. J. Found. Comput. Sci. 14, No. 3, 503-523 (2003). MSC: 68M12 PDFBibTeX XMLCite \textit{W. C. Grimmell} and \textit{N. S. V. Rao}, Int. J. Found. Comput. Sci. 14, No. 3, 503--523 (2003; Zbl 1075.68551) Full Text: DOI
Xuan, B. Bui; Ferreira, A.; Jarry, A. Computing shortest, fastest, and foremost journeys in dynamic networks. (English) Zbl 1075.68545 Int. J. Found. Comput. Sci. 14, No. 2, 267-285 (2003). MSC: 68M10 PDFBibTeX XMLCite \textit{B. B. Xuan} et al., Int. J. Found. Comput. Sci. 14, No. 2, 267--285 (2003; Zbl 1075.68545) Full Text: DOI