Skip to main content
Princeton Engineering
Magnifying Glass
Princeton Computer Science
CS GUIDE

Main navigation

  • Academics
    • Undergraduate Program
    • Graduate Program
    • Courses
  • Research
    • Research Areas
    • Technical Reports
    • Computing Facilities
  • People
    • Faculty
    • Researchers
    • Technical Staff
    • Administrative Staff
    • Graduate Students
    • Undergraduate Students
    • Graduate Alumni
  • News & Events
    • Events
    • News
  • Diversity & Outreach
    • Climate and Inclusion Committee
    • REU on AI and Machine Learning
    • Resources for students
    • Outreach initiatives
    • Resources for faculty and staff

Reports for Author "Orlin, James B."

  • TR-338-91 - Improved Algorithms for Bipartite Network Flow (1991-05-00)
    Ahuja, Ravindra K. / Orlin, James B. / Stein, Clifford / Tarjan, Robert E.
  • TR-118-87 - Improved Time Bounds for the Maximum Flow Problem (1987-09-00)
    Ahuja, Ravindra K. / Orlin, James B. / Tarjan, Robert E.
  • TR-154-88 - Faster Algorithms for the Shortest Path Problem (1988-03-00)
    Ahuja, Ravindra K. / Mehlhorn, Kurt / Orlin, James B. / Tarjan, Robert E.
  • TR-164-88 - Finding Minimum-Cost Flows by Double Scaling (1988-06-00)
    Ahuja, Ravindra K. / Orlin, James B. / Tarjan, Robert E. / Goldberg, Andrew V.
Princeton Shield Princeton University
Department of Computer Science
Visit Us
35 Olden Street
Princeton, NJ 08544
Contact Us
Jobs
Princeton Engineering
© 2025 The Trustees of Princeton University | Privacy | Accessibility
Connect with us
Facebook
X.com
LinkedIn
YouTube