The following pages link to Vincent Froese (Q295646):
Displaying 32 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Triangle counting in dynamic graph streams (Q334947) (← links)
- The complexity of finding effectors (Q519899) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Computational complexity aspects of point visibility graphs (Q1720342) (← links)
- Co-clustering under the maximum norm (Q1736769) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Persistent graphs and cyclic polytope triangulations (Q2043765) (← links)
- A fast shortest path algorithm on terrain-like graphs (Q2046450) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- Fast exact dynamic time warping on run-length encoded time series (Q2684485) (← links)
- A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems (Q2849932) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- Co-Clustering Under the Maximum Norm (Q2942637) (← links)
- Multi-player Diffusion Games on Graph Classes (Q2948467) (← links)
- Win-Win Kernelization for Degree Sequence Completion Problems (Q3188894) (← links)
- Finding Points in General Position (Q4605338) (← links)
- A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs (Q4634393) (← links)
- The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality (Q5043561) (← links)
- Tight Hardness Results for Consensus Problems on Circular Strings and Time Series (Q5128513) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- The Complexity of Degree Anonymization by Vertex Addition (Q5251633) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Multi-Player Diffusion Games on Graph Classes (Q5856441) (← links)
- Parameterized Algorithms for Matrix Completion with Radius Constraints. (Q5874448) (← links)
- (Q5874459) (← links)
- Terrain-like graphs and the median Genocchi numbers (Q6057452) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)
- Nash equilibria in reverse temporal Voronoi games (Q6616234) (← links)
- Fine-grained complexity analysis of some combinatorial data science problems (Q6631303) (← links)
