Michiel Smid

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 28

Top Topics

Independent Set

Top Venues

Discret. Comput. Geom.

Publications

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) (2024)
Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan
Geometric Covering via Extraction Theorem. ITCS (2024)
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults. CoRR (2024)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Euclidean Maximum Matchings in the Plane - Local to Global. CoRR (2024)
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) (2023)
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) (2023)
Joyce Bacic, Saeed Mehrabi, Michiel Smid
Shortest Beer Path Queries in Outerplanar Graphs. Algorithmica 85 (6) (2023)
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 (2023)
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) (2023)
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 (2022)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points. Comput. Geom. Topol. 1 (1) (2022)
Abrar Kazi, Michiel Smid
Closest-pair queries and minimum-weight queries are equivalent for squares. Comput. Geom. 100 (2022)
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) (2021)
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)
Joyce Bacic, Saeed Mehrabi, Michiel Smid
Shortest Beer Path Queries in Outerplanar Graphs. CoRR (2021)
Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid
Tight Bounds on the Clique Chromatic Number. Electron. J. Comb. 28 (3) (2021)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Approximating bottleneck spanning trees on partitioned tuples of points. CoRR (2021)
Joyce Bacic, Saeed Mehrabi, Michiel Smid
Shortest Beer Path Queries in Outerplanar Graphs. ISAAC (2021)
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC (2021)
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Euclidean Maximum Matchings in the Plane - Local to Global. WADS (2021)
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) (2021)
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR (2021)
Farah Chanchary, Anil Maheshwari, Michiel Smid
Window queries for intersecting objects, maximal points and approximations using coresets. Discret. Appl. Math. 305 (2021)
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) (2020)
Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid
Covering Points with Pairs of Concentric Disks. CCCG (2020)
Abrar Kazi, Michiel Smid
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. CCCG (2020)
Luís Fernando Schultz Xavier da Silveira, Michiel Smid
An Instance-Based Algorithm for Deciding the Bias of a Coin. CoRR (2020)
Abrar Kazi, Michiel Smid
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. CoRR (2020)