Vincent Froese

Available identifiers

zbMath Open froese.vincentMaRDI QIDQ295646

List of research outcomes

Publication	Date of Publication	Type
Fine-grained complexity analysis of some combinatorial data science problems	2024-11-01	Paper
Nash equilibria in reverse temporal Voronoi games	2024-10-08	Paper
Disentangling the computational complexity of network untangling	2024-02-09	Paper
Terrain-like graphs and the median Genocchi numbers	2023-10-25	Paper
Fast exact dynamic time warping on run-length encoded time series	2023-02-16	Paper
https://portal.mardi4nfdi.de/entity/Q5874459	2023-02-07	Paper
Parameterized Algorithms for Matrix Completion with Radius Constraints.	2023-02-07	Paper
The complexity of binary matrix completion under diameter constraints	2023-01-09	Paper
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality	2022-10-06	Paper
A fast shortest path algorithm on terrain-like graphs	2021-08-18	Paper
Persistent graphs and cyclic polytope triangulations	2021-08-03	Paper
Multi-Player Diffusion Games on Graph Classes	2021-03-26	Paper
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series	2020-10-27	Paper
Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces	2019-12-04	Paper
A parameterized algorithmics framework for degree sequence completion problems in directed graphs	2019-04-25	Paper
Co-clustering under the maximum norm	2019-03-26	Paper
Computational complexity aspects of point visibility graphs	2019-02-08	Paper
Parameterizing edge modification problems above lower bounds	2018-06-01	Paper
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs	2018-04-10	Paper
Finding Points in General Position	2018-02-22	Paper
Star Partitions of Perfect Graphs	2017-07-05	Paper
The complexity of finding effectors	2017-03-31	Paper
Triangle counting in dynamic graph streams	2016-11-01	Paper
Parameterizing edge modification problems above lower bounds	2016-07-25	Paper
Win-win kernelization for degree sequence completion problems	2016-06-13	Paper
Exploiting hidden structure in selecting dimensions that distinguish vectors	2015-12-30	Paper
The complexity of degree anonymization by vertex addition	2015-12-08	Paper
The complexity of finding effectors	2015-09-30	Paper
Multi-player Diffusion Games on Graph Classes	2015-09-30	Paper
Co-Clustering Under the Maximum Norm	2015-09-11	Paper
Network-Based Vertex Dissolution	2015-06-08	Paper
The Complexity of Degree Anonymization by Vertex Addition	2015-05-20	Paper
Network-Based Dissolution	2014-10-14	Paper
Triangle counting in dynamic graph streams	2014-09-02	Paper
Win-Win Kernelization for Degree Sequence Completion Problems	2014-09-02	Paper
Star Partitions of Perfect Graphs	2014-07-01	Paper
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems	2013-09-20	Paper

Research outcomes over time

This page was built for person: Vincent Froese