The following pages link to Sepp Hartung (Q249101):
Displaying 25 items.
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Co-clustering under the maximum norm (Q1736769) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- The complexity of degree anonymization by graph contractions (Q2407102) (← links)
- On Explaining Integer Vectors by Few Homogenous Segments (Q2842158) (← links)
- The Complexity of Finding a Large Subgraph under Anonymity Constraints (Q2872080) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- Co-Clustering Under the Maximum Norm (Q2942637) (← links)
- The Complexity of Degree Anonymization by Graph Contractions (Q2948472) (← links)
- The Parameterized Complexity of Local Search for TSP, More Refined (Q3104663) (← links)
- Incremental List Coloring of Graphs, Parameterized by Conservation (Q3569081) (← links)
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs (Q4899256) (← links)
- Parameterized Complexity of DAG Partitioning (Q4924637) (← links)
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs (Q5246711) (← links)
- The Complexity of Degree Anonymization by Vertex Addition (Q5251633) (← links)
- A Refined Complexity Analysis of Degree Anonymization in Graphs (Q5327468) (← links)
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda (Q5494853) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)