Inhalt des Dokuments
| Address: | Technische Universität Berlin Fakultät IV Sekr. TEL 5-1 Ernst-Reuter-Platz 7 10587 Berlin | |
| Room: | TEL 509 | |
| Phone: | +49 30 314 241 66 | |
| E-Mail: | vincent.froese[at]tu-berlin.de | |
| Research Interests: | parameterized algorithmics and complexity data science graph problems | |
| Office hour | Tuesday 14:00 - 15:00 |
Conference Publications
2018
|
Markus Brill and Till Fluschnik and Vincent Froese and Brijnesh Jain and Rolf Niedermeier and David Schultz. Exact Mean Computation in Dynamic Time Warping Spaces. In Proceedings of the SIAM International Conference on Data Mining (SDM '18), pages 540–548. SIAM, 2018. |
Bibtex entry
Link to publication Link to original publication |
2017
|
Robert Bredereck and Vincent Froese and Marcel Koseler and Marcelo Garlet Millani and André Nichterlein and Rolf Niedermeier. A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. In Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC '16), pages 10:1–10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. |
Bibtex entry
Link to publication Link to original publication |
2016
|
René van Bevern and Vincent Froese and Christian Komusiewicz. Parameterizing edge modification problems above lower bounds. In Proceedings of the 11th International Computer Science Symposium in Russia (CSR '16), pages 57–72. Springer, 2016. |
Bibtex entry
Link to publication Link to original publication |
|
Vincent Froese and Iyad Kanj and André Nichterlein and Rolf Niedermeier. Finding Points in General Position. In Proceedings of the 28th Canadian Conference on Computational Geometry (CCCG '16), pages 7–14. 2016. |
Bibtex entry
Link to publication Link to original publication |
2015
|
Laurent Bulteau and Vincent Froese and Nimrod Talmon. Multi-Player Diffusion Games on Graph Classes. In Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC '15), pages 200–211. Springer, 2015. Full version available at http://arxiv.org/abs/1412.2544. |
Bibtex entry
Link to publication Link to original publication |
|
Laurent Bulteau and Stefan Fafianie and Vincent Froese and Rolf Niedermeier and Nimrod Talmon. The Complexity of Finding Effectors. In Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC '15), pages 224–235. Springer, 2015. Full version available at http://arxiv.org/abs/1411.7838. |
Bibtex entry
Link to publication Link to original publication |
2014
|
Robert Bredereck and Vincent Froese and Sepp Hartung and André Nichterlein and Rolf Niedermeier and Nimrod Talmon. The Complexity of Degree Anonymization by Vertex Addition. In Proceedings of the 10th International Conference on Algorithmic Aspects of Information and Management (AAIM '14), pages 44–55. Springer, 2014. |
Bibtex entry
Link to publication Link to original publication |
|
Laurent Bulteau and Vincent Froese and Sepp Hartung and Rolf Niedermeier. Co-Clustering Under the Maximum Norm. In Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC '14), pages 298–309. Springer, 2014. |
Bibtex entry
Link to publication Link to original publication |
|
René van Bevern and Robert Bredereck and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger. Network-Based Dissolution. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS '14), pages 69–80. Springer, 2014. |
Bibtex entry
Link to publication Link to original publication |
|
René van Bevern and Robert Bredereck and Laurent Bulteau and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger. Star Partitions of Perfect Graphs. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP '14), pages 174–185. Springer, 2014. |
Bibtex entry
Link to publication Link to original publication |
|
Vincent Froese and André Nichterlein and Rolf Niedermeier. Win-Win Kernelization for Degree Sequence Completion Problems. In Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '14), pages 194–205. Springer, 2014. |
Bibtex entry
Link to publication Link to original publication |
2013
|
Vincent Froese and René van Bevern and Rolf Niedermeier and Manuel Sorge. A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS '13), pages 445–456. Springer, 2013. |
Bibtex entry
Link to publication Link to original publication |
Journal Publications
2018
|
Robert Bredereck and Vincent Froese and Marcel Koseler and Marcelo Garlet Millani and André Nichterlein and Rolf Niedermeier. A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. Algorithmica, 2018. Accepted for publication. |
Bibtex entry
Link to publication |
|
René van Bevern and Vincent Froese and Christian Komusiewicz. Parameterizing edge modification problems above lower bounds. Theory of Computing Systems, 62(3):739–770, 2018. |
Bibtex entry
Link to publication Link to original publication |
|
Anne-Sophie Himmel and Clemens Hoffmann and Pascal Kunz and Vincent Froese and Manuel Sorge. Computational Complexity Aspects of Point Visibility Graphs. Discrete Applied Mathematics, 2018. Available online. |
Bibtex entry
Link to publication Link to original publication |
2017
|
René van Bevern and Robert Bredereck and Laurent Bulteau and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger. Partitioning Perfect Graphs into Stars. Journal of Graph Theory, 85(2):297–335, 2017. |
Bibtex entry
Link to publication Link to original publication |
|
Laurent Bulteau and Stefan Fafianie and Vincent Froese and Rolf Niedermeier and Nimrod Talmon. The Complexity of Finding Effectors. Theory of Computing Systems, 60(2):253–279, 2017. |
Bibtex entry
Link to publication Link to original publication |
|
Vincent Froese and Iyad Kanj and André Nichterlein and Rolf Niedermeier. Finding Points in General Position. International Journal of Computational Geometry & Applications, 27(4):277–296, 2017. |
Bibtex entry
Link to publication Link to original publication |
2016
|
Laurent Bulteau and Vincent Froese and Konstantin Kutzkov and Rasmus Pagh. Triangle counting in dynamic graph streams. Algorithmica, 76(1):259–278, 2016. |
Bibtex entry
Link to publication Link to original publication |
|
Laurent Bulteau and Vincent Froese and Sepp Hartung and Rolf Niedermeier. Co-Clustering Under the Maximum Norm. Algorithms, 9(1):17, 2016. |
Bibtex entry
Link to publication Link to original publication |
|
Vincent Froese and René van Bevern and Rolf Niedermeier and Manuel Sorge. Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. Journal of Computer and System Sciences, 82(3):521–535, 2016. |
Bibtex entry
Link to publication Link to original publication |
|
Vincent Froese and André Nichterlein and Rolf Niedermeier. Win-Win Kernelization for Degree Sequence Completion Problems. Journal of Computer and System Sciences, 82(6):1100–1111, 2016. |
Bibtex entry
Link to publication Link to original publication |
|
Laurent Bulteau and Vincent Froese and Nimrod Talmon. Multi-Player Diffusion Games on Graph Classes. Internet Mathematics, 12(6):363–380, 2016. |
Bibtex entry
Link to publication Link to original publication |
2015
|
Robert Bredereck and Vincent Froese and Sepp Hartung and André Nichterlein and Rolf Niedermeier and Nimrod Talmon. The Complexity of Degree Anonymization by Vertex Addition. Theoretical Computer Science, 607(1):16–34, Elsevier, 2015. |
Bibtex entry
Link to publication Link to original publication |
|
René van Bevern and Robert Bredereck and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Gerhard J. Woeginger. Network-Based Vertex Dissolution. SIAM Journal on Discrete Mathematics, 29(2):888–914, 2015. |
Bibtex entry
Link to publication Link to original publication |