The main premise of the project BOBR
that we are going to start next year
is to use decomposition methods 
for solving hard problems in networks.
Let’s take some examples from real life,
e.g. the Facebook graph – people with acquaintances 
as connections between them
or the roadmap of Poland 
where we have cities and roads between them.
In such networks, we should be able to routinely solve 
hard computational problems
such as detection of small communities in Facebook
or placing hospitals on the map of Poland.
These problems are hard,
and designing efficient algorithms for solving them 
is a very non-trivial task.
The main idea behind the project BOBR
is to use structural properties of these networks
to analyse them from the mathematical point of view
to be able to find quick solutions 
to the problems that we are interested in.
This sounds very practical, however, 
the project is purely theoretical.
What interests us
is the mathematical connection between 
– on one side – structural measures of a graph,
decomposition properties that we can analyse 
from the mathematical point of view,
and on the other side, 
a possibility of designing quick
and efficient algorithms for solving them.
The interplay of these two things 
is the object of our study.
