Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs von Hartung, Sepp, Komusiewicz, Christian, Nichterlein, André

Volltext

On structural parameterizations for the 2-club problem von Hartung, Sepp, Komusiewicz, Christian, Nichterlein, André, Suchý, Ondřej

Volltext

Incremental list coloring of graphs, parameterized by conservation von Hartung, Sepp, Niedermeier, Rolf

Volltext

Co-Clustering under the Maximum Norm von Bulteau, Laurent, Froese, Vincent, Hartung, Sepp, Niedermeier, Rolf

Volltext

The complexity of degree anonymization by graph contractions von Talmon, Nimrod, Hartung, Sepp

Volltext

The complexity of degree anonymization by vertex addition von Bredereck, Robert, Froese, Vincent, Hartung, Sepp, Nichterlein, André, Niedermeier, Rolf, Talmon, Nimrod

Volltext

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda von Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Suchy, O., Woeginger, G. J.

Volltext

A refined complexity analysis of degree anonymization in graphs von Hartung, Sepp, Nichterlein, André, Niedermeier, Rolf, Suchý, Ondřej

Volltext

Fixed-parameter algorithms for DAG Partitioning von van Bevern, René, Bredereck, Robert, Chopin, Morgan, Hartung, Sepp, Hüffner, Falk, Nichterlein, André, Suchý, Ondřej

Volltext

The Parameterized Complexity of Local Search for TSP, More Refined von Guo, Jiong, Hartung, Sepp, Niedermeier, Rolf, Suchý, Ondřej

Volltext

NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs von Hartung, Sepp, Nichterlein, André

Volltext

Constant-factor approximations for Capacitated Arc Routing without triangle inequality von van Bevern, René, Hartung, Sepp, Nichterlein, André, Sorge, Manuel

Volltext

On explaining integer vectors by few homogeneous segments von Bredereck, Robert, Chen, Jiehua, Hartung, Sepp, Komusiewicz, Christian, Niedermeier, Rolf, Suchý, Ondřej

Volltext

The Complexity of Degree Anonymization by Graph Contractions von Hartung, Sepp, Talmon, Nimrod

Volltext

Finding large degree-anonymous subgraphs is hard von Bazgan, Cristina, Bredereck, Robert, Hartung, Sepp, Nichterlein, André, Woeginger, Gerhard J.

Volltext

Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks von Hartung, Sepp, Hoffmann, Clemens, Nichterlein, André

Volltext

Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing von Hartung, Sepp, Hoos, Holger H.

Volltext

Incremental List Coloring of Graphs, Parameterized by Conservation von Hartung, Sepp, Niedermeier, Rolf

Volltext

Co-Clustering Under the Maximum Norm von Bulteau, Laurent, Froese, Vincent, Hartung, Sepp, Niedermeier, Rolf

Volltext

NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs von Hartung, Sepp, Nichterlein, André

Volltext