pith. sign in

Manuel Sorge

Identifiers

  • name variant Manuel Sorge 0.60 · backfill

Papers (23)

  1. Exact and Approximate Algorithms for Polytree Learning cs.DS · 2026 · author #3
  2. Matchings under Preferences: Strength of Stability and Trade-offs cs.GT · 2019 · author #3
  3. On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors cs.CC · 2018 · author #3
  4. Efficient Algorithms for Measuring the Funnel-likeness of DAGs cs.DS · 2018 · author #4
  5. Computational Complexity Aspects of Point Visibility Graphs cs.DM · 2017 · author #5
  6. The Parameterized Complexity of Centrality Improvement in Networks cs.DM · 2017 · author #3
  7. Cluster Editing for Multi-Layer and Temporal Graphs cs.DM · 2017 · author #3
  8. How hard is it to satisfy (almost) all roommates? cs.CC · 2017 · author #3
  9. The Complexity of Routing with Few Collisions cs.CC · 2017 · author #3
  10. Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs cs.CC · 2017 · author #3
  11. Adapting the Bron-Kerbosch Algorithm for Enumerating Maximal Cliques in Temporal Graphs cs.DS · 2016 · author #4
  12. The Parameterized Complexity of the Minimum Shared Edges Problem cs.CC · 2016 · author #4
  13. The Minimum Shared Edges Problem on Planar Graphs cs.CC · 2016 · author #2
  14. Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors cs.DM · 2015 · author #4
  15. Well-Formed Separator Sequences, with an Application to Hypergraph Drawing cs.DM · 2015 · author #5
  16. H-Index Manipulation by Merging Articles: Models, Theory, and Experiments cs.DL · 2014 · author #4
  17. On Kernelization and Approximation for the Vector Connectivity Problem cs.CC · 2014 · author #2
  18. The Minimum Feasible Tileset problem cs.CC · 2014 · author #3
  19. Constant-factor approximations for Capacitated Arc Routing without triangle inequality cs.DS · 2014 · author #4
  20. On the Parameterized Complexity of Computing Balanced Partitions in Graphs cs.DM · 2013 · author #3
  21. A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs cs.CC · 2013 · author #1
  22. On Making Directed Graphs Eulerian cs.DM · 2011 · author #1
  23. Algorithmic Aspects of Golomb Ruler Construction cs.DM · 2010 · author #1

Mentions

  • 1507.02350 #5 · backfill · confidence 0.70 Manuel Sorge
  • 1412.5498 #4 · backfill · confidence 0.70 Manuel Sorge
  • 1410.8819 #2 · backfill · confidence 0.70 Manuel Sorge
  • 1409.8524 #3 · backfill · confidence 0.70 Manuel Sorge
  • 1404.3660 #4 · backfill · confidence 0.70 Manuel Sorge
  • 1312.7014 #3 · backfill · confidence 0.70 Manuel Sorge
  • 1306.6598 #1 · backfill · confidence 0.70 Manuel Sorge
  • 1101.4283 #1 · backfill · confidence 0.70 Manuel Sorge
  • 1005.5395 #1 · backfill · confidence 0.70 Manuel Sorge

Frequent Coauthors