Name
Affiliation
Papers
DIETER RAUTENBACH
Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
282
Collaborators
Citations 
PageRank 
171
946
138.87
Referers 
Referees 
References 
1155
1722
1861
Search Limit
1001000
Title
Citations
PageRank
Year
On the computational complexity of the bipartizing matching problem00.342022
Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs00.342022
Algorithmic aspects of broadcast independence00.342022
ON HAMILTONIAN CYCLES IN CLAW-FREE CUBIC GRAPHS00.342022
Linear programming based approximation for unweighted induced matchings—Breaking the Δ barrier10.352020
Domination versus edge domination00.342020
Closed-neighborhood union-closed graphs00.342020
On the maximum number of minimum total dominating sets in forests.00.342019
Forcing brushes.00.342019
On the Kőnig-Egerváry theorem for k-paths: BESSY et al.00.342019
Approximating maximum uniquely restricted matchings in bipartite graphs00.342019
Some bounds on the zero forcing number of a graph.50.592018
On the hardness of finding the geodetic number of a subcubic graph.00.342018
Hereditary equality of domination and exponential domination.00.342018
Dynamic monopolies for interval graphs with bounded thresholds.10.362018
On some Graphs with a Unique Perfect Matching.00.342018
Approximately locating an invisible agent in a graph with relative distance queries.00.342018
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees.00.342017
Some comments on the Slater number.00.342017
Extremal Values of the Chromatic Number for a Given Degree Sequence.00.342017
Local Connectivity, Local Degree Conditions, some Forbidden Induced Subgraphs, and Cycle Extendability00.342017
Decycling with a matching.20.642017
Relating domination, exponential domination, and porous exponential domination.20.472017
Exponential independence.00.342017
The Geodetic Hull Number is Hard for Chordal Graphs.20.382017
Bounds on the Exponential Domination Number30.572017
Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95].00.342017
Cycles Avoiding a Color in Colorful Graphs00.342016
Forbidden induced subgraphs for bounded p-intersection number00.342016
Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence10.392016
On the geodetic iteration number of distance-hereditary graphs00.342016
Strong Equality of Roman and Weak Roman Domination in Trees10.412016
Independence in Uniform Linear Triangle-free Hypergraphs00.342016
A lower bound on the independence number of a graph in terms of degrees and local clique sizes00.342016
Feedback vertex sets in cubic multigraphs40.542015
Brush your trees!10.372015
Equality of distance packing numbers00.342015
Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs.40.592015
Robust recoverable perfect matchings20.412015
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.00.342015
The P3-Convexity in the Complementary Prism of a Graph.00.342015
Complexity analysis of P-convexity problems on bounded-degree and planar graphs.10.362015
The Maximum Number of Dominating Induced Matchings.00.342015
Remarks on dynamic monopolies with given average thresholds.10.362015
Graphs of interval count two with a given partition10.362014
Transversals of Longest Paths and Cycles30.512014
Independent domination in subcubic bipartite graphs of girth at least six10.372014
Integral mixed unit interval graphs40.562013
Geodetic Number versus Hull Number in P3-Convexity.00.342013
Matchings in Graphs of Odd Regularity and Girth.10.372013
  • 1
  • 2