Saeed Mehrabi

Michiel Smid

Algorithmica, June, 2023

Maximum Bipartite Subgraphs of Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2023

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2023

Geodesic obstacle representation of graphs.

[BibT_eX]

[DOI]

Luís Fernando Schultz Xavier da Silveira

Pat Morin

Comput. Geom., 2023

2022

Parameterized complexity of two-interval pattern problem.

[BibT_eX]

[DOI]

Prosenjit Bose

Debajyoti Mondal

Theor. Comput. Sci., 2022

Computing maximum independent set on outerstring graphs and their relatives.

[BibT_eX]

[DOI]

Comput. Geom., 2022

2021

On the Minimum Consistent Subset Problem.

[BibT_eX]

[DOI]

Algorithmica, 2021

On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2021

Faster Multi-sided One-Bend Boundary Labelling.

[BibT_eX]

[DOI]

Prosenjit Bose

Debajyoti Mondal

Proceedings of the WALCOM: Algorithms and Computation, 2021

Upward Point Set Embeddings of Paths and Trees.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2021

2020

(Faster) Multi-Sided Boundary Labelling.

[BibT_eX]

[DOI]

Prosenjit Bose

Debajyoti Mondal

CoRR, 2020

Evacuating equilateral triangles and squares in the face-to-face model.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Packing boundary-anchored rectangles and squares.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Maximum Bipartite Subgraph of Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Covering Points with Pairs of Concentric Disks.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Approximability of covering cells with line segments.

[BibT_eX]

[DOI]

Paz Carmi

Anil Maheshwari

Luís Fernando Schultz Xavier da Silveira

Theor. Comput. Sci., 2019

Polygon simplification by minimizing convex corners.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Approximating dominating set on intersection graphs of rectangles and L-frames.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation.

[BibT_eX]

[DOI]

Hamideh Vosoughpour

Ziting Yu

Algorithmica, 2019

Constrained Orthogonal Segment Stabbing.

[BibT_eX]

Sayan Bandyapadhyay

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Approximating Dominating Set on Intersection Graphs of L-frames.

[BibT_eX]

[DOI]

CoRR, 2018

Boundary Labeling for Rectangular Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017

Computing conforming partitions of orthogonal polygons with minimum stabbing number.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On RAC drawings of 1-planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Guarding monotone art galleries with sliding cameras in linear time.

[BibT_eX]

[DOI]

Mark de Berg

J. Discrete Algorithms, 2017

A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid.

[BibT_eX]

[DOI]

CoRR, 2017

Approximation Algorithms for Independence and Domination on B<sub>1</sub>-VPG and B<sub>1</sub>-EPG Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Guarding orthogonal art galleries with sliding cameras.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Approximating Domination on Intersection Graphs of Paths on a Grid.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

On Guarding Orthogonal Polygons with Sliding Cameras.

[BibT_eX]

[DOI]

Hamideh Vosoughpour

Proceedings of the WALCOM: Algorithms and Computation, 2017

Evacuating an Equilateral Triangle in the Face-to-Face Model.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Grid-Obstacle Representations with Connections to Staircase Guarding.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Approximating Weighted Duo-Preservation in Comparative Genomics.

[BibT_eX]

[DOI]

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

On Guarding Orthogonal Polygons with Bounded Treewidth.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Packing Boundary-Anchored Rectangles.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Unique Set Cover on Unit Disks and Unit Squares.

[BibT_eX]

[DOI]

CoRR, 2016

On r-Guarding Thin Orthogonal Polygons.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

1-Bend RAC Drawings of 1-Planar Graphs.

[BibT_eX]

[DOI]

Walter Didimo

Giuseppe Liotta

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Geometric Unique Set Cover on Unit Disks and Unit Squares.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Rectangle-of-influence triangulations.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Sliding k-Transmitters: Hardness and Approximation.

[BibT_eX]

Ziting Yu

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Guarding the Vertices of an Orthogonal Terrain using Vertex Guards.

[BibT_eX]

[DOI]

CoRR, 2015

A Note on Approximating 2-Transmitters.

[BibT_eX]

[DOI]

Abbas Mehrabi

CoRR, 2015

Guarding Orthogonal Terrains.

[BibT_eX]

[DOI]

Pak Ching Li

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Drawing HV-Restricted Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras

[BibT_eX]

[DOI]

CoRR, 2013

A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.

[BibT_eX]

[DOI]

Robert Fraser

CoRR, 2013

Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On k-Enclosing Objects in a Coloured Point Set.

[BibT_eX]

[DOI]

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

2012

Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

The Cover Contact Graph of Discs Touching a Line.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Realizing Site Permutations.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2009

A Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem.

[BibT_eX]

Ali D. Mehrabi

Abbas Mehrabi

Proceedings of the IJCCI 2009, 2009

On Efficiency of Evolutionary Algorithms for Finding Large Independent Sets.

[BibT_eX]

Proceedings of the 4th Indian International Conference on Artificial Intelligence, 2009

A New Hybrid Genetic Algorithm for Maximum Independent Set Problem.

[BibT_eX]