Michiel Smid

Carleton University — Canada

Computer Science · Physical Sciences

29h-index3.5kcitations325works0.12yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(243), Data Management and Algorithms(95), Advanced Graph Theory Research(81), Complexity and Algorithms in Graphs(42), Advanced Numerical Analysis Techniques(34)

Publications325 total

An Improved Bound for Plane Covering Paths
arXiv (Cornell University)·2025Open Access
On Separating Path and Tree Systems in Graphs
Discrete Mathematics & Theoretical Computer Science·2025· 1 citedOpen Access
Polychromatic Coloring of Tuples in Hypergraphs
arXiv (Cornell University)·2025Open Access
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
arXiv (Cornell University)·2025Open Access
Computing Oriented Spanners and Their Dilation
arXiv (Cornell University)·2024Open Access
Euclidean Maximum Matchings in the Plane—Local to Global
Algorithmica·2024
Euclidean Maximum Matchings in the Plane---Local to Global
arXiv (Cornell University)·2024Open Access
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
arXiv (Cornell University)·2024Open Access
On Separating Path and Tree Systems in Graphs
arXiv (Cornell University)·2023· 1 citedOpen Access
On the Spanning and Routing Ratio of the Directed Theta-Four Graph
Discrete & Computational Geometry·2023· 2 cited
Improved Routing on the Delaunay Triangulation
Discrete & Computational Geometry·2023· 8 cited
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications·2022· 1 citedOpen Access
Shortest Beer Path Queries in Outerplanar Graphs
Algorithmica·2022· 1 citedOpen Access
An instance-based algorithm for deciding the bias of a coin
Discrete Mathematics Algorithms and Applications·2022
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points
arXiv (Cornell University)·2021Open Access
Exact and Approximation Algorithms for Many-To-Many Point Matching in\n the Plane
arXiv (Cornell University)·2021· 1 citedOpen Access
Tight Bounds on the Clique Chromatic Number
The Electronic Journal of Combinatorics·2021· 2 citedOpen Access
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
Discrete & Computational Geometry·2021· 2 cited
Closest-pair queries and minimum-weight queries are equivalent for squares
Computational Geometry·2021Open Access
Window queries for intersecting objects, maximal points and approximations using coresets
Discrete Applied Mathematics·2021
page 1 of 17Next →

Frequent Co-authors

Joachim Gudmundsson(12), Prosenjit Bose(9), Giri Narasimhan(8), Ravi Janardan(8), Anil Maheshwari(7), Prosenjit Gupta(7), Pat Morin(4), Christos Levcopoulos(4), Sunil Arya(3), Gautam Das(3), Jayanth Majhi(3), Danny Z. Chen(3), David M. Mount(2), Jason Morrison(2), Srinivasa R. Arikati(2), L. Paul Chew(2), Christos Zaroliagis(2), Ahmad Biniaz(2), Boris Aronov(2), Jörg Schwerdt(2)