Manuel Sorge
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
40
Venues
20
Active years
2011–2026
Best venue rank
A*
Where they publish
Papers
40 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | How Hard Is It to Explain Preferences Using Few Boolean Attributes? | Clemens Anzinger, Jiehua Chen, Christian Hatschka, Manuel Sorge, Alexander Temper |
| 2025 | AAAI | Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. | Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge |
| 2025 | ICML | Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. | Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider |
| 2025 | ICML | Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms. | Christian Komusiewicz, Andr Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus |
| 2024 | ISAAC | On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. | Alexander Firbas, Manuel Sorge |
| 2024 | SOFSEM | The Complexity of Cluster Vertex Splitting and Company. | Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anas Villedieu, Monika Wimann |
| 2023 | AAAI | Game Implementation: What Are the Obstructions? | Jiehua Chen, Seyedeh Negar Layegh Khavidaki, Sebastian Vincent Haydn, Sofia Simola, Manuel Sorge |
| 2023 | AAAI | The Influence of Dimensions on the Complexity of Computing Decision Trees. | Stephen G. Kobourov, Maarten Lffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms |
| 2023 | ICML | On Computing Optimal Tree Ensembles. | Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge |
| 2023 | SODA | 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, Toms Masark, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge |
| 2022 | ESA | Turbocharging Heuristics for Weak Coloring Numbers. | Alexander Dobler, Manuel Sorge, Anas Villedieu |
| 2022 | GD | Planarizing Graphs and Their Drawings by Vertex Splitting. | Martin Nllenburg, Manuel Sorge, Soeren Terziadis, Anas Villedieu, Hsiang-Yun Wu, Jules Wulms |
| 2021 | IJCAI | Fractional Matchings under Preferences: Stability and Optimality. | Jiehua Chen, Sanjukta Roy, Manuel Sorge |
| 2021 | SODA | Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. | Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wrblewski, Anna Zych-Pawlewicz |
| 2021 | SODA | Optimal Discretization is Fixed-parameter Tractable. | Stefan Kratsch, Toms Masark, Irene Muzi, Marcin Pilipczuk, Manuel Sorge |
| 2021 | STACS | Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. | Shaohua Li, Marcin Pilipczuk, Manuel Sorge |
| 2021 | SAGT | On (Coalitional) Exchange-Stable Matching. | Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge |
| 2020 | IJCAI | Threshold Treewidth and Hypertree Width. | Robert Ganian, Andr Schidler, Manuel Sorge, Stefan Szeider |
| 2020 | ISAAC | The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. | Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge |
| 2019 | CIAC | Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. | Laurent Bulteau, Niels Grttemeier, Christian Komusiewicz, Manuel Sorge |
| 2019 | EC | Matchings under Preferences: Strength of Stability and Trade-Offs. | Jiehua Chen, Piotr Skowron, Manuel Sorge |
| 2019 | ESA | On Computing Centroids According to the p-Norms of Hamming Distance Vectors. | Jiehua Chen, Danny Hermelin, Manuel Sorge |
| 2019 | ESA | Packing Directed Circuits Quarter-Integrally. | Toms Masark, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge |
| 2018 | ESA | Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. | Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen |
| 2018 | ICALP | How Hard Is It to Satisfy (Almost) All Roommates?. | Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion |
| 2018 | ISAAC | Cluster Editing in Multi-Layer and Temporal Graphs. | Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Such |
| 2018 | SOFSEM | The Parameterized Complexity of Centrality Improvement in Networks. | Clemens Hoffmann, Hendrik Molter, Manuel Sorge |
| 2017 | CIAC | Assessing the Computational Complexity of Multi-layer Subgraph Detection. | Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge |
| 2017 | FCT | The Complexity of Routing with Few Collisions. | Till Fluschnik, Marco Morik, Manuel Sorge |
| 2016 | ECAI | h-Index Manipulation by Undoing Merges. | Ren van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh |
| 2016 | GD | Twins in Subdivision Drawings of Hypergraphs. | Ren van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge |
| 2015 | ATMOS | Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. | Ren van Bevern, Christian Komusiewicz, Manuel Sorge |
| 2015 | IJCAI | H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. | Ren van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh |
| 2015 | SOFSEM | Finding Highly Connected Subgraphs. | Falk Hffner, Christian Komusiewicz, Manuel Sorge |
| 2014 | WAOA | The Minimum Feasible Tileset Problem. | Yann Disser, Stefan Kratsch, Manuel Sorge |
| 2013 | ISAAC | Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. | Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Such, Mathias Weller |
| 2013 | MFCS | A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. | Vincent Froese, Ren van Bevern, Rolf Niedermeier, Manuel Sorge |
| 2013 | WG | On the Parameterized Complexity of Computing Graph Bisections. | Ren van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Such |
| 2011 | IWOCA | A New View on Rural Postman Based on Eulerian Extension and Matching. | Manuel Sorge, Ren van Bevern, Rolf Niedermeier, Mathias Weller |
| 2011 | WG | From Few Components to an Eulerian Graph by Adding Arcs. | Manuel Sorge, Ren van Bevern, Rolf Niedermeier, Mathias Weller |