Did you mean: hamann

search result

Cover von A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP

A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP

Year: 2024
Media group: LIPIcs
Cover von Approximation Algorithms and Lower Bounds for Graph Burning

Approximation Algorithms and Lower Bounds for Graph Burning

Year: 2023
Media group: LIPIcs
Cover von The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research
article in ACM SIGCOMM Computer Communication Review : pp. 24-30
Search for this author
Year: 2019
Publisher: New York, ACM
Series: Computer communication review; 49. 2019, 1
Media group: ARTICLE
Cover von Fast Approximation Algorithms for the Generalized Survivable Network Design Problem

Fast Approximation Algorithms for the Generalized Survivable Network Design Problem

Year: 2016
Media group: LIPIcs
Cover von On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree

On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree

Year: 2014
Media group: LIPIcs
Cover von Dagstuhl perspectives workshop on end-to-end protocols for the future internet; 2
article : S. 42-47
Search for this author
Year: 2009
Publisher: New York, ACM
Count: 2
Media group: ARTICLE
Cover von Parameterized Complexity of Directed Traveling Salesman Problem

Parameterized Complexity of Directed Traveling Salesman Problem

Year: 2025
Media group: LIPIcs
Cover von On Sparse Hitting Sets

On Sparse Hitting Sets

From Fair Vertex Cover to Highway Dimension
Year: 2022
Media group: LIPIcs
Cover von Recoloring Interval Graphs with Limited Recourse Budget

Recoloring Interval Graphs with Limited Recourse Budget

Year: 2020
Media group: LIPIcs
Cover von Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

Author: Dvorak, Pavel
Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0