Name
Year | Venue | Field |
|---|---|---|
2013 | arXiv: Computational Complexity | Discrete mathematics,Combinatorics,Vertex (geometry),Upper and lower bounds,Omega,Duality (optimization),Treewidth,Mathematics,Planar graph,Bounded function,Exponential time hypothesis |
DocType | Volume | Citations |
Journal | abs/1312.5937 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Verbitsky | 1 | 191 | 27.50 |