„Graph problems“

Suchergebnisse

867 Treffer

• The Power of Project Leadership – 7 Keys to Help You Transform from Project Manager to Project Leader
  Madsen, Susanne 2019 Kogan Page Ltd
• Effects of methylphenidate and physiotherapeutic treatment on graphomotor movements in children with ADHD
  Rothe, Josefine ; Kattlun, Fabian A. ; Kaufmann, Jeanne ; Uhlmann, Anne ; Wanderer, Sina ; Bluschke, Annet ; Beste, Christian ; Roessner, Veit 2025 Technische Universität Dresden
• 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
• Nonlinear Feature Selection for Multi-target Regression Problems
  Kanouté, Mamadou ; Grall-Maës, Edith ; Beauseroy, Pierre
• LP can be a cure for Parameterized Problems
  Narayanaswamy, N.S. ; Raman, Venkatesh ; Ramanujan, M.S. ; Saurabh, Saket 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the restriction of somie NP-complete graph problems to permutation graphs
  Brandstädt, Andreas ; Kratsch, Dieter 1984 Friedrich-Schiller-Univ.
• Parameterized Dynamic Cluster Editing
  Luo, Junjie ; Molter, Hendrik ; Nichterlein, André ; Niedermeier, Rolf 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Vertex Deletion Problems on Chordal Graphs
  Cao, Yixin ; Ke, Yuping ; Otachi, Yota ; You, Jie 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems
  Bilò, Vittorio ; Caragiannis, Ioannis ; Fanelli, Angelo ; Flammini, Michele ; Monaco, Gianpiero 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computational Counting (Dagstuhl Seminar 13031)
  Bürgisser, Peter ; Goldberg, Leslie Ann ; Jerrum, Mark ; Koiran, Pascal
• Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
  Dyer, Martin ; Feige, Uriel ; Frieze, Alan M. ; Karpinski, Marek
• The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs
  Bellitto, Thomas ; Li, Shaohua ; Okrasa, Karolina ; Pilipczuk, Marcin ; Sorge, Manuel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
  Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity Dichotomy for Steiner Multicut
  Bringmann, Karl ; Hermelin, Danny ; Mnich, Matthias ; van Leeuwen, Erik Jan 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
  Bathie, Gabriel ; Bousquet, Nicolas ; Cao, Yixin ; Ke, Yuping ; Pierron, Théo
• Parameterized Pre-Coloring Extension and List Coloring Problems
  Gutin, Gregory Z. ; Majumdar, Diptapriyo ; Ordyniak, Sebastian ; Wahlström, Magnus 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding Optimal Solutions With Neighborly Help
  Burjons, Elisabet ; Frei, Fabian ; Hemaspaandra, Edith ; Komm, Dennis ; Wehner, David 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071)
  Fomin, Fedor V. ; Fraigniaud, Pierre ; Kreutzer, Stephan ; Thilikos, Dimitrios M.
• FPT Inapproximability of Directed Cut and Connectivity Problems
  Chitnis, Rajesh ; Feldmann, Andreas Emil 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
  Pilipczuk, Michał ; Leeuwen, Erik Jan van ; Wiese, Andreas