Skip to main content

4 Result(s)

within Conference Paper Remove this filter Manuel Sorge Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Data Structures Remove this filter Numeric Computing Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Finding Dense Subgraphs of Sparse Graphs

    We investigate the computational complexity of the Densest- k -Subgraph (D k S) problem, where the input is an undirected graph G = (V,E) and one wants to f...

    Christian Komusiewicz, Manuel Sorge in Parameterized and Exact Computation (2012)

  2. No Access

    Chapter and Conference Paper

    A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems

    We examine the algorithmic tractability of NP-hard combinatorial feature selection problems in terms of parameterized complexity theory. In combinatorial feature selection, one seeks to discard dimensions from...

    Vincent Froese, René van Bevern… in Mathematical Foundations of Computer Scien… (2013)

  3. No Access

    Chapter and Conference Paper

    Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments

    We consider the following problem. Given a graph and a rational number  \(\mu \) ,

    Christian Komusiewicz, Manuel Sorge, Kolja Stahl in Experimental Algorithms (2015)

  4. No Access

    Chapter and Conference Paper

    Efficient Algorithms for Measuring the Funnel-Likeness of DAGs

    Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funnel if every source-sink path can be uniquely identified by one of its arcs. Funnels are an analog to trees for directed graphs that is mo...

    Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier… in Combinatorial Optimization (2018)