forked from aseetharam/NSF-BioSketch-template
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbiosketch.bib
139 lines (131 loc) · 5.6 KB
/
biosketch.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
@article{DBLP:journals/comgeo/BitnerD12,
author = {Steven Bitner and
Ovidiu Daescu},
title = {Minimum-sum dipolar spanning tree in R\({}^{\mbox{3}}\)},
journal = {Comput. Geom.},
volume = {45},
number = {9},
pages = {476--481},
year = {2012},
url = {https://doi.org/10.1016/j.comgeo.2010.09.011},
doi = {10.1016/j.comgeo.2010.09.011},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/BitnerD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isvd/BitnerCD10,
author = {Steven Bitner and
Yam Ki Cheung and
Ovidiu Daescu},
editor = {Mir Abolfazl Mostafavi},
title = {Minimum Separating Circle for Bichromatic Points in the Plane},
booktitle = {Seventh International Symposium on Voronoi Diagrams in Science and
Engineering, {ISVD} 2010, Quebec, Canada, June 28-30, 2010},
pages = {50--55},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/ISVD.2010.14},
doi = {10.1109/ISVD.2010.14},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/isvd/BitnerCD10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BitnerCCDKW10,
author = {Steven Bitner and
Yam Ki Cheung and
Atlas F. Cook and
Ovidiu Daescu and
Anastasia Kurdia and
Carola Wenk},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Visiting a Sequence of Points with a Bevel-Tip Needle},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {492--502},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_43},
doi = {10.1007/978-3-642-12200-2\_43},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BitnerCCDKW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1222,
author = {Steven Bitner and
Ovidiu Daescu},
title = {Minimum Sum Dipolar Spanning Tree in R{\^{}}3},
journal = {CoRR},
volume = {abs/1007.1222},
year = {2010},
url = {http://arxiv.org/abs/1007.1222},
archivePrefix = {arXiv},
eprint = {1007.1222},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1222.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BitnerD09,
author = {Steven Bitner and
Ovidiu Daescu},
title = {Farthest segments and extremal triangles spanned by points in R\({}^{\mbox{3}}\)},
journal = {Inf. Process. Lett.},
volume = {109},
number = {20},
pages = {1167--1171},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.07.018},
doi = {10.1016/j.ipl.2009.07.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BitnerD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hicss/BitnerD08,
author = {Steven Bitner and
Ovidiu Daescu},
title = {Finding a Minimum-Sum Dipolar Spanning Tree in {R3}},
booktitle = {41st Hawaii International International Conference on Systems Science
{(HICSS-41} 2008), Proceedings, 7-10 January 2008, Waikoloa, Big Island,
HI, {USA}},
pages = {469},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/HICSS.2008.171},
doi = {10.1109/HICSS.2008.171},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/hicss/BitnerD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BitnerD07,
author = {Steven Bitner and
Ovidiu Daescu},
editor = {Prosenjit Bose},
title = {Finding Segments and Triangles Spanned by Points in R\({}^{\mbox{3}}\)},
booktitle = {Proceedings of the 19th Annual Canadian Conference on Computational
Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa,
Canada},
pages = {17--20},
publisher = {Carleton University, Ottawa, Canada},
year = {2007},
url = {http://cccg.ca/proceedings/2007/01a3.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BitnerD07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BitnerD07a,
author = {Steven Bitner and
Ovidiu Daescu},
editor = {Prosenjit Bose},
title = {Minimum-sum Dipolar Spanning Tree for Points in R\({}^{\mbox{3}}\)},
booktitle = {Proceedings of the 19th Annual Canadian Conference on Computational
Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa,
Canada},
pages = {81--84},
publisher = {Carleton University, Ottawa, Canada},
year = {2007},
url = {http://cccg.ca/proceedings/2007/04a1.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BitnerD07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}