VLDB 2026 Research / reviewers in the wild / expert
Vedran Cacic
dblp:125/8154
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Computable Approximations of Semicomputable GraphsabstractIn this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with arbitrary precision, by its computable subgraph with computable endpoints. Vedran Cacic, Matea Celar, Zvonko Iljazovic |
Log. Methods Comput. Sci. | 1 |
| 2021 | Computable subcontinua of semicomputable chainable Hausdorff continua
Vedran Cacic, Zvonko Iljazovic |
Theor. Comput. Sci. | 1 |