direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Vincent Froese
Address:
Technische Universität Berlin
Fakultät IV
Sekr. TEL 5-1
Ernst-Reuter-Platz 7
10587 Berlin







Room:
TEL 509d
Phone:
+49 30 314 253 12
E-Mail:
vincent.froese[at]tu-berlin.de
Research Interests:
parameterized algorithmics and complexity
data science
graph problems
Office hour
contact via e-mail

Conference Publications

2022

Luca Kreisel and Niclas Boehmer and Vincent Froese and Rolf Niedermeier.
Equilibria in Schelling Games: Computational Hardness and Robustness.
In Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), 2022. Accepted for publication.
Bibtex entry Link to publication
Vincent Froese and Leon Kellerhals and Rolf Niedermeier.
Modification-Fair Cluster Editing.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. Accepted for publication.
Bibtex entry
Vincent Froese and Leon Kellerhals and Rolf Niedermeier.
Modification-Fair Cluster Editing.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. Accepted for publication.
Bibtex entry
Luca Kreisel and Niclas Boehmer and Vincent Froese and Rolf Niedermeier.
Equilibria in Schelling Games: Computational Hardness and Robustness.
In Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), 2022. Accepted for publication.
Bibtex entry Link to publication
Vincent Froese and Leon Kellerhals and Rolf Niedermeier.
Modification-Fair Cluster Editing.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. Accepted for publication.
Bibtex entry
Luca Kreisel and Niclas Boehmer and Vincent Froese and Rolf Niedermeier.
Equilibria in Schelling Games: Computational Hardness and Robustness.
In Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), 2022. Accepted for publication.
Bibtex entry Link to publication
Luca Kreisel and Niclas Boehmer and Vincent Froese and Rolf Niedermeier.
Equilibria in Schelling Games: Computational Hardness and Robustness.
In Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), 2022. Accepted for publication.
Bibtex entry Link to publication
Luca Kreisel and Niclas Boehmer and Vincent Froese and Rolf Niedermeier.
Equilibria in Schelling Games: Computational Hardness and Robustness.
In Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), 2022. Accepted for publication.
Bibtex entry Link to publication
Vincent Froese and Leon Kellerhals and Rolf Niedermeier.
Modification-Fair Cluster Editing.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. Accepted for publication.
Bibtex entry
Luca Kreisel and Niclas Boehmer and Vincent Froese and Rolf Niedermeier.
Equilibria in Schelling Games: Computational Hardness and Robustness.
In Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), 2022. Accepted for publication.
Bibtex entry Link to publication
Vincent Froese and Leon Kellerhals and Rolf Niedermeier.
Modification-Fair Cluster Editing.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. Accepted for publication.
Bibtex entry
Luca Kreisel and Niclas Boehmer and Vincent Froese and Rolf Niedermeier.
Equilibria in Schelling Games: Computational Hardness and Robustness.
In Proceedings of the 21th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), 2022. Accepted for publication.
Bibtex entry Link to publication
Vincent Froese and Leon Kellerhals and Rolf Niedermeier.
Modification-Fair Cluster Editing.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. Accepted for publication.
Bibtex entry
Vincent Froese and Leon Kellerhals and Rolf Niedermeier.
Modification-Fair Cluster Editing.
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. Accepted for publication.
Bibtex entry

2021

Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Binary Matrix Completion Under Diameter Constraints.
In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Binary Matrix Completion Under Diameter Constraints.
In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Binary Matrix Completion Under Diameter Constraints.
In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
Bibtex entry Link to publication
Link to original publication
Niclas Boehmer and Vincent Froese and Julia Henkel and Yvonne Lasars and Rolf Niedermeier and Malte Renken.
Two Influence Maximization Games on Graphs Made Temporal.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 45–51. ijcai.org, 2021.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Binary Matrix Completion Under Diameter Constraints.
In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
Bibtex entry Link to publication
Link to original publication
Niclas Boehmer and Vincent Froese and Julia Henkel and Yvonne Lasars and Rolf Niedermeier and Malte Renken.
Two Influence Maximization Games on Graphs Made Temporal.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 45–51. ijcai.org, 2021.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Binary Matrix Completion Under Diameter Constraints.
In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Binary Matrix Completion Under Diameter Constraints.
In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
Bibtex entry Link to publication
Link to original publication
Niclas Boehmer and Vincent Froese and Julia Henkel and Yvonne Lasars and Rolf Niedermeier and Malte Renken.
Two Influence Maximization Games on Graphs Made Temporal.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 45–51. ijcai.org, 2021.
Bibtex entry Link to publication
Link to original publication
Niclas Boehmer and Vincent Froese and Julia Henkel and Yvonne Lasars and Rolf Niedermeier and Malte Renken.
Two Influence Maximization Games on Graphs Made Temporal.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 45–51. ijcai.org, 2021.
Bibtex entry Link to publication
Link to original publication
Niclas Boehmer and Vincent Froese and Julia Henkel and Yvonne Lasars and Rolf Niedermeier and Malte Renken.
Two Influence Maximization Games on Graphs Made Temporal.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 45–51. ijcai.org, 2021.
Bibtex entry Link to publication
Link to original publication
Niclas Boehmer and Vincent Froese and Julia Henkel and Yvonne Lasars and Rolf Niedermeier and Malte Renken.
Two Influence Maximization Games on Graphs Made Temporal.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 45–51. ijcai.org, 2021.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Binary Matrix Completion Under Diameter Constraints.
In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21), pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
Bibtex entry Link to publication
Link to original publication
Niclas Boehmer and Vincent Froese and Julia Henkel and Yvonne Lasars and Rolf Niedermeier and Malte Renken.
Two Influence Maximization Games on Graphs Made Temporal.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 45–51. ijcai.org, 2021.
Bibtex entry Link to publication
Link to original publication

2020

Nathan Schaar and Vincent Froese and Rolf Niedermeier.
Faster Binary Mean Computation Under Dynamic Time Warping.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Parameterized Algorithms for Matrix Completion With Radius Constraints.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Nathan Schaar and Vincent Froese and Rolf Niedermeier.
Faster Binary Mean Computation Under Dynamic Time Warping.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Parameterized Algorithms for Matrix Completion With Radius Constraints.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Nathan Schaar and Vincent Froese and Rolf Niedermeier.
Faster Binary Mean Computation Under Dynamic Time Warping.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Parameterized Algorithms for Matrix Completion With Radius Constraints.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Nathan Schaar and Vincent Froese and Rolf Niedermeier.
Faster Binary Mean Computation Under Dynamic Time Warping.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Nathan Schaar and Vincent Froese and Rolf Niedermeier.
Faster Binary Mean Computation Under Dynamic Time Warping.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Parameterized Algorithms for Matrix Completion With Radius Constraints.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Parameterized Algorithms for Matrix Completion With Radius Constraints.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Nathan Schaar and Vincent Froese and Rolf Niedermeier.
Faster Binary Mean Computation Under Dynamic Time Warping.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Parameterized Algorithms for Matrix Completion With Radius Constraints.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Nathan Schaar and Vincent Froese and Rolf Niedermeier.
Faster Binary Mean Computation Under Dynamic Time Warping.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication
Tomohiro Koana and Vincent Froese and Rolf Niedermeier.
Parameterized Algorithms for Matrix Completion With Radius Constraints.
In Proceedings of the 31th Annual Symposium on Combinatorial Pattern Matching (CPM '20), pages 20:1–20:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020.
Bibtex entry Link to publication
Link to original publication

2019

Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 469–480. Springer, 2019.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 469–480. Springer, 2019.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 469–480. Springer, 2019.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 469–480. Springer, 2019.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 469–480. Springer, 2019.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 469–480. Springer, 2019.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
In Proceedings of the 8th International Conference on Complex Networks and their Applications, pages 469–480. Springer, 2019.
Bibtex entry Link to publication
Link to original publication

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

To top

Journal Publications

2021

Vincent Froese and Malte Renken.
Persistent Graphs and Cyclic Polytope Triangulations.
Combinatorica, 41:407–423, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
A Fast Shortest Path Algorithm on Terrain-like Graphs.
Discrete & Computational Geometry, 66:737–750, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
A Fast Shortest Path Algorithm on Terrain-like Graphs.
Discrete & Computational Geometry, 66:737–750, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
Persistent Graphs and Cyclic Polytope Triangulations.
Combinatorica, 41:407–423, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
Persistent Graphs and Cyclic Polytope Triangulations.
Combinatorica, 41:407–423, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
Persistent Graphs and Cyclic Polytope Triangulations.
Combinatorica, 41:407–423, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
Persistent Graphs and Cyclic Polytope Triangulations.
Combinatorica, 41:407–423, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
A Fast Shortest Path Algorithm on Terrain-like Graphs.
Discrete & Computational Geometry, 66:737–750, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
Persistent Graphs and Cyclic Polytope Triangulations.
Combinatorica, 41:407–423, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
A Fast Shortest Path Algorithm on Terrain-like Graphs.
Discrete & Computational Geometry, 66:737–750, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
A Fast Shortest Path Algorithm on Terrain-like Graphs.
Discrete & Computational Geometry, 66:737–750, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
Persistent Graphs and Cyclic Polytope Triangulations.
Combinatorica, 41:407–423, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
A Fast Shortest Path Algorithm on Terrain-like Graphs.
Discrete & Computational Geometry, 66:737–750, Springer, 2021.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Malte Renken.
A Fast Shortest Path Algorithm on Terrain-like Graphs.
Discrete & Computational Geometry, 66:737–750, Springer, 2021.
Bibtex entry Link to publication
Link to original publication

2020

Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
Social Network Analysis and Mining, 10:50, Springer, 2020.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Rolf Niedermeier.
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.
SIAM Journal on Discrete Mathematics, 34(3):1854–1883, SIAM, 2020.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
Social Network Analysis and Mining, 10:50, Springer, 2020.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Rolf Niedermeier.
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.
SIAM Journal on Discrete Mathematics, 34(3):1854–1883, SIAM, 2020.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
Social Network Analysis and Mining, 10:50, Springer, 2020.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Rolf Niedermeier.
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.
SIAM Journal on Discrete Mathematics, 34(3):1854–1883, SIAM, 2020.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
Social Network Analysis and Mining, 10:50, Springer, 2020.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Rolf Niedermeier.
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.
SIAM Journal on Discrete Mathematics, 34(3):1854–1883, SIAM, 2020.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
Social Network Analysis and Mining, 10:50, Springer, 2020.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Rolf Niedermeier.
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.
SIAM Journal on Discrete Mathematics, 34(3):1854–1883, SIAM, 2020.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
Social Network Analysis and Mining, 10:50, Springer, 2020.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Rolf Niedermeier.
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.
SIAM Journal on Discrete Mathematics, 34(3):1854–1883, SIAM, 2020.
Bibtex entry Link to publication
Link to original publication
Laurent Bulteau and Vincent Froese and Rolf Niedermeier.
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series.
SIAM Journal on Discrete Mathematics, 34(3):1854–1883, SIAM, 2020.
Bibtex entry Link to publication
Link to original publication
Vincent Froese and Brijnesh Jain and Rolf Niedermeier and Malte Renken.
Comparing Temporal Graphs Using Dynamic Time Warping.
Social Network Analysis and Mining, 10:50, Springer, 2020.
Bibtex entry Link to publication
Link to original publication

2019

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, 81(4):1584–1614, 2019.
Bibtex entry Link to publication
Link to original publication
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.
Data Mining and Knowledge Discovery, 33(1):252–291, 2019.
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, 254:283–290, 2019.
Bibtex entry Link to publication
Link to original publication
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, 81(4):1584–1614, 2019.
Bibtex entry Link to publication
Link to original publication
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.
Data Mining and Knowledge Discovery, 33(1):252–291, 2019.
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, 254:283–290, 2019.
Bibtex entry Link to publication
Link to original publication
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.
Data Mining and Knowledge Discovery, 33(1):252–291, 2019.
Bibtex entry Link to publication
Link to original publication
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.
Data Mining and Knowledge Discovery, 33(1):252–291, 2019.
Bibtex entry Link to publication
Link to original publication
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, 81(4):1584–1614, 2019.
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, 254:283–290, 2019.
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, 254:283–290, 2019.
Bibtex entry Link to publication
Link to original publication
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.
Data Mining and Knowledge Discovery, 33(1):252–291, 2019.
Bibtex entry Link to publication
Link to original publication
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, 81(4):1584–1614, 2019.
Bibtex entry Link to publication
Link to original publication
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, 81(4):1584–1614, 2019.
Bibtex entry Link to publication
Link to original publication
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.
Data Mining and Knowledge Discovery, 33(1):252–291, 2019.
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, 254:283–290, 2019.
Bibtex entry Link to publication
Link to original publication
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.
Data Mining and Knowledge Discovery, 33(1):252–291, 2019.
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, 254:283–290, 2019.
Bibtex entry Link to publication
Link to original publication
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, 81(4):1584–1614, 2019.
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, 254:283–290, 2019.
Bibtex entry Link to publication
Link to original publication
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, 81(4):1584–1614, 2019.
Bibtex entry Link to publication
Link to original publication

2018

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

Zusatzinformationen / Extras