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.

NeilInCanadia's Andrews:M [3 articles] Export

Recent papers posted to NeilInCanadia's library by the author Andrews:M. You can also see everyone's Andrews:M.

	Hardness of buy-at-bulk network design [My Copy] Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on In Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on (2004), pp. 115-124. by M. Andrews posted to hardness network_design by NeilInCanadia on 2008-11-08 21:54:44 as
	Hardness of the undirected congestion minimization problem [My Copy] In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005), pp. 284-293. by Matthew Andrews, Lisa Zhang posted to hardness network_flow by NeilInCanadia on 2007-03-02 17:20:32 as
	Hardness of the undirected edge-disjoint paths problem [My Copy] In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005), pp. 276-283. by Matthew Andrews, Lisa Zhang posted to graph_theory hardness by NeilInCanadia on 2007-03-02 17:11:05 as

Note: You may cite this page as: http://www.citeulike.org/user/NeilInCanadia/author/Andrews:M

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.

selfish_routing	38
approximation	28
network_design	26
survey	18
comp_geometry	17
oblivious	17
graph_theory	15
network_flow	15
vpn	15
books	15
traffic	13
random_walks	13
metric_embeddings	11
frog_model	10
networks	10
hardness	9
complexity	9
probability	9
load_balancing	9
algorithms	9
routing	7
combinatorics	7
matching	6
optimization	6
branching_processes	6
matroids	6
partitions	6
network_games	5
source_location	5
ip	5
nonatomic_games	5
probabilistic	5
random_graphs	5
notes	5
buy-at-bulk	5
open_problems	5
network_coding	5
tcp	5
robustness	4
chordal_graphs	4
online_algorithms	4
confluent_flow	4
monotone_paths	4
terrain_guarding	4
graph_packing	4
concentration	4
facility_location	4
planar_graphs	3
interesting	3
agt	3
steiner	3
asymptotics	3
lp	3
metrics	2
mcmc	2
congestion_games	2
set_cover	2
inequalities	2
matrix_multiplication	2
percolation	2
spanning_trees	2
rent_or_buy	2
scale_free	2
rendezvous	2
mfmc	1
sle	1
expanders	1
graph_minors	1
discrete_geometry	1
economics	1
rounding	1
mts	1
functional_programming	1
mixing_time	1
colouring	1
cycle_packing	1
thesis	1
matrices	1
hypergraphs	1
numerical_analysis	1
geometry	1
statistical_physics	1
edp	1
quantum_computing	1
auctions	1
reference	1
polyhedral	1
large_deviations	1
cops	1
coordination	1
hard-core	1
lie_groups	1
disjoint_paths	1
incorrect	1
type_theory	1
spdes	1
brw	1
voronoi	1
string_theory	1
boolean_functions	1
dynamic_flows	1
exact	1

NeilInCanadia's Andrews:M [3 articles] Export

NeilInCanadia's tags