Henry L. Fleischmann

Orcid: 0000-0002-6093-3393

Affiliations:
  • University of Michigan, Department of Mathematics, Ann Arbor, MI, USA


According to our database1, Henry L. Fleischmann authored at least 13 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Reviving Thorup's Shortcut Conjecture.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
Faster Weak Expander Decompositions and Approximate Max Flow.
CoRR, November, 2025

Improved Directed Expander Decompositions.
CoRR, July, 2025

On Approximability of Steiner Tree in ℓ<sub>p</sub>-metrics.
TheoretiCS, 2025

On Steiner Trees of the regular simplex.
J. Comput. Geom., 2025

Inapproximability of Maximum Diameter Clustering for Few Clusters.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Beyond Symmetry in Repeated Games with Restarts.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Fast Algorithms for Graph Arboricity and Related Problems.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024
On Approximability of Steiner Tree in <i>ℓ<sub>p</sub></i>-metrics.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Spanning Adjacency Oracles in Sublinear Time.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Distinct Angle Problems and Variants.
Discret. Comput. Geom., December, 2023

Optimal point sets determining few distinct angles.
Australas. J Comb., October, 2023

Distinct angles in general position.
Discret. Math., April, 2023


  Loading...