Homepage
- Algebraic approach to graph problems
- Graph algorithms in general, both static and dynamic
- Efficient data structures
Publications in the MPI database
- Mucha, M. and Sankowski, P.: Maximum Matchings in Planar Graphs via Gaussian Elimination . ESA 2004: 532-543 (pdf)
- Mucha, M. and Sankowski, P.: Maximum Matchings via Gaussian Elimination . FOCS 2004: 248-255 (pdf)
- October 2000 - June 2005:
Ph. D. student in Computer Science at the Warsaw University, Poland
Title of PhD Thesis: (supervisor: Dr. Hab. Krzysztof Diks) (pdf, ps)
- October 1995 - June 2001:
Studies in Mathematics at the Warsaw University
Title of Master's Thesis (Diplomarbeit): Operadic construction of Steenrod Algebra (supervisor: Dr. Agnieszka Bojanowska)
- October 1995 - June 2000:
Studies in Computer Science at the Warsaw University
Title of Master's Thesis (Diplomarbeit): Analysis and implementation of a matching algorithm of L.Lovasz (supervisor: Prof. Dr. Wojciech Rytter)
Hobbies
- The game of Go (I am a polish 5 kyu)
- Yoga