„graph problems“

Suchergebnisse

1.000+ Treffer

• Flexible Graph Connectivity – Approximating network design problems between 1- and 2-connectivity
  Adjiashvili, David ; Hommelsheim, Felix ; Mühlenthaler, Moritz
• A Generalization of Nemhauser and Trotter's Local Optimization Theorem
  Fellows, Michael R. ; Guo, Jiong ; Moser, Hannes ; Niedermeier, Rolf 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An integrated decision-making prototype based on OLAP systems and multicriteria analysis for complex decision-making problems
  Boutkhoum, Omar ; Hanine, Mohamed
• Learning and Intelligent Optimization – Third International Conference, LION 3, Trento, Italy, January 14-18, 2009. Selected Papers
  Nicosia, Giuseppe ; Pardalos, Panos M. 2009 Springer International Publishing
• Approximation of knapsack problems with conflict and forcing graphs
  Pferschy, Ulrich ; Schauer, Joachim
• Anion Intercalation into Graphite Cathodes in K + ‐containing High‐Voltage Electrolytes: Problems Associated with Counter Anodes
  Park, Chunguk ; Han, Su Cheol ; Pyo, Myoungho
• Graph Theory – Favorite Conjectures and Open Problems - 2
  Gera, Ralucca ; Haynes, Teresa W. ; Hedetniemi, S. T. 2018 Springer International Publishing
• Deep Learning Algorithm of Graph Convolutional Network: A Case of Aqueous Solubility Problems
  Cho, Hyeoncheol ; Choi, Insung S.
• New Concise Extended Formulations for Circular Structures in Optimization Problems
  Perscheid, Bernd ; de Vries, Sven ; Cheng, Eddie 2020 Universität Trier
• Compound Logics for Modification Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Sau, Ignasi ; Stamoulis, Giannos ; Thilikos, Dimitrios M. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Structural graph theory meets algorithms: covering and connectivity problems in graphs
  Akhoondian Amiri, Saeed ; Kreutzer, Stephan ; Pilipczuk, Marcin ; Thilikos, Dimitrios 2017 Technische Universität Berlin
• B. Botev, B. Russev i Sv. Gerasimov: Problemy fonofogo ekologičeskogo monitironga (Problems of the Background Ecological Monitoring). (in Russian with english summaries). Second School of biological monitoring. Sofia, Publ. House Bulgarian Acad. Sci., 1987, p. 177, graphs, tables, Lv 1.73
  Sládeček, V.
• 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
• Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives
  Kunz, Pascal ; Fluschnik, Till ; Niedermeier, Rolf ; Renken, Malte 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Binary Matrix Completion Under Diameter Constraints
  Koana, Tomohiro ; Froese, Vincent ; Niedermeier, Rolf 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping
  Brandt, Sebastian ; Keller, Barbara ; Rybicki, Joel ; Suomela, Jukka ; Uitto, Jara 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Multistage Vertex Cover
  Fluschnik, Till ; Niedermeier, Rolf ; Rohm, Valentin ; Zschoche, Philipp 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
  Bredereck, Robert ; Froese, Vincent ; Koseler, Marcel ; Millani, Marcelo Garlet ; Nichterlein, André ; Niedermeier, Rolf 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Problems from the Discrete to the Continuous – Probability, Number Theory, Graph Theory, and Combinatorics
  Pinsky, Ross 2014 Springer International Publishing
• Hitting Set Problems on Graphs
  Bachtler, Oliver ; Krumke, Sven O. 2017 Rheinland-Pfälzische Technische Universität Kaiserslautern-Landau