We announce one-year postdoc positions (with possible extensions) at the Institute of Informatics, University of Warsaw, Poland. The positions are supported by the ERC Starting Grant CUTACOMBS: \u201cCuts and decompositions: algorithms and combinatorial properties\u201d led by Marcin Pilipczuk and by the ERC Consolidator Grant TUgbOAT: \u201cTowards Unification of Algorithmic Tools\u201d led by Piotr Sankowski.<\/p>\n
The CUTACOMBS\u2019 focus is on structural graph theory and parameterized complexity. Example topics include: The TUgbOAT\u2019s focus is to work on algorithms for core algorithmic problems. The theoretical computer science group in Warsaw is strong and growing. Apart from the algorithms group specializing in parameterized and approximation algorithms (Marek Cygan, \u0141ukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Micha\u0142 Pilipczuk, Piotr Sankowski), we have also a leading research group in logic and automata (Miko\u0142aj Boja\u0144czyk, Bartosz Klin, S\u0142awomir Lasota).<\/p>\n We are looking for outstanding candidates with a Ph.D. (or soon to obtain a Ph.D.) in Computer Science or Mathematics who have already proven their high scientific potential in the area of algorithms or graph theory through publications in proceedings of highly ranked international conferences and\/or journals. Background in the specific areas of projects in question will be an advantage.<\/p>\n The gross annual salary is around 100,000PLN. For comparison, this translates to around twice the average salary in Poland. The position comes with a generous travel support and no teaching duties.<\/p>\n The application deadline is 10th September 2018. The starting date is flexible, but not earlier than 1st November 2018.<\/p>\n To apply, send a CV both to Marcin Pilipczuk (malcin@mimuw.edu.pl) and Piotr Sankowski (sank@mimuw.edu.pl). Please indicate your preference with regards to the project. Questions and informal inquiries are welcome.<\/p>\n","protected":false},"excerpt":{"rendered":" We announce one-year postdoc positions (with possible extensions) at the Institute of Informatics, University of Warsaw, Poland. The positions are supported by the ERC Starting Grant CUTACOMBS: \u201cCuts and decompositions: algorithms and combinatorial properties\u201d led by Marcin Pilipczuk and by … Continue reading
\n* structure of separations in directed graphs, with applications to parameterized algorithms;
\n* approximability of the disjoint paths problem in various settings;
\n* structure of hereditary graph classes, such as graph excluding a fixed graph as induced subgraph, with algorithmic and graph-theoretical applications.
\nMore information about the project can be found at http:\/\/cutacombs.mimuw.edu.pl\/<\/a>.<\/p>\n
\nExample topics include:
\n* faster algorithms for matchings and maximum flow problems;
\n* optimal online algorithms (when comparing to online opt);
\n* analyzing structure of real world networks and exploiting it algorithmically.<\/p>\n