Publications
Search

Publications :: Search

Show author

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

    Author information
    First name: Manuel
    Last name: Sorge
    DBLP: 54/3371
    Rating: (not rated yet)
    Bookmark:

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

    Show item 1 to 25 of 57  
    Select a publication
    Show Title Venue Rating Date
    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
    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, Marco Morik, Manuel Sorge.
    The Complexity of Routing with Few Collisions.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Stefan Kratsch, Manuel Sorge.
    On Kernelization and Approximation for the Vector Connectivity Problem.
    Algorithmica 2017, Volume 79 (0) 2017
    Conference paper
    Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion.
    How hard is it to satisfy (almost) all roommates?
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge.
    Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.
    Social Netw. Analys. Mining 2017, Volume 7 (0) 2017
    Conference paper
    Till Fluschnik, Marco Morik, Manuel Sorge.
    The Complexity of Routing with Few Collisions.
    Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings 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
    Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý.
    A Parameterized View on Multi-Layer Cluster Editing.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Clemens Hoffmann 0002, Hendrik Molter, Manuel Sorge.
    The Parameterized Complexity of Centrality Improvement in Networks.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Till Fluschnik, Manuel Sorge.
    The Minimum Shared Edges Problem on Planar Graphs.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh.
    h-Index Manipulation by Undoing Merges.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen.
    Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
    15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland 2016 (0) 2016
    Conference paper
    René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý.
    Finding Secluded Places of Special Interest in Graphs.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh.
    h-Index Manipulation by Undoing Merges.
    ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016) 2016 (0) 2016
    Journal article
    René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh.
    H-index manipulation by merging articles: Models, theory, and experiments.
    Artif. Intell. 2016, Volume 240 (0) 2016
    Conference paper
    Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge.
    Enumerating maximal cliques in temporal graphs.
    2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016, San Francisco, CA, USA, August 18-21, 2016 2016 (0) 2016
    Conference paper
    René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý.
    Finding Secluded Places of Special Interest in Graphs.
    11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark 2017 (0) 2016
    Conference paper
    Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge.
    Exploiting hidden structure in selecting dimensions that distinguish vectors.
    J. Comput. Syst. Sci. 2016, Volume 82 (0) 2016
    Conference paper
    René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge.
    Twins in Subdivision Drawings of Hypergraphs.
    Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers 2016 (0) 2016
    Conference paper
    Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge.
    The Parameterized Complexity of the Minimum Shared Edges Problem.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge.
    Enumerating Maximal Cliques in Temporal Graphs.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge.
    Assessing the Computational Complexity of Multi-Layer Subgraph Detection.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Falk Hüffner, Christian Komusiewicz, Manuel Sorge.
    Finding Highly Connected Subgraphs.
    SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod SnÄ?žkou, Czech Republic, January 24-29, 2015. Proceedings 2015 (0) 2015
    Journal article
    Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller.
    Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.
    SIAM J. Discrete Math. 2015, Volume 29 (0) 2015
    Show item 1 to 25 of 57  

    Your query returned 57 matches in the database.