„Disk Graphs“

Suchergebnisse

222 Treffer

• More Sets, Graphs and Numbers – A Salute to Vera Sós and András Hajnal
  Győri, Ervin 2006 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
• Contributions to the Problems of Recognizing and Coloring Gammoids
  Albrecht, Immanuel ; Hochstättler, Winfried ; Neudauer, Nancy Ann 2018 FernUniversität in Hagen
• Disk Intersection Graphs: Models, Data Structures, and Algorithms
  Seiferth, Paul 2016 Freie Universität Berlin
• Silence is golden: reactive local topology control and geographic routing in wireless ad hoc and sensor networks
  Neumann, Florentin ; Frey, Hannes ; Turau, Volker ; Sofronie-Stokkermans, Viorica ; Lämmel, Ralf 2016 Universität Koblenz-Landau
• An O(nlog n) Algorithm for Single-Source Shortest Paths in Disk Graphs
  de Berg, Mark ; Cabello, Sergio 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
  Brewer, Bruce W. ; Wang, Haitao 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
  Koana, Tomohiro ; Purohit, Nidhi ; Simonov, Kirill 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A QPTAS for Facility Location on Unit Disk Graphs
  Friggstad, Zachary ; Rezapour, Mohsen ; Salavatipour, Mohammad R. ; Sun, Hao 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subcoloring of (Unit) Disk Graphs
  Marin, Malory ; Watrigant, Rémi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Syntax and Semantics of Graphs – An approach to the specification of visual notations for discrete-event systems
  Janneck, Jörn W. 2000 Shaker
• Compact Routing in Unit Disk Graphs
  Mulzer, Wolfgang ; Willert, Max 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Tiling Random Regular Graphs Efficiently
  Diskin, Sahar ; Hoshen, Ilay ; Zhukovskii, Maksim 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Maximum Clique Problem in a Disk Graph Made Easy
  Keil, J. Mark ; Mondal, Debajyoti 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-And-Bifurcate Technique
  Chan, Timothy M. ; Huang, Zhengcheng 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Structure and Independence in Hyperbolic Uniform Disk Graphs
  Bläsius, Thomas ; von der Heydt, Jean-Pierre ; Kisfaludi-Bak, Sándor ; Wilhelm, Marcus ; van Wordragen, Geert 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Single-Source Shortest Path Problem in Weighted Disk Graphs
  An, Shinwoo ; Oh, Eunjin ; Xue, Jie 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
  Abu-Affash, A. Karim ; Carmi, Paz ; Maheshwari, Anil ; Morin, Pat ; Smid, Michiel ; Smorodinsky, Shakhar