Sepp Hartung und Parameterized - Info zur Person

(1 - 14 von 19

)

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, ...

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.

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ý ...

‪Christian Komusiewicz‬ - ‪Google Scholar‬

scholar.google.de

‪Philipps-Universität Marburg‬ - ‪‪ mal zitiert‬‬ - ‪Algorithms‬ - ‪Algorithm Engineering‬ - ‪Parameterized Complexity‬ - ‪Com…tional Biology‬

‪Falk Hüffner‬ - ‪Google Académico‬

scholar.google.com.ar

‪TomTom‬ - ‪‪Citado por ‬‬ - ‪Theoretical Computer Science‬ - ‪Algorithms‬ - ‪Parameterized Complexity‬ - ‪Com…tional Biology‬

‪Falk Hüffner‬ - ‪Google Scholar‬

scholar.google.nl

‪TomTom‬ - ‪‪Geciteerd door ‬‬ - ‪Theoretical Computer Science‬ - ‪Algorithms‬ - ‪Parameterized Complexity‬ - ‪Com…tional Biology‬

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, ...

[PDF] Metric Dimension Parameterized by Max Leaf Number | Semantic...

www.semanticscholar.org

This paper shows that this graph invariant may be calculated by an algorithm whose running time is linear in the input graph size, added to a function of the...

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 ...

‪Robert Bredereck‬ - ‪Google Scholar‬

scholar.google.co.il

‪TU Clausthal‬ - ‪‫מצוטט/ת ב-1,411 מאמרים‬‬ - ‪Fixed-parameter Tractability‬ - ‪Parameterized Complexity‬ - ‪Com…tional Social Choice‬ - ‪Combinatorial Data...

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.