„Graph Algorithms“

Suchergebnisse

3.156 Treffer

• Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
  Chaplick, Steven ; Da Lozzo, Giordano ; Di Giacomo, Emilio ; Liotta, Giuseppe ; Montecchiani, Fabrizio
• Algorithms for the Maximum Independent Set Problem
  Lê, Ngoc C. ; Schiermeyer, Ingo ; Harant, Jochen 2015 Technische Universitaet Bergakademie Freiberg Universitaetsbibliothek "Georgius Agricola"
• Flip Distances Between Graph Orientations
  Aichholzer, Oswin ; Cardinal, Jean ; Huynh, Tony ; Knauer, Kolja ; Mütze, Torsten ; Steiner, Raphael ; Vogtenhuber, Birgit
• Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
  Pilipczuk, Michał ; Leeuwen, Erik Jan van ; Wiese, Andreas
• Ortho-polygon Visibility Representations of Embedded Graphs
  Di Giacomo, Emilio ; Didimo, Walter ; Evans, William S. ; Liotta, Giuseppe ; Meijer, Henk ; Montecchiani, Fabrizio ; Wismath, Stephen K.
• B-cell epitope prediction through a graph model
  Zhao, Liang ; Wong, Limsoon ; Lu, Lanyuan ; Hoi, Steven CH ; Li, Jinyan
• Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
  Novotná, Jana ; Okrasa, Karolina ; Pilipczuk, Michał ; Rzążewski, Paweł ; van Leeuwen, Erik Jan ; Walczak, Bartosz 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Stochastic Graph Exploration
  Anagnostōpulos, Arēs ; Cohen, Ilan R. ; Leonardi, Stefano ; Łącki, Jakub 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithmic Properties of Sparse Digraphs
  Kreutzer, Stephan ; Muzi, Irene ; Ossona de Mendez, Patrice ; Rabinovich, Roman ; Siebertz, Sebastian 2019 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 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Parameterized Algorithms for Graphs of Polynomial Growth
  Marx, Dániel ; Pilipczuk, Marcin 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs
  Kreutzer, Stephan ; Rabinovich, Roman ; Siebertz, Sebastian ; Weberstädt, Grischa 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)
  Demaine, Erik D. ; Fomin, Fedor V. ; Hajiaghayi, MohammadTaghi ; Thilikos, Dimitrios M.
• Subgraph Isomorphism on Graph Classes that Exclude a Substructure
  Bodlaender, Hans L. ; Hanaka, Tesshu ; Kobayashi, Yasuaki ; Kobayashi, Yusuke ; Okamoto, Yoshio ; Otachi, Yota ; Zanden, Tom C. van der
• Fast Minor Testing in Planar Graphs
  Adler, Isolde ; Dorn, Frederic ; Fomin, Fedor V. ; Sau, Ignasi ; Thilikos, Dimitrios M.
• Classification in BioApps – Automation of Decision Making
  Dey, Nilanjan ; Ashour, Amira ; Borra, Surekha 2018 Springer International Publishing
• A systematic approach to constructing families of incremental topology control algorithms using graph transformation
  Kluge, Roland ; Stein, Michael ; Varró, Gergely ; Schürr, Andy ; Hollick, Matthias ; Mühlhäuser, Max
• Solving Problems on Graphs of High Rank-Width
  Eiben, Eduard ; Ganian, Robert ; Szeider, Stefan
• Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
  Golovach, Petr A. ; Heggernes, Pinar ; Kanté, Mamadou Moustapha ; Kratsch, Dieter ; Sæther, Sigve H. ; Villanger, Yngve
• Graphs, dioids and semirings – new models and algorithms
  Gondran, Michel 2008 Springer