A k-attractor is a combinatorial object unifying dictionary-based
compre...
The graph exploration problem asks a searcher to explore an unknown grap...
Online computation is a concept to model uncertainty where not all
infor...
In the area of graph drawing, the One-Sided Crossing Minimization Proble...
We introduce and study the complexity of Path Packing. Given a graph G a...
Moving an autonomous agent through an unknown environment is one of the
...