Rahnuma Islam Nishat

Orcid: 0000-0001-6987-4855

According to our database1, Rahnuma Islam Nishat authored at least 32 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs.
J. Comb. Optim., November, 2024

A Review of AI and Machine Learning Contribution in Predictive Business Process Management (Process Enhancement and Process Improvement Approaches).
CoRR, 2024

Approximation algorithms for maximum weighted internal spanning trees in regular graphs and subdivisions of graphs.
Comput. J., 2024

2023
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs.
Int. J. Found. Comput. Sci., November, 2023

Drawing Partial 2-Trees with Few Slopes.
Algorithmica, May, 2023

1-Complex <i>s,t</i> Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.
J. Graph Algorithms Appl., 2023

Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022
Closed space-filling curves with controlled orientation for 3D printing.
Comput. Graph. Forum, 2022

1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.
Proceedings of the WALCOM: Algorithms and Computation, 2022

2021
Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020
Reconfiguration of Hamiltonian cycles and paths in grid graphs.
PhD thesis, 2020

2019
Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

2018
Table cartogram.
Comput. Geom., 2018

2017
Bend Complexity and Hamiltonian Cycles in Grid Graphs.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2014
The Range Beacon Placement Problem for Robot Navigation.
Proceedings of the Canadian Conference on Computer and Robot Vision, 2014

2013
A Note on Minimum-Segment Drawings of Planar Graphs.
J. Graph Algorithms Appl., 2013

Acyclic coloring with few division vertices.
J. Discrete Algorithms, 2013

Minimum-segment convex drawings of 3-connected cubic plane graphs.
J. Comb. Optim., 2013

Planar and Plane Slope Number of Partial 2-Trees.
Proceedings of the Graph Drawing - 21st International Symposium, 2013


Map Folding.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Grid Proximity Graphs: LOGs, GIGs and GIRLs.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Acyclic colorings of graph subdivisions revisited.
J. Discrete Algorithms, 2012

Point-set embeddings of plane 3-trees.
Comput. Geom., 2012

Touching Triangle Representations for 3-Connected Planar Graphs.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Point-Set Embeddability of 2-Colored Trees.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Hamiltonian Paths and Cycles in Planar Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Visibility Drawings of Plane 3-Trees with Minimum Area.
Math. Comput. Sci., 2011

Minimum-Area Drawings of Plane 3-Trees.
J. Graph Algorithms Appl., 2011

Acyclic Colorings of Graph Subdivisions.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Embedding Plane 3-Trees in ℝ2 and ℝ3.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
Point-Set Embeddings of Plane 3-Trees - (Extended Abstract).
Proceedings of the Graph Drawing - 18th International Symposium, 2010


  Loading...