Ahmad Biniaz

According to our database1, Ahmad Biniaz authored at least 36 papers between 2009 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Strong matching of points with geometric shapes.
Comput. Geom., 2018

Spanning Trees in Multipartite Geometric Graphs.
Algorithmica, 2018

Flip Distance to some Plane Configurations.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Improved Bounds for Guarding Plane Graphs with Edges.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

On the Size of Outer-String Representations.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Rollercoasters and Caterpillars.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Faster Algorithms for some Optimization Problems on Collinear Points.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Compatible 4-Holes in Point Sets.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Packing Plane Spanning Trees into a Point Set.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Integral Unit Bar-Visibility Graphs.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Compatible Paths on Labelled Point Sets.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem.
J. Graph Algorithms Appl., 2017

Approximation algorithms for the unit disk cover problem in 2D and 3D.
Comput. Geom., 2017

Maximum Plane Trees in Multipartite Geometric Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Packing Boundary-Anchored Rectangles.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
A plane 1.88-spanner for points in convex position.
JoCG, 2016

A Plane 1.88-Spanner for Points in Convex Position.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Plane Bichromatic Trees of Low Degree.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Towards Plane Spanners of Degree 3.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Matchings in higher-order Gabriel graphs.
Theor. Comput. Sci., 2015

On the hardness of full Steiner tree problems.
J. Discrete Algorithms, 2015

Packing Plane Perfect Matchings into a Point Set.
Discrete Mathematics & Theoretical Computer Science, 2015

On full Steiner trees in unit disk graphs.
Comput. Geom., 2015

Approximating the bottleneck plane perfect matching of a point set.
Comput. Geom., 2015

An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon.
Proceedings of the Topics in Theoretical Computer Science, 2015

A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

Plane and Planarity Thresholds for Random Geometric Graphs.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem.
Comput. Geom., 2014

Bottleneck Bichromatic Plane Matching of Points.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Approximating Full Steiner Tree in a Unit Disk Graph.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Fixed-Orientation Equilateral Triangle Matching of Point Sets.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012
A faster circle-sweep Delaunay triangulation algorithm.
Advances in Engineering Software, 2012

2009
Slope Preserving Terrain Simplification - An Experimental Study.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009


  Loading...