Michiel Smid

45 papers A* 2A 3B 6Journal 32Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Linear-Time (1+ϵ)-Approximation Algorithms for Two-Line-Center Problems.
CoRR
Chaeyoon Chung, Anil Maheshwari, Michiel Smid
2025 A conf
An Improved Bound for Plane Covering Paths.
ESA
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous
2025 J jnl
An Improved Bound for Plane Covering Paths.
CoRR
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous
2025 A* conf
Computing Oriented Spanners and Their Dilation.
SoCG
Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, Sampson Wong
2025 J jnl
Deciding if a DAG is Interesting is Hard.
CoRR
Jean-Lou De Carufel, Anil Maheshwari, Saeed Odak, Bodhayan Roy, Michiel Smid, Marc Vicuna
2025 J jnl
Euclidean Maximum Matchings in the Plane - Local to Global.
Algorithmica
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2025 J jnl
Metric and geometric spanners that are resilient to degree-bounded edge faults.
J. Comput. Geom.
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid
2025 J jnl
Noncrossing Longest Paths and Cycles.
Graphs Comb.
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2025 J jnl
On Separating Path and Tree Systems in Graphs.
Discret. Math. Theor. Comput. Sci.
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
2025 A* conf
Polychromatic Coloring of Tuples in Hypergraphs.
SoCG
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, Milos Stojakovic
2025 J jnl
Polychromatic Coloring of Tuples in Hypergraphs.
CoRR
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, Milos Stojakovic
2025 B conf
Tight Bounds on the Number of Closest Pairs in Vertical Slabs.
WADS
Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth
2025 J jnl
Tight Bounds on the Number of Closest Pairs in Vertical Slabs.
CoRR
Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth
2024 J jnl
Computing Oriented Spanners and their Dilation.
CoRR
Kevin Buchin, Antonia Kalb, Anil Maheshwari, Saeed Odak, Michiel Smid, Carolin Rehs, Sampson Wong
2024 J jnl
Euclidean Maximum Matchings in the Plane - Local to Global.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2024 A conf
Geometric Covering via Extraction Theorem.
ITCS
Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan
2024 J jnl
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults.
CoRR
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid
2024 A conf
Noncrossing Longest Paths and Cycles.
GD
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024 J jnl
Noncrossing Longest Paths and Cycles.
CoRR
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024 J jnl
On the Spanning and Routing Ratio of the Directed Theta-Four Graph.
Discret. Comput. Geom.
Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel Smid
2024 B conf
On the Spanning and Routing Ratios of the Yao-Four Graph.
ISAAC
Prosenjit Bose, Darryl Hill, Michiel Smid, Tyler Tuttle
2023 J jnl
An instance-based algorithm for deciding the bias of a coin.
Discret. Math. Algorithms Appl.
Luís Fernando Schultz Xavier da Silveira, Michiel Smid
2023 J jnl
Improved Routing on the Delaunay Triangulation.
Discret. Comput. Geom.
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid
2023 J jnl
On Separating Path and Tree Systems in Graphs.
CoRR
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
2023 J jnl
Shortest Beer Path Queries in Outerplanar Graphs.
Algorithmica
Joyce Bacic, Saeed Mehrabi, Michiel Smid
2023 J jnl
The Minimum Moving Spanning Tree Problem.
J. Graph Algorithms Appl.
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
2022 J jnl
Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points.
Comput. Geom. Topol.
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2022 J jnl
Closest-pair queries and minimum-weight queries are equivalent for squares.
Comput. Geom.
Abrar Kazi, Michiel Smid
2022 J jnl
Computing maximum independent set on outerstring graphs and their relatives.
Comput. Geom.
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid
2021 J jnl
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.
Discret. Comput. Geom.
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky
2021 J jnl
Approximating bottleneck spanning trees on partitioned tuples of points.
CoRR
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2021 B conf
Euclidean Maximum Matchings in the Plane - Local to Global.
WADS
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2021 B conf
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane.
ISAAC
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
2021 J jnl
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane.
CoRR
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
2021 J jnl
On the Minimum Consistent Subset Problem.
Algorithmica
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid
2021 B conf
Shortest Beer Path Queries in Outerplanar Graphs.
ISAAC
Joyce Bacic, Saeed Mehrabi, Michiel Smid
2021 J jnl
Shortest Beer Path Queries in Outerplanar Graphs.
CoRR
Joyce Bacic, Saeed Mehrabi, Michiel Smid
2021 B conf
The Minimum Moving Spanning Tree Problem.
WADS
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
2021 J jnl
Tight Bounds on the Clique Chromatic Number.
Electron. J. Comb.
Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid
2021 J jnl
Window queries for intersecting objects, maximal points and approximations using coresets.
Discret. Appl. Math.
Farah Chanchary, Anil Maheshwari, Michiel Smid
2020 J jnl
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics.
J. Comput. Geom.
Michiel Smid, Anil Maheshwari, Wolfgang Mulzer
2020 J jnl
An Instance-Based Algorithm for Deciding the Bias of a Coin.
CoRR
Luís Fernando Schultz Xavier da Silveira, Michiel Smid
2020 — conf
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares.
CCCG
Abrar Kazi, Michiel Smid
2020 J jnl
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares.
CoRR
Abrar Kazi, Michiel Smid
2020 — conf
Covering Points with Pairs of Concentric Disks.
CCCG
Anil Maheshwari, Saeed Mehrabi, Sasanka Roy, Michiel Smid