( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality.

, , , и . Discovery Science, том 5808 из Lecture Notes in Computer Science, стр. 465-472. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Hideo Baba

Hideo Ohashi

Hideo Andreas Baba

Hideo Ikezawa-Hanada

 

Другие публикации лиц с тем же именем

Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection., , , , , , и . ECCB, стр. 227-236. (2003)Generalized pattern matching and periodicity under substring consistent equivalence relations., , , , и . Theor. Comput. Sci., (2016)Efficient Computation of Substring Equivalence Classes with Suffix Arrays., , , , и . Algorithmica, 79 (2): 291-318 (2017)Faster Compact On-Line Lempel-Ziv Factorization, , , , и . CoRR, (2013)Finding Characteristic Substrings from Compressed Texts., и . Stringology, стр. 40-54. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2009)Bit-parallel Algorithms for Computing all the Runs in a String., , , , и . Stringology, стр. 203-213. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2009)Computing Reversed Lempel-Ziv Factorization Online., , , , и . Stringology, стр. 107-118. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)New Lower Bounds for the Maximum Number of Runs in a String., , , , и . Stringology, стр. 140-145. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2008)NP-Completeness for the Space-Optimality of Double-Array Tries., , , и . CoRR, (2024)Computing Longest (Common) Lyndon Subsequences., , , , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 128-142. Springer, (2022)