Author Info
Name
Affiliation
Papers
STEFAN RICHTER
Department of Computer Science, RWTH Aachen University, Germany
11
Collaborators
Citations 
PageRank 
9
176
9.96
Referers 
Referees 
References 
277
191
138
Search Limit
100277
Title
Citations
PageRank
Year
Breaking Anonymity by Learning a Unique Minimum Hitting Set30.402009
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms110.522009
NISAN: network information service for anonymization networks200.682009
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover231.062008
Dynamic Programming for Minimum Steiner Trees231.132007
A faster algorithm for the steiner tree problem251.632006
Enumerate and expand: new runtime bounds for vertex cover variants80.582006
Parameterized power domination complexity311.782006
Intuitive algorithms and t-vertex cover80.592006
Algorithms based on the treewidth of sparse graphs211.192005
On the parameterized complexity of exact satisfiability problems30.402005