-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlinebreaking.bib
229 lines (212 loc) · 6.74 KB
/
linebreaking.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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
@ references for implementing (efficiently) a line-breaking algorithm
@ the first is the original Knuth algorithm; the rest are optimizations
@article {SPE:SPE4380111102,
author = {Knuth, Donald E. and Plass, Michael F.},
title = {Breaking paragraphs into lines},
journal = {Software: Practice and Experience},
volume = {11},
number = {11},
publisher = {John Wiley & Sons, Ltd.},
issn = {1097-024X},
url = {http://dx.doi.org/10.1002/spe.4380111102},
doi = {10.1002/spe.4380111102},
pages = {1119--1184},
year = {1981},
}
@article{Hirschberg:1987:LWS:33367.33370,
author = {Hirschberg, Daniel S. and Larmore, Lawrence Louis},
title = {The Least Weight Subsequence Problem},
journal = {SIAM Journal on Computing},
issue_date = {August 1987},
volume = {16},
number = {4},
month = aug,
year = {1987},
issn = {0097-5397},
pages = {628--638},
numpages = {11},
url = {http://dx.doi.org/10.1137/0216043},
doi = {10.1137/0216043},
acmid = {33370},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
}
@article{Hirschberg:1987:NAF:28869.28875,
author = {Hirschberg, Daniel S. and Larmore, Lawrence Louis},
title = {New Applications of Failure Functions},
journal = {Journal of the ACM},
issue_date = {July 1987},
volume = {34},
number = {3},
month = jul,
year = {1987},
issn = {0004-5411},
pages = {616--625},
numpages = {10},
url = {http://doi.acm.org/10.1145/28869.28875},
doi = {10.1145/28869.28875},
acmid = {28875},
publisher = {ACM},
address = {New York, NY, USA},
}
@inproceedings{Aggarwal:1986:GAM:10515.10546,
author = {Aggarwal, A and Klawe, M and Moran, S and Shor, P and Wilber, R},
title = {Geometric Applications of a Matrix Searching Algorithm},
booktitle = {Proceedings of the Second Annual Symposium on Computational Geometry},
series = {SCG '86},
year = {1986},
isbn = {0-89791-194-6},
location = {Yorktown Heights, New York, USA},
pages = {285--292},
numpages = {8},
url = {http://doi.acm.org/10.1145/10515.10546},
doi = {10.1145/10515.10546},
acmid = {10546},
publisher = {ACM},
address = {New York, NY, USA},
}
@inproceedings{Aggarwal:1986:GAM:10515.10546,
author = {Aggarwal, A and Klawe, M and Moran, S and Shor, P and Wilber, R},
title = {Geometric Applications of a Matrix Searching Algorithm},
booktitle = {Proceedings of the Second Annual Symposium on Computational Geometry},
series = {SCG '86},
year = {1986},
isbn = {0-89791-194-6},
location = {Yorktown Heights, New York, USA},
pages = {285--292},
numpages = {8},
url = {http://doi.acm.org/10.1145/10515.10546},
doi = {10.1145/10515.10546},
acmid = {10546},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{Wilber:1988:CLS:51368.51379,
author = {Wilber, Robert},
title = {The Concave Least-weight Subsequence Problem Revisited},
journal = {Journal of Algorithms},
issue_date = {September 1988},
volume = {9},
number = {3},
month = sep,
year = {1988},
issn = {0196-6774},
pages = {418--425},
numpages = {8},
url = {http://dx.doi.org/10.1016/0196-6774(88)90032-6},
doi = {10.1016/0196-6774(88)90032-6},
acmid = {51379},
publisher = {Academic Press, Inc.},
address = {Duluth, MN, USA},
}
@article{Galil:1989:SUD:64154.64250,
author = {Galil, Zvi and Giancarlo, Raffaele},
title = {Speeding Up Dynamic Programming with Application to Molecular Biology},
journal = {Theoretical Computer Science},
issue_date = {April 1989},
volume = {64},
number = {1},
month = apr,
year = {1989},
issn = {0304-3975},
pages = {107--118},
numpages = {12},
url = {https://doi.org/10.1016/0304-3975(89)90101-1},
doi = {10.1016/0304-3975(89)90101-1},
acmid = {64250},
publisher = {Elsevier Science Publishers Ltd.},
address = {Essex, UK},
}
@article{Galil:1990:LAC:79790.79800,
author = {Galil, Zvi and Park, Kunsoo},
title = {A Linear-time Algorithm for Concave One-dimensional Dynamic Programming},
journal = {Information Processing Letters},
issue_date = {February 1990},
volume = {33},
number = {6},
month = feb,
year = {1990},
issn = {0020-0190},
pages = {309--311},
numpages = {3},
url = {http://dx.doi.org/10.1016/0020-0190(90)90215-J},
doi = {10.1016/0020-0190(90)90215-J},
acmid = {79800},
publisher = {Elsevier North-Holland, Inc.},
address = {Amsterdam, The Netherlands, The Netherlands},
}
@article{Eppstein:1990:SCM:82765.82778,
author = {Eppstein, David},
title = {Sequence Comparison with Mixed Convex and Concave Costs},
journal = {Journal of Algorithms},
issue_date = {March 1990},
volume = {11},
number = {1},
month = feb,
year = {1990},
issn = {0196-6774},
pages = {85--101},
numpages = {17},
url = {http://dx.doi.org/10.1016/0196-6774(90)90031-9},
doi = {10.1016/0196-6774(90)90031-9},
acmid = {82778},
publisher = {Academic Press, Inc.},
address = {Duluth, MN, USA},
}
@article{Eppstein:1992:SDP:146637.146656,
author = {Eppstein, David and Galil, Zvi and Giancarlo, Raffaele and Italiano, Giuseppe F.},
title = {Sparse Dynamic Programming II: Convex and Concave Cost Functions},
journal = {Journal of the ACM},
issue_date = {July 1992},
volume = {39},
number = {3},
month = jul,
year = {1992},
issn = {0004-5411},
pages = {546--567},
numpages = {22},
url = {http://doi.acm.org/10.1145/146637.146656},
doi = {10.1145/146637.146656},
acmid = {146656},
publisher = {ACM},
address = {New York, NY, USA},
}
@Inbook{Becker1997,
author="Becker, Peter",
editor="Jiang, Tao and Lee, D. T.",
title="Construction of nearly optimal multiway trees",
bookTitle="Computing and Combinatorics: Third Annual International Conference, COCOON '97 Shanghai, China, August 20--22, 1997 Proceedings",
year="1997",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="294--303",
isbn="978-3-540-69522-6",
doi="10.1007/BFb0045096",
url="https://doi.org/10.1007/BFb0045096"
}
@article{DEMOOR19993,
title = "Bridging the algorithm gap: A linear-time functional program for paragraph formatting",
journal = "Science of Computer Programming",
volume = "35",
number = "1",
pages = "3--27",
year = "1999",
note = "",
issn = "0167-6423",
doi = "http://dx.doi.org/10.1016/S0167-6423(99)00005-2",
url = "http://www.sciencedirect.com/science/article/pii/S0167642399000052",
author = "Oege de Moor and Jeremy Gibbons",
}
@Inbook{Aggarwal1993,
author="Aggarwal, Alok and Tokuyama, Takeshi",
editor="Ng, K. W. and Raghavan, P. and Balasubramanian, N. V. and Chin, F. Y. L.",
title="Consecutive interval query and dynamic programming on intervals",
bookTitle="Algorithms and Computation: 4th International Symposium, ISAAC '93 Hong Kong, December 15--17, 1993 Proceedings",
year="1993",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="466--475",
isbn="978-3-540-48233-8",
doi="10.1007/3-540-57568-5_278",
url="https://doi.org/10.1007/3-540-57568-5_278"
}