Sedjelmaci, Sidi Mohamed A parallel extended GCD algorithm. (English) Zbl 1193.11118 J. Discrete Algorithms 6, No. 3, 526-538 (2008). Reviewer: Michael J. Jacobson jun. (Calgary) MSC: 11Y16 11A05 68W10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Kortsarz, Guy; Nutov, Zeev A note on two source location problems. (English) Zbl 1160.90552 J. Discrete Algorithms 6, No. 3, 520-525 (2008). MSC: 90B80 05C85 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Bazgan, Cristina; Tuza, Zsolt Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. (English) Zbl 1167.68060 J. Discrete Algorithms 6, No. 3, 510-519 (2008). Reviewer: Václav Koubek (Praha) MSC: 68W25 05C35 05C85 68Q25 68R10 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Peterlongo, Pierre; Pisanti, Nadia; Boyer, Frédéric; do Lago, Alair Pereira; Sagot, Marie-France Lossless filter for multiple repetitions with Hamming distance. (English) Zbl 1165.94312 J. Discrete Algorithms 6, No. 3, 497-509 (2008). MSC: 94A13 68R15 68P99 68T10 68W05 92D10 × Cite Format Result Cite Review PDF Full Text: DOI
Pinter, Ron Y.; Rokhlenko, Oleg; Tsur, Dekel; Ziv-Ukelson, Michal Approximate labelled subtree homeomorphism. (English) Zbl 1160.90680 J. Discrete Algorithms 6, No. 3, 480-496 (2008). MSC: 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel Approximating the traffic grooming problem. (English) Zbl 1160.90342 J. Discrete Algorithms 6, No. 3, 472-479 (2008). MSC: 90B20 90B80 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Bordewich, Magnus; McCartin, Catherine; Semple, Charles A 3-approximation algorithm for the subtree distance between phylogenies. (English) Zbl 1171.05317 J. Discrete Algorithms 6, No. 3, 458-471 (2008). MSC: 05C05 92D15 × Cite Format Result Cite Review PDF Full Text: DOI
Rahman, Atif; Shatabda, Swakkhar; Hasan, Masud An approximation algorithm for sorting by reversals and transpositions. (English) Zbl 1186.92035 J. Discrete Algorithms 6, No. 3, 449-457 (2008). MSC: 92D15 92C40 05C85 05C90 92-08 × Cite Format Result Cite Review PDF Full Text: DOI
Khorsi, Ahmed; Ouardi, Faissal; Ziadi, Djelloul Fast equation automaton computation. (English) Zbl 1160.68416 J. Discrete Algorithms 6, No. 3, 433-448 (2008). MSC: 68Q45 68Q25 68R15 68W30 × Cite Format Result Cite Review PDF Full Text: DOI
Lai, Ying Kit; Poon, Chung Keung; Shi, Benyun Approximate colored range and point enclosure queries. (English) Zbl 1160.68352 J. Discrete Algorithms 6, No. 3, 420-432 (2008). MSC: 68P05 68P10 68W25 × Cite Format Result Cite Review PDF Full Text: DOI
Salmela, Leena; Tarhio, Jorma Fast parameterized matching with \(q\)-grams. (English) Zbl 1160.68483 J. Discrete Algorithms 6, No. 3, 408-419 (2008). MSC: 68R15 68P10 68T10 × Cite Format Result Cite Review PDF Full Text: DOI
Dom, Michael; Guo, Jiong; Niedermeier, Rolf; Wernicke, Sebastian Red-blue covering problems and the consecutive ones property. (English) Zbl 1161.90018 J. Discrete Algorithms 6, No. 3, 393-407 (2008). MSC: 90C35 05C70 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Di Stefano, Gabriele; Krause, Stefan; Lübbecke, Marco E.; Zimmermann, Uwe T. On minimum \(k\)-modal partitions of permutations. (English) Zbl 1173.90482 J. Discrete Algorithms 6, No. 3, 381-392 (2008). MSC: 90C11 90C27 05A05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Nitin; Subramanian, Ashok Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties. (English) Zbl 1160.90553 J. Discrete Algorithms 6, No. 3, 353-380 (2008). MSC: 90B80 90C35 90C39 × Cite Format Result Cite Review PDF Full Text: DOI