„planar graph problems“

Suchergebnisse

1.000+ Treffer

• Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification
  Galby, Esther ; Kisfaludi-Bak, Sándor ; Marx, Dániel ; Sharma, Roohani 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
  Goemans, Michel X. ; Williamson, David P.
• Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
  Focke, Jacob ; Hörsch, Florian ; Li, Shaohua ; Marx, Dániel 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity
  Bläsius, Thomas ; Wagner, D. 2015 KIT-Bibliothek
• Satisfiability Characterizations of Upward Planarity Problems
  Zeranski, Robert 2014 Verlag Dr. Hut
• Exact algorithms for NP hard problems on networks – design, analysis and implementation
  Alber, Jochen
• Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern
  Hörsch, Florian ; Marx, Dániel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for Distance Problems in Continuous Graphs
  Cabello, Sergio ; Garijo, Delia ; Kalb, Antonia ; Klute, Fabian ; Parada, Irene ; Silveira, Rodrigo I. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The structure of plane graphs with independent crossings and its applications to coloring problems
  Zhang, Xin ; Liu, Guizhen
• Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
  Pilipczuk, Michał ; Leeuwen, Erik Jan van ; Wiese, Andreas
• Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs
  Cohen-Addad, Vincent ; Pilipczuk, Marcin ; Pilipczuk, Michał 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
  Chitnis, Rajesh ; Feldmann, Andreas Emil ; Manurangsi, Pasin 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
  Fomin, Fedor V. ; Golovach, Petr A. ; Stamoulis, Giannos ; Thilikos, Dimitrios M. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position
  Tkachenko, Anastasiia ; Wang, Haitao 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
  Bhore, Sujoy ; Ganian, Robert ; Khazaliya, Liana ; Montecchiani, Fabrizio ; Nöllenburg, Martin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Tragedy of Being Almost but Not Quite Planar (Invited Talk)
  Erickson, Jeff 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Modification to Planarity is Fixed Parameter Tractable
  Fomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
  Pilipczuk, Michal ; van Leeuwen, Erik Jan ; Wiese, Andreas 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• NC Algorithms for Weighted Planar Perfect Matching and Related Problems
  Sankowski, Piotr 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs
  Byrka, Jaroslaw ; Lewandowski, Mateusz ; Moldenhauer, Carsten 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik