According to our database1, Manuel Sorge authored at least 42 papers between 2009 and 2019.
Legend:Book In proceedings Article PhD thesis Other
The complexity of routing with collision avoidance.
J. Comput. Syst. Sci., 2019
Computational complexity aspects of point visibility graphs.
Discrete Applied Mathematics, 2019
Matchings under Preferences: Strength of Stability and Trade-Offs.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discrete Optimization, 2018
Matching algorithms for assigning orthologs after genome duplication events.
Computational Biology and Chemistry, 2018
The Parameterized Complexity of Centrality Improvement in Networks.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
Cluster Editing in Multi-Layer and Temporal Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
How Hard Is It to Satisfy (Almost) All Roommates?.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Be sparse! Be dense! Be robust!: elements of parameterized algorithmics.
PhD thesis, 2017
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs.
Social Netw. Analys. Mining, 2017
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments.
The Complexity of Routing with Few Collisions.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
Assessing the Computational Complexity of Multi-layer Subgraph Detection.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
Exploiting hidden structure in selecting dimensions that distinguish vectors.
J. Comput. Syst. Sci., 2016
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
Finding Secluded Places of Special Interest in Graphs.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Twins in Subdivision Drawings of Hypergraphs.
Proceedings of the Graph Drawing and Network Visualization, 2016
h-Index Manipulation by Undoing Merges.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
Enumerating maximal cliques in temporal graphs.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.
SIAM J. Discrete Math., 2015
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
Theory Comput. Syst., 2015
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems.
Discrete Applied Mathematics, 2015
Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
Finding Highly Connected Subgraphs.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015
On Kernelization and Approximation for the Vector Connectivity Problem.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
The Parameterized Complexity of the Minimum Shared Edges Problem.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems.
Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015
Constant-factor approximations for Capacitated Arc Routing without triangle inequality.
Oper. Res. Lett., 2014
The Minimum Feasible Tileset Problem.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014
On the Parameterized Complexity of Computing Graph Bisections.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Exact combinatorial algorithms and experiments for finding maximum k-plexes.
J. Comb. Optim., 2012
Finding Dense Subgraphs of Sparse Graphs.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012
Exploiting a Hypergraph Model for Finding Golomb Rulers.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
From Few Components to an Eulerian Graph by Adding Arcs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
A New View on Rural Postman Based on Eulerian Extension and Matching.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009