M. Sohel Rahman
List of publications from the
| 2008 |
|---|
| 23 | 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 |
| 22 | 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 |
| 21 | EE | Costas S. Iliopoulos,
M. Sohel Rahman:
Indexing Circular Patterns.
WALCOM 2008: 46-57 |
| 20 | EE | Costas S. Iliopoulos,
Mohammad Sohel Rahman:
Faster index for property matching.
Inf. Process. Lett. 105(6): 218-223 (2008) |
| 19 | 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) |
| 18 | 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) |
| 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 |
