Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Ashvinkumar, Vikrant
7  Ergebnisse:
Personensuche X
?
1

Local Routing in Sparse and Lightweight Geometric Graphs:

Ashvinkumar, Vikrant ; Gudmundsson, Joachim ; Levcopoulos, Christos..
Algorithmica.  84 (2022)  5 - p. 1316-1340 , 2022
Link: https://doi.org/10.1007/..
 
?
2

Evaluating Stability in Massive Social Networks: Efficient ..:

Ashvinkumar, Vikrant ; Assadi, Sepehr ; Deng, Chengyuan..
http://arxiv.org/abs/2306.00668.  , 2023
Link: http://arxiv.org/abs/230..
 
?
3

Parallel and Distributed Exact Single-Source Shortest Paths..:

Ashvinkumar, Vikrant ; Bernstein, Aaron ; Cao, Nairen...
http://arxiv.org/abs/2303.00811.  , 2023
Link: http://arxiv.org/abs/230..
 
?
4

Local Routing in Sparse and Lightweight Geometric Graphs:

Ashvinkumar, Vikrant ; Gudmundsson, Joachim ; Levcopoulos, Christos..
Algorithmica, 0178-4617, 2022, 84, s. 1316-1340.  , 2022
Link: http://urn.kb.se/resolve..
 
?
5

Local Routing in Sparse and Lightweight Geometric Graphs:

Ashvinkumar, Vikrant ; Gudmundsson, Joachim ; Levcopoulos, Christos..
Leibniz International Proceedings in Informatics (LIPIcs), 1868-8969.  , 2019
Link: http://urn.kb.se/resolve..
 
?
6

Local Routing in Sparse and Lightweight Geometric Graphs:

Ashvinkumar, Vikrant ; Gudmundsson, Joachim ; Levcopoulos, Christos..
http://arxiv.org/abs/1909.10215.  , 2019
Link: http://arxiv.org/abs/190..
 
?
7

Local Routing in Sparse and Lightweight Geometric Graphs:

Ashvinkumar, Vikrant ; Gudmundsson, Joachim ; Levcopoulos, Christos.
doi:10.4230/LIPIcs.ISAAC.2019.30.  , 2019
Link: https://doi.org/10.4230/..
 
1-7