search result

Cover von All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing

All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing

Year: 2016
Media group: LIPIcs
Cover von Fast Map Matching with Vertex-Monotone Fréchet Distance

Fast Map Matching with Vertex-Monotone Fréchet Distance

Year: 2021
Media group: OASICS
Cover von Recent Advances in Intrusion Detection
13th International Symposium, Ottawa, Ontario, Canada, September 15 - 17, 2010, Proceedings
Search for this author
Year: 2010
Publisher: Berlin, Springer
Series: Lecture notes in computer science; 6307
Media group: MONOGRAPHIE
Cover von Preventing Small Global Cuts by Protecting Edges

Preventing Small Global Cuts by Protecting Edges

Year: 2026
Media group: LIPIcs
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 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 Timeline Problems in Temporal Graphs

Timeline Problems in Temporal Graphs

Vertex Cover vs. Dominating Set
Year: 2025
Media group: LIPIcs
OPEN V 11.1.0.0