Rahnuma Islam Nishat

Int. J. Found. Comput. Sci., November, 2023

Drawing Partial 2-Trees with Few Slopes.

[BibT_eX]

[DOI]

Algorithmica, May, 2023

1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.

[BibT_eX]

[DOI]

Venkatesh Srinivasan

J. Graph Algorithms Appl., 2023

2022

Closed space-filling curves with controlled orientation for 3D printing.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2022

The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs.

[BibT_eX]

[DOI]

Venkatesh Srinivasan

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs.

[BibT_eX]

[DOI]

Srinivasan Venkatesh

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Reconfiguration of Hamiltonian cycles and paths in grid graphs.

[BibT_eX]

[DOI]

PhD thesis, 2020

2019

Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

2018

Table cartogram.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

Bend Complexity and Hamiltonian Cycles in Grid Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2014

The Range Beacon Placement Problem for Robot Navigation.

[BibT_eX]

[DOI]

Proceedings of the Canadian Conference on Computer and Robot Vision, 2014

2013

A Note on Minimum-Segment Drawings of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Acyclic coloring with few division vertices.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Minimum-segment convex drawings of 3-connected cubic plane graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Planar and Plane Slope Number of Partial 2-Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Table Cartograms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Map Folding.

[BibT_eX]

[DOI]

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

Grid Proximity Graphs: LOGs, GIGs and GIRLs.

[BibT_eX]

[DOI]

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

2012

Acyclic colorings of graph subdivisions revisited.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Point-set embeddings of plane 3-trees.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Touching Triangle Representations for 3-Connected Planar Graphs.

[BibT_eX]

[DOI]

Stephen G. Kobourov

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Point-Set Embeddability of 2-Colored Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Hamiltonian Paths and Cycles in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Visibility Drawings of Plane 3-Trees with Minimum Area.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2011

Minimum-Area Drawings of Plane 3-Trees.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

J. Graph Algorithms Appl., 2011

Acyclic Colorings of Graph Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Embedding Plane 3-Trees in ℝ2 and ℝ3.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Point-Set Embeddings of Plane 3-Trees - (Extended Abstract).

[BibT_eX]

[DOI]