M. Sohel Rahman
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
30 | EE | Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman: Maximum Neighbour Voronoi Games. WALCOM 2009: 93-104 |
2008 | ||
29 | EE | Tomás Flouri, Costas S. Iliopoulos, Mohammad Sohel Rahman, Ladislav Vagner, Michal Vorácek: Indexing Factors in DNA/RNA Sequences. BIRD 2008: 436-445 |
28 | EE | Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, M. Sohel Rahman: Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model. BIRD 2008: 446-455 |
27 | EE | Costas S. Iliopoulos, M. Sohel Rahman: A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. SOFSEM 2008: 316-327 |
26 | EE | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen: Improved Algorithms for the Range Next Value Problem and Applications. STACS 2008: 205-216 |
25 | EE | Costas S. Iliopoulos, M. Sohel Rahman: Indexing Circular Patterns. WALCOM 2008: 46-57 |
24 | EE | Costas S. Iliopoulos, Mohammad Sohel Rahman: Faster index for property matching. Inf. Process. Lett. 105(6): 218-223 (2008) |
23 | EE | Costas S. Iliopoulos, Mohammad Sohel Rahman: New efficient algorithms for the LCS and constrained LCS problems. Inf. Process. Lett. 106(1): 13-18 (2008) |
22 | EE | Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman: Optimal prefix and suffix queries on texts. Inf. Process. Lett. 108(5): 320-325 (2008) |
21 | EE | Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth: Identifying Rhythms in Musical Texts. Int. J. Found. Comput. Sci. 19(1): 37-51 (2008) |
20 | EE | Costas S. Iliopoulos, Laurent Mouchard, Mohammad Sohel Rahman: A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching. Mathematics in Computer Science 1(4): 557-569 (2008) |
19 | EE | Abu Zafar M. Shahriar, Md. Mostofa Akbar, Mohammad Sohel Rahman, Muhammad Abdul Hakim Newton: A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem. The Journal of Supercomputing 43(3): 257-280 (2008) |
18 | EE | Costas S. Iliopoulos, M. Sohel Rahman: Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci. 395(2-3): 255-267 (2008) |
2007 | ||
17 | EE | M. Sohel Rahman, Costas S. Iliopoulos: A New Efficient Algorithm for Computing the Longest Common Subsequence. AAIM 2007: 82-90 |
16 | EE | Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner: The Constrained Longest Common Subsequence Problem for Degenerate Strings. CIAA 2007: 309-311 |
15 | EE | Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen: Algorithms for Computing the Longest Parameterized Common Subsequence. CPM 2007: 265-273 |
14 | EE | Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman: Finding Patterns in Given Intervals. MFCS 2007: 645-656 |
13 | EE | M. Sohel Rahman, Costas S. Iliopoulos: Indexing Factors with Gaps. SOFSEM (1) 2007: 465-474 |
12 | M. Sohel Rahman, Costas S. Iliopoulos: Pattern Matching Algorithms with Don't Cares. SOFSEM (2) 2007: 116-126 | |
11 | M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard: Pattern Matching in Degenerate DNA/RNA Sequences. WALCOM 2007: 109-120 | |
2006 | ||
10 | EE | M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth: Finding Patterns with Variable Length Gaps or Don't Cares. COCOON 2006: 146-155 |
9 | EE | M. Sohel Rahman, Costas S. Iliopoulos: Algorithms for Computing Variants of the Longest Common Subsequence Problem. ISAAC 2006: 399-408 |
8 | EE | Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth: Song classifications for dancing. Stringology 2006: 41-48 |
7 | EE | Md. Mostofa Akbar, Mohammad Sohel Rahman, Mohammad Kaykobad, Eric G. Manning, Gholamali C. Shoja: Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls. Computers & OR 33: 1259-1273 (2006) |
2005 | ||
6 | Md. Mostofa Akbar, Eric G. Manning, Gholamali C. Shoja, Mohammad Sohel Rahman, Mohammad Kaykobad: Optimal Server Selection for Content Routing. Computers and Their Applications 2005: 259-264 | |
5 | Mohammad Sohel Rahman, Mohammad Kaykobad, Mohammad Saifur Rahman: A New Sufficient Condition for the Existence of Hamiltonian Paths. Computers and Their Applications 2005: 56-59 | |
4 | EE | Rajat Shuvro Roy, Mohammad Sohel Rahman: On Communicating with Agents on the Network. ICDCIT 2005: 267-277 |
3 | EE | Mohammad Sohel Rahman, Mohammad Kaykobad: On Hamiltonian cycles and Hamiltonian paths. Inf. Process. Lett. 94(1): 37-41 (2005) |
2 | EE | Mohammad Sohel Rahman, Mohammad Kaykobad: Complexities of some interesting problems on spanning trees. Inf. Process. Lett. 94(2): 93-97 (2005) |
2004 | ||
1 | EE | Mohammad Sohel Rahman, Abul Kashem: Degree restricted spanning trees of graphs. SAC 2004: 225-228 |
1 | Md. Mostofa Akbar | [6] [7] [19] |
2 | Pavlos Antoniou | [28] |
3 | Manolis Christodoulakis | [8] [21] |
4 | Maxime Crochemore | [14] [22] [26] |
5 | Tomás Flouri | [29] |
6 | Masud Hasan | [30] |
7 | Costas S. Iliopoulos | [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] |
8 | Inuka Jayasekera | [28] |
9 | Abul Kashem | [1] |
10 | Mohammad Kaykobad (M. Kaykobad) | [2] [3] [5] [6] [7] |
11 | Marcin Kubica | [15] [26] |
12 | Inbok Lee | [10] |
13 | Eric G. Manning | [6] [7] |
14 | Manal Mohamed | [10] |
15 | Laurent Mouchard | [11] [20] |
16 | Muhammad Abdul Hakim Newton | [19] |
17 | Mohammad Saifur Rahman | [5] |
18 | Md. Muhibur Rasheed | [30] |
19 | Rajat Shuvro Roy | [4] |
20 | Abu Zafar M. Shahriar | [19] |
21 | Gholamali C. Shoja | [6] [7] |
22 | William F. Smyth (Bill Smyth) | [8] [10] [21] |
23 | Ladislav Vagner | [16] [29] |
24 | Michal Vorácek | [16] [29] |
25 | Tomasz Walen | [15] [26] |