default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichiel H. M. Smid
Michiel Smid
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j143]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill
, Michiel Smid:
On the Spanning and Routing Ratio of the Directed Theta-Four Graph. Discret. Comput. Geom. 71(3): 872-892 (2024)- [c131]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - [c130]Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan:
Geometric Covering via Extraction Theorem. ITCS 2024: 7:1-7:20 - [c129]Prosenjit Bose, Darryl Hill, Michiel Smid, Tyler Tuttle:
On the Spanning and Routing Ratios of the Yao-Four Graph. ISAAC 2024: 15:1-15:17 - [i61]Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid:
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. CoRR abs/2405.18134 (2024) - [i60]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. CoRR abs/2405.20424 (2024) - [i59]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. CoRR abs/2410.05580 (2024) - 2023
- [j142]Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. Algorithmica 85(6): 1679-1705 (2023) - [j141]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid:
Improved Routing on the Delaunay Triangulation. Discret. Comput. Geom. 70(3): 495-549 (2023) - [j140]Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
An instance-based algorithm for deciding the bias of a coin. Discret. Math. Algorithms Appl. 15(3): 2250097:1-2250097:10 (2023) - [j139]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl. 27(1): 1-18 (2023) - [i58]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky:
On Separating Path and Tree Systems in Graphs. CoRR abs/2312.14295 (2023) - 2022
- [j138]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. 1(1): 3:1-3:18 (2022) - [j137]Abrar Kazi, Michiel Smid:
Closest-pair queries and minimum-weight queries are equivalent for squares. Comput. Geom. 100: 101810 (2022) - [j136]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid:
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103: 101852 (2022) - 2021
- [j135]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid:
On the Minimum Consistent Subset Problem. Algorithmica 83(7): 2273-2302 (2021) - [j134]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid:
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28(3) (2021) - [j133]Michiel H. M. Smid:
An improved construction for spanners of disks. Comput. Geom. 92: 101682 (2021) - [j132]Farah Chanchary, Anil Maheshwari, Michiel Smid:
Window queries for intersecting objects, maximal points and approximations using coresets. Discret. Appl. Math. 305: 295-310 (2021) - [j131]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66(4): 1401-1414 (2021) - [c128]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC 2021: 44:1-44:14 - [c127]Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. ISAAC 2021: 62:1-62:16 - [c126]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. WADS 2021: 15-28 - [c125]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. WADS 2021: 186-199 - [i57]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR abs/2109.07524 (2021) - [i56]Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. CoRR abs/2110.15693 (2021) - [i55]Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Approximating bottleneck spanning trees on partitioned tuples of points. CoRR abs/2111.05780 (2021) - 2020
- [j130]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Optimal Art Gallery Localization is NP-hard. Comput. Geom. 88: 101607 (2020) - [j129]Joachim Gudmundsson, Michiel H. M. Smid:
Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword. Comput. Geom. 88: 101608 (2020) - [j128]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89: 101631 (2020) - [j127]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying relational event graphs using colored range searching data structures. Discret. Appl. Math. 286: 51-61 (2020) - [j126]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and planarity thresholds for random geometric graphs. Discret. Math. Algorithms Appl. 12(1): 2050005:1-2050005:21 (2020) - [j125]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs. Inf. Process. Lett. 153 (2020) - [j124]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11(1): 418-432 (2020) - [j123]Michiel Smid, Anil Maheshwari, Wolfgang Mulzer:
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics. J. Comput. Geom. 11(1): 507-524 (2020) - [c124]Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid:
Covering Points with Pairs of Concentric Disks. CCCG 2020: 33-38 - [c123]Abrar Kazi, Michiel Smid:
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. CCCG 2020: 206-213 - [i54]Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid:
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. CoRR abs/2004.05883 (2020) - [i53]Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid:
Tight Bounds on The Clique Chromatic Number. CoRR abs/2006.11353 (2020) - [i52]Abrar Kazi, Michiel Smid:
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. CoRR abs/2010.06463 (2020) - [i51]Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
An Instance-Based Algorithm for Deciding the Bias of a Coin. CoRR abs/2011.05502 (2020)
2010 – 2019
- 2019
- [j122]Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81(4): 1512-1534 (2019) - [j121]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip distance to some plane configurations. Comput. Geom. 81: 12-21 (2019) - [j120]Sang Won Bae, Michiel H. M. Smid:
Closest-pair queries in fat rectangles. Comput. Geom. 83: 1-8 (2019) - [j119]Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy:
Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. 29(1): 73-93 (2019) - [j118]Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
The Most Likely Object to be Seen Through a Window. Int. J. Comput. Geom. Appl. 29(4): 269-287 (2019) - [j117]Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel H. M. Smid:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. Int. J. Found. Comput. Sci. 30(2): 293-313 (2019) - [j116]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793: 28-35 (2019) - [c122]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid:
On the Spanning and Routing Ratio of Theta-Four. SODA 2019: 2361-2370 - [c121]Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. WADS 2019: 155-167 - [c120]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS 2019: 211-224 - [c119]Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. WADS 2019: 283-295 - [i50]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR abs/1903.07024 (2019) - [i49]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. CoRR abs/1905.00791 (2019) - [i48]Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid:
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. CoRR abs/1905.02322 (2019) - 2018
- [j115]Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid:
Geometric Path Problems with Violations. Algorithmica 80(2): 448-471 (2018) - [j114]Prosenjit Bose, Darryl Hill, Michiel H. M. Smid:
Improved Spanning Ratio for Low Degree Plane Spanners. Algorithmica 80(3): 935-976 (2018) - [j113]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80(11): 3177-3191 (2018) - [j112]Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica 80(11): 3316-3334 (2018) - [j111]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Strong matching of points with geometric shapes. Comput. Geom. 68: 186-205 (2018) - [j110]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59(4): 864-885 (2018) - [c118]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Window Queries for Problems on Intersecting Objects and Maximal Points. CALDAM 2018: 199-213 - [c117]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CCCG 2018: 346-352 - [c116]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky:
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG 2018: 2:1-2:12 - [c115]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG 2018: 8:1-8:14 - [c114]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid:
Improved Routing on the Delaunay Triangulation. ESA 2018: 22:1-22:13 - [c113]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. SWAT 2018: 11:1-11:14 - [p2]Michiel H. M. Smid:
The Well-Separated Pair Decomposition and Its Applications. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [i47]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR abs/1802.09505 (2018) - [i46]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid:
On the Spanning and Routing Ratio of Theta-Four. CoRR abs/1808.01298 (2018) - [i45]Sang Won Bae, Michiel H. M. Smid:
Closest-Pair Queries in Fat Rectangles. CoRR abs/1809.10531 (2018) - [i44]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. CoRR abs/1809.10737 (2018) - [i43]Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid:
On the Minimum Consistent Subset Problem. CoRR abs/1810.09232 (2018) - 2017
- [j109]Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid:
Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60: 8-18 (2017) - [j108]Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. 63: 1-9 (2017) - [j107]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. J. Graph Algorithms Appl. 21(4): 389-415 (2017) - [j106]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. 21(4): 527-546 (2017) - [j105]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards plane spanners of degree 3. J. Comput. Geom. 8(1): 11-31 (2017) - [c112]Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM 2017: 83-95 - [c111]Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid:
Maximum Plane Trees in Multipartite Geometric Graphs. WADS 2017: 193-204 - [c110]Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. WADS 2017: 301-312 - [e5]Joachim Gudmundsson, Michiel H. M. Smid:
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada. 2017 [contents] - [i42]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Art Gallery Localization. CoRR abs/1706.06938 (2017) - [i41]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Optimal Art Gallery Localization is NP-hard. CoRR abs/1706.08016 (2017) - [i40]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Compatible 4-Holes in Point Sets. CoRR abs/1706.08105 (2017) - 2016
- [j104]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi games and ϵ-nets, in two and three dimensions. Comput. Geom. 55: 41-58 (2016) - [j103]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. 57: 27-39 (2016) - [j102]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Probing convex polygons with a wedge. Comput. Geom. 58: 34-59 (2016) - [j101]Christian Knauer, Michiel H. M. Smid:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 26(3-4): 0-134 (2016) - [j100]Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu:
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. 7(1): 444-472 (2016) - [j99]Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel:
A plane 1.88-spanner for points in convex position. J. Comput. Geom. 7(1): 520-539 (2016) - [c109]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG 2016: 140-146 - [c108]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. ISAAC 2016: 19:1-19:14 - [c107]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. IWOCA 2016: 55-67 - [c106]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. IWOCA 2016: 68-80 - [c105]Prosenjit Bose, Darryl Hill, Michiel H. M. Smid:
Improved Spanning Ratio for Low Degree Plane Spanners. LATIN 2016: 249-262 - [c104]Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
A Plane 1.88-Spanner for Points in Convex Position. SWAT 2016: 25:1-25:14 - [c103]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts. SWAT 2016: 27:1-27:14 - [r8]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. Encyclopedia of Algorithms 2016: 86-90 - [r7]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Geometric Spanners. Encyclopedia of Algorithms 2016: 846-852 - [r6]Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Planar Geometric Spanners. Encyclopedia of Algorithms 2016: 1570-1574 - [i39]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. CoRR abs/1606.08824 (2016) - [i38]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. CoRR abs/1607.01294 (2016) - [i37]Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel H. M. Smid, Fabian Stehn:
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees. CoRR abs/1607.05547 (2016) - [i36]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. CoRR abs/1611.01661 (2016) - [i35]Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid:
Minimizing the Continuous Diameter when Augmenting a Tree with a Shortcut. CoRR abs/1612.01370 (2016) - 2015
- [j98]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On full Steiner trees in unit disk graphs. Comput. Geom. 48(6): 453-458 (2015) - [j97]Joachim Gudmundsson, Michiel H. M. Smid:
Fast algorithms for approximate Fréchet matching queries in geometric trees. Comput. Geom. 48(6): 479-494 (2015) - [j96]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. Comput. Geom. 48(9): 646-660 (2015) - [j95]A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid:
Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48(9): 718-731 (2015) - [j94]Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Average Stretch Factor: How Low Does It Go? Discret. Comput. Geom. 53(2): 296-326 (2015) - [j93]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. Discret. Math. Theor. Comput. Sci. 17(2): 119-142 (2015) - [j92]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On the hardness of full Steiner tree problems. J. Discrete Algorithms 34: 118-127 (2015) - [j91]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015) - [j90]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596: 67-78 (2015) - [c102]Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari, Michiel H. M. Smid:
Plane and Planarity Thresholds for Random Geometric Graphs. ALGOSENSORS 2015: 1-12 - [c101]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM 2015: 89-100 - [c100]Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid, Paul Liu:
A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem. CCCG 2015 - [c99]