MIT Open Access Articles: Recent submissions

Now showing items 43-45 of 55248

    • Minimum Plane Bichromatic Spanning Trees 

      Akitaya, Hugo; Biniaz, Ahmad; Demaine, Erik; Kleist, Linda; Stock, Frederick; e.a.
      For a set of red and blue points in the plane, a minimum bichromatic spanning tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endpoint. A MinBST can be computed in O(n log ...

    • Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time 

      Dong, Sally; Gao, Yu; Goranci, Gramoz; Lee, Yin Tat; Sachdeva, Sushant; e.a. (ACM, 2025-07-26)
      We present a nearly-linear time algorithm for finding a minimum-cost flow in planar graphs with polynomially bounded integer costs and capacities. The previous fastest algorithm for this problem is based on interior point ...

    • Enhancing Electric Vehicle Security and Privacy through Decentralized Identity Management 

      Aydeger, Abdullah; Zeydan, Engin; Mangues-Bafalluy, Josep; Arslan, Suayb; Turk, Yekta (ACM, 2025-09-12)
      In the next decade, electric vehicles (EVs) are expected to contribute to reducing climate change and transforming road mobility significantly. However, the security and privacy of EV charging systems present considerable ...