Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Torgny Andersson
avi singh
Robert J. Zomer
Masao Yokota
Scott A. Starks
Daniel Omeiza
Hikaru Fujisaki
Michael Terry
Zhihao Li
Radu Timofte
Home
/
Author
/
STEFAN RICHTER
Author Info
Open Visualization
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
100
277
Publications (11 rows)
Collaborators (9 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Breaking Anonymity by Learning a Unique Minimum Hitting Set
3
0.40
2009
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms
11
0.52
2009
NISAN: network information service for anonymization networks
20
0.68
2009
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
23
1.06
2008
Dynamic Programming for Minimum Steiner Trees
23
1.13
2007
A faster algorithm for the steiner tree problem
25
1.63
2006
Enumerate and expand: new runtime bounds for vertex cover variants
8
0.58
2006
Parameterized power domination complexity
31
1.78
2006
Intuitive algorithms and t-vertex cover
8
0.59
2006
Algorithms based on the treewidth of sparse graphs
21
1.19
2005
On the parameterized complexity of exact satisfiability problems
3
0.40
2005
1