Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Christian
    Last name: Komusiewicz
    DBLP: 69/1771
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 105  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon.
    When can Graph Hyperbolicity be computed in Linear Time?
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen.
    Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Maximilian Katzmann, Christian Komusiewicz.
    Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem.
    Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. 2017 (0) 2017
    Conference paper
    Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge.
    Assessing the Computational Complexity of Multi-layer Subgraph Detection.
    Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings 2017 (0) 2017
    Conference paper
    Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon.
    When Can Graph Hyperbolicity Be Computed in Linear Time?
    Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings 2017 (0) 2017
    Conference paper
    Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi.
    Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping.
    28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland 2017 (0) 2017
    Conference paper
    Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz.
    Beyond Adjacency Maximization: Scaffold Filling for New String Distances.
    28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland 2017 (0) 2017
    Conference paper
    René van Bevern, Christian Komusiewicz, Manuel Sorge.
    A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments.
    Networks 2017, Volume 70 (0) 2017
    Journal article
    Guillaume Fertin, Julien Fradin, Christian Komusiewicz.
    The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Christian Komusiewicz.
    Multivariate Algorithmics for Finding Cohesive Subnetworks.
    Algorithms 2016, Volume 9 (0) 2016
    Show item 1 to 10 of 105  

    Your query returned 105 matches in the database.