Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Gunjan Kumar
Barbara Aquilani
Kazem Dehghan-Sanej
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Bernhard Spinnler
Home
/
Author
/
K. W. WAGNER
Author Info
Open Visualization
Name
Affiliation
Papers
K. W. WAGNER
UNIV WURZBURG, INST INFORMAT, W-8700 WURZBURG, GERMANY
8
Collaborators
Citations
PageRank
6
224
18.58
Referers
Referees
References
265
99
92
Search Limit
100
265
Publications (8 rows)
Collaborators (6 rows)
Referers (100 rows)
Referees (99 rows)
Title
Citations
PageRank
Year
The Chain Method to Separate Counting Classes
6
0.46
1998
On the power of number-theoretic operations with respect to counting
17
1.37
1995
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
43
2.58
1992
The binary network flow problem is logspace complete for P
1
0.47
1990
The computational complexity of graph problems with succinct multigraph representation
3
0.42
1988
More complicated questions about maxima and minima, and some closures of NP
118
8.09
1987
Some observations on the connection between counting and recursion
33
4.29
1986
On the intersection of the class of linear context-free languages and the class of single-reset languages
3
0.89
1986
1