| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2024 | J | jnl |
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem.
Algorithmica
|
| 2024 | J | jnl |
Algorithmica
|
| 2023 | A | conf |
GECCO
|
| 2023 | J | jnl |
CoRR
|
| 2023 | J | jnl |
Evol. Comput.
|
| 2023 | J | jnl |
Theor. Comput. Sci.
|
| 2022 | — | conf |
PPSN (2)
|
| 2022 | J | jnl |
Algorithmica
|
| 2022 | J | jnl |
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem.
CoRR
|
| 2022 | A | conf |
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem.
GECCO
|
| 2022 | B | conf |
EvoCOP
|
| 2022 | J | jnl |
CoRR
|
| 2021 | J | jnl |
CoRR
|
| 2021 | B | conf |
EvoCOP
|
| 2021 | J | jnl |
CoRR
|
| 2021 | A | conf |
GECCO
|
| 2020 | — | conf |
PPSN (1)
|
| 2020 | J | jnl |
CoRR
|
| 2020 | J | jnl |
CoRR
|
| 2020 | A | conf |
GECCO
|