1
0
0
(1 - 19 von 19
)
Algorithmic Aspects of Manipulation and Anonymization in Social...
books.google.de
(cited on 32, 106, 107, 108, 111, 118, 130) Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, and Nimrod Talmon. The complexity of degree anonymization by vertex addition. In Proceedings of the 10th International Conference on Algorithmic Aspects in Information and Management ...
Degree-constrained editing of small-degree graphs - Nichterlein,...
books.google.de
Chapter 5 is based on joint work with Cristina Bazgan (University ParisDauphine, LAMSADE, Paris), Robert Bredereck, Sepp Hartung, and Gerhard J. Woeginger (TU Eindhoven) on the Anonym V-Del and Anonym E-Del problems. Earlier work on Anonym E-Ins [Har+13] (which is presented in Chapter 6) motivated me to ...
[ ] Fixed-Parameter Algorithms for DAG Partitioning
arxiv.org
... Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, ... Journal reference: Discrete Applied Mathematics 220: ,
Methods for Discrete Structures
www3.math.tu-berlin.de
This talk is based on joint work with Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Geevarghese Philip, Ondrej Suchý, Nimrod Talmon, ...
Search results for "Gerhard J. Woeginger" – FacetedDBLP
dblp.l3s.de
Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger: The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC : 2013:
Parameterized Complexity of DAG Partitioning | SpringerLink
link.springer.com
René van Bevern (18); Robert Bredereck (18); Morgan Chopin (19); Sepp Hartung (18); Falk Hüffner (18); André Nichterlein (18); Ondřej Suchý ...
Robert Bredereck - Google Scholar
scholar.google.co.il
TU Clausthal - מצוטט/ת ב-1,411 מאמרים - Fixed-parameter Tractability - Parameterized Complexity - Com…tional Social Choice - Combinatorial Data...
Ondra Suchy - Citas de Google Académico
scholar.google.es
Rolf Niedermeier,; Sepp Hartung,; Jan Kratochvil,; Tomas Vyskocil,; André Nichterlein,; Christian Komusiewicz,; René van Bevern,; Robert Bredereck,; Manuel ...
Robert Bredereck - Citações do Google Académico
scholar.google.com.br
Rolf Niedermeier,; Jiehua Chen,; Gerhard Woeginger,; André Nichterlein,; Sepp Hartung,; Piotr Faliszewski,; Nimrod Talmon,; Geevarghese Philip,; René van ...
A Parameterized Algorithmics Framework for Semantic Scholar
www.semanticscholar.org
Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, and Gerhard J D. Gale. A theorem on flows in networks. Pacific Journal of Mathematics, ...
Publications | Robert Bredereck
robert.bredereck.info
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, and Ondřej Such ...
FPT papers in conferences - Parameterized Complexity
fpt.wikidot.com
Treewidth and pathwidth parameterized by vertex cover; Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier and Ondrej ...
René van Bevern - Citazioni di Google Scholar
scholar.google.it
Rolf Niedermeier,; Manuel Sorge,; Christian Komusiewicz,; Mathias Weller,; Michael Fellows,; Ondra Suchý,; Robert Bredereck,; Sepp Hartung,; Gerhard ...
Finding large degree-anonymous subgraphs is hard - Archive ouverte HAL
hal.archives-ouvertes.fr
Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard Woeginger. Finding large degree-anonymous subgraphs is hard. Theoretical ...
The complexity of degree anonymization by vertex addition
www.infona.pl
The complexity of degree anonymization by vertex addition. Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon · Details · Contributors · Fields of science · Bibliography · Quotations · Similar · Collections ...
Table of COMSOC FPT Races - Parameterized Complexity
fpt.wikidot.com
Robert Bredereck and Jiehua Chen and Sepp Hartung and Stefan Kratsch and Rolf Niedermeier and Ondřej Suchý. A Multivariate Complexity Analysis of ...
Alle Infos zum Namen "Sepp Hartung"
sortiert nach Relevanz / Datum