Did you mean: summerhammer

search result

Cover von SubModST

SubModST

A Fast Generic Solver for Submodular Maximization with Size Constraints
Year: 2024
Media group: LIPIcs
Cover von On the Complexity of Community-Aware Network Sparsification

On the Complexity of Community-Aware Network Sparsification

Year: 2024
Media group: LIPIcs
Cover von On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model

Year: 2023
Media group: LIPIcs
Cover von Essentially Tight Kernels For (Weakly) Closed Graphs

Essentially Tight Kernels For (Weakly) Closed Graphs

Year: 2021
Media group: LIPIcs
Cover von Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Year: 2020
Media group: LIPIcs
Cover von Exploiting c-Closure in Kernelization Algorithms for Graph Problems

Exploiting c-Closure in Kernelization Algorithms for Graph Problems

Year: 2020
Media group: LIPIcs
Cover von Robot vision
international workshop : Auckland, New Zealand, February 16 - 18, 2001 : proceedings
Search for this author
Year: 2001
Publisher: Berlin, Springer
Series: Lecture notes in computer science; 1998
Media group: MONOGRAPHIE
Cover von Timeline Problems in Temporal Graphs

Timeline Problems in Temporal Graphs

Vertex Cover vs. Dominating Set
Year: 2025
Media group: LIPIcs
Cover von Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions

Temporal Dominating Set and Temporal Vertex Cover Under the Lense of Degree Restrictions

Year: 2025
Media group: LIPIcs
Cover von Complexity of Local Search for Euclidean Clustering Problems

Complexity of Local Search for Euclidean Clustering Problems

Year: 2024
Media group: LIPIcs
OPEN V 11.1.0.0