2025
Online Range Assignment Problems.
Proceedings of the Algorithms and Complexity - 14th International Conference, 2025
2024
Dynamic Euclidean bottleneck matching.
Theor. Comput. Sci., 2024
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees.
J. Graph Algorithms Appl., 2024
2023
Stabbing Pairwise Intersecting Disks by Four Points.
Discret. Comput. Geom., December, 2023
Geodesic obstacle representation of graphs.
Comput. Geom., 2023
Piercing pairwise intersecting geodesic disks by five points.
Comput. Geom., 2023
Parameterized Study of Steiner Tree on Unit Disk Graphs.
Algorithmica, 2023
Geometric Spanning Trees Minimizing the Wiener Index.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
2022
A linear-time algorithm for minimum k-hop dominating set of a cactus graph.
Discret. Appl. Math., 2022
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree.
CoRR, 2022
Computing maximum independent set on outerstring graphs and their relatives.
Comput. Geom., 2022
<i>δ</i>-Greedy <i>t</i>-spanner.
Comput. Geom., 2022
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number.
Electron. J. Comb., 2022
2021
Minimizing total interference in asymmetric sensor networks.
Theor. Comput. Sci., 2021
Planar bichromatic bottleneck spanning trees.
J. Comput. Geom., 2021
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.
Discret. Comput. Geom., 2021
2×n Grids have Unbounded Anagram-Free Chromatic Number.
CoRR, 2021
Improved PTASs for convex barrier coverage.
Comput. Geom., 2021
Piercing pairwise intersecting geodesic disks.
Comput. Geom., 2021
On the Minimum Consistent Subset Problem.
Algorithmica, 2021
2020
Faster algorithms for some optimization problems on collinear points.
J. Comput. Geom., 2020
Monochromatic plane matchings in bicolored point set.
Inf. Process. Lett., 2020
Balanced line separators of unit disk graphs.
Comput. Geom., 2020
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule.
Algorithmica, 2020
Non-Crossing Matching of Online Points.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
Approximability of covering cells with line segments.
Theor. Comput. Sci., 2019
Bottleneck bichromatic full Steiner trees.
Inf. Process. Lett., 2019
The Most Likely Object to be Seen Through a Window.
Int. J. Comput. Geom. Appl., 2019
Locating battery charging stations to facilitate almost shortest paths.
Discret. Appl. Math., 2019
Minimizing the sum of distances to a server in a constraint network.
Comput. Geom., 2019
Bottleneck detour tree of points on a path.
Comput. Geom., 2019
2018
Dual power assignment via second Hamiltonian cycle.
J. Comput. Syst. Sci., 2018
Unique Coverage with Rectangular Regions.
Int. J. Comput. Geom. Appl., 2018
Selecting and covering colored points.
Discret. Appl. Math., 2018
Near-Optimal O(k)-Robust Geometric Spanners.
CoRR, 2018
Bounded-Hop Communication Networks.
Algorithmica, 2018
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
Boundary Labeling for Rectangular Diagrams.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
2017
Strongly Connected Spanning Subgraph for Almost Symmetric Networks.
Int. J. Comput. Geom. Appl., 2017
Efficient data retrieval in faulty sensor networks using a mobile mule.
Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017
\delta -Greedy t-spanner.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017
Network Optimization on Partitioned Pairs of Points.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
2016
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.
J. Comput. Geom., 2016
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016
2015
Bottleneck Steiner tree with bounded number of Steiner vertices.
J. Discrete Algorithms, 2015
Minimum Dominating Set Problem for Unit Disks Revisited.
Int. J. Comput. Geom. Appl., 2015
Compatible Connectivity Augmentation of Planar Disconnected Graphs.
Discret. Comput. Geom., 2015
Spiderman graph: Visibility in urban regions.
Comput. Geom., 2015
Approximating the bottleneck plane perfect matching of a point set.
Comput. Geom., 2015
On the Bounded-Hop Range Assignment Problem.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
On the Minimum Cost Range Assignment Problem.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2014
The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition.
Discret. Comput. Geom., 2014
Bottleneck non-crossing matching in the plane.
Comput. Geom., 2014
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.
Algorithmica, 2014
2013
Minimum weight Euclidean t-spanner is NP-hard.
J. Discrete Algorithms, 2013
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks.
Int. J. Comput. Geom. Appl., 2013
Bounding the locality of distributed routing algorithms.
Distributed Comput., 2013
Stable Roommates Spanner.
Comput. Geom., 2013
On the power of the semi-separated pair decomposition.
Comput. Geom., 2013
2012
Efficient model for indoor radio paths computation.
Simul. Model. Pract. Theory, 2012
An optimal algorithm for computing angle-constrained spanners.
J. Comput. Geom., 2012
On bounded degree plane strong geometric spanners.
J. Discrete Algorithms, 2012
The MST of symmetric disk graphs is light.
Comput. Geom., 2012
Unexplored Steiner Ratios in Geometric Networks.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
2011
Minimum power energy spanners in wireless ad hoc networks.
Wirel. Networks, 2011
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
Spanners of additively weighted point sets.
J. Discrete Algorithms, 2011
Multi Cover of a Polygon Minimizing the Sum of Areas.
Int. J. Comput. Geom. Appl., 2011
Connectivity guarantees for wireless networks with directional antennas.
Comput. Geom., 2011
On a family of strong geometric spanners that admit local routing strategies.
Comput. Geom., 2011
Location-Oblivious Distributed Unit Disk Graph Coloring.
Algorithmica, 2011
The euclidean bottleneck steiner path problem.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011
2010
On the Stretch Factor of Convex Delaunay Graphs.
J. Comput. Geom., 2010
Bounded Degree Planar Geometric Spanners
CoRR, 2010
Computing the Greedy Spanner in Near-Quadratic Time.
Algorithmica, 2010
Improved Methods For Generating Quasi-gray Codes.
Proceedings of the Algorithm Theory, 2010
Communication-Efficient Construction of the Plane Localized Delaunay Graph.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
Computing Radio Paths in an Urban Environment.
Proceedings of the 7th IEEE Consumer Communications and Networking Conference, 2010
Stable roommates and geometric spanners.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
Direction assignment in wireless networks.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
Matrix columns allocation problems.
Theor. Comput. Sci., 2009
Spanners of Complete k-Partite Geometric Graphs.
SIAM J. Comput., 2009
Geometric spanners with small chromatic number.
Comput. Geom., 2009
A linear-space algorithm for distance preserving graph embedding.
Comput. Geom., 2009
Minimum-Cost Load-Balancing Partitions.
Algorithmica, 2009
2008
Private Approximation of Search Problems.
SIAM J. Comput., 2008
Approximating the Visible Region of a Point on a Terrain.
GeoInformatica, 2008
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks.
Comput. Geom., 2008
Distinct Distances in Graph Drawings.
Electron. J. Comb., 2008
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
2007
Power Assignment in Radio Networks with Two Power Levels.
Algorithmica, 2007
Fault-Tolerant Power Assignment and Backbone in Wireless Networks.
Ad Hoc Sens. Wirel. Networks, 2007
Covering Points by Unit Disks of Fixed Location.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
Linear-Space Algorithms for Distance Preserving Embedding.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2006
The minimum-area spanning tree problem.
Comput. Geom., 2006
2005
On the Fermat-Weber center of a convex object.
Comput. Geom., 2005
Geographic Quorum System Approximations.
Algorithmica, 2005
The minimum area spanning tree problem.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
Minimum-Cost Load-Balancing Partitions.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
2004
Computing all large sums-of-pairs in <sub>R<sup>n</sup></sub> and the discrete planar two-watchtower problem.
Inf. Process. Lett., 2004
2003
Greedy Edge-Disjoint Paths in Complete Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003