Research interest
Discrete
mathematics and theoretical computer science: design and analysis of
discrete algorithms, graph theory, operational research, computational
complexity, combinatorial games. The particular problems I am intrested
in are:
- graph searching models (node and edge search, their variants and generalizations):
- search time in different settings,
- non-classical optimization criteria,
- connections to graph parameters,
- connected graph searching,
- (distributed) graph exploration without complete knowledge,
- searching in partial orders,
- chromatic graph theory,
- selected models of task scheduling:
- scheduling with precedence constraints,
- scheduling with release dates and deadlines,
- the complexity of combinatorial games.
Education
- PhD. Thesis: "Parallel
Scheduling by Graph Ranking", Gdańsk University of Technology,
Faculty of
Electronics, Telecommunications and Informatics, 2006
- Engineer degree (Computer Science), Gdańsk University
of Technology, ETI Faculty, 2004
- M.Sc. Thesis (Mathematics): "Ranking of Graphs and
Its Applications", University
of Gdańsk, The
Faculty of Mathematics, Physics and Informatics, 2003
Honors
- Scholarship for outstanding young researchers from Ministry of Science and Higher Education, 2011.
- Scholarship START
from the Foundation for
Polish Science, 2008, 2009
- Witold Lipski prize for Young Researchers in Computer Science, 2008
- Scientific Awards, Gdańsk University of Technology,
2007, 2009
- The prize of the Gdańsk
Scientific Society and the Mayor of the City of
Gdańsk, 2006
- Scientific Award, Gdańsk University of Technology,
2005
- The first prize in the contest for the best M.Sc.
thesis in Computer Science organized by Polish
Information Processing Society, 2003
- Awards from Rector of University of Gdańsk, received
as a student in academic years 1998/99, 1999/2000 and 2001/02
Hobbies
|
