>> Information For:   |   Prospective Students   |   Current Students   |   Alumni   |   Industry & Government   |   Faculty Members
Username : Password : Forgot password?
 Research Detail:


  Algorithms and Theory >Graph Theory:
  Recent Publications:

29. S. Ahmed, and Md. Saidur Rahman, Multi-interval Pairwise Compatibility Graphs. In Proceedings of Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Springer, Bern, Switzerland, pages 71-84, 2017
28. S. Sharmin, Sujoy Das, and Md. Saidur Rahman, Proactive Humanitarian Aid Networks with Guided Topology and Small-World Effect. In Proceedings of The fifth IEEE Region 10 (Asia Pacific) Humanitarian Technology Conference (R10HTC) 2017, IEEE Explore, Dhaka, Bangladeh, 2017
27. Md. Iqbal Hossain, and Md. Saidur Rahman, A necessary condition and a sufficient condition for pairwise compatibility graphs. In Proceedings of WALCOM 2016, Springer, Lecture Notes in Computer Science, 9627, pages 107-113, 2016
26. Stephane Durocher, Debajyoti Mondal, and Md. Saidur Rahman, On graphs that are not PCGs. Theoretical Computer Science, Elsevier, 571:78-87, 2015
25. Md. Sazzadur Rahaman, Tousif Ahmed, Sad Al Abdullah, and Md. Saidur Rahman, Antibandwidth problem for itchy caterpillars. In Proceedings of International Conference on Informatics, Electronics & Vision (ICIEV), 2014, IEEE, Dhaka, pages 1-6, 2014
24. M. Sohel Rahman, M. Kaykobad, and J. S. Firoz, New Sufficient Conditions for Hamiltonian Paths. The Scientific World Journal, 2014:ID: 743431, 2014
23. Stephane Durocher, Debajyoti Mondal, and Md. Saidur Rahman, On Graphs That Are Not PCGs. In Proceedings of WALCOM 2013, Lecture Notes in Computer Science, 7748, Springer, pages 310-321, 2013
22. Sammi Abida Salma, Md. Saidur Rahman, and Md. Iqbal Hossain, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs. Journal of Graph Algorithms and Applications (JGAA), 17(2), :81-102, 2013
21. Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, and Sue Whitesides, Acyclic coloring with few division vertices. J. Discrete Algorithms, 23:42-53, 2013
20. S. Sharmin, and F. Manne, Efficient Counting of Maximal Independent sets in Sparse Graphs. In Proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013,, Springer, LNCS 7933, Rome, Italy, pages 103-114, 2013
19. Sammi Abida Salma, and Md. Saidur Rahman, Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs. In Proceedings of WALCOM, Lecture Notes in Computer Science, 7157, Springer, pages 112-123, 2012
18. Tanveer Awal, and Md. Saidur Rahman, A Linear Algorithm for Resource Four-partitioning Four-connected Planar Graphs. AKCE International Journal of Graphs and Combinatorics, 9(1), :11-20, 2012
17. Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, and Sue Whitesides, Acyclic Coloring with Few Division Vertices. In Proceedings of IWOCA 2012, Lecture Notes in Computer Science, 7643, Springer, pages 86 - 99, 2012
16. Md. Rezaul Karim, Md. Jawaherul Alam, and Md. Saidur Rahman, On Some Properties of Doughnut Graphs. In Proceedings of IWOCA 2012, Lecture Notes in Computer Science, 7643, Springer, pages 60-64, 2012
15. Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, and Md. Saidur Rahman, Acyclic colorings of graph subdivisions revisited. Journal of Discrete Algorithms, 16:90-103, 2012
14. Abu Reyan Ahmed, Md. Mazharul Islam, and Md. Saidur Rahman, On acyclic colorings of graphs. In Proceedings of 15th International Conference on Computer and Information Technology (ICCIT 2012), pages 95-100, 2012
13. Mohammad Tanvir Parvez, Md. Saidur Rahman, and Shin-ichi Nakano, Generating all triangulations of plane graphs. Journal of Graph Algorithms and Applications, :457-482, 2011
12. Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, and Md. Saidur Rahman, Acyclic Colorings of Graph Subdivisions. In Proceedings of International Workshop on Combinatorial Algorithms (IWOCA)., 2011
11. Tonmoy Guha Roy, Sourabh Aryabhatta, Md. Mohsin Uddin, and Md. Saidur Rahman, On Graceful Labelings of Trees. In Proceedings of WALCOM, Lecture Notes in Computer Science, 6552, Springer, pages 214-220, 2011
10. S. Sharmin, J. A. Telle, M. Vatshelle, and E. M. Hvidevold, Finding good decompositions for dynamic programming on dense graphs. In Proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, Springer, LNCS 7112, Germany, pages 219-231, 2011
9. Md. Mostofa Ali Patwary, and Md. Saidur Rahman, Minimum Face-Spanning Subgraphs of Plane Graphs. AKCE International Journal of Graphs and Combinatorics, 7(2):133-150, 2010
8. Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, and Md. Saidur Rahman, Pairwise compatibility graphs. Journal of Applied Mathematics and Computing, 30:479-503, 2009
7. Md. Rezaul Karim, and Md. Saidur Rahman, Four-Connected Spanning Subgraphs of Doughnut Graphs. In Proceedings of WALCOM, Lecture Notes in Computer Science, 4921, Springer, pages 132-143, 2008
6. Muhammad Nur Yanhaona, K. S. M. Tozammel Hossain, and Md. Saidur Rahman, Pairwise compatibility graphs. In Proceedings of WALCOM 2008, Lecture Notes in Computer Science, 4921, Springer, pages 222-233, 2008
5. Md. Shariful Islam Bhuyan, and Md. Saidur Rahman, Efficient Generation of Combinatorial Families. In Proceedings of 11th International Conference on Computer and Information Technology (ICCIT 2008), IEEE Xplore, pages 25-30, 2008
4. S. Sharmin, Md. Monirul Islam, D. Barua, and A. Mahmood, Graph Matching Recombination for Evolving Neural Networks. In Proceedings of the European Symposium on Artificial Neural Networks, ESANN 2007, Springer, LNCS 4492, China, pages 562-568, 2007
3. M. Sohel Rahman, M. Kaykobad, and Mohammad Saifur Rahman, A New Sufficient Condition for the Existence of Hamiltonian Paths. In Proceedings of 0th International Conference on Computers and Their Applications (CATA), 2005
2. M. Kaykobad, Asif-ul Haque , Mohammad Saifur Rahman, and M. Sohel Rahman, On Average Length of Cycle in a Complete Graph. In Proceedings of International Conference on Computer and Information Technology, pages 47-49, 2002
1. A. H. Tamal, M. S. Rahman, M. Sohel Rahman, and M. Kaykobad, On Average Length of Cycles in Complete Graphs. In Proceedings of 5th International Conference on Computer and Information Technology (ICCIT), pages 47-49, 2002

Department of Computer Science and Engineering, ECE building, Palashi, Dhaka, Bangladesh. The Department is part of the Faculty of Electrical and Electronic Engineering at the Bangladesh University of Engineering & Technology. No part or content of this website may be copied or reproduced without permission of the department authority. Contact info@cse.buet.ac.bd with questions or comments on this page.  [Development Credits]