Manuel Sorge - RankMe

143 papers A* 15A 8B 20C 6Journal 91Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	How Hard Is It to Explain Preferences Using Few Boolean Attributes? AAAI Clemens Anzinger, Jiehua Chen, Christian Hatschka, Manuel Sorge, Alexander Temper
2025	J	`jnl`	How Hard is it to Explain Preferences Using Few Boolean Attributes? CoRR Clemens Anzinger, Jiehua Chen, Christian Hatschka, Manuel Sorge, Alexander Temper
2025	J	`jnl`	Improving Decision Trees through the Lens of Parameterized Local Search. CoRR Juha Harviainen, Frank Sommer, Manuel Sorge
2025	A*	`conf`	Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms. ICML Christian Komusiewicz, André Schidler, Frank Sommer, Manuel Sorge, Luca Pascal Staus
2025	A*	`conf`	Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. ICML Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider
2025	J	`jnl`	Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. CoRR Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider
2025	J	`jnl`	Planarizing graphs and their drawings by vertex splitting. J. Comput. Geom. Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
2025	J	`jnl`	The complexity of cluster vertex splitting and company. Discret. Appl. Math. Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
2025	J	`jnl`	The influence of dimensions on the complexity of computing decision trees. Artif. Intell. Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2025	A*	`conf`	Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. AAAI Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge
2024	J	`jnl`	A note on clustering aggregation for binary clusterings. Oper. Res. Lett. Jiehua Chen, Danny Hermelin, Manuel Sorge
2024	J	`jnl`	Cluster Editing Parameterized above Modification-disjoint ACM Trans. Algorithms Shaohua Li, Marcin Pilipczuk, Manuel Sorge
2024	J	`jnl`	Cluster Editing for Multi-Layer and Temporal Graphs. Theory Comput. Syst. Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2024	B	`conf`	On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. ISAAC Alexander Firbas, Manuel Sorge
2024	J	`jnl`	On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. CoRR Alexander Firbas, Manuel Sorge
2024	B	`conf`	The Complexity of Cluster Vertex Splitting and Company. SOFSEM Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
2024	J	`jnl`	The role of twins in computing planar supports of hypergraphs. J. Graph Algorithms Appl. René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2024	J	`jnl`	Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. CoRR Luca Pascal Staus, Christian Komusiewicz, Frank Sommer, Manuel Sorge
2023	A*	`conf`	Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
2023	A*	`conf`	Game Implementation: What Are the Obstructions? AAAI Jiehua Chen, Seyedeh Negar Layegh Khavidaki, Sebastian Vincent Haydn, Sofia Simola, Manuel Sorge
2023	A*	`conf`	On Computing Optimal Tree Ensembles. ICML Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
2023	J	`jnl`	On Computing Optimal Tree Ensembles. CoRR Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
2023	J	`jnl`	The Complexity of Cluster Vertex Splitting and Company. CoRR Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
2023	J	`jnl`	The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Algorithmica Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2023	A*	`conf`	The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2022	J	`jnl`	Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2022	J	`jnl`	Constant Congestion Brambles. Discret. Math. Theor. Comput. Sci. Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
2022	J	`jnl`	Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
2022	J	`jnl`	Game Implementation: What Are the Obstructions? CoRR Jiehua Chen, Sebastian Vincent Haydn, Negar Layegh Khavidaki, Sofia Simola, Manuel Sorge
2022	J	`jnl`	Packing Directed Cycles Quarter- and Half-Integrally. Comb. Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2022	A	`conf`	Planarizing Graphs and Their Drawings by Vertex Splitting. GD Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
2022	J	`jnl`	Planarizing Graphs and their Drawings by Vertex Splitting. CoRR Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
2022	J	`jnl`	The Influence of Dimensions on the Complexity of Computing Decision Trees. CoRR Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2022	J	`jnl`	Threshold Treewidth and Hypertree Width. CoRR André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider
2022	J	`jnl`	Threshold Treewidth and Hypertree Width. J. Artif. Intell. Res. Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
2022	A	`conf`	Turbocharging Heuristics for Weak Coloring Numbers. ESA Alexander Dobler, Manuel Sorge, Anaïs Villedieu
2022	J	`jnl`	Turbocharging Heuristics for Weak Coloring Numbers. CoRR Alexander Dobler, Manuel Sorge, Anaïs Villedieu
2021	A	`conf`	Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. STACS Shaohua Li, Marcin Pilipczuk, Manuel Sorge
2021	J	`jnl`	Constant congestion brambles in directed graphs. CoRR Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2021	A*	`conf`	Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 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
2021	A*	`conf`	Fractional Matchings under Preferences: Stability and Optimality. IJCAI Jiehua Chen, Sanjukta Roy, Manuel Sorge
2021	J	`jnl`	Matchings under Preferences: Strength of Stability and Tradeoffs. ACM Trans. Economics and Comput. Jiehua Chen, Piotr Skowron, Manuel Sorge
2021	B	`conf`	On (Coalitional) Exchange-Stable Matching. SAGT Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge
2021	J	`jnl`	On (Coalitional) Exchange-Stable Matching. CoRR Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge
2021	A*	`conf`	Optimal Discretization is Fixed-parameter Tractable. SODA Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
2021	J	`jnl`	Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2020	J	`jnl`	A Double Exponential Lower Bound for the Distinct Vectors Problem. CoRR Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	A Double Exponential Lower Bound for the Distinct Vectors Problem. Discret. Math. Theor. Comput. Sci. Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	Constant Congestion Brambles. CoRR Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2020	J	`jnl`	Fractional Matchings under Preferences: Stability and Optimality. CoRR Jiehua Chen, Sanjukta Roy, Manuel Sorge
2020	J	`jnl`	On Dynamic Parameterized k-Path. CoRR 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
2020	J	`jnl`	Optimal Discretization is Fixed-parameter Tractable. CoRR Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2020	B	`conf`	The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2020	J	`jnl`	The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
2020	B	`conf`	The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki
2020	A*	`conf`	Threshold Treewidth and Hypertree Width. IJCAI Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
2020	J	`jnl`	h-Index manipulation by undoing merges. Quant. Sci. Stud. René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2019	J	`jnl`	Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2019	J	`jnl`	Cluster Editing parameterized above the size of a modification-disjoint P CoRR Shaohua Li, Marcin Pilipczuk, Manuel Sorge
2019	J	`jnl`	Computational complexity aspects of point visibility graphs. Discret. Appl. Math. Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
2019	A*	`conf`	Matchings under Preferences: Strength of Stability and Trade-Offs. EC Jiehua Chen, Piotr Skowron, Manuel Sorge
2019	J	`jnl`	Matchings under Preferences: Strength of Stability and Trade-offs. CoRR Jiehua Chen, Piotr Skowron, Manuel Sorge
2019	A	`conf`	On Computing Centroids According to the p-Norms of Hamming Distance Vectors. ESA Jiehua Chen, Danny Hermelin, Manuel Sorge
2019	A	`conf`	Packing Directed Circuits Quarter-Integrally. ESA Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2019	J	`jnl`	Packing directed circuits quarter-integrally. CoRR Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge
2019	J	`jnl`	The Minimum Feasible Tileset Problem. Algorithmica Yann Disser, Stefan Kratsch, Manuel Sorge
2019	J	`jnl`	The complexity of routing with collision avoidance. J. Comput. Syst. Sci. Till Fluschnik, Marco Morik, Manuel Sorge
2019	J	`jnl`	The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
2019	C	`conf`	Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. CIAC Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2018	J	`jnl`	A Note on Clustering Aggregation. CoRR Jiehua Chen, Danny Hermelin, Manuel Sorge
2018	B	`conf`	Cluster Editing in Multi-Layer and Temporal Graphs. ISAAC Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2018	C	`conf`	Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2018	J	`jnl`	Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2018	A*	`conf`	How Hard Is It to Satisfy (Almost) All Roommates?. ICALP Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion
2018	J	`jnl`	Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge
2018	J	`jnl`	On Computing Centroids According to the p-Norms of Hamming Distance Vectors. CoRR Jiehua Chen, Danny Hermelin, Manuel Sorge
2018	J	`jnl`	Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018	A	`conf`	Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018	J	`jnl`	Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018	B	`conf`	The Parameterized Complexity of Centrality Improvement in Networks. SOFSEM Clemens Hoffmann, Hendrik Molter, Manuel Sorge
2018	J	`jnl`	The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2018	J	`jnl`	Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. CoRR Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2017	J	`jnl`	A Parameterized View on Multi-Layer Cluster Editing. CoRR Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2017	J	`jnl`	A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Networks René van Bevern, Christian Komusiewicz, Manuel Sorge
2017	J	`jnl`	Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017	J	`jnl`	Algorithmic Aspects of Point Visibility Graphs. CoRR Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge
2017	C	`conf`	Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017	—	`—`	Be sparse! Be dense! Be robust!: elements of parameterized algorithmics. Manuel Sorge
2017	J	`jnl`	How hard is it to satisfy (almost) all roommates? CoRR Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion
2017	J	`jnl`	On Kernelization and Approximation for the Vector Connectivity Problem. Algorithmica Stefan Kratsch, Manuel Sorge
2017	J	`jnl`	Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2017	B	`conf`	The Complexity of Routing with Few Collisions. FCT Till Fluschnik, Marco Morik, Manuel Sorge
2017	J	`jnl`	The Complexity of Routing with Few Collisions. CoRR Till Fluschnik, Marco Morik, Manuel Sorge
2017	J	`jnl`	The Parameterized Complexity of Centrality Improvement in Networks. CoRR Clemens Hoffmann, Hendrik Molter, Manuel Sorge
2016	J	`jnl`	Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	J	`jnl`	Enumerating Maximal Cliques in Temporal Graphs. CoRR Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	B	`conf`	Enumerating maximal cliques in temporal graphs. ASONAM Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	J	`jnl`	Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2016	B	`conf`	Finding Secluded Places of Special Interest in Graphs. IPEC René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016	J	`jnl`	Finding Secluded Places of Special Interest in Graphs. CoRR René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016	J	`jnl`	H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016	—	`conf`	Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2016	J	`jnl`	The Minimum Shared Edges Problem on Planar Graphs. CoRR Till Fluschnik, Manuel Sorge
2016	J	`jnl`	The Parameterized Complexity of the Minimum Shared Edges Problem. CoRR Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
2016	A	`conf`	Twins in Subdivision Drawings of Hypergraphs. GD René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2016	A	`conf`	h-Index Manipulation by Undoing Merges. ECAI René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016	J	`jnl`	h-Index Manipulation by Undoing Merges. CoRR René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2015	J	`jnl`	An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Discret. Appl. Math. Christian Komusiewicz, Manuel Sorge
2015	C	`conf`	Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. ATMOS René van Bevern, Christian Komusiewicz, Manuel Sorge
2015	J	`jnl`	Approximation algorithms for mixed, windy, and capacitated arc routing problems. CoRR René van Bevern, Christian Komusiewicz, Manuel Sorge
2015	J	`jnl`	Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2015	B	`conf`	Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. SEA Christian Komusiewicz, Manuel Sorge, Kolja Stahl
2015	B	`conf`	Finding Highly Connected Subgraphs. SOFSEM Falk Hüffner, Christian Komusiewicz, Manuel Sorge
2015	A*	`conf`	H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2015	B	`conf`	On Kernelization and Approximation for the Vector Connectivity Problem. IPEC Stefan Kratsch, Manuel Sorge
2015	J	`jnl`	On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst. René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2015	J	`jnl`	Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
2015	—	`conf`	The Parameterized Complexity of the Minimum Shared Edges Problem. FSTTCS Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
2015	J	`jnl`	Twins in Subdivision Drawings of Hypergraphs. CoRR René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2015	J	`jnl`	Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2014	J	`jnl`	Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
2014	J	`jnl`	Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
2014	J	`jnl`	Exploiting a hypergraph model for finding Golomb rulers. Acta Informatica Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller
2014	J	`jnl`	On Google Scholar H-Index Manipulation by Merging Articles. CoRR René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2014	J	`jnl`	On Kernelization and Approximation for the Vector Connectivity Problem. CoRR Stefan Kratsch, Manuel Sorge
2014	B	`conf`	The Minimum Feasible Tileset Problem. WAOA Yann Disser, Stefan Kratsch, Manuel Sorge
2014	J	`jnl`	The Minimum Feasible Tileset problem. CoRR Yann Disser, Stefan Kratsch, Manuel Sorge
2013	J	`jnl`	A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs. CoRR Manuel Sorge
2013	B	`conf`	A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge
2013	B	`conf`	Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller
2013	J	`jnl`	On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2013	B	`conf`	On the Parameterized Complexity of Computing Graph Bisections. WG René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý
2012	J	`jnl`	A new view on Rural Postman based on Eulerian Extension and Matching. J. Discrete Algorithms Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2012	J	`jnl`	Exact combinatorial algorithms and experiments for finding maximum k-plexes. J. Comb. Optim. Hannes Moser, Rolf Niedermeier, Manuel Sorge
2012	C	`conf`	Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller
2012	B	`conf`	Finding Dense Subgraphs of Sparse Graphs. IPEC Christian Komusiewicz, Manuel Sorge
2011	C	`conf`	A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2011	B	`conf`	From Few Components to an Eulerian Graph by Adding Arcs. WG Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller
2011	J	`jnl`	On Making Directed Graphs Eulerian CoRR Manuel Sorge
2010	J	`jnl`	Algorithmic Aspects of Golomb Ruler Construction CoRR Manuel Sorge
2009	B	`conf`	Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA Hannes Moser, Rolf Niedermeier, Manuel Sorge