Yiming Zhao

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees	2021	Haitao Wang Yiming Zhao
+ PDF Chat	Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees	2021	Haitao Wang Yiming Zhao
+	Reverse Shortest Path Problem for Unit-Disk Graphs	2021	Haitao Wang Yiming Zhao
+ PDF Chat	Reverse Shortest Path Problem for Unit-Disk Graphs	2021	Haitao Wang Yiming Zhao
+ PDF Chat	A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space	2020	Haitao Wang Yiming Zhao
+	A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space	2020	Haitao Wang Yiming Zhao
+	Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees	2020	Haitao Wang Yiming Zhao

Common Coauthors

Coauthor	Papers Together
Haitao Wang	3
Haitao Wang	2
Haitao Wang	1
Haitao Wang	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	An improved algorithm for diameter-optimally augmenting paths in a metric space	2018	Haitao Wang	5
+ PDF Chat	Augmenting Graphs to Minimize the Diameter	2014	Fabrizio Frati Serge Gaspers Joachim Gudmundsson Luke Mathieson	4
+	Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees	2016	Ulrike Große Joachim Gudmundsson Christian Knauer Michiel Smid Fabian Stehn	4
+ PDF Chat	A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space	2019	Christopher Johnson Haitao Wang	4
+ PDF Chat	Faster All-Pairs Shortest Paths via Circuit Complexity	2018	Ryan Williams	3
+	Decreasing the diameter of bounded degree graphs	2000	Noga Alon András Gyárfás Miklós Ruszinkó	3
+ PDF Chat	Decreasing the diameter of bounded degree graphs	2000	Noga Alon Andr�s Gy�rf�s Mikl�s Ruszink�	2
+	Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems	1983	Nimrod Megiddo	2
+ PDF Chat	Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications	2005	Jie Gao Li Zhang	2
+	Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees.	2018	Davide Bilò	2
+ PDF Chat	Almost optimal algorithms for diameter-optimally augmenting trees	2022	Davide Bilò	2
+	Shortest paths in intersection graphs of unit disks	2014	Sergio Cabello Miha Jejčič	2
+ PDF Chat	Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs	2020	Haitao Wang Jie Xue	2
+	A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space	2020	Haitao Wang Yiming Zhao	2
+	On an instance of the inverse shortest paths problem	1992	D. Burton Philippe L. Toint	2
+	Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications	2017	Haim Kaplan Wolfgang Mulzer Liam Roditty Paul Seiferth Micha Sharir	1
+ PDF Chat	A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs	2018	Mark de Berg Hans L. Bodlaender Sándor Kisfaludi-Bak Dániel Marx Tom C. van der Zanden	1
+ PDF Chat	A linear-time algorithm for radius-optimally augmenting paths in a metric space	2021	Christopher Johnson Haitao Wang	1
+ PDF Chat	Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees	2021	Haitao Wang Yiming Zhao	1