Marcin Pilipczuk's research interests lie mostly in algorithmics, especially fixed parameter tractability and exact computations of NP-hard problems. Sometimes he also studies pure graph theory and approximation algorithms.