search result

Cover von Destroying Densest Subgraphs Is Hard

Destroying Densest Subgraphs Is Hard

Year: 2024
Media group: LIPIcs
Cover von Correlating Theory and Practice in Finding Clubs and Plexes

Correlating Theory and Practice in Finding Clubs and Plexes

Year: 2023
Media group: LIPIcs
Cover von Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions

Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions

Year: 2023
Media group: LIPIcs
Cover von Density Matters

Density Matters

A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
Year: 2026
Media group: LIPIcs
Cover von Graph Clustering Problems Under the Lens of Parameterized Local Search

Graph Clustering Problems Under the Lens of Parameterized Local Search

Year: 2023
Media group: LIPIcs
Cover von Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time

Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time

Year: 2022
Media group: LIPIcs
Cover von Covering Many (Or Few) Edges with k Vertices in Sparse Graphs

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs

Year: 2022
Media group: LIPIcs
Cover von The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge

Cluster Editing
Year: 2021
Media group: LIPIcs
Cover von Using a Geometric Lens to Find k Disjoint Shortest Paths

Using a Geometric Lens to Find k Disjoint Shortest Paths

Year: 2021
Media group: LIPIcs
Cover von Parameterized Dynamic Cluster Editing

Parameterized Dynamic Cluster Editing

Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0