forked from patmorin/freecoll
/
freecoll.bib
403 lines (370 loc) · 12.6 KB
/
freecoll.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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
@inproceedings{DBLP:conf/cccg/CastanedaU96,
author = {Netzahualcoyotl Casta{\~{n}}eda and
Jorge Urrutia},
title = {Straight Line Embeddings of Planar Graphs on Point Sets},
booktitle = {Proc. the 8th Canadian Conference on Computational
Geometry, {(CCCG)}},
pages = {312--318},
year = {1996}
}
@article{GMPP,
author = {P. Gritzmann and B. Mohar and J. Pach and R. Pollack},
title = {Embedding a planar triangulation with vertices at specified points (solution to problem e3341)},
journal = {Amer. Math. Monthly},
volume = {98},
year= 1991,
pages = {165--166}
}
@article{DBLP:journals/comgeo/Bose02,
author = {Prosenjit Bose},
title = {On embedding an outer-planar graph in a point set},
journal = {Comput. Geom.},
volume = {23},
number = {3},
pages = {303--312},
year = {2002}
}
@article{dFPP90,
AUTHOR = {de Fraysseix, H. and Pach, J. and Pollack, R.},
TITLE = {How to draw a planar graph on a grid},
JOURNAL = {Combinatorica},
VOLUME = {10},
YEAR = {1990},
NUMBER = {1},
PAGES = {41--51},
}
@article{DBLP:journals/ipl/Kurowski04,
author = {Maciej Kurowski},
title = {A 1.235 lower bound on the number of points needed to draw all \emph{n}-vertex
planar graphs},
journal = {Information Processing Letters},
volume = {92},
number = {2},
pages = {95--98},
year = {2004}
}
@article{DBLP:journals/jgaa/BannisterCDE14,
author = {Michael J. Bannister and
Zhanpeng Cheng and
William E. Devanny and
David Eppstein},
title = {Superpatterns and Universal Point Sets},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {177--209},
year = {2014}
}
@inproceedings{deFraysseix:1988:SSS:62212.62254,
author = {de Fraysseix, Hubert and Pach, J\'{a}nos and Pollack, Richard},
title = {Small Sets Supporting {F\'ary} Embeddings of Planar Graphs},
booktitle = {Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing},
series = {STOC '88},
year = {1988},
isbn = {0-89791-264-0},
location = {Chicago, Illinois, USA},
pages = {426--433},
numpages = {8}
}
@article{w-sp-05,
author = {David R. Wood},
title = {A Simple Proof of the {F}\'ary-{W}agner Theorem},
journal = {CoRR},
volume = {abs/cs/0505047},
year = {2005},
url = {http://arxiv.org/abs/cs/0505047},
archivePrefix = {arXiv},
eprint = {cs/0505047},
timestamp = {Wed, 07 Jun 2017 14:41:01 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/abs-cs-0505047},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{fary
, author = "Istv\'an F\'ary"
, title = "On Straight Line Representions of Planar Graphs"
, journal = "Acta Sci. Math. (Szeged)"
, volume = 11
, year = 1948
, pages = "229--233"
}
@article{pt-up-02,
author = {J{\'{a}}nos Pach and
G{\'{a}}bor Tardos},
title = {Untangling a Polygon},
journal = {Discrete {\&} Computational Geometry},
volume = {28},
number = {4},
pages = {585--592},
year = {2002}
}
@article{kpr-upg-11,
author = {Mihyun Kang and
Oleg Pikhurko and
Alexander Ravsky and
Mathias Schacht and
Oleg Verbitsky},
title = {Untangling planar graphs from a specified vertex position - {H}ard cases},
journal = {Discrete Applied Mathematics},
volume = {159},
number = {8},
pages = {789--799},
year = {2011}
}
@article{DBLP:journals/dm/Owens81,
author = {P. J. Owens},
title = {Non-{H}amiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons},
journal = {Discrete Mathematics},
volume = {36},
number = {2},
pages = {227--230},
year = {1981}
}
@article{gkossw-upg-09,
author = {Xavier Goaoc and
Jan Kratochv{\'{\i}}l and
Yoshio Okamoto and
Chan{-}Su Shin and
Andreas Spillner and
Alexander Wolff},
title = {Untangling a Planar Graph},
journal = {Discrete {\&} Computational Geometry},
volume = {42},
number = {4},
pages = {542--569},
year = {2009}
}
@article{c-upg-10,
author = {Josef Cibulka},
title = {Untangling Polygons and Graphs},
journal = {Discrete {\&} Computational Geometry},
volume = {43},
number = {2},
pages = {402--411},
year = {2010}
}
@article{ddlmw-pqp-15,
author = {Emilio {Di Giacomo} and
Walter Didimo and
Giuseppe Liotta and
Henk Meijer and
Stephen K. Wismath},
title = {Planar and Quasi-Planar Simultaneous Geometric Embedding},
journal = {The Computer Journal},
volume = {58},
number = {11},
pages = {3126--3140},
year = {2015}
}
@article{behks-cppsge-17,
author = {Luis Barba and
William Evans and
Michael Hoffmann and
Vincent Kusters and
Maria Saumell and
Bettina Speckmann},
title = {Column planarity and partially-simultaneous geometric embedding},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {983--1002},
year = {2017}
}
@inproceedings{abehlmmo-ups-12,
author = {Patrizio Angelini and
Carla Binucci and
William S. Evans and
Ferran Hurtado and
Giuseppe Liotta and
Tamara Mchedlidze and
Henk Meijer and
Yoshio Okamoto},
title = {Universal Point Subsets for Planar Graphs},
booktitle = {23rd International Symposium on Algorithms and Computation ({ISAAC} 2012)},
pages = {423--432},
year = {2012},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
series = {LNCS},
volume = {7676},
publisher = {Springer}
}
@Article{ dalozzo.dujmovic.ea:drawing,
title = {Drawing planar graphs with many collinear vertices},
author = {Giordano {Da Lozzo} and Vida Dujmovi\'c and Fabrizio Frati
and Tamara Mchedlidze and Vincenzo Roselli},
journal = {Journal of Computational Geometry},
volume = 9,
number = 1,
pages = {94--130},
year = 2018
}
@Article{ tutte:convex,
author = {W. T. Tutte},
title = {Convex representations of graphs},
journal = {Proceedings of the London Mathematical Society},
volume = 10,
year = 1960,
pages = {304-320}
}
@Article{ tutte:how,
author = {William T. Tutte},
title = {How to draw a graph},
journal = {Proceedings of the London Mathematical Society},
volume = {13},
pages = {743--768},
year = {1963}
}
@article{felsner.huemer.ea:binary,
author = {Stefan Felsner and
Clemens Huemer and
Sarah Kappes and
David Orden},
title = {Binary Labelings for Plane Quadrangulations and their Relatives},
journal = {Discrete Mathematics {\&} Theoretical Computer Science},
volume = {12},
number = {3},
pages = {115--138},
year = {2010},
url = {http://dmtcs.episciences.org/475},
timestamp = {Thu, 11 May 2017 14:15:03 +0200},
biburl = {https://dblp.org/rec/bib/journals/dmtcs/FelsnerHKO10},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{ravsky.verbitsky:on,
author = {Alexander Ravsky and
Oleg Verbitsky},
title = {On Collinear Sets in Straight-Line Drawings},
booktitle = {37th International Workshop on Graph-Theoretic Concepts in Computer Science ({WG} 2011)},
series = {LNCS},
volume = {6986},
pages = {295--306},
publisher = {Springer},
year = {2011},
note = {Preliminary version on arXiv:\href{http://arxiv.org/abs/0806.0253}
{0806.0253}},
crossref = {DBLP:conf/wg/2011},
url = {https://doi.org/10.1007/978-3-642-25870-1_27},
doi = {10.1007/978-3-642-25870-1_27}
}
@proceedings{DBLP:conf/wg/2011,
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {37th International Workshop on Graph-Theoretic Concepts in Computer Science ({WG} 2011)},
series = {LNCS},
volume = {6986},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1},
doi = {10.1007/978-3-642-25870-1}
}
@article{ravsky.verbitsky:on-arxiv,
author = {Alexander Ravsky and
Oleg Verbitsky},
title = {On collinear sets in straight line drawings},
journal = {CoRR},
volume = {abs/0806.0253},
year = {2008},
url = {http://arxiv.org/abs/0806.0253},
archivePrefix = {arXiv},
eprint = {0806.0253},
timestamp = {Wed, 07 Jun 2017 14:40:07 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/abs-0806-0253},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{devillers.liotta.ea:checking,
author = {Olivier Devillers and
Giuseppe Liotta and
Franco P. Preparata and
Roberto Tamassia},
title = {Checking the convexity of polytopes and the planarity of subdivisions},
journal = {Comput. Geom.},
volume = {11},
number = {3-4},
pages = {187--208},
year = {1998},
url = {https://doi.org/10.1016/S0925-7721(98)00039-X},
doi = {10.1016/S0925-7721(98)00039-X},
timestamp = {Sat, 16 Sep 2017 12:05:35 +0200},
biburl = {https://dblp.org/rec/bib/journals/comgeo/DevillersLPT98},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{dujmovic:utility,
author = {Vida Dujmovi\'c},
title = {The Utility of Untangling},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {121--134},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00407},
doi = {10.7155/jgaa.00407},
timestamp = {Sat, 20 May 2017 00:25:22 +0200},
biburl = {https://dblp.org/rec/bib/journals/jgaa/Dujmovic17},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{bose.dujmovic.ea:polynomial,
author = {Prosenjit Bose and
Vida Dujmovi\'c and
Ferran Hurtado and
Stefan Langerman and
Pat Morin and
David R. Wood},
title = {A Polynomial Bound for Untangling Geometric Planar Graphs},
journal = {Discrete {\&} Computational Geometry},
volume = {42},
number = {4},
pages = {570--585},
year = {2009},
url = {https://doi.org/10.1007/s00454-008-9125-3},
doi = {10.1007/s00454-008-9125-3},
timestamp = {Mon, 05 Jun 2017 20:47:50 +0200},
biburl = {https://dblp.org/rec/bib/journals/dcg/BoseDHLMW09},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{cano.toth.ea:upper,
author = {Javier Cano and
Csaba D. T{\'{o}}th and
Jorge Urrutia},
title = {Upper Bound Constructions for Untangling Planar Geometric Graphs},
journal = {{SIAM} J. Discrete Math.},
volume = {28},
number = {4},
pages = {1935--1943},
year = {2014},
url = {https://doi.org/10.1137/130924172},
doi = {10.1137/130924172},
timestamp = {Fri, 26 May 2017 22:54:47 +0200},
biburl = {https://dblp.org/rec/bib/journals/siamdm/CanoTU14},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{mchedlidze.radermacher.ea:aligned,
author = {Tamara Mchedlidze and
Marcel Radermacher and
Ignaz Rutter},
title = {Aligned Drawings of Planar Graphs},
booktitle = {25th International Symposium on Graph Drawing and Network Visualization ({GD} 2017)},
pages = {3--16},
year = {2017},
crossref = {DBLP:conf/gd/2017},
url = {https://doi.org/10.1007/978-3-319-73915-1_1},
doi = {10.1007/978-3-319-73915-1_1},
timestamp = {Wed, 21 Feb 2018 12:53:44 +0100},
biburl = {https://dblp.org/rec/bib/conf/gd/MchedlidzeRR17},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gd/2017,
editor = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {25th International Symposium on Graph Drawing and Network Visualization ({GD} 2017)},
series = {LNCS},
volume = {10692},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-73915-1},
doi = {10.1007/978-3-319-73915-1},
isbn = {978-3-319-73914-4},
timestamp = {Wed, 21 Feb 2018 12:53:44 +0100},
biburl = {https://dblp.org/rec/bib/conf/gd/2017},
bibsource = {dblp computer science bibliography, https://dblp.org}
}