default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Froese
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Vincent Froese:
Fine-grained complexity analysis of some combinatorial data science problems. Technical University of Berlin, Germany, 2018, ISBN 978-3-7983-3003-0, pp. 1-180
Journal Articles
- 2024
- [j26]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in schelling games: computational hardness and robustness. Auton. Agents Multi Agent Syst. 38(1): 9 (2024) - [j25]Vincent Froese, Malte Renken:
Terrain-like graphs and the median Genocchi numbers. Eur. J. Comb. 115: 103780 (2024) - [j24]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68(1): 103-121 (2024) - [j23]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-fair cluster editing. Soc. Netw. Anal. Min. 14(1): 109 (2024) - 2023
- [j22]Vincent Froese
, Brijnesh J. Jain, Maciej Rymar, Mathias Weller:
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. Algorithmica 85(2): 492-508 (2023) - [j21]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
The complexity of binary matrix completion under diameter constraints. J. Comput. Syst. Sci. 132: 45-67 (2023) - [j20]Brijnesh J. Jain, Vincent Froese, David Schultz:
An average-compress algorithm for the sample mean problem under dynamic time warping. J. Glob. Optim. 86(4): 885-903 (2023) - 2022
- [j19]Vincent Froese, Christoph Hertrich, Rolf Niedermeier:
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. J. Artif. Intell. Res. 74: 1775-1790 (2022) - 2021
- [j18]Vincent Froese, Malte Renken:
Persistent Graphs and Cyclic Polytope Triangulations. Comb. 41(3): 407-423 (2021) - [j17]Vincent Froese, Malte Renken:
A Fast Shortest Path Algorithm on Terrain-like Graphs. Discret. Comput. Geom. 66(2): 737-750 (2021) - 2020
- [j16]Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. SIAM J. Discret. Math. 34(3): 1854-1883 (2020) - [j15]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing temporal graphs using dynamic time warping. Soc. Netw. Anal. Min. 10(1): 50 (2020) - 2019
- [j14]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica 81(4): 1584-1614 (2019) - [j13]Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge:
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254: 283-290 (2019) - [j12]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact mean computation in dynamic time warping spaces. Data Min. Knowl. Discov. 33(1): 252-291 (2019) - 2018
- [j11]René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing Edge Modification Problems Above Lower Bounds. Theory Comput. Syst. 62(3): 739-770 (2018) - 2017
- [j10]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. Int. J. Comput. Geom. Appl. 27(4): 277-296 (2017) - [j9]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Partitioning Perfect Graphs into Stars. J. Graph Theory 85(2): 297-335 (2017) - [j8]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. Theory Comput. Syst. 60(2): 253-279 (2017) - 2016
- [j7]Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle Counting in Dynamic Graph Streams. Algorithmica 76(1): 259-278 (2016) - [j6]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering under the Maximum Norm. Algorithms 9(1): 17 (2016) - [j5]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-Player Diffusion Games on Graph Classes. Internet Math. 12(6): 363-380 (2016) - [j4]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. 82(3): 521-535 (2016) - [j3]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-win kernelization for degree sequence completion problems. J. Comput. Syst. Sci. 82(6): 1100-1111 (2016) - 2015
- [j2]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Vertex Dissolution. SIAM J. Discret. Math. 29(2): 888-914 (2015) - [j1]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607: 16-34 (2015)
Conference and Workshop Papers
- 2023
- [c22]Vincent Froese, Christoph Hertrich:
Training Neural Networks is NP-Hard in Fixed Dimension. NeurIPS 2023 - 2022
- [c21]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-Fair Cluster Editing. AAAI 2022: 6631-6638 - [c20]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Hardness and Robustness. AAMAS 2022: 761-769 - [c19]Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA 2022: 53:1-53:15 - [c18]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. IJCAI 2022: 2037-2043 - 2021
- [c17]Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken:
Two Influence Maximization Games on Graphs Made Temporal. IJCAI 2021: 45-51 - [c16]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Binary Matrix Completion Under Diameter Constraints. STACS 2021: 47:1-47:14 - 2020
- [c15]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion with Radius Constraints. CPM 2020: 20:1-20:14 - [c14]Nathan Schaar, Vincent Froese, Rolf Niedermeier:
Faster Binary Mean Computation Under Dynamic Time Warping. CPM 2020: 28:1-28:13 - 2019
- [c13]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing Temporal Graphs Using Dynamic Time Warping. COMPLEX NETWORKS (2) 2019: 469-480 - 2018
- [c12]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact Mean Computation in Dynamic Time Warping Spaces. SDM 2018: 540-548 - 2016
- [c11]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CCCG 2016: 7-14 - [c10]René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing Edge Modification Problems Above Lower Bounds. CSR 2016: 57-72 - [c9]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC 2016: 10:1-10:14 - 2015
- [c8]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-player Diffusion Games on Graph Classes. TAMC 2015: 200-211 - [c7]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. TAMC 2015: 224-235 - 2014
- [c6]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Degree Anonymization by Vertex Addition. AAIM 2014: 44-55 - [c5]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. ICALP (1) 2014: 174-185 - [c4]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. ISAAC 2014: 298-309 - [c3]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. MFCS (2) 2014: 69-80 - [c2]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-Win Kernelization for Degree Sequence Completion Problems. SWAT 2014: 194-205 - 2013
- [c1]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS 2013: 445-456
Informal and Other Publications
- 2024
- [i34]Simeon Pawlowski, Vincent Froese:
Nash Equilibria in Reverse Temporal Voronoi Games. CoRR abs/2402.04696 (2024) - [i33]Vincent Froese, Moritz Grillo, Martin Skutella:
Complexity of Deciding Injectivity and Surjectivity of ReLU Neural Networks. CoRR abs/2405.19805 (2024) - 2023
- [i32]Vincent Froese, Christoph Hertrich:
Training Neural Networks is NP-Hard in Fixed Dimension. CoRR abs/2303.17045 (2023) - 2022
- [i31]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. CoRR abs/2204.02668 (2022) - [i30]Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR abs/2206.14698 (2022) - [i29]Vincent Froese, Malte Renken:
Terrain-like Graphs and the Median Genocchi Numbers. CoRR abs/2210.16281 (2022) - 2021
- [i28]Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken:
Two Influence Maximization Games on Graphs Made Temporal. CoRR abs/2105.05987 (2021) - [i27]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Complexity and Robustness. CoRR abs/2105.06561 (2021) - [i26]Vincent Froese, Christoph Hertrich, Rolf Niedermeier:
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality. CoRR abs/2105.08675 (2021) - [i25]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-Fair Cluster Editing. CoRR abs/2112.03183 (2021) - 2020
- [i24]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Parameterized Algorithms for Matrix Completion With Radius Constraints. CoRR abs/2002.00645 (2020) - [i23]Nathan Schaar, Vincent Froese, Rolf Niedermeier:
Faster Binary Mean Computation Under Dynamic Time Warping. CoRR abs/2002.01178 (2020) - [i22]Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Complexity of Combinatorial Matrix Completion With Diameter Constraints. CoRR abs/2002.05068 (2020) - 2019
- [i21]Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller:
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. CoRR abs/1903.03003 (2019) - [i20]Vincent Froese, Malte Renken:
Advancing Through Terrains. CoRR abs/1904.08746 (2019) - [i19]Matthias Bentert, Jiehua Chen, Vincent Froese, Gerhard J. Woeginger:
Good Things Come to Those Who Swap Objects on Paths. CoRR abs/1905.04219 (2019) - [i18]Brijnesh J. Jain, Vincent Froese, David Schultz:
An Average-Compress Algorithm for the Sample Mean Problem under Dynamic Time Warping. CoRR abs/1909.13541 (2019) - [i17]Vincent Froese, Malte Renken:
Terrain Visibility Graphs and Cyclic Polytope Triangulations. CoRR abs/1911.05012 (2019) - [i16]Vincent Froese, Christoph Hansknecht:
Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces. CoRR abs/1912.02300 (2019) - 2018
- [i15]Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR abs/1804.02854 (2018) - [i14]Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, Malte Renken:
Comparing Temporal Graphs Using Dynamic Time Warping. CoRR abs/1810.06240 (2018) - 2017
- [i13]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact Mean Computation in Dynamic Time Warping Spaces. CoRR abs/1710.08937 (2017) - [i12]Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge:
Algorithmic Aspects of Point Visibility Graphs. CoRR abs/1711.01811 (2017) - 2016
- [i11]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR abs/1604.06302 (2016) - 2015
- [i10]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CoRR abs/1508.01097 (2015) - [i9]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR abs/1512.01150 (2015) - [i8]René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing edge modification problems above lower bounds. CoRR abs/1512.04047 (2015) - [i7]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. CoRR abs/1512.05693 (2015) - 2014
- [i6]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. CoRR abs/1402.2589 (2014) - [i5]René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Network-Based Dissolution. CoRR abs/1402.2664 (2014) - [i4]Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle counting in dynamic graph streams. CoRR abs/1404.4696 (2014) - [i3]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-Win Kernelization for Degree Sequence Completion Problems. CoRR abs/1404.5432 (2014) - [i2]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. CoRR abs/1411.7838 (2014) - [i1]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-Player Diffusion Games on Graph Classes. CoRR abs/1412.2544 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-18 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
