|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
8 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width |
Bergougnoux, Benjamin |
|
82 | 6 |
p. 1654-1674 |
article |
|
| 2 | High-Dimensional Approximate r-Nets |
Avarikioti, Z. |
|
82 | 6 |
p. 1675-1702 |
article |
|
| 3 | Nested Convex Bodies are Chaseable |
Bansal, Nikhil |
|
82 | 6 |
p. 1640-1653 |
article |
|
| 4 | On the Complexity of Computing Treebreadth |
Ducoffe, Guillaume |
|
82 | 6 |
p. 1574-1600 |
article |
|
| 5 | On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths |
Araújo, Júlio |
|
82 | 6 |
p. 1616-1639 |
article |
|
| 6 | Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs |
Pilipczuk, Michał |
|
82 | 6 |
p. 1703-1739 |
article |
|
| 7 | Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions |
Maske, Charles |
|
82 | 6 |
p. 1601-1615 |
article |
|
| 8 | Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs |
Conte, Alessio |
|
82 | 6 |
p. 1547-1573 |
article |
8 results found