vix.ing · top · new · best · stats · spec

Dieter Rautenbach

  1. Some remarks on the geodetic number of a graph
    2009/10/03 by Mitre C. Dourado, Fábio Protti, Dieter Rautenbach +1 · 3 citations
    Computer Science · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Interconnection Networks and Systems
  2. Transversals of Longest Paths and Cycles
    2013/02/22 by Dieter Rautenbach, Jean‐Sébastien Sereni, Rautenbach, Dieter +1 · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Computational Geometry and Mesh Generation
  3. Relating the independence number and the dissociation number
    2022/05/06 by Felix Bock, Bock, Felix, Johannes Pardey +5 · 3 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications
  4. Sandwiches Missing Two Ingredients of Order Four
    2017/04/06 by José D. Alvarado, Alvarado, José D., Simone Dantas +3 · 2 citations
    Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #semigroups and automata theory
  5. Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence
    2015/07/16 by Michael Gentner, Michael A. Henning, Gentner, Michael +3 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Complexity and Algorithms in Graphs
  6. Smallest Domination Number and Largest Independence Number of Graphs and\n Forests with given Degree Sequence
    2015/07/16 by Michael Gentner, Michael A. Henning, Gentner, Michael +3 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Graph theory and applications
  7. Sparse vertex cutsets and the maximum degree
    2023/04/20 by Stéphane Bessy, Bessy, Stéphane, Johannes Rauch +5 · 3 citations
    Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
  8. Uniquely restricted matchings and edge colorings
    2016/11/21 by Julien Baste, Baste, Julien, Dieter Rautenbach +3 · 1 citation
    Computer Science · Mathematics · #05C70 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
  9. A lower bound on the acyclic matching number of subcubic graphs
    2017/10/27 by Maximilian Fürst, Dieter Rautenbach, Fürst, M. +1 · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems
  10. Revisiting Extremal Graphs Having No Stable Cutsets
    2024/11/30 by Johannes Rauch, Rauch, Johannes, Dieter Rautenbach +1 · 3 citations
    Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
  11. Exact and Parameterized Algorithms for the Independent Cutset Problem
    2023/07/05 by Johannes Rauch, Rauch, Johannes, Dieter Rautenbach +3 · 1 citation
    Computer Science · #05C69 #68Q25 #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
  12. Cyclic Neighborhoods in Digraphs
    2026/07/29 by Thilo Hartel, Dieter Rautenbach
    Mathematics · #math.CO