We study two “above guarantee” versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Longest Detour, ...

We introduce the rendezvous game with adversaries. In this game, two players, Facilitator and Divider, play against each other on a graph. Facilitator has two agents and Divider has a team of k agents located in some ...

We revisit a graph width parameter that we dub bipartite treewidth, along with its associated graph decomposition that we call bipartite tree decomposition. Bipartite treewidth can be seen as a common generalization of ...

k-means and k-median clustering are powerful unsupervised machine learning techniques. However, due to complicated dependencies on all the features, it is challenging to interpret the resulting cluster assignments. Moshkovitz, ...

The viability of Virtual Reality (VR) is being explored in an increasing number of fields outside its primary use in entertainment. A notable example is VR therapy, where VR-based alternatives to exposure therapy and ...

Almost perfect nonlinear (APN) functions are important in fields such as algebra, combinatorics, cryptography, etc. Finding new APN functions is of special importance in cryptography. This is because when used in modern ...

The actor model provides a higher level of abstraction for writing concurrent and distributed systems. It alleviates the developer from having to deal with explicit locking and thread management, making it easier to implement ...

Robots are complicated machines. Today we have a lot of different types of robots, each with different types of sensors and actuators which have their own practical (and impractical) applications. Utilizing the benefits ...

With the emergence of Virtual Reality (VR) and recent advancements on both the hardware and software side, VR is now available to the masses and a plethora of new experiences can be made and explored by people and researchers. ...