My Research

Research Interest::Co-Authors::Publications::[in DBLP]

Research Interests

Stringology, String Algorithms, Bioinformatics, Musicolgy, Design and analysis of Algorithms (Sequential, Parallel, Distributed), Theoretical Computer Science with applications, Multimedia Technology...

My Co-Authors

Md. Mostofa Akbar, Manolis Christodoulakis, Maxime Crochemore, Asif-ul Haque, Costas S. Iliopoulos, Md. Abula Kashem, M. Kaykobad, Marcin Kubica, Inbok Lee, Eric.G. Manning, Spiros Michalakopoulos, Manal Mohamed, Laurent Mouchard, Muhammad Abdul Hakim Newton, Mohammad Saifur Rahman, Rajat Shuvro Roy, Wojciech Rytter, Abu Zafar Mohammad Shahriar, Gholamali C. Shoja, William F. Smyth, Ladislav Vagner, Michal Voracek, Tomasz Walen

Publications [2007, 2006, 2005, 2004, 2003, 2002]


2008

  1. M. Crochemore, C. S. Iliopoulos, M. Kubica, M. S. Rahman, and T. Walen. Improved algorithms for the range next value problem and applications. In Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Bordeaux, France, February 2008.
  2. C. S. Iliopoulos and M. S. Rahman. Indexing circular patterns. In Proceedings of the Workshop on Algorithms and Computation, Dhaka, Bangladesh, February 2008.
  3. C. S. Iliopoulos and M. S. Rahman. A new model to solve swap matching problem and efficient algorithms for short patterns. In Proceedings of the 34th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '08), High Tatras, Slovakia, January 2008.
  4. C. S. Iliopoulos and M. S. Rahman. A new efficient algorithm for computing the longest common subsequence. Theory of Computing Systems, To Appear.

[Go To Top]


2007

  1. Abu Zafar Mohammad Shahriar, Md. Mostofa Akbar, M. Sohel Rahman, and Muhammad Abdul Hakim Newton, A Multiprocessor based Heuristic for Multi-dimensional Multiple-Choice Knapsack Problem. Accepted at The Journal of Supercomputing.
  2. Arbee L. P. Chen, Costas S. Iliopoulos, Spiridon Michalakopoulos, and M. Sohel Rahman. Implementation of algorithms to classify musical texts according to rhythms. In Charalampos Spyridis, Anastasia Georgaki, Georgios Kouroupetroglou, and Christina Anagnostopoulou, editors, SMC, pages 134–141, 2007
  3. Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rah-man, and William F. Smyth. Identifying rhythms in musical texts. International Journal of Foundations of Computer Science, 2007. To Appear.
  4. Maxime Crochemore,  Costas S. Iliopoulos, and M. Sohel Rahman. Finding patterns in given intervals. In Ludek Kucera and Anton´ın Kucera, editors, MFCS, volume 4708 of Lecture Notes in Computer Science, pages 645–656. Springer, 2007.
  5. Maxime Crochemore, Costas S. Iliopoulos, and M. Sohel Rahman. Optimal prefix and suffix queries on texts. In AofA, 2007. To Appear in DMTCS Proceedings.
  6. Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, and Tomasz Walen. Algorithms for computing the longest parameterized common subsequence. In Bin Ma and Kaizhong Zhang, editors, CPM, volume 4580 of Lecture Notes in Computer Science, pages 265–273. Springer, 2007.
  7. Costas S. Iliopoulos, Laurent Mouchard, and Mohammad Sohel Rah-man. A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching. Mathematics in Computer Science (MCS), 2007. Accepted in the Special Issue on Combinatorial Algorithms.
  8. Costas S. Iliopoulos and M. Sohel Rahman.  Faster index for property matching. Inf. Process. Lett. To Appear (10.1016/j.ipl.2007.09.004).
  9. Costas S. Iliopoulos and M. Sohel Rahman. Indexing factors with gaps. Algorithmica. To Appear.
  10. Costas S. Iliopoulos and M. Sohel Rahman.   New efficient algorithms for the LCS and constrained LCS problems. Inf. Process. Lett. To Appear (10.1016/j.ipl.2007.09.008).
  11. Costas S. Iliopoulos and M. Sohel Rahman. Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci., 2007. To Appear.
  12. Costas S. Iliopoulos and M. Sohel Rahman. New efficient algorithms for LCS and constrained LCS problem. In Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, and Stefan Szeider, editors. Algorithms and Complexity in Durham 2007 -Proceedings of the Third ACiD Workshop, 17-19 September 2007, Durham, UK, volume 9 of Texts in Algorithmics, pages 83–94, King’s College, London, 2007.
  13. Costas S. Iliopoulos, M. Sohel Rahman, and Wojciech Rytter. Algorithms for two versions of LCS problem for indeterminate strings. In International Workshop on Combinatorial Algorithms (IWOCA), 2007. To Appear.
  14. Costas S. Iliopoulos, M. Sohel Rahman, Michal Voracek, and Ladislav Vagner. Computing constrained longest common subsequence for degenerate strings using finite automata. In Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, and Stefan Szeider, editors. Algorithms and Complexity in Durham 2007 -Proceedings of the Third ACiD Workshop, 17-19 September 2007, Durham, UK, volume 9 of Texts in Algorithmics, pages 95–106, King’s College, London, 2007.
  15. M. Sohel Rahman and Costas S. Iliopoulos. Indexing factors with gaps. In Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, and Frantisek Plasil, editors, SOFSEM (1), volume 4362 of Lecture Notes in Computer Science, pages 465–474. Springer, 2007.
  16. M. Sohel Rahman and Costas S. Iliopoulos. A new efficient algorithm for computing the longest common subsequence. In Ming-Yang Kao and Xiang-Yang Li, editors, AAIM, volume 4508 of Lecture Notes in Computer Science, pages 82–90. Springer, 2007.
  17. M. Sohel Rahman and Costas S. Iliopoulos. Pattern matching algo­rithms with don’t cares. In Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plasil, Maria Bielikov´and M´a, editors, SOFSEM (2), pages 116–126. Institute of Computer Science AS CR, Prague, 2007.
  18. M. Sohel Rahman, Costas S. Iliopoulos, and Laurent Mouchard. Pattern matching in degenerate DNA/RNA sequences. In M. Kaykobad and Md. Saidur Rahman, editors, WALCOM, pages 109–120. Bangladesh Academy of Sciences (BAS), 2007.

[Go To Top]

2006

  1. Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rah-man, and William F. Smyth. Song classifications for dancing. In Jan Holub and Jan Zd´arek, editors, Stringology, pages 41–48. Department of Computer Science and Engineering, Faculty of Electrical Engineer­ing, Czech Technical University, 2006.
  2. M. Sohel Rahman and Costas S. Iliopoulos. Algorithms for computing variants of the longest common subsequence problem. In Tetsuo Asano, editor, ISAAC, volume 4288 of Lecture Notes in Computer Science, pages 399–408. Springer, 2006.
  3. M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, and William F. Smyth. Finding patterns with variable length gaps or don’t cares. In Danny Z. Chen and D. T. Lee, editors, COCOON, volume 4112 of Lecture Notes in Computer Science, pages 146–155. Springer, 2006.
  4. M.M. Akbar, M. Sohel Rahman, M. Kaykobad, E.G. Manning, and G.C. Shoja, Solving the Multidimensional Multiple-Choice Knapsack Problem by Constructing Convex Hulls, Computers & Operations Research, 33 (2006), pp. 1259-1273.

[Go To Top]

2005

  1. M. Sohel Rahman, and M. Kaykobad, Complexities of Some Interesting Problems on Spanning Trees, Information Processing Letters, 94:2 (2005), pp. 93-97.
  2. M. Sohel Rahman, and M. Kaykobad, On Hamiltonian Cycles and Hamiltonian Paths, Information Processing Letters, 94:1 (2005), pp. 37-41.
  3. R. S. Roy and M. Sohel Rahman, On Communicating with Agents on the Network, In Proceedings of the 2nd ICDCIT 2005, Bhubaneswar, India, December 2005, LNCS 3816, pp. 267-277.
  4. M.M. Akbar, M. Sohel Rahman, E.G. Manning and G.C. Shoja, Distributed Utility Model for Distributed Multimedia Server Systems, In Proceedings of Design, Analysis, and Simulation of Distributed Systems (DASD), Spring Simulation Multi-conference, 2005, pp. 148-155.
  5. M. Sohel Rahman, M. Kaykobad and Mohammad Saifur Rahman, A New Sufficient Condition for the Existence of Hamiltonian Paths, In Proceedings of the 20th International Conference on Computers and Their Applications (CATA 2005), USA, March 2005, pp. 56-59.
  6. M.M. Akbar, E.G. Manning, G.C. Shoja and M. Sohel Rahman, Optimal Server Selection for Content Routing, In Proceedings of the 20th International Conference on Computers and Their Applications (CATA 2005), USA, March 2005, pp. 259-264.

[Go To Top]

2004

  1. Mohammad Sohel Rahman, M Kaykobad, Independence Number and Degree Bounded Spanning Tree, Applied Mathematics E-Notes, 4 (2004), pp. 122-124.
  2. Mohammad Sohel Rahman and Md. Abul Kashem, Degree Restricted Spanning Trees of Graphs, Proceedings of the 19th ACM Symposium of Applied Computing (SAC 2004) pp. 225-228.
  3. Mohammad Sohel Rahman, and Md. Abul Kashem, An Efficient Algorithm for Finding an Independency Tree, Accepted for Presentation & Publication in the 7th International Conference on Computer and Information Technology (ICCIT), 2004.
  4. Mohammad Sohel Rahman and M Kaykobad, Set Version: A New Notion and Results, Accepted for Publication and Presentation in the Information Society, 2004, 7th Multi-Conference, Sub-conference: Theoretical Computer Science, Slovenia

[Go To Top]

2003

  1. Mohammad Sohel Rahman and M Kaykobad, On Hamiltonian Cycles and Hamiltonian Paths, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 185-187.
  2. Mohammad Sohel Rahman, M Kaykobad and M M Akbar, Independence Number and Hamiltonicity of Graphs, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 150-152.

[Go To Top]

2002
  1. Asif-ul Haque, Mohammad Saifur Rahman, Mohammad Sohel Rahman and M. Kaykobad, On Average Length of Cycles in Complete Graphs, Proceedings of 5th International Conference on Computer and Information Technology (ICCIT), 2002, pp. 47-49.
  2. Mohammad Sohel Rahman and Md. Abul Kashem, Degree Restricted Spanning Trees of Graphs, Proceedings of 5th International Conference on Computer and Information Technology (ICCIT), 2002, pp. 50-52.

[Go To Top]