default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRahnuma Islam Nishat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c22]Therese Biedl
, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier:
Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons. WALCOM 2025: 32-46- 2024
- [j14]Sheikh Azizul Hakim, Rahnuma Islam Nishat, Md. Saidur Rahman:
Approximation algorithms for maximum weighted internal spanning trees in regular graphs and subdivisions of graphs. Comput. J. 67(10): 2898-2905 (2024) - [j13]Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs. J. Comb. Optim. 48(4): 31 (2024) - [e1]Rahnuma Islam Nishat:
Proceedings of the 36th Canadian Conference on Computational Geometry, CCCG 2024, Brock University, St. Catharines, Canada, July 17-19, 2024. 2024 [contents] - [i4]Mostafa Abbasi, Rahnuma Islam Nishat, Corey Bond, John Brandon Graham-Knight, Patricia Lasserre, Yves Lucet, Homayoun Najjaran:
A Review of AI and Machine Learning Contribution in Predictive Business Process Management (Process Enhancement and Process Improvement Approaches). CoRR abs/2407.11043 (2024) - [i3]Reyan Ahmed, Debajyoti Mondal, Rahnuma Islam Nishat:
Subsetwise and Multi-Level Additive Spanners with Lightness Guarantees. CoRR abs/2411.07505 (2024) - [i2]Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier:
Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons. CoRR abs/2411.11274 (2024) - 2023
- [j12]William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat:
Drawing Partial 2-Trees with Few Slopes. Algorithmica 85(5): 1156-1175 (2023) - [j11]Rahnuma Islam Nishat, Sue Whitesides:
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs. Int. J. Found. Comput. Sci. 34(7): 773-793 (2023) - [j10]Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
1-Complex s,t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. J. Graph Algorithms Appl. 27(4): 281-327 (2023) - [c21]Yeganeh Bahoo, Onur Cagirici, Kody Manastyrski, Rahnuma Islam Nishat, Christopher Kolios, Roni Sherman:
Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras. CCCG 2023: 63-70 - 2022
- [j9]A. Bedel, Yoann Coudert-Osmont, Jonàs Martínez, Rahnuma Islam Nishat, Sue Whitesides, Sylvain Lefebvre:
Closed space-filling curves with controlled orientation for 3D printing. Comput. Graph. Forum 41(2): 473-492 (2022) - [c20]Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. COCOON 2022: 463-475 - [c19]Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. WALCOM 2022: 59-70 - [i1]Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides:
The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs. CoRR abs/2205.08025 (2022) - 2021
- [c18]Rahnuma Islam Nishat, Srinivasan Venkatesh, Sue Whitesides:
Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs. IWOCA 2021: 501-515 - 2020
- [b1]Rahnuma Islam Nishat:
Reconfiguration of Hamiltonian cycles and paths in grid graphs. University of Victoria, Canada, 2020
2010 – 2019
- 2019
- [c17]Rahnuma Islam Nishat, Sue Whitesides:
Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs. WG 2019: 325-337 - 2018
- [j8]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table cartogram. Comput. Geom. 68: 174-185 (2018) - 2017
- [c16]Rahnuma Islam Nishat, Sue Whitesides:
Bend Complexity and Hamiltonian Cycles in Grid Graphs. COCOON 2017: 445-456 - 2014
- [c15]River Allen, Neil MacMillan, Dimitri Marinakis, Rahnuma Islam Nishat, Rayhan Rahman, Sue Whitesides:
The Range Beacon Placement Problem for Robot Navigation. CRV 2014: 151-158 - 2013
- [j7]Debajyoti Mondal, Rahnuma Islam Nishat, Sudip Biswas, Md. Saidur Rahman:
Minimum-segment convex drawings of 3-connected cubic plane graphs. J. Comb. Optim. 25(3): 460-480 (2013) - [j6]Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides:
Acyclic coloring with few division vertices. J. Discrete Algorithms 23: 42-53 (2013) - [j5]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides:
A Note on Minimum-Segment Drawings of Planar Graphs. J. Graph Algorithms Appl. 17(3): 301-328 (2013) - [c14]River Allen, Laurie J. Heyer, Rahnuma Islam Nishat, Sue Whitesides:
Grid Proximity Graphs: LOGs, GIGs and GIRLs. CCCG 2013 - [c13]Rahnuma Islam Nishat, Sue Whitesides:
Map Folding. CCCG 2013 - [c12]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek:
Table Cartograms. ESA 2013: 421-432 - [c11]William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat:
Planar and Plane Slope Number of Partial 2-Trees. GD 2013: 412-423 - 2012
- [j4]Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman:
Point-set embeddings of plane 3-trees. Comput. Geom. 45(3): 88-98 (2012) - [j3]Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman:
Acyclic colorings of graph subdivisions revisited. J. Discrete Algorithms 16: 90-103 (2012) - [c10]Sudip Biswas, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat:
Hamiltonian Paths and Cycles in Planar Graphs. COCOA 2012: 83-94 - [c9]Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat:
Touching Triangle Representations for 3-Connected Planar Graphs. GD 2012: 199-210 - [c8]Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat:
Point-Set Embeddability of 2-Colored Trees. GD 2012: 291-302 - [c7]Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides:
Acyclic Coloring with Few Division Vertices. IWOCA 2012: 86-99 - 2011
- [j2]Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Muhammad Jawaherul Alam:
Minimum-Area Drawings of Plane 3-Trees. J. Graph Algorithms Appl. 15(2): 177-204 (2011) - [j1]Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman:
Visibility Drawings of Plane 3-Trees with Minimum Area. Math. Comput. Sci. 5(1): 119-132 (2011) - [c6]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides:
A Note on Minimum-Segment Drawings of Planar Graphs. CCCG 2011 - [c5]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides:
Embedding Plane 3-Trees in ℝ2 and ℝ3. GD 2011: 39-51 - [c4]Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman:
Acyclic Colorings of Graph Subdivisions. IWOCA 2011: 247-260 - 2010
- [c3]Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Md. Jawaherul Alam:
Minimum-area drawings of plane 3-trees. CCCG 2010: 191-194 - [c2]Sudip Biswas, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman:
Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs. COCOON 2010: 182-191 - [c1]Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman:
Point-Set Embeddings of Plane 3-Trees - (Extended Abstract). GD 2010: 317-328
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-30 20:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
