|
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 Algorithm to Compute the Nucleolus of Shortest Path Games |
Baïou, Mourad |
2019 |
81 | 8 |
p. 3099-3113 |
article |
|
| 2 | Approximately Coloring Graphs Without Long Induced Paths |
Chudnovsky, Maria |
2019 |
81 | 8 |
p. 3186-3199 |
article |
|
| 3 | A Tight Lower Bound for Planar Steiner Orientation |
Chitnis, Rajesh |
2019 |
81 | 8 |
p. 3200-3216 |
article |
|
| 4 | Dynamic Space Efficient Hashing |
Maier, Tobias |
2019 |
81 | 8 |
p. 3162-3185 |
article |
|
| 5 | Faster Approximate Diameter and Distance Oracles in Planar Graphs |
Chan, Timothy M. |
2019 |
81 | 8 |
p. 3075-3098 |
article |
|
| 6 | Flexible Resource Allocation to Interval Jobs |
Katz, Dmitriy |
2019 |
81 | 8 |
p. 3217-3244 |
article |
|
| 7 | Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly |
Schweller, Robert |
2019 |
81 | 8 |
p. 3114-3135 |
article |
|
| 8 | Stable Secretaries |
Babichenko, Yakov |
2019 |
81 | 8 |
p. 3136-3161 |
article |
8 results found