Unless you worked for Ford’s plastics, paint and vinyls division in the 1980s, you probably don’t know the name Jim Moylan. But you might well know the idea that made this unknown engineer who ...

Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

Ford’s $19.5 billion write-off on its electric vehicle business is the latest example of foolhardy efforts to quickly phase out fossil fuels. Ford Motor’s stunning announcement that it’s taking a ...

ZeroNine Design unlocks more power for European Ranger Raptor V6 engines, because not all heroes wear capes. Despite the global nature of the automotive industry, certain models are still sold only in ...

The original version of this story appeared in Quanta Magazine. Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price.

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

As the song says, sometimes you don’t know what you’ve got ’til it’s gone. The current midsize Ford Ranger is an appealing pickup truck in its own right, but its size and emphasis on creature comforts ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.