„Intersection Graphs“

Suchergebnisse

1.000+ Treffer

• Approximating Densest Subgraph in Geometric Intersection Graphs
  Har-Peled, Sariel ; Rahul, Saladi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs
  Har-Peled, Sariel ; Yang, Everett 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space
  Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay ; Saurabh, Saket 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Circle-Segment Intersection Queries in Connected Geometric Graphs
  Afshani, Peyman ; Bosch, Yannick ; Storandt, Sabine 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Metric Sketching and Dynamic Algorithms for Geometric and Topological Graphs (Dagstuhl Seminar 25212)
  Bhore, Sujoy ; Gao, Jie ; Le, Hung ; Tóth, Csaba D. ; Milenković, Lazar
• Node-Link, Obstacle, and Intersection Representations of Graphs and Hypergraphs
  Firman, Oksana ; Wolff, Alexander ; Fiala, Jiří 2025 Universität Würzburg
• Partial Representation Extension and Simultaneous Representation of Intersection Graphs
  Stumpf, Peter Frederik ; Rutter, Ignaz 2024 Universität Passau
• On subclasses of grid intersection graphs
  Mustaţă, Irina ; Felsner, Stefan ; Köhler, Ekkehard 2014 Technische Universität Berlin
• Intersection graphs of pseudosegments
  Dangelmayr, Cornelia 2010 Freie Universität Berlin
• Twin-Width VIII: Delineation and Win-Wins
  Bonnet, Édouard ; Chakraborty, Dibyayan ; Kim, Eun Jung ; Köhler, Noleen ; Lopes, Raul ; Thomassé, Stéphan 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graph-Theoretic Concepts in Computer Science – 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers
  Kratsch, Dieter ; Todinca, Ioan 2014 Springer International Publishing
• Graph-Theoretic Concepts in Computer Science – 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
  Brandstädt, Andreas ; Jansen, Klaus ; Reischuk, Rüdiger 2013 Springer Berlin Heidelberg
• Approximation and Online Algorithms – 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers
  2011 Springer Berlin Heidelberg
• A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $$\mathbb {R}^2$$
  Aronov, Boris ; Berg, Mark de ; Theocharous, Leonidas
• Approximation and Online Algorithms – 7th International Workshop,WAOA 2009, Copenhagen Denmark, September 10-11, 2009. Revised Papers
  Jansen, Klaus ; Solis-Oba, Roberto 2010 Springer Berlin Heidelberg
• Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
  Galby, Esther ; Munaro, Andrea ; Yang, Shizhou 2023 Technische Universität Hamburg. Universitätsbibliothek
• The Dominating Set Problem in Geometric Intersection Graphs
  de Berg, Mark ; Kisfaludi-Bak, Sándor ; Woeginger, Gerhard 2018 Universitätsbibliothek der RWTH Aachen
• Topological recursion for generalised Kontsevich graphs and r-spin intersection numbers
  Belliard, Raphaël ; Charbonnier, Séverin ; Eynard, Bertrand ; Garcia-Failde, Elba 2025 Humboldt-Universität zu Berlin
• BFS and Reverse Shortest Paths for Ball Intersection Graphs in Three and Higher Dimensions
  Katz, Matthew J. ; Saban, Rachel ; Sharir, Micha 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments
  de Berg, Mark ; Jansen, Bart M. P. ; Lamme, Jeroen S. K. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik