Alex Crane

According to our database, Alex Crane authored at least 9 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination.

Matthias Bentert, Alex Crane, Pål Grønås Drange, Yosuke Mizutani, Blair D. Sullivan

CoRR, June, 2025

Equalizing Closeness Centralities via Edge Additions.

Alex Crane, Sorelle A. Friedler, Mihir Patel, Blair D. Sullivan

CoRR, May, 2025

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges.

Alex Crane, Thomas Stanley, Blair D. Sullivan, Nate Veldt

CoRR, February, 2025

2024

Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help?

Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani, Felix Reidl, Blair D. Sullivan

CoRR, 2024

Fast algorithms to improve fair information access in networks.

Dennis Robert Windham, Caroline J. Wendt, Alex Crane, Sorelle A. Friedler, Blair D. Sullivan, Aaron Clauset

CoRR, 2024

Optimizing Information Access in Networks via Edge Augmentation.

Aditya Bhaskara, Alex Crane, Md. Mumtahin Habib Ullah Mazumder, Blair D. Sullivan, Prasanth Yalamanchili

CoRR, 2024

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning.

Yosuke Mizutani, Daniel Coimbra Salomao, Alex Crane, Matthias Bentert, Pål Grønås Drange, Felix Reidl, Alan Kuntz, Blair D. Sullivan

CoRR, 2024

Overlapping and Robust Edge-Colored Clustering in Hypergraphs.

Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt

Proceedings of the 17th ACM International Conference on Web Search and Data Mining, 2024

Correlation Clustering with Vertex Splitting.

Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024