M.Sc. Stefan Fafianie
| Büro | Universität Bonn Institut für Informatik I Raum II.65 Friedrich-Ebert-Allee 144 D-53113 Bonn | Telefon | +49 228 73-54221 |  |
| fafianie@cs.uni-bonn.de | ||||
| Sprechzeiten | Nach Vereinbarung | |||
Group
Research Interests
- Parameterized Complexity
- Kernelization
- Algorithm Engineering
Publications
Conference
- Stefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, Vuong Anh Quyen:
Preprocessing Under Uncertainty: Matroid Intersectionto appear in Proceedings of 41st MFCS - Stefan Fafianie, Stefan Kratsch, Vuong Anh Quyen:
Preprocessing Under Uncertaintyin Proceedings of 33rd STACS - Stefan Fafianie, Stefan Kratsch:
A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Timein Proceedings of 40th MFCS - Stefan Fafianie, Stefan Kratsch:
An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problemin Proceedings of 14th SEA - Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectorsin Proceedings of 12th TAMC - Stefan Fafianie, Stefan Kratsch:
Streaming Kernelizationin Proceedings of 39th MFCS - Stefan Fafianie, Hans. L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositionsin Proceedings of 8th IPEC
Journal
- Stefan Fafianie, Laurent Bulteau, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectorsin Theory of Computing Systems - Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositionsin Algorithmica, Volume 71, Issue 3
ArXiv
- Stefan Fafianie, Stefan Kratsch, Vuong Anh Quyen:
Preprocessing Under Uncertaintyon arXiv:1510.05503 - Stefan Fafianie, Stefan Kratsch:
A Shortcut to (Sun)Flowers: Kernels in Logarihtmic Space or Linear Timeon arXiv:1504.08235 - Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Compleixity of Finding Effectorson arXiv:1411.7838 - Stefan Fafianie, Stefan Kratsch:
Streaming Kernelizationon arXiv:1405.1356 - Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositionson arXiv:1305.7448
Attended Conferences and Workshops
- MFCS 2015, 40th International Symposium on Mathematical Foundations of Computer Science*
- SEA 2015, 14th International Symposium on Experimental Algorithms*
- Worker 2015, Workshop on Kernelization
- MFCS 2014, 39th International Symposium on Mathematical Foundations of Computer Science*
- 2014 Summer School on Parameterized Algorithms and Complexity
- IPEC 2013, 8th International Symposium on Parameterized and Exact Computation*
* gave a talk