Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. - Hannes Moser; Rolf Niedermeier; Manuel Sorge (SEA, 2009)

Algorithmic Aspects of Golomb Ruler Construction - Manuel Sorge (CoRR, 2010)

From Few Components to an Eulerian Graph by Adding Arcs. - Manuel Sorge; René van Bevern; Rolf Niedermeier; Mathias Weller (WG, 2011)

On Making Directed Graphs Eulerian - Manuel Sorge (CoRR, 2011)

Finding Dense Subgraphs of Sparse Graphs. - Christian Komusiewicz; Manuel Sorge (IPEC, 2012)

Exact combinatorial algorithms and experiments for finding maximum k-plexes. - Hannes Moser; Rolf Niedermeier; Manuel Sorge (J. Comb. Optim., 2012)

A new view on Rural Postman based on Eulerian Extension and Matching. - Manuel Sorge; René van Bevern; Rolf Niedermeier; Mathias Weller (J. Discrete Algorithms, 2012)

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. - Jiehua Chen 001; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Ondrej Suchý 001; Mathias Weller (ISAAC, 2013)

A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. - Vincent Froese; René van Bevern; Rolf Niedermeier; Manuel Sorge (MFCS, 2013)

On the Parameterized Complexity of Computing Graph Bisections. - René van Bevern; Andreas Emil Feldmann; Manuel Sorge; Ondrej Suchý 001 (WG, 2013)

A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs. - Manuel Sorge (CoRR, 2013)

Exploiting a hypergraph model for finding Golomb rulers. - Manuel Sorge; Hannes Moser; Rolf Niedermeier; Mathias Weller (Acta Informatica, 2014)

On Google Scholar H-Index Manipulation by Merging Articles. - René van Bevern; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Toby Walsh (CoRR, 2014)

Constant-factor approximations for Capacitated Arc Routing without triangle inequality. - René van Bevern; Sepp Hartung; André Nichterlein; Manuel Sorge (Oper. Res. Lett., 2014)

Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. - René van Bevern; Christian Komusiewicz; Manuel Sorge (ATMOS, 2015)

Finding Highly Connected Subgraphs. - Falk Hüffner; Christian Komusiewicz; Manuel Sorge (SOFSEM, 2015)

Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. - Christian Komusiewicz; Manuel Sorge; Kolja Stahl (SEA, 2015)

Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. - René van Bevern; Iyad A. Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (CoRR, 2015)

An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. - Christian Komusiewicz; Manuel Sorge (Discret. Appl. Math., 2015)

On the Parameterized Complexity of Computing Balanced Partitions in Graphs. - René van Bevern; Andreas Emil Feldmann; Manuel Sorge; Ondrej Suchý 001 (Theory Comput. Syst., 2015)

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. - Jiehua Chen 001; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Ondrej Suchý 001; Mathias Weller (SIAM J. Discret. Math., 2015)

Enumerating maximal cliques in temporal graphs. - Anne-Sophie Himmel; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (ASONAM, 2016)

Twins in Subdivision Drawings of Hypergraphs. - René van Bevern; Iyad A. Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (GD, 2016)

Finding Secluded Places of Special Interest in Graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (IPEC, 2016)

H-index manipulation by merging articles: Models, theory, and experiments. - René van Bevern; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Toby Walsh (Artif. Intell., 2016)

The Minimum Shared Edges Problem on Planar Graphs. - Till Fluschnik; Manuel Sorge (CoRR, 2016)

Exploiting hidden structure in selecting dimensions that distinguish vectors. - Vincent Froese; René van Bevern; Rolf Niedermeier; Manuel Sorge (J. Comput. Syst. Sci., 2016)

Assessing the Computational Complexity of Multi-layer Subgraph Detection. - Robert Bredereck; Christian Komusiewicz; Stefan Kratsch; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (CIAC, 2017)

The Complexity of Routing with Few Collisions. - Till Fluschnik; Marco Morik; Manuel Sorge (FCT, 2017)

On Kernelization and Approximation for the Vector Connectivity Problem. - Stefan Kratsch; Manuel Sorge (Algorithmica, 2017)

A Parameterized View on Multi-Layer Cluster Editing. - Jiehua Chen 001; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (CoRR, 2017)

Algorithmic Aspects of Point Visibility Graphs. - Anne-Sophie Himmel; Clemens Hoffmann 002; Pascal Kunz 001; Vincent Froese; Manuel Sorge (CoRR, 2017)

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. - René van Bevern; Christian Komusiewicz; Manuel Sorge (Networks, 2017)

Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. - Anne-Sophie Himmel; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (Soc. Netw. Anal. Min., 2017)

Be sparse! Be dense! Be robust!: elements of parameterized algorithmics. - Manuel Sorge (2017)

How Hard Is It to Satisfy (Almost) All Roommates?. - Jiehua Chen 001; Danny Hermelin; Manuel Sorge; Harel Yedidsion (ICALP, 2018)

The Parameterized Complexity of Centrality Improvement in Networks. - Clemens Hoffmann 002; Hendrik Molter; Manuel Sorge (SOFSEM, 2018)

Matching algorithms for assigning orthologs after genome duplication events. - Guillaume Fertin; Falk Hüffner; Christian Komusiewicz; Manuel Sorge (Comput. Biol. Chem., 2018)

A Note on Clustering Aggregation. - Jiehua Chen 001; Danny Hermelin; Manuel Sorge (CoRR, 2018)

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. - René van Bevern; Till Fluschnik; George B. Mertzios; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (Discret. Optim., 2018)

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. - Iyad A. Kanj; Christian Komusiewicz; Manuel Sorge; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2018)

Matchings under Preferences: Strength of Stability and Trade-Offs. - Jiehua Chen 001; Piotr Skowron 001; Manuel Sorge (EC, 2019)

On Computing Centroids According to the p-Norms of Hamming Distance Vectors. - Jiehua Chen 001; Danny Hermelin; Manuel Sorge (ESA, 2019)

Packing Directed Circuits Quarter-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (ESA, 2019)

The Minimum Feasible Tileset Problem. - Yann Disser; Stefan Kratsch; Manuel Sorge (Algorithmica, 2019)

Cluster Editing parameterized above the size of a modification-disjoint P3 packing is para-NP-hard. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (CoRR, 2019)

Computational complexity aspects of point visibility graphs. - Anne-Sophie Himmel; Clemens Hoffmann 002; Pascal Kunz 001; Vincent Froese; Manuel Sorge (Discret. Appl. Math., 2019)

The parameterized complexity of the minimum shared edges problem. - Till Fluschnik; Stefan Kratsch; Rolf Niedermeier; Manuel Sorge (J. Comput. Syst. Sci., 2019)

The complexity of routing with collision avoidance. - Till Fluschnik; Marco Morik; Manuel Sorge (J. Comput. Syst. Sci., 2019)

Assessing the computational complexity of multilayer subgraph detection. - Robert Bredereck; Christian Komusiewicz; Stefan Kratsch; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (Netw. Sci., 2019)

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (ISAAC, 2020)

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. - Lukasz Kowalik; Marcin Mucha; Wojciech Nadara; Marcin Pilipczuk; Manuel Sorge; Piotr Wygocki (IPEC, 2020)

On Dynamic Parameterized k-Path. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Michal Pilipczuk; Marcin Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (CoRR, 2020)

A Double Exponential Lower Bound for the Distinct Vectors Problem. - Marcin Pilipczuk; Manuel Sorge (Discret. Math. Theor. Comput. Sci., 2020)

Efficient algorithms for measuring the funnel-likeness of DAGs. - Marcelo Garlet Millani; Hendrik Molter; Rolf Niedermeier; Manuel Sorge (J. Comb. Optim., 2020)

h-Index manipulation by undoing merges. - René van Bevern; Christian Komusiewicz; Hendrik Molter; Rolf Niedermeier; Manuel Sorge; Toby Walsh (Quant. Sci. Stud., 2020)

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. - Iyad Kanj; Christian Komusiewicz; Manuel Sorge; Erik Jan van Leeuwen (SIAM J. Discret. Math., 2020)

Fractional Matchings under Preferences: Stability and Optimality. - Jiehua Chen 001; Sanjukta Roy 001; Manuel Sorge (IJCAI, 2021)

On (Coalitional) Exchange-Stable Matching. - Jiehua Chen 001; Adrian Chmurovic; Fabian Jogl; Manuel Sorge (SAGT, 2021)

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (SODA, 2021)

Optimal Discretization is Fixed-parameter Tractable. - Stefan Kratsch; Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Manuel Sorge (SODA, 2021)

Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (STACS, 2021)

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. - Laurent Bulteau; Niels Grüttemeier; Christian Komusiewicz; Manuel Sorge (J. Comput. Syst. Sci., 2021)

Matchings under Preferences: Strength of Stability and Tradeoffs. - Jiehua Chen 001; Piotr Skowron 001; Manuel Sorge (ACM Trans. Economics and Comput., 2021)

Turbocharging Heuristics for Weak Coloring Numbers. - Alexander Dobler; Manuel Sorge; Anaïs Villedieu (ESA, 2022)

Planarizing Graphs and Their Drawings by Vertex Splitting. - Martin Nöllenburg; Manuel Sorge; Soeren Terziadis; Anaïs Villedieu; Hsiang-Yun Wu; Jules Wulms (GD, 2022)

Constant Congestion Brambles. - Meike Hatzel; Pawel Komosa; Marcin Pilipczuk; Manuel Sorge (Discret. Math. Theor. Comput. Sci., 2022)

Threshold Treewidth and Hypertree Width. - Robert Ganian; André Schidler; Manuel Sorge; Stefan Szeider (J. Artif. Intell. Res., 2022)

Constant Congestion Brambles in Directed Graphs. - Tomás Masarík; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (SIAM J. Discret. Math., 2022)

Packing Directed Cycles Quarter- and Half-Integrally. - Tomás Masarík; Irene Muzi; Marcin Pilipczuk; Pawel Rzazewski; Manuel Sorge (Comb., 2022)

Game Implementation: What Are the Obstructions? - Jiehua Chen 001; Seyedeh Negar Layegh Khavidaki; Sebastian Vincent Haydn; Sofia Simola; Manuel Sorge (AAAI, 2023)

On Computing Optimal Tree Ensembles. - Christian Komusiewicz; Pascal Kunz 001; Frank Sommer; Manuel Sorge (ICML, 2023)

Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. - Meike Hatzel; Lars Jaffke; Paloma T. Lima; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Manuel Sorge (SODA, 2023)

The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (Algorithmica, 2023)

On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. - Alexander Firbas; Manuel Sorge (ISAAC, 2024)

The role of twins in computing planar supports of hypergraphs. - René van Bevern; Iyad Kanj; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge (J. Graph Algorithms Appl., 2024)

A note on clustering aggregation for binary clusterings. - Jiehua Chen 001; Danny Hermelin; Manuel Sorge (Oper. Res. Lett., 2024)

Cluster Editing Parameterized above Modification-disjoint P3-packings. - Shaohua Li 005; Marcin Pilipczuk; Manuel Sorge (ACM Trans. Algorithms, 2024)

Cluster Editing for Multi-Layer and Temporal Graphs. - Jiehua Chen 001; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (Theory Comput. Syst., 2024)

Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. - Luca Pascal Staus; Christian Komusiewicz; Frank Sommer; Manuel Sorge (AAAI, 2025)

The influence of dimensions on the complexity of computing decision trees. - Stephen G. Kobourov; Maarten Löffler; Fabrizio Montecchiani; Marcin Pilipczuk; Ignaz Rutter; Raimund Seidel; Manuel Sorge; Jules Wulms (Artif. Intell., 2025)

The complexity of cluster vertex splitting and company. - Alexander Firbas; Alexander Dobler; Fabian Holzer; Jakob Schafellner; Manuel Sorge; Anaïs Villedieu; Monika Wißmann (Discret. Appl. Math., 2025)

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. - Juha Harviainen; Frank Sommer; Manuel Sorge; Stefan Szeider (CoRR, 2025)