search result

Cover von On Sufficient Conditions for Short Journeys in Temporal Graphs

On Sufficient Conditions for Short Journeys in Temporal Graphs

Year: 2026
Media group: LIPIcs
Cover von Parameterized Local Search for Vertex Cover

Parameterized Local Search for Vertex Cover

When Only the Search Radius Is Crucial
Year: 2022
Media group: LIPIcs
Cover von Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard

Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard

Year: 2022
Media group: LIPIcs
Cover von A Timecop’s Chase Around the Table

A Timecop’s Chase Around the Table

Year: 2021
Media group: LIPIcs
Cover von Preventing Small Global Cuts by Protecting Edges

Preventing Small Global Cuts by Protecting Edges

Year: 2026
Media group: LIPIcs
Cover von Foremost, Fastest, Shortest

Foremost, Fastest, Shortest

Temporal Graph Realization Under Various Path Metrics
Year: 2026
Media group: LIPIcs
Cover von Realization of Temporally Connected Graphs Based on Degree Sequences

Realization of Temporally Connected Graphs Based on Degree Sequences

Year: 2025
Media group: LIPIcs
Cover von Recognizing and Realizing Temporal Reachability Graphs

Recognizing and Realizing Temporal Reachability Graphs

Year: 2025
Media group: LIPIcs
Cover von Fantastic Flips and Where to Find Them

Fantastic Flips and Where to Find Them

A General Framework for Parameterized Local Search on Partitioning Problems
Year: 2025
Media group: LIPIcs
Cover von When Can Cluster Deletion with Bounded Weights Be Solved Efficiently?

When Can Cluster Deletion with Bounded Weights Be Solved Efficiently?

Year: 2024
Media group: LIPIcs
OPEN V 11.1.0.0