„Planar Graphs“

Suchergebnisse

1.000+ Treffer

• Reactive construction of planar overlay graphs on unit disk graphs
  Surberg, Freya ; Frey, Hannes ; Neumann, Florentin 2015 Universität Koblenz-Landau
• Interval-valued fuzzy planar graphs
  Pramanik, Tarasankar ; Samanta, Sovan ; Pal, Madhumangal
• On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper)
  Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David ; Ran, Yingli ; Rawitz, Dror 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
  Pilipczuk, Marcin ; Pilipczuk, Michal ; Sankowski, Piotr ; van Leeuwen, Erik Jan 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quasi-planar graphs have a linear number of edges
  Agarwal, Pankaj K. ; Aronov, Boris ; Pach, János ; Pollack, Richard ; Šārîr, Mîkā
• On Primal-Dual Circle Representations
  Felsner, Stefan ; Rote, Günter 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Planar Stories of Graph Drawings: Algorithms and Experiments
  Binucci, Carla ; Cornelsen, Sabine ; Didimo, Walter ; Hong, Seok-Hee ; Katsanou, Eleni ; Patrignani, Maurizio ; Symvonis, Antonios ; Wolf, Samuel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Price of Connectivity Augmentation on Planar Graphs
  A. Akitaya, Hugo ; Dallant, Justin ; Demaine, Erik D. ; Kaufmann, Michael ; Kleist, Linda ; Stock, Frederick ; Tóth, Csaba D. ; Ueckerdt, Torsten 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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
• Generalized neutrosophic planar graphs and its application
  Mahapatra, Rupkumar ; Samanta, Sovan ; Pal, Madhumangal
• Nishizeki, T., N. Chiba: Planar Graphs: Theory and Algorithms. (North‐Holland Mathematics Studies, 140); (Annals of Discrete Mathematics, 32). North Holland, Amsterdam 1988, 232 pp., $ 100,‐; Dfl. 190,‐, ISBN 0‐444‐70212‐1
  Seese, D.
• Algebraic Combinatorics – Walks, Trees, Tableaux, and More
  Stanley, Richard P. 2018 Springer International Publishing
• Basic Graph Theory
  Rahman, Md. Saidur 2017 Springer International Publishing
• Algebraic Combinatorics – Walks, Trees, Tableaux, and More
  2013 Springer New York
• Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
  Goemans, Michel X. ; Williamson, David P.
• On 2-distance (Δ + 4)-coloring of Planar Graphs with girth Five
  Deniz, Zakir
• On the Eternal Domination Number of Planar Graphs with Diameter 2
  Taletskii, D. S.
• A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs
  Grigoriev, Alexander ; Kobayashi, Yasuaki ; Tamaki, Hisao ; Zanden, Tom C. ˜van derœ 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient union find for planar graphs and other sparse graph classes – (extended abstracts)
  Gustedt, Jens 1995 TU, Fachbereich 3
• A Note on 4-connected Planar K1,1,5-minor-free Graphs
  Xu, Yuqi ; Yang, Weihua ; Zhao, Shuang