http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/939 This collection gathers the papers of respected teachers and students of BUET published at recognized national and international journal, conference, workshop, and seminars. 2026-04-07T08:56:46Z http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/1957 Good spanning trees in graph drawing Md. Iqbal, Hossain; Md. Saidur, Rahman; Md. Iqbal, Hossain Introduces a good spanning tree of a plane graph.Solves two open problems on monotone drawings using good spanning trees.Finds a 2-visibility drawing of a planar graph using a good spanning tree.Gives algorithms to find an spike-VPG and T-shaped drawings of a planar graph. A plane graph is a planar graph with a fixed planar embedding. In this paper we define a special spanning tree of a plane graph which we call a good spanning tree. Not every plane graph has a good spanning tree. We show that every connected planar graph has a planar embedding with a good spanning tree. Using a good spanning tree, we show that every connected planar graph G of n vertices has a straight-line monotone grid drawing on an O ( n ) × O ( n 2 ) grid, and such a drawing can be found in O ( n ) time. Our results solve two open problems on monotone drawings of planar graphs posed by Angelini et al. Using good spanning trees, we also give simple linear-time algorithms for finding a 2-visibility representation of a connected planar graph G of n vertices on a ( 2 n - 1 ) × ( 2 n - 1 ) grid and for finding a spike-VPG representation of G on a ( 2 n - 1 ) × n grid. 2015-11-15T00:00:00Z http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/953 SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching. Azim, Md. Aashikur Rahman; Iliopoulos, Costas S.; Rahman, M. Sohel; Samiruzzaman, M.; Azim, Md. Aashikur Rahman This paper deals with the circular pattern matching (CPM) problem, which appears as an interesting problem in many biological contexts. CPM consists in finding all occurrences of the rotations of a patternPof length𝑚in a textTof length𝑛. In this paper, we present SimpLiFiCPM (pronounced “Simplify CPM”), a simple and lightweight filter-based algorithm to solve the problem. We compare our algorithm with the state-of-the-art algorithms and the results are found to be excellent. Much of the speed of our algorithm comes from the fact that our filters are effective but extremely simple and lightweight. 2015-03-21T00:00:00Z http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/944 Assurance of the Maximum Destruction in Battlefield using Cost-Effective Approximation Techniques Jaigirdar, Fariha Tasmin; Islam, Mohammad Mahfuzul; Jaigirdar, Fariha Tasmin Military Applications of Wireless Sensor Network in domains of maximizing security and gaining maximum benefits while attacking the opponent is a challenging and prominent area of research now-a-days. A commander’s goal in a battle field is not limited by securing his troops and the country but also to deliver proper commands to assault the enemies using the minimum number of resources. In this paper, we propose two efficient and low cost approximation algorithms—the maximum clique analysis and the maximum degree analysis techniques. Both of the techniques find the strategies of maximizing the destruction in a battlefield to defeat the opponent by utilizing limited resources. Experimental results show the effectiveness of the proposed algorithms in the prescribed areas of applications. Gaining the cost-effectiveness of the algorithms are also major concerns of this research. A comparative study explaining the number of resources required for commencing required level of destruction made to the opponents has been provided in this paper. The studies show that the maximum degree analysis technique is able to perform more destruction than the maximum clique analysis technique using same number of resources and requires relatively less computational complexity as well. 2012-01-01T00:00:00Z http://lib.buet.ac.bd;localhosthttp://:8080/xmlui/handle/123456789/943 Deterministic cluster head selection for wireless sensor networks Azim, Akramul; Islam, Mohammad Mahfuzul; Islam, Mohammad Mahfuzul The applications and adoption of wireless sensor networks (WSNs) in social and environmental purposes are increasing because of monitoring different infrastructures such as military, scientific, environmental, and domestic infrastructures. Low energy adaptive clustering hierarchy (LEACH) and its variants use some intermediate nodes, known as cluster heads, for relaying the communications made between the sensor nodes and the base station. These schemes, however, lack of a deterministic cluster head selection technique to form a certain number of required clusters. In this paper, we propose a deterministic cluster head selection technique to select expected number of clusters. Simulations justify the mathematical modeling of such a cluster head selection scheme which can be applied directly in realistic systems. 2012-01-01T00:00:00Z