Search all the public and authenticated articles in CiteULike.
Enter a search phrase. You can also specify

a CiteULike article id (123456),

a DOI (doi:10.1234/12345678)

or a PubMed Id (pmid:12345678).

Click Help for advanced usage.

mpotamias's Dragan:F [2 articles] Export

Recent papers posted to mpotamias's library by the author Dragan:F. You can also see everyone's Dragan:F.

Note: You may cite this page as: http://www.citeulike.org/user/mpotamias/author/Dragan:F

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

yrbcn	38
social-networks	16
centrality	11
betweenness	8
social	7
social-privacy	7
embeddings	5
random-walk	5
theory	5
graph-partitioning	4
metric	3
game-theory	3
anonymity	3
approximation-algorithm	3
shortest-paths	3
all-pairs-shortest-paths	3
spectral-clustering	3
algorithm	3
social-search	3
commute-time	3
indexing	3
nearest-neighbors	2
pagerank	2
query-logs	2
kleinberg	2
compare-rankings	2
large-scale	2
network	2
landmarks	2
approximate	2
map-reduce	2
dijkstra	2
privacy	2
algorihms	2
search	2
graph	2
a-star	2
embedding	2
social-sensitive	2
ta	2
advertising	1
trees	1
metrics	1
quantiles	1
seperation	1
sam	1
time-series	1
lossy-counting	1
hitting-time	1
data-streams	1
rwr	1
graph-mining	1
classics	1
link-recommendation	1
spectral	1
heuristic	1
click-graph	1
hiitng-time	1
probabilistic	1
sssp	1
contractiveness	1
complexity	1
graphs	1
lipschitz	1
first-passage-time	1
pruning	1
hiring-problem	1
collaborative-filtering	1
influence	1
proximity	1
uncertainty	1
degree-sequence	1
reference-based	1
slack	1
dynamic-programming	1
subsequence	1
reference-objects-selection	1
top-k	1
segmentation	1
shortest-path	1
parallel	1
similarity-search	1
link-prediction	1
median	1
apsp	1
auctions	1
green-functions	1
threshold	1

	Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach [My Copy] Lecture Notes in Computer Science, Vol. 2204 (2001), pp. 103-??. by Feodor F. Dragan posted to no-tag by mpotamias on 2008-07-29 17:08:02 as
	Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach [My Copy] Graph-Theoretic Concepts in Computer Science (2001), pp. 103-116. by Feodor Dragan posted to algorihms all-pairs-shortest-paths yrbcn by mpotamias on 2008-06-23 17:55:24 as

mpotamias's Dragan:F [2 articles] Export

mpotamias's tags