| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Effat Farhana, M. Sohel Rahman |
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanaeem M. Moosa, M. Sohel Rahman |
Sub-quadratic time and linear space data structures for permutation matching in binary strings.  |
J. Discrete Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz |
Indeterminate string inference algorithms.  |
J. Discrete Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz |
Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract).  |
WALCOM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Masud Hasan, S. M. Shabab Hossain, Md. Mahmudur Rahman, M. Sohel Rahman |
Solving the generalized Subset Sum problem with a light based device.  |
Natural Computing  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Masud Hasan, S. M. Shabab Hossain, Md. Mahmudur Rahman, M. Sohel Rahman |
Solving Minimum Hitting Set Problem and Generalized Exact Cover Problem with Light Based Devices.  |
IJUC  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz |
Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman |
Computing a Longest Common Palindromic Subsequence  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tanaeem M. Moosa, M. Sohel Rahman |
Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees.  |
COCOON  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanaeem M. Moosa, M. Sohel Rahman |
Indexing permutations for binary strings.  |
Inf. Process. Lett.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Masud Hasan, Tanaeem M. Moosa, M. Sohel Rahman |
Cache Oblivious Algorithms for the RMQ and the RMSQ Problems.  |
Mathematics in Computer Science  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman |
Finding Patterns In Given Intervals.  |
Fundam. Inform.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanaeem M. Moosa, M. Sohel Rahman |
Improved Algorithms for the Point-Set Embeddability problem for Plane 3-Trees  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner |
Finite automata based algorithms on subsequences and supersequences of degenerate strings.  |
J. Discrete Algorithms  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | S. M. Shabab Hossain, Md. Mahmudur Rahman, M. Sohel Rahman |
Solving a Generalized Version of the Exact Cover Problem with a Light-Based Device.  |
OSC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shahrear Iqbal, Md. Faizul Bari, M. Sohel Rahman |
Solving the Multi-dimensional Multi-choice Knapsack Problem with the Help of Ants.  |
ANTS Conference  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman |
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time.  |
WALCOM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Effat Farhana, Jannatul Ferdous, Tanaeem M. Moosa, M. Sohel Rahman |
Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems.  |
SPIRE  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahfuza Sharmin, Rukhsana Yeasmin, Masud Hasan, Atif Rahman, Mohammad Sohel Rahman |
Pancake Flipping with Two Spatulas.  |
Electronic Notes in Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, M. Sohel Rahman |
Indexing Factors with Gaps.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
String index, Gapped-factor, Algorithms, Data structure, Suffix tree |
| 1 | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman |
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Shihabur Rahman Chowdhury, Masud Hasan, Sumaiya Iqbal, M. Sohel Rahman |
An $O(n^2)$ Algorithm for Computing Longest Common Cyclic Subsequence  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Md. Raqibul Hasan, M. Sohel Rahman |
Computing a Solution for the Subset Sum Problem with a Light Based Device.  |
OSC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman |
Maximum Neighbour Voronoi Games.  |
WALCOM  |
2009 |
DBLP DOI BibTeX RDF |
Competitive facility location, Voronoi games, Voronoi diagram, Delaunay triangulation |
| 1 | Costas S. Iliopoulos, Mohammad Sohel Rahman |
A New Efficient Algorithm for Computing the Longest Common Subsequence.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Algorithms, Strings, Longest common subsequence |
| 1 | Md. Faizul Bari, Mohammad Sohel Rahman, Rifat Shahriyar |
Finding All Covers of an Indeterminate String in O(n) Time on Average.  |
Stringology  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, M. Sohel Rahman |
Algorithms for computing variants of the longest common subsequence problem.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, M. Sohel Rahman |
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model.  |
BIRD  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, M. Sohel Rahman |
Indexing Circular Patterns.  |
WALCOM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, M. Sohel Rahman |
A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns.  |
SOFSEM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, Mohammad Sohel Rahman |
Faster index for property matching.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, Mohammad Sohel Rahman |
New efficient algorithms for the LCS and constrained LCS problems.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman |
Optimal prefix and suffix queries on texts.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth |
Identifying Rhythms in Musical Texts.  |
Int. J. Found. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2008 |
DBLP DOI BibTeX RDF |
Multiprocessor systems, Heuristic algorithms, Knapsack problem, Process synchronization, Inter process communication |
| 1 | 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  |
2008 |
DBLP DOI BibTeX RDF |
degenerate strings, DNA/RNA sequences, Algorithm, pattern matching |
| 1 | Tomás Flouri, Costas S. Iliopoulos, Mohammad Sohel Rahman, Ladislav Vagner, Michal Vorácek |
Indexing Factors in DNA/RNA Sequences.  |
BIRD  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen |
Improved Algorithms for the Range Next Value Problem and Applications.  |
STACS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Sohel Rahman, Costas S. Iliopoulos |
A New Efficient Algorithm for Computing the Longest Common Subsequence.  |
AAIM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman |
Finding Patterns in Given Intervals.  |
MFCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard |
Pattern Matching in Degenerate DNA/RNA Sequences.  |
WALCOM  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen |
Algorithms for Computing the Longest Parameterized Common Subsequence.  |
CPM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Sohel Rahman, Costas S. Iliopoulos |
Pattern Matching Algorithms with Don't Cares.  |
SOFSEM  |
2007 |
DBLP BibTeX RDF |
|
| 1 | M. Sohel Rahman, Costas S. Iliopoulos |
Indexing Factors with Gaps.  |
SOFSEM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner |
The Constrained Longest Common Subsequence Problem for Degenerate Strings.  |
CIAA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Sohel Rahman, Costas S. Iliopoulos |
Algorithms for Computing Variants of the Longest Common Subsequence Problem.  |
ISAAC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth |
Song classifications for dancing.  |
Stringology  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Mohammad Sohel Rahman, Mohammad Kaykobad |
On Hamiltonian cycles and Hamiltonian paths.  |
Inf. Process. Lett.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Sohel Rahman, Mohammad Kaykobad |
Complexities of some interesting problems on spanning trees.  |
Inf. Process. Lett.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Sohel Rahman, Mohammad Kaykobad, Mohammad Saifur Rahman |
A New Sufficient Condition for the Existence of Hamiltonian Paths.  |
Computers and Their Applications  |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Rajat Shuvro Roy, Mohammad Sohel Rahman |
On Communicating with Agents on the Network.  |
ICDCIT  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Sohel Rahman, Abul Kashem |
Degree restricted spanning trees of graphs.  |
SAC  |
2004 |
DBLP DOI BibTeX RDF |
algorithms, graphs, NP-completeness, spanning trees, Hamiltonian path |