Name
Abstract | ||
|---|---|---|
r for maximum independent set in \(O^*(\exp ({\tilde{O}}(n/r \log ^2 r+r\log ^2r)))\) time, |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00453-018-0512-8 | Algorithmica |
Keywords | Field | DocType |
Approximation algorithms,PCP’s,Exponential time algorithms | Approximation algorithm,Discrete mathematics,Combinatorics,Polynomial,Independent set,Omega,Vertex cover,Conjecture,Mathematics,Exponential time hypothesis,Bounded function | Journal |
Volume | Issue | ISSN |
abs/1708.03515 | 10 | 0178-4617 |
Citations | PageRank | References |
1 | 0.35 | 23 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikhil Bansal | 1 | 3043 | 230.41 |
| Parinya Chalermsook | 2 | 187 | 20.94 |
| Bundit Laekhanukit | 3 | 129 | 16.93 |
| Danupon Nanongkai | 4 | 643 | 41.26 |
| Jesper Nederlof | 5 | 294 | 24.22 |