You are here:
3170 Phone: +49 (421) 218-63752 vigny[at]uni-bremen[dot]de © MarioGrobler M. Sc. MarioGrobler Office: MZH 3180 Phone: +49 (421) 218-63753 grobler[at]uni-bremen[dot]de © Nikolas Mählmann M. Sc. Nikolas Mählmann
Section: FB3
Summer 2021 Theoretische Informatik 2 (03-BA-601.02, 03-IBGT-THI2, Sebastian Siebertz und MarioGrobler) Vorlesung ECTS: 6 Die Vorlesungen finden online asynchron statt. Übungstermine: wöchentlich Di 10:00 [...] enumerating sets of solutions. Seminar Parameterized Complexity (Sebastian Siebertz, Alexandre Vigny, MarioGrobler, Nikolas Mählmann) Seminar ECTS: 3 Termine: wöchentlich Di 10:00 - 12:00 Seminar online Sprache:
Summer 2020 Theoretische Informatik 2 (03-BA-601.02, 03-IBGT-THI1, Sebastian Siebertz und MarioGrobler) Vorlesung ECTS: 6 Die Vorlesungen finden online asynchron statt. Übungstermine: wöchentlich Di 10:00
further material on twin-width much more easily and think about the new open questions. 5.11.2020, MarioGrobler (University of Bremen) Parikh automata on finite and and infinite words Parikh automata on finite
Automata, Invited tutorial, 15.9.2019. Current PhD students and Postdocs Dr. Alexandre Vigny MarioGrobler Nikolas Mählmann Service Organization of Dagstuhl seminar Sparsity in Algorithms, Combinatorics
proper minor-closed graph classes. J. Comb. Theory, Ser. B 151 : 111-147 (2021) Jona Dirks , MarioGrobler , Roman Rabinovich , Yannik Schnaubelt , Sebastian Siebertz , Maximilian Sonneborn : PACE Solver
degeneracy, bounded expansion, and nowhere dense. These results where obtained in collaboration with MarioGrobler, Yiting Jiang, Patrice Ossona de Mendez, and Sebastian Siebertz. Nikolas Mählmann Nikolas Mählmann
problem as well as directed Steiner problems. November 23, 2021 MarioGrobler (University of Bremen) Discrepancy and Sparsity MarioGrobler (University of Bremen) November 23, 2021 at 10:15AM in room MZH [...] terminates in an egalitarian (i.e. two-sided) rank-maximal stable matching. November 5, 2020, MarioGrobler (University of Bremen) Parikh automata on finite and and infinite words Parikh automata on finite
