The prize for the best research article of the Workshop on Algorithms in Bioinformatics conference (WABI) was awarded to the research conducted in the Graph Algorithms team led by Associate Professor ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

Estimating the number of triangles in a graph is a fundamental problem and has found applications in many fields. This ...

Algorithms are the fundamental procedures that guide computers in solving problems, from simple calculations to complex data analysis. At their core, an algorithm is a set of step-by-step instructions ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

A group of computer gamers are making habit of outshining scientists at their own game. Most of them have no scientific background, but they have a track record of cracking tough scientific puzzles, ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...