Name
Year | Venue | Keywords |
|---|---|---|
2000 | Electronic Colloquium on Computational Complexity (ECCC) | planar graph,polynomial time approximation scheme |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,k-minimum spanning tree,Planar straight-line graph,Monic polynomial,Matrix polynomial,Chromatic polynomial,1-planar graph,Polynomial-time approximation scheme,Clique problem,Mathematics | Journal | 7 |
Issue | Citations | PageRank |
64 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus Jansen | 1 | 789 | 82.68 |
| Marek Karpinski | 2 | 2895 | 302.60 |
| Andrzej Lingas | 3 | 0 | 0.34 |