References
wwwmayr.in.tum.de
[1] Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz,. Rolf Niedermeier, and Ondrej Suchý. On explaining integer vectors by.
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.
Catchup results for cs from Thu, 4 Feb 2016
arxiv.org
Authors: Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier. Comments: Journal version to appear in Algorithms. Subjects: Discrete Mathematics (cs.DM). arXiv: (replaced) [pdf, ps, other]. Title: Analysis and Optimization of Caching and Multicasting in Large-Scale Cache-Enabled Wireless ...
Sepp Hartung and Rolf Niedermeier* (rolf ...
jointmathematicsmeetings.org
Sepp Hartung and Rolf Niedermeier* (rolf.niedermeier@tu-berlin. de), FG AKT, Sekr. TEL 5-1TU Berlin, D Berlin, ...
IPEC Schedule
tcs.rwth-aachen.de
Schedule Wednesday. 10:20: On Multiway Cut parameterized above lower bounds Sepp Hartung, René Van Bevern, Rolf Niedermeier, Mathias Weller, and Frank Kammer.
The Complexity of Degree Anonymization by Vertex Addition |...
link.springer.com
Robert Bredereck; Vincent Froese; Sepp Hartung; André Nichterlein; Rolf Niedermeier; Nimrod Talmon. Robert Bredereck. 1. Vincent Froese. 1. Sepp Hartung. 1.
Alle Infos zum Namen "Sepp Hartung"
Ondra Suchý - Citações do Google Acadêmico
scholar.google.com.br
Rolf Niedermeier,; Sepp Hartung,; Jan Kratochvil,; Saket Saurabh,; Jiehua Chen,; André Nichterlein,; René van Bevern,; Christian Komusiewicz,; Manuel Sorge, ...
Ondra Suchy - Google Scholar Citations
scholar.google.be
Rolf Niedermeier,; Sepp Hartung,; Jan Kratochvil,; Saket Saurabh,; Tomas Vyskocil,; André Nichterlein,; René van Bevern,; Christian Komusiewicz,; Manuel ...
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 ...
AAAI-10 Final Schedule
www.aaai.org
David Leake, AI Magazine Editor-in-Chief. AAAI Classic Paper and Jiong Guo, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann.
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 ...
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 ...
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 ...
Incremental List Coloring of Graphs Parameterized Complexity
fpt.wdfiles.com
JMM 2013, San Diego. 2Paper to appear in Theoretical Computer Science. Sepp Hartung and Rolf Niedermeier. Incremetal List Coloring of Graphs. Folie
Nimrod Talmon - researchr alias
researchr.org
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon. wads 2017: [doi] · Structured Proportional RepresentationNimrod Talmon. atal 2017: [doi] · The complexity of degree anonymization by graph contractionsNimrod Talmon, Sepp Hartung. iandc, ...
TAMC 2010
kam.mff.cuni.cz
11:00-11:30, Sylvain Guillemot and Matthias Mnich. Kernel and Fast Algorithm for Dense Triplet Inconsistency, Benedek Nagy. An automata-theoretic characterization of the Chomsky-hierarchy. 11:30-12:00, Sepp Hartung and Rolf Niedermeier. Incremental List Coloring of Graphs, Parameterized by Conservation.
CiteSeerX — The Parameterized Complexity of Local Search for TSP,...
citeseerx.ist.psu.edu
BibTeX. @MISC{Guo11theparameterized, author = {Jiong Guo and Sepp Hartung and Rolf Niedermeier and et al.}, title = { The Parameterized Complexity of Local Search for TSP, More Refined}, year = {2011} } ...
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 ...
sortiert nach Relevanz / Datum