Sepp Hartung

Available identifiers

zbMath Open hartung.seppWikidataQ102425334 ScholiaQ102425334MaRDI QIDQ249101

List of research outcomes

Publication	Date of Publication	Type
Co-clustering under the maximum norm	2019-03-26	Paper
Constant-factor approximations for capacitated arc routing without triangle inequality	2018-09-28	Paper
The complexity of degree anonymization by graph contractions	2017-09-28	Paper
Fixed-parameter algorithms for DAG partitioning	2017-02-06	Paper
Finding large degree-anonymous subgraphs is hard	2016-02-26	Paper
The complexity of degree anonymization by vertex addition	2015-12-08	Paper
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs	2015-10-30	Paper
The Complexity of Degree Anonymization by Graph Contractions	2015-09-30	Paper
Co-Clustering Under the Maximum Norm	2015-09-11	Paper
A refined complexity analysis of degree anonymization in graphs	2015-06-09	Paper
The Complexity of Degree Anonymization by Vertex Addition	2015-05-20	Paper
On structural parameterizations for the 2-club problem	2015-04-28	Paper
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs	2015-04-22	Paper
On explaining integer vectors by few homogeneous segments	2015-02-20	Paper
On structural parameterizations for the 2-club problem	2014-11-04	Paper
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda	2014-07-30	Paper
The Complexity of Finding a Large Subgraph under Anonymity Constraints	2014-01-14	Paper
Incremental list coloring of graphs, parameterized by conservation	2014-01-10	Paper
The parameterized complexity of local search for TSP, more refined	2013-11-11	Paper
On Explaining Integer Vectors by Few Homogenous Segments	2013-08-12	Paper
A Refined Complexity Analysis of Degree Anonymization in Graphs	2013-08-07	Paper
Parameterized Complexity of DAG Partitioning	2013-06-07	Paper
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs	2013-01-07	Paper
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs	2012-08-14	Paper
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs	2012-06-15	Paper
The Parameterized Complexity of Local Search for TSP, More Refined	2011-12-16	Paper
Incremental List Coloring of Graphs, Parameterized by Conservation	2010-06-17	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Sepp Hartung