Greg Bodwin - RankMe

89 papers A* 25A 8B 3Journal 51Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Simple Length-Constrained Expander Decompositions. SOSA Greg Bodwin, Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan
2025	A*	`conf`	A Lower Bound for Light Spanners in General Graphs. SODA Greg Bodwin, Jeremy Flics
2025	J	`jnl`	An Alternate Proof of Near-Optimal Light Spanners. TheoretiCS Greg Bodwin
2025	J	`jnl`	Greedy Algorithms for Shortcut Sets and Hopsets. CoRR Ben Bals, Joakim Blikstad, Greg Bodwin, Daniel Dadush, Sebastian Forster, Yasamin Nazari
2025	A*	`conf`	Improved Online Reachability Preservers. SODA Greg Bodwin, Tuong Le
2025	A*	`conf`	Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths. SODA Greg Bodwin, Lily Wang
2025	A*	`conf`	Light Edge Fault Tolerant Graph Spanners. ICALP Greg Bodwin, Michael Dinitz, Ama Koranteng, Lily Wang
2025	J	`jnl`	Light Edge Fault Tolerant Graph Spanners. CoRR Greg Bodwin, Michael Dinitz, Ama Koranteng, Lily Wang
2025	J	`jnl`	Multiplicative Spanners in Minor-Free Graphs. CoRR Greg Bodwin, Gary Hoppenworth, Zihan Tan
2025	J	`jnl`	Notes on the Linear Algebraic View of Regularity Lemmas. CoRR Greg Bodwin, Tuong Le
2025	J	`jnl`	Simple Length-Constrained Expander Decompositions. CoRR Greg Bodwin, Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan
2024	J	`jnl`	A Lower Bound for Light Spanners in General Graphs. CoRR Greg Bodwin, Jeremy Flics
2024	A*	`conf`	Additive Spanner Lower Bounds with Optimal Inner Graph Structure. ICALP Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
2024	J	`jnl`	Additive Spanner Lower Bounds with Optimal Inner Graph Structure. CoRR Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
2024	—	`conf`	An Alternate Proof of Near-Optimal Light Spanners. SOSA Greg Bodwin
2024	A	`conf`	Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? ITCS Aaron Bernstein, Greg Bodwin, Nicole Wein
2024	A*	`conf`	Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. SODA Greg Bodwin, Bernhard Haeupler, Merav Parter
2024	J	`jnl`	Improved Online Reachability Preservers. CoRR Greg Bodwin, Tuong Le
2024	J	`jnl`	Reachability Preservers: New Extremal Bounds and Approximation Algorithms. SIAM J. Comput. Amir Abboud, Greg Bodwin
2024	A	`conf`	Spanning Adjacency Oracles in Sublinear Time. ITCS Greg Bodwin, Henry L. Fleischmann
2024	A*	`conf`	The Discrepancy of Shortest Paths. ICALP Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang
2024	J	`jnl`	The Discrepancy of Shortest Paths. CoRR Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang
2023	J	`jnl`	An Alternate Proof of Near-Optimal Light Spanners. CoRR Greg Bodwin
2023	J	`jnl`	Are there graphs whose shortest path structure requires large edge weights? CoRR Aaron Bernstein, Greg Bodwin, Nicole Wein
2023	A*	`conf`	Bridge Girth: A Unifying Notion in Network Design. FOCS Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi
2023	A	`conf`	Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free. ITCS Greg Bodwin, Michael Dinitz, Yasamin Nazari
2023	J	`jnl`	Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. CoRR Greg Bodwin, Bernhard Haeupler, Merav Parter
2023	A*	`conf`	Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier. FOCS Greg Bodwin, Gary Hoppenworth
2023	J	`jnl`	Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier. CoRR Greg Bodwin, Gary Hoppenworth
2023	J	`jnl`	Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths. CoRR Greg Bodwin, Lily Wang
2023	A	`conf`	Opponent Indifference in Rating Systems: A Theoretical Case for Sonas. ITCS Greg Bodwin, Forest Zhang
2023	J	`jnl`	Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. J. ACM Greg Bodwin, Merav Parter
2023	J	`jnl`	Spanning Adjacency Oracles in Sublinear Time. CoRR Greg Bodwin, Henry L. Fleischmann
2022	J	`jnl`	A note on distance-preserving graph sparsification. Inf. Process. Lett. Greg Bodwin
2022	J	`jnl`	A unified view of graph regularity via matrix decompositions. Random Struct. Algorithms Greg Bodwin, Santosh S. Vempala
2022	J	`jnl`	Bridge Girth: A Unifying Notion in Network Design. CoRR Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi
2022	J	`jnl`	Epic Fail: Emulators can tolerate polynomially many edge faults for free. CoRR Greg Bodwin, Michael Dinitz, Yasamin Nazari
2022	A*	`conf`	New Additive Spanner Lower Bounds by an Unlayered Obstacle Product. FOCS Greg Bodwin, Gary Hoppenworth
2022	J	`jnl`	New Additive Spanner Lower Bounds by an Unlayered Obstacle Product. CoRR Greg Bodwin, Gary Hoppenworth
2022	J	`jnl`	Opponent Indifference in Rating Systems: A Theoretical Case for Sonas. CoRR Greg Bodwin, Forest Zhang
2022	A*	`conf`	Partially Optimal Edge Fault-Tolerant Spanners. SODA Greg Bodwin, Michael Dinitz, Caleb Robelle
2022	A	`conf`	Vertex Fault-Tolerant Emulators. ITCS Greg Bodwin, Michael Dinitz, Yasamin Nazari
2021	J	`jnl`	Better Distance Preservers and Additive Spanners. ACM Trans. Algorithms Greg Bodwin, Virginia Vassilevska Williams
2021	B	`conf`	Multi-Level Weighted Additive Spanners. SEA Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence
2021	J	`jnl`	Multi-level Weighted Additive Spanners. CoRR Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence
2021	J	`jnl`	New Results on Linear Size Distance Preservers. SIAM J. Comput. Greg Bodwin
2021	B	`conf`	On Additive Spanners in Weighted Graphs with Local Error. WG Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence
2021	A*	`conf`	Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. SODA Greg Bodwin, Michael Dinitz, Caleb Robelle
2021	J	`jnl`	Partially Optimal Edge Fault-Tolerant Spanners. CoRR Greg Bodwin, Michael Dinitz, Caleb Robelle
2021	A*	`conf`	Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. PODC Greg Bodwin, Merav Parter
2021	J	`jnl`	Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. CoRR Greg Bodwin, Merav Parter
2021	J	`jnl`	Vertex Fault-Tolerant Emulators. CoRR Greg Bodwin, Michael Dinitz, Yasamin Nazari
2021	J	`jnl`	Weighted Sparse and Lightweight Spanners with Local Additive Error. CoRR Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence
2020	J	`jnl`	Graph spanners: A tutorial review. Comput. Sci. Rev. Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Richard Spence
2020	A*	`conf`	New Fault Tolerant Subset Preservers. ICALP Greg Bodwin, Keerti Choudhary, Merav Parter, Noa Shahar
2020	J	`jnl`	Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. CoRR Greg Bodwin, Michael Dinitz, Caleb Robelle
2020	J	`jnl`	Some General Structure for Extremal Sparsification Problems. CoRR Greg Bodwin
2020	A	`conf`	Strategy-Stealing Is Non-Constructive. ITCS Greg Bodwin, Ofer Grossman
2020	B	`conf`	Weighted Additive Spanners. WG Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence
2020	J	`jnl`	Weighted Additive Spanners. CoRR Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence
2019	A*	`conf`	A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners. PODC Greg Bodwin, Shyamal Patel
2019	J	`jnl`	Graph Spanners: A Tutorial Review. CoRR Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Richard Spence
2019	J	`jnl`	Matrix Decompositions and Sparse Graph Regularity. CoRR Greg Bodwin, Santosh S. Vempala
2019	A*	`conf`	On the Structure of Unique Shortest Paths in Graphs. SODA Greg Bodwin
2019	J	`jnl`	Strategy-Stealing is Non-Constructive. CoRR Greg Bodwin, Ofer Grossman
2019	J	`jnl`	Strategy-Stealing is Non-Constructive. Electron. Colloquium Comput. Complex. Greg Bodwin, Ofer Grossman
2018	J	`jnl`	A Hierarchy of Lower Bounds for Sublinear Additive Spanners. SIAM J. Comput. Amir Abboud, Greg Bodwin, Seth Pettie
2018	J	`jnl`	A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners. CoRR Greg Bodwin, Shyamal Patel
2018	J	`jnl`	On the Structure of Unique Shortest Paths in Graphs. CoRR Greg Bodwin
2018	A*	`conf`	Optimal Vertex Fault Tolerant Spanners (for fixed stretch). SODA Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams
2018	A*	`conf`	Reachability Preservers: New Extremal Bounds and Approximation Algorithms. SODA Amir Abboud, Greg Bodwin
2017	A*	`conf`	A Hierarchy of Lower Bounds for Sublinear Additive Spanners. SODA Amir Abboud, Greg Bodwin, Seth Pettie
2017	A*	`conf`	Linear Size Distance Preservers. SODA Greg Bodwin
2017	J	`jnl`	Optimal Vertex Fault Tolerant Spanners (for fixed stretch). CoRR Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams
2017	A*	`conf`	Preserving Distances in Very Faulty Graphs. ICALP Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams
2017	J	`jnl`	Preserving Distances in Very Faulty Graphs. CoRR Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams
2017	J	`jnl`	Reachability Preservers: New Extremal Bounds and Approximation Algorithms. CoRR Amir Abboud, Greg Bodwin
2017	A*	`conf`	Testing Core Membership in Public Goods Economies. ICALP Greg Bodwin
2017	J	`jnl`	Testing Core Membership in Public Goods Economies. CoRR Greg Bodwin
2017	J	`jnl`	The 4/3 Additive Spanner Exponent Is Tight. J. ACM Amir Abboud, Greg Bodwin
2016	J	`jnl`	A Hierarchy of Lower Bounds for Sublinear Additive Spanners. CoRR Amir Abboud, Greg Bodwin, Seth Pettie
2016	A*	`conf`	Better Distance Preservers and Additive Spanners. SODA Greg Bodwin, Virginia Vassilevska Williams
2016	A*	`conf`	Error Amplification for Pairwise Spanner Lower Bounds. SODA Amir Abboud, Greg Bodwin
2016	A	`conf`	Fully Dynamic Spanners with Worst-Case Update Time. ESA Greg Bodwin, Sebastian Krinninger
2016	J	`jnl`	Fully Dynamic Spanners with Worst-Case Update Time. CoRR Greg Bodwin, Sebastian Krinninger
2016	A	`conf`	Graph Reconstruction with a Betweenness Oracle. STACS Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel
2016	J	`jnl`	Linear Size Distance Preservers. CoRR Greg Bodwin
2016	A*	`conf`	The 4/3 additive spanner exponent is tight. STOC Amir Abboud, Greg Bodwin
2015	J	`jnl`	The 4/3 Additive Spanner Exponent is Tight. CoRR Amir Abboud, Greg Bodwin