|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 12 keywords
|
|
|
|
|
Results
Found 37 publication records. Showing 37 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 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 | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam |
Cutting a Convex Polyhedron Out of a Sphere. |
Graphs and Combinatorics |
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 | Ifat Jahangir, Anindya Das, Masud Hasan |
Formulation and Development of a Novel Quaternary Algebra |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz |
Efficient view point selection for silhouettes of convex polyhedra. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Md. Ashraful Alam, Masud Hasan |
Computing Nice Projections of Convex Polyhedra. |
Int. J. Comput. Geometry Appl. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz |
Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. |
Int. J. Comput. Geometry Appl. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Masud Hasan |
Cutting Out Polygons with a Circular Saw. |
ISAAC |
2011 |
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 | Syed Ishtiaque Ahmed, Md. Ariful Islam, Masud Hasan |
Cutting a Cornered Convex Polygon Out of a Circle. |
JCP |
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 | Anindya Das, Ifat Jahangir, Masud Hasan |
On the Design and Analysis of Quaternary Serial and Parallel Adders |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Masud Hasan, Mohammad Monoar Hossain, Alejandro López-Ortiz, Sabrina Nusrat, Saad Altaful Quader, Nabila Rahman |
Some New Equiprojective Polyhedra |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Syed Ishtiaque Ahmed, Masud Hasan, Awalin Sopan |
Vindictive Voronoi Games and Stabbing Delaunay Circles. |
ISVD |
2010 |
DBLP DOI BibTeX RDF |
competitive facility location, matching in planar graphs, stabbing set, Voronoi games, Delaunay triangulation |
| 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 | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam |
Cutting a Convex Polyhedron Out of a Sphere. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Syed Ishtiaque Ahmed, Md. Mansurul Alam Bhuiyan, Masud Hasan, Ishita Kamal Khan |
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost. |
WALCOM |
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(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 | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam |
Cutting a Convex Polyhedron Out of a Sphere |
CoRR |
2009 |
DBLP 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 | Md. Mahmud Muntakim Khan, Ayan Kumar Biswas, Shuvro Chowdhury, Masud Hasan, Asif Islam Khan |
Synthesis of GF(3) Based Reversible/Quantum Logic Circuits without Garbage Output. |
ISMVL |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahfuza Sharmin, Rukhsana Yeasmin, Masud Hasan |
Sorting by Prefix Reversals and Prefix Transpositions with Forward March |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Muhammad Abdullah Adnan, Masud Hasan |
Characterizing Graphs of Zonohedra |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Masud Hasan, Anna Lubiw |
Equiprojective polyhedra. |
Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Atif Rahman, Swakkhar Shatabda, Masud Hasan |
An approximation algorithm for sorting by reversals and transpositions. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maruf Ahmed, Sharif M. H. Chowdhury, Masud Hasan |
List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity. |
ICDCN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maruf Ahmed, Sharif M. H. Chowdhury, Masud Hasan |
Fast Preemptive Task Scheduling Algorithm for Homogeneous and Heterogeneous Distributed Memory Systems. |
SNPD |
2008 |
DBLP DOI BibTeX RDF |
Preemptive, Scheduling, Distributed, Memory, Heterogeneous, Systems, Task, Homogeneous, Fast |
| 1 | Muhammad Ashraful Alam, Masud Hasan |
Computing Nice Projections of Convex Polyhedra. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
nice orthogonal projections, Voronoi diagram, views, Convex polyhedra |
| 1 | Atif Rahman, Swakkhar Shatabda, Masud Hasan |
Approximation Algorithm for Sorting by Reversals and Transpositions. |
WALCOM |
2007 |
DBLP BibTeX RDF |
|
| 1 | Asif Islam Khan, Nadia Nusrat, Samira Manabi Khan, Masud Hasan, Mozammel H. A. Khan |
Quantum Realization of Some Ternary Circuits Using Muthukrishnan-Stroud Gates. |
ISMVL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz |
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz |
Efficient View Point Selection for Silhouettes of Convex Polyhedra. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Masud Hasan, Md. Saidur Rahman, Takao Nishizeki |
A linear algorithm for compact box-drawings of trees. |
Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Masud Hasan, Anna Lubiw |
Equiprojective Polyhedra. |
CCCG |
2003 |
DBLP BibTeX RDF |
|
| 1 | Masud Hasan, Md. Saidur Rahman, Takao Nishizeki |
A linear algorithm for compact box-drawings of trees. |
CCCG |
2002 |
DBLP BibTeX RDF |
|
| 1 | Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar |
Searching for the center of a circle. |
CCCG |
2002 |
DBLP BibTeX RDF |
|
Displaying result #1 - #37 of 37 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")