pith. sign in

Robert Ganian

Identifiers

  • name variant Robert Ganian 0.60 · backfill

Papers (27)

  1. Computing Twin-Width via Treedepth and Vertex Integrity cs.DS · 2026 · author #1
  2. Coordinated Motion Planning is FPT on Discretized Simple Polygons cs.DS · 2026 · author #3
  3. Bilateral Treewidth for QBF: Where Strategies and Resolution Meet cs.DS · 2026 · author #1
  4. Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees cs.DS · 2025 · author #3
  5. The Complexity Landscape of Decompositional Parameters for ILP cs.DS · 2018 · author #1
  6. Group Activity Selection with Few Agent Types cs.DS · 2018 · author #1
  7. The Power of Cut-Based Parameters for Computing Edge Disjoint Paths cs.DS · 2018 · author #1
  8. Parameterized Algorithms for the Matrix Completion Problem cs.DS · 2018 · author #1
  9. Small Resolution Proofs for QBF using Dependency Treewidth cs.DS · 2017 · author #2
  10. On Structural Parameterizations of the Edge Disjoint Paths Problem cs.DS · 2017 · author #1
  11. Backdoors to Tractable Valued CSP cs.DS · 2016 · author #1
  12. Combining Treewidth and Backdoors for CSP cs.DS · 2016 · author #1
  13. A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion cs.DS · 2016 · author #2
  14. On the Complexity of Rainbow Coloring Problems cs.DM · 2015 · author #2
  15. Meta-Kernelization using Well-Structured Modulators cs.DS · 2015 · author #2
  16. Solving Problems on Graphs of High Rank-Width cs.DS · 2015 · author #2
  17. Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting cs.DS · 2015 · author #1
  18. Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions cs.DS · 2015 · author #1
  19. Parameterized Complexity of Asynchronous Border Minimization cs.DS · 2015 · author #1
  20. Quantified Conjunctive Queries on Partially Ordered Sets cs.LO · 2014 · author #2
  21. Model Checking Existential Logic on Partially Ordered Sets cs.LO · 2014 · author #2
  22. Expanding the expressive power of Monadic Second-Order logic on restricted graph classes cs.DS · 2013 · author #1
  23. Meta-Kernelization with Structural Parameters cs.DS · 2013 · author #1
  24. Using Neighborhood Diversity to Solve Hard Problems cs.DS · 2012 · author #1
  25. Lower Bounds on the Complexity of MSO1 Model-Checking cs.LO · 2011 · author #1
  26. Better algorithms for satisfiability problems for formulas of bounded rank-width cs.DM · 2010 · author #1
  27. Are there any good digraph width measures? cs.DM · 2010 · author #1

Mentions

  • 2606.20331 #1 · arxiv_oai · confidence 0.70 Robert Ganian
  • 1510.03614 #2 · backfill · confidence 0.70 Robert Ganian
  • 1507.05544 #2 · backfill · confidence 0.70 Robert Ganian
  • 1507.05463 #2 · backfill · confidence 0.70 Robert Ganian
  • 1507.02479 #1 · backfill · confidence 0.70 Robert Ganian
  • 1506.09100 #1 · backfill · confidence 0.70 Robert Ganian
  • 1503.08078 #1 · backfill · confidence 0.70 Robert Ganian
  • 1408.4263 #2 · backfill · confidence 0.70 Robert Ganian
  • 1405.2891 #2 · backfill · confidence 0.70 Robert Ganian
  • 1306.5571 #1 · backfill · confidence 0.70 Robert Ganian
  • 1303.1786 #1 · backfill · confidence 0.70 Robert Ganian
  • 1201.3091 #1 · backfill · confidence 0.70 Robert Ganian
  • 1109.5804 #1 · backfill · confidence 0.70 Robert Ganian
  • 1006.5621 #1 · backfill · confidence 0.70 Robert Ganian
  • 1004.1485 #1 · backfill · confidence 0.70 Robert Ganian

Frequent Coauthors