default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuel Sorge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Cluster Editing for Multi-Layer and Temporal Graphs. Theory Comput. Syst. 68(5): 1239-1290 (2024)- [j33]Jiehua Chen, Danny Hermelin, Manuel Sorge:
A note on clustering aggregation for binary clusterings. Oper. Res. Lett. 52: 107052 (2024) - [j32]Shaohua Li
, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing Parameterized above Modification-disjoint P3-packings. ACM Trans. Algorithms 20(1): 3:1-3:43 (2024) - [c46]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: 226-239 - [i49]Alexander Firbas, Manuel Sorge:
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. CoRR abs/2401.16296 (2024) - 2023
- [j31]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): 1202-1250 (2023) - [c45]Jiehua Chen, Seyedeh Negar Layegh Khavidaki, Sebastian Vincent Haydn, Sofia Simola, Manuel Sorge:
Game Implementation: What Are the Obstructions? AAAI 2023: 5557-5564 - [c44]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: 8343-8350 - [c43]Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge:
On Computing Optimal Tree Ensembles. ICML 2023: 17364-17374 - [c42]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: 3229-3244 - [i48]Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge:
On Computing Optimal Tree Ensembles. CoRR abs/2306.04423 (2023) - [i47]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 abs/2309.00504 (2023) - 2022
- [j30]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Cycles Quarter- and Half-Integrally. Comb. 42(Supplement 2): 1409-1438 (2022) - [j29]Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge:
Constant Congestion Brambles. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j28]Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. J. Artif. Intell. Res. 74: 1687-1713 (2022) - [j27]Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. 36(2): 922-938 (2022) - [c41]Alexander Dobler, Manuel Sorge, Anaïs Villedieu:
Turbocharging Heuristics for Weak Coloring Numbers. ESA 2022: 44:1-44:18 - [c40]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: 232-246 - [i46]Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms:
Planarizing Graphs and their Drawings by Vertex Splitting. CoRR abs/2202.12293 (2022) - [i45]Alexander Dobler, Manuel Sorge, Anaïs Villedieu:
Turbocharging Heuristics for Weak Coloring Numbers. CoRR abs/2203.03358 (2022) - [i44]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 abs/2205.07756 (2022) - [i43]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 abs/2207.07425 (2022) - [i42]André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. CoRR abs/2210.07040 (2022) - [i41]Jiehua Chen, Sebastian Vincent Haydn, Negar Layegh Khavidaki, Sofia Simola, Manuel Sorge:
Game Implementation: What Are the Obstructions? CoRR abs/2212.00699 (2022) - 2021
- [j26]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: 75-96 (2021) - [j25]Jiehua Chen, Piotr Skowron, Manuel Sorge:
Matchings under Preferences: Strength of Stability and Tradeoffs. ACM Trans. Economics and Comput. 9(4): 20:1-20:55 (2021) - [c39]Jiehua Chen, Sanjukta Roy, Manuel Sorge:
Fractional Matchings under Preferences: Stability and Optimality. IJCAI 2021: 89-95 - [c38]Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge:
On (Coalitional) Exchange-Stable Matching. SAGT 2021: 205-220 - [c37]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: 796-809 - [c36]Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. SODA 2021: 1702-1719 - [c35]Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. STACS 2021: 49:1-49:16 - [i40]Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant congestion brambles in directed graphs. CoRR abs/2103.08445 (2021) - [i39]Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge:
On (Coalitional) Exchange-Stable Matching. CoRR abs/2105.05725 (2021) - 2020
- [j24]Marcin Pilipczuk, Manuel Sorge:
A Double Exponential Lower Bound for the Distinct Vectors Problem. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j23]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. 39(1): 216-245 (2020) - [j22]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1(4): 1529-1552 (2020) - [j21]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): 640-681 (2020) - [c34]Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. IJCAI 2020: 1898-1904 - [c33]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: 59:1-59:15 - [c32]Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki:
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC 2020: 37:1-37:18 - [i38]Marcin Pilipczuk, Manuel Sorge:
A Double Exponential Lower Bound for the Distinct Vectors Problem. CoRR abs/2002.01293 (2020) - [i37]Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. CoRR abs/2003.02475 (2020) - [i36]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 abs/2006.00571 (2020) - [i35]Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge:
Constant Congestion Brambles. CoRR abs/2008.02133 (2020) - [i34]Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR abs/2009.12892 (2020) - [i33]Jiehua Chen, Sanjukta Roy, Manuel Sorge:
Fractional Matchings under Preferences: Stability and Optimality. CoRR abs/2011.12259 (2020)
2010 – 2019
- 2019
- [j20]Yann Disser, Stefan Kratsch, Manuel Sorge:
The Minimum Feasible Tileset Problem. Algorithmica 81(3): 1126-1151 (2019) - [j19]Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge:
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254: 283-290 (2019) - [j18]Till Fluschnik, Marco Morik, Manuel Sorge:
The complexity of routing with collision avoidance. J. Comput. Syst. Sci. 102: 69-86 (2019) - [j17]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. 106: 23-48 (2019) - [j16]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7(2): 215-241 (2019) - [c31]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: 99-111 - [c30]Jiehua Chen, Piotr Skowron, Manuel Sorge:
Matchings under Preferences: Strength of Stability and Trade-Offs. EC 2019: 41-59 - [c29]Jiehua Chen, Danny Hermelin, Manuel Sorge:
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. ESA 2019: 28:1-28:16 - [c28]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Circuits Quarter-Integrally. ESA 2019: 72:1-72:13 - [i32]Jiehua Chen, Piotr Skowron, Manuel Sorge:
Matchings under Preferences: Strength of Stability and Trade-offs. CoRR abs/1902.10535 (2019) - [i31]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing directed circuits quarter-integrally. CoRR abs/1907.02494 (2019) - [i30]Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing parameterized above the size of a modification-disjoint P3 packing is para-NP-hard. CoRR abs/1910.08517 (2019) - 2018
- [j15]Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge:
Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. 74: 379-390 (2018) - [j14]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: 20-50 (2018) - [j13]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: 22-47 (2018) - [c27]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA 2018: 51:1-51:14 - [c26]Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion:
How Hard Is It to Satisfy (Almost) All Roommates?. ICALP 2018: 35:1-35:15 - [c25]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Cluster Editing in Multi-Layer and Temporal Graphs. ISAAC 2018: 24:1-24:13 - [c24]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO 2018: 183-195 - [c23]Clemens Hoffmann, Hendrik Molter, Manuel Sorge:
The Parameterized Complexity of Centrality Improvement in Networks. SOFSEM 2018: 111-124 - [i29]Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR abs/1801.10401 (2018) - [i28]Jiehua Chen, Danny Hermelin, Manuel Sorge:
On Computing Centroids According to the p-Norms of Hamming Distance Vectors. CoRR abs/1807.06469 (2018) - [i27]Jiehua Chen, Danny Hermelin, Manuel Sorge:
A Note on Clustering Aggregation. CoRR abs/1807.08949 (2018) - [i26]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR abs/1808.08772 (2018) - [i25]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 abs/1811.09411 (2018) - 2017
- [b1]Manuel Sorge:
Be sparse! Be dense! Be robust!: elements of parameterized algorithmics. Technical University of Berlin, Germany, 2017, ISBN 978-3-7983-2885-3, pp. 1-251 - [j12]Stefan Kratsch, Manuel Sorge:
On Kernelization and Approximation for the Vector Connectivity Problem. Algorithmica 79(1): 96-138 (2017) - [j11]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): 262-278 (2017) - [j10]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): 35:1-35:16 (2017) - [c22]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC 2017: 128-139 - [c21]Till Fluschnik, Marco Morik, Manuel Sorge:
The Complexity of Routing with Few Collisions. FCT 2017: 257-270 - [i24]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR abs/1702.04322 (2017) - [i23]Till Fluschnik, Marco Morik, Manuel Sorge:
The Complexity of Routing with Few Collisions. CoRR abs/1705.03673 (2017) - [i22]Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion:
How hard is it to satisfy (almost) all roommates? CoRR abs/1707.04316 (2017) - [i21]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
A Parameterized View on Multi-Layer Cluster Editing. CoRR abs/1709.09100 (2017) - [i20]Clemens Hoffmann, Hendrik Molter, Manuel Sorge:
The Parameterized Complexity of Centrality Improvement in Networks. CoRR abs/1710.01576 (2017) - [i19]Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge:
Algorithmic Aspects of Point Visibility Graphs. CoRR abs/1711.01811 (2017) - 2016
- [j9]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. 240: 19-35 (2016) - [j8]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting hidden structure in selecting dimensions that distinguish vectors. J. Comput. Syst. Sci. 82(3): 521-535 (2016) - [c20]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Enumerating maximal cliques in temporal graphs. ASONAM 2016: 337-344 - [c19]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. ECAI 2016: 895-903 - [c18]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. GD 2016: 67-80 - [c17]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. IPEC 2016: 5:1-5:16 - [c16]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT 2016: 14:1-14:14 - [i18]Till Fluschnik, Manuel Sorge:
The Minimum Shared Edges Problem on Planar Graphs. CoRR abs/1602.01385 (2016) - [i17]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The Parameterized Complexity of the Minimum Shared Edges Problem. CoRR abs/1602.01739 (2016) - [i16]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. CoRR abs/1604.04827 (2016) - [i15]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR abs/1604.07724 (2016) - [i14]Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Enumerating Maximal Cliques in Temporal Graphs. CoRR abs/1605.03871 (2016) - [i13]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. CoRR abs/1606.09000 (2016) - 2015
- [j7]Christian Komusiewicz, Manuel Sorge:
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Discret. Appl. Math. 193: 145-161 (2015) - [j6]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): 1-35 (2015) - [j5]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): 1-25 (2015) - [c15]René van Bevern, Christian Komusiewicz, Manuel Sorge:
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. ATMOS 2015: 130-143 - [c14]Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The Parameterized Complexity of the Minimum Shared Edges Problem. FSTTCS 2015: 448-462 - [c13]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI 2015: 808-814 - [c12]Stefan Kratsch, Manuel Sorge:
On Kernelization and Approximation for the Vector Connectivity Problem. IPEC 2015: 377-388 - [c11]Falk Hüffner, Christian Komusiewicz, Manuel Sorge:
Finding Highly Connected Subgraphs. SOFSEM 2015: 254-265 - [c10]Christian Komusiewicz, Manuel Sorge, Kolja Stahl:
Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. SEA 2015: 82-93 - [i12]René van Bevern, Christian Komusiewicz, Manuel Sorge:
Approximation algorithms for mixed, windy, and capacitated arc routing problems. CoRR abs/1506.05620 (2015) - [i11]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR abs/1507.02350 (2015) - [i10]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. CoRR abs/1511.09389 (2015) - [i9]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors. CoRR abs/1512.01150 (2015) - 2014
- [j4]Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a hypergraph model for finding Golomb rulers. Acta Informatica 51(7): 449-471 (2014) - [j3]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. 42(4): 290-292 (2014) - [c9]Yann Disser, Stefan Kratsch, Manuel Sorge:
The Minimum Feasible Tileset Problem. WAOA 2014: 144-155 - [i8]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR abs/1404.3660 (2014) - [i7]Yann Disser, Stefan Kratsch, Manuel Sorge:
The Minimum Feasible Tileset problem. CoRR abs/1409.8524 (2014) - [i6]Stefan Kratsch, Manuel Sorge:
On Kernelization and Approximation for the Vector Connectivity Problem. CoRR abs/1410.8819 (2014) - [i5]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
On Google Scholar H-Index Manipulation by Merging Articles. CoRR abs/1412.5498 (2014) - 2013
- [c8]Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC 2013: 361-371 - [c7]Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. MFCS 2013: 445-456 - [c6]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Graph Bisections. WG 2013: 76-87 - [i4]Manuel Sorge:
A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs. CoRR abs/1306.6598 (2013) - [i3]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR abs/1312.7014 (2013) - 2012
- [j2]Hannes Moser, Rolf Niedermeier, Manuel Sorge:
Exact combinatorial algorithms and experiments for finding maximum k-plexes. J. Comb. Optim. 24(3): 347-373 (2012) - [j1]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A new view on Rural Postman based on Eulerian Extension and Matching. J. Discrete Algorithms 16: 12-33 (2012) - [c5]Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a Hypergraph Model for Finding Golomb Rulers. ISCO 2012: 368-379 - [c4]Christian Komusiewicz, Manuel Sorge:
Finding Dense Subgraphs of Sparse Graphs. IPEC 2012: 242-251 - 2011
- [c3]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
A New View on Rural Postman Based on Eulerian Extension and Matching. IWOCA 2011: 310-323 - [c2]Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
From Few Components to an Eulerian Graph by Adding Arcs. WG 2011: 307-318 - [i2]Manuel Sorge:
On Making Directed Graphs Eulerian. CoRR abs/1101.4283 (2011) - 2010
- [i1]Manuel Sorge:
Algorithmic Aspects of Golomb Ruler Construction. CoRR abs/1005.5395 (2010)
2000 – 2009
- 2009
- [c1]Hannes Moser, Rolf Niedermeier, Manuel Sorge:
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes. SEA 2009: 233-244
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
