Manuel Sorge

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 94

Top Venues

CoRR

J. Comput. Syst. Sci.

ESA

IPEC

Technical University of Berlin, Germany (PHD)

Education History

Technical University of Berlin, Germany

PHD

Publications

Jiehua Chen, Danny Hermelin, Manuel Sorge
A note on clustering aggregation for binary clusterings. Oper. Res. Lett. 52 (2024)
Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
The Complexity of Cluster Vertex Splitting and Company. SOFSEM (2024)
Alexander Firbas, Manuel Sorge
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. CoRR (2024)
Shaohua Li, Marcin Pilipczuk, Manuel Sorge
-packings. ACM Trans. Algorithms 20 (1) (2024)
Jiehua Chen, Seyedeh Negar Layegh Khavidaki, Sebastian Vincent Haydn, Sofia Simola, Manuel Sorge
Game Implementation: What Are the Obstructions? AAAI (2023)
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
On Computing Optimal Tree Ensembles. ICML (2023)
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
On Computing Optimal Tree Ensembles. CoRR (2023)
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI (2023)
Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
The Complexity of Cluster Vertex Splitting and Company. CoRR (2023)
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA (2023)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Algorithmica 85 (5) (2023)
Jiehua Chen, Sebastian Vincent Haydn, Negar Layegh Khavidaki, Sofia Simola, Manuel Sorge
Game Implementation: What Are the Obstructions? CoRR (2022)
Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. 36 (2) (2022)
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
Threshold Treewidth and Hypertree Width. J. Artif. Intell. Res. 74 (2022)
Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
Constant Congestion Brambles. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Packing Directed Cycles Quarter- and Half-Integrally. Comb. 42 (Supplement 2) (2022)
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR (2022)
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
The Influence of Dimensions on the Complexity of Computing Decision Trees. CoRR (2022)
Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
Planarizing Graphs and their Drawings by Vertex Splitting. CoRR (2022)
Alexander Dobler, Manuel Sorge, Anaïs Villedieu
Turbocharging Heuristics for Weak Coloring Numbers. CoRR (2022)
Alexander Dobler, Manuel Sorge, Anaïs Villedieu
Turbocharging Heuristics for Weak Coloring Numbers. ESA (2022)
André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider
Threshold Treewidth and Hypertree Width. CoRR (2022)
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
Planarizing Graphs and Their Drawings by Vertex Splitting. GD (2022)
Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge
On (Coalitional) Exchange-Stable Matching. CoRR (2021)
Shaohua Li, Marcin Pilipczuk, Manuel Sorge
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. STACS (2021)
Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Constant congestion brambles in directed graphs. CoRR (2021)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. 120 (2021)
Jiehua Chen, Piotr Skowron, Manuel Sorge
Matchings under Preferences: Strength of Stability and Tradeoffs. ACM Trans. Economics and Comput. 9 (4) (2021)
Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge
On (Coalitional) Exchange-Stable Matching. SAGT (2021)
Jiehua Chen, Sanjukta Roy, Manuel Sorge
Fractional Matchings under Preferences: Stability and Optimality. IJCAI (2021)
Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
Optimal Discretization is Fixed-parameter Tractable. SODA (2021)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA (2021)
Marcin Pilipczuk, Manuel Sorge
A Double Exponential Lower Bound for the Distinct Vectors Problem. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC (2020)
Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
Optimal Discretization is Fixed-parameter Tractable. CoRR (2020)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR (2020)
Marcin Pilipczuk, Manuel Sorge
A Double Exponential Lower Bound for the Distinct Vectors Problem. CoRR (2020)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
On Dynamic Parameterized k-Path. CoRR (2020)
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
Threshold Treewidth and Hypertree Width. IJCAI (2020)
Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC (2020)
Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
Constant Congestion Brambles. CoRR (2020)
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. 39 (1) (2020)
Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. 34 (1) (2020)
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1 (4) (2020)
Jiehua Chen, Sanjukta Roy, Manuel Sorge
Fractional Matchings under Preferences: Stability and Optimality. CoRR (2020)
Jiehua Chen, Piotr Skowron, Manuel Sorge
Matchings under Preferences: Strength of Stability and Trade-offs. CoRR (2019)
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. 106 (2019)
Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Packing directed circuits quarter-integrally. CoRR (2019)
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7 (2) (2019)
Shaohua Li, Marcin Pilipczuk, Manuel Sorge
packing is para-NP-hard. CoRR (2019)
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254 (2019)
Jiehua Chen, Piotr Skowron, Manuel Sorge
Matchings under Preferences: Strength of Stability and Trade-Offs. EC (2019)
Till Fluschnik, Marco Morik, Manuel Sorge
The complexity of routing with collision avoidance. J. Comput. Syst. Sci. 102 (2019)
Jiehua Chen, Danny Hermelin, Manuel Sorge
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. ESA (2019)
Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
Packing Directed Circuits Quarter-Integrally. ESA (2019)
Yann Disser, Stefan Kratsch, Manuel Sorge
The Minimum Feasible Tileset Problem. Algorithmica 81 (3) (2019)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. CIAC (2019)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA (2018)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30 (2018)
Jiehua Chen, Danny Hermelin, Manuel Sorge
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. CoRR (2018)
Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion
How Hard Is It to Satisfy (Almost) All Roommates?. ICALP (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR (2018)
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Cluster Editing in Multi-Layer and Temporal Graphs. ISAAC (2018)
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. 92 (2018)
Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO (2018)
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. CoRR (2018)
Clemens Hoffmann, Hendrik Molter, Manuel Sorge
The Parameterized Complexity of Centrality Improvement in Networks. SOFSEM (2018)
Jiehua Chen, Danny Hermelin, Manuel Sorge
A Note on Clustering Aggregation. CoRR (2018)
Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge
Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. 74 (2018)
Clemens Hoffmann, Hendrik Molter, Manuel Sorge
The Parameterized Complexity of Centrality Improvement in Networks. CoRR (2017)
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
A Parameterized View on Multi-Layer Cluster Editing. CoRR (2017)
Till Fluschnik, Marco Morik, Manuel Sorge
The Complexity of Routing with Few Collisions. CoRR (2017)
Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion
How hard is it to satisfy (almost) all roommates? CoRR (2017)
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
Algorithmic Aspects of Point Visibility Graphs. CoRR (2017)
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7 (1) (2017)
Till Fluschnik, Marco Morik, Manuel Sorge
The Complexity of Routing with Few Collisions. FCT (2017)
René van Bevern, Christian Komusiewicz, Manuel Sorge
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Networks 70 (3) (2017)
Stefan Kratsch, Manuel Sorge
On Kernelization and Approximation for the Vector Connectivity Problem. Algorithmica 79 (1) (2017)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR (2017)
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC (2017)
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
h-Index Manipulation by Undoing Merges. ECAI (2016)
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Enumerating Maximal Cliques in Temporal Graphs. CoRR (2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. CoRR (2016)
Till Fluschnik, Manuel Sorge
The Minimum Shared Edges Problem on Planar Graphs. CoRR (2016)
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
Twins in Subdivision Drawings of Hypergraphs. Graph Drawing (2016)
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Enumerating maximal cliques in temporal graphs. ASONAM (2016)
Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. 82 (3) (2016)
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
h-Index Manipulation by Undoing Merges. CoRR (2016)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT (2016)
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. 240 (2016)
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
The Parameterized Complexity of the Minimum Shared Edges Problem. CoRR (2016)
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR (2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. IPEC (2016)
René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI (2015)
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst. 57 (1) (2015)
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR (2015)
Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. 29 (1) (2015)
Stefan Kratsch, Manuel Sorge
On Kernelization and Approximation for the Vector Connectivity Problem. IPEC (2015)
Christian Komusiewicz, Manuel Sorge
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Discret. Appl. Math. 193 (2015)

Manuel Sorge.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Manuel Sorge