1
0
0
(1 - 23 von 28
)
CiE News
www.mathcomp.leeds.ac.uk
Science Magazine AAAS ... the CiE Best Student Paper Award, sponsored by Springer, are Sepp Hartung and André Nichterlein, for their ...
science-parse/authorFullName.tsv at master · allenai/science-parse ·...
github.com
... Catherine Plaisant Heiko Hansen Helen Evans Hilary Hutchinson Michel Beaudouin-Lafon Nicolas Roussel Stéphane Conversy Wendy Mackay cd9b475d2ee e8d0dca33b335d77 André Nichterlein Sepp Hartung.
Sepp Hartung & André Nichterlein, NP-Hardness and fixed-parameter...
philpapers.org
Karl A. Abrahamson, Rodney G. Downey & Michael R. Fellows (1995). Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and ...
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.
Be sparse! Be dense! Be robust!: Elements of parameterized...
books.google.de
[Har+15] [Har+99] [Har14] [Har62] [HD02] [Her+13] [Her+15] [HKS15] [Hol+06] [Hol15] Sepp Hartung, Christian Komusiewicz, André Nichterlein, and Ondrej Suchý. “On structural parameterizations for the 2-club problem.” In: Discrete Applied Mathematics 185 (2015), pp. 79–92 (cit. on p. 103). Erez Hartuv, Armin O. Schmitt, ...
Combinatorics authors/titles Apr 2014
arxiv.org
Fan realizations of subword complexes and multi-associahedra via Gale duality René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge. Bipartite ...
[ ] On Structural Parameterizations for the 2-Club Problem
arxiv.org
Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý. The NP-hard 2-Club problem is, given an undirected graph G=(V,E) ...
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ý ...
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.
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 ...
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 ...
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 ...
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 ...
CiE Accepted Papers
www.mathcomp.leeds.ac.uk
Science Magazine AAAS · Springer · The IET ... Josef Berger. When is the denial inequality an ... Sepp Hartung and André Nichterlein. NP-Hardness and ...
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, ...
Scilit | Article - On Structural Parameterizations for the 2-Club...
www.scilit.net
Sepp Hartung, Christian Komusiewicz, André Nichterlein, David Hutchison, Takeo Kanade, Josef Kittler, Jon M. Kleinberg, Friedemann Mattern, ...
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 ...
Alle Infos zum Namen "Sepp Hartung"
sortiert nach Relevanz / Datum