-
Notifications
You must be signed in to change notification settings - Fork 0
/
biblio.bib
300 lines (273 loc) · 9.35 KB
/
biblio.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
%
% Note: The citation keys are generated using the "shorttitle"
% field, which must be added manually.
%
@article{flipwidth2023,
title={Flip-width: Cops and Robber on dense graphs},
shorttitle={ArXiv},
url={http://arxiv.org/abs/2302.00352},
note={arXiv:2302.00352 [cs, math]},
number={arXiv:2302.00352},
publisher={arXiv},
author={Toru\'nczyk, Symon},
year={2023},
month={02},
}
@INPROCEEDINGS{tree-like,
author={Adcock, Aaron B. and Sullivan, Blair D. and Mahoney, Michael W.},
shorttitle={ICDM},
booktitle={2013 IEEE 13th International Conference on Data Mining},
title={Tree-Like Structure in Large Social and Information Networks},
year={2013},
volume={},
number={},
pages={1-10},
% doi={10.1109/ICDM.2013.77}
}
@InProceedings{treewidth-db,
author = {Silviu Maniu and Pierre Senellart and Suraj Jog},
title = {{An Experimental Study of the Treewidth of Real-World Graph Data}},
shorttitle={ICDT},
booktitle = {22nd International Conference on Database Theory (ICDT 2019)},
pages = {12:1--12:18},
year = {2019},
volume = {127},
}
@article{tree-diet,
shorttitle = {Alg. Mol. Bio.},
author = {Marchand, Bertrand and Ponty, Yann and Bulteau, Laurent},
year = {2022},
month = {04},
pages = {},
title = {Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics},
volume = {17},
journal = {Algorithms for Molecular Biology},
% doi = {10.1186/s13015-022-00213-z}
}
@article{planar-street,
shorttitle = {Env. Plan. B},
author = {Geoff Boeing},
title ={Planarity and street network representation in urban form analysis},
journal = {Environment and Planning B: Urban Analytics and City Science},
volume = {47},
number = {5},
pages = {855-869},
year = {2020},
% doi = {10.1177/2399808318802941},
}
@INPROCEEDINGS{planar-bio,
shorttitle={BIBM},
author={Gasper, William and Cooper, Kathryn and Cornelius, Nathan and Ali, Hesham},
booktitle={2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)},
title={Parallel Planar Approximation for Large Networks},
year={2021},
volume={},
number={},
pages={1948-1955},
% doi = {10.1109/BIBM52615.2021.9669815}
}
@article{Joret2022,
shorttitle = {Elec. J. Comb.},
% doi = {10.37236/10274},
year = {2022},
month = {03},
volume = {29},
number = {1},
author = {Gwena\"el Joret and Piotr Micek},
title = {Improved Bounds for Weak Coloring Numbers},
journal = {The Electronic Journal of Combinatorics}
}
@article{Brown2020,
shorttitle = {Gen. Bio.},
% doi = {10.1186/s13059-020-02066-4},
year = {2020},
month = jul,
publisher = {Springer Science and Business Media {LLC}},
volume = {21},
number = {1},
author = {C. Titus Brown and Dominik Moritz and Michael P. O'Brien and Felix Reidl and Taylor Reiter and Blair D. Sullivan},
title = {Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity},
journal = {Genome Biology}
}
@book{Nesetril2012,
shorttitle={Sparsity},
title={Sparsity: graphs, structures, and algorithms},
author={Ne{\v{s}}et{\v{r}}il, Jaroslav and De Mendez, Patrice Ossona},
volume={28},
year={2012},
publisher={Springer Science \& Business Media}
}
@misc{Nederlof2022,
shorttitle={ArXiv},
url = {https://arxiv.org/abs/2201.09340},
author = {Nederlof, Jesper and Pilipczuk, Micha\l and W{e}grzycki, Karol},
title = {Bounding generalized coloring numbers of planar graphs using coin models},
publisher = {arXiv},
year = {2022},
copyright = {arXiv.org perpetual, non-exclusive license}
}
@misc{Breen2023,
shorttitle = {{EuJC (in press)}},
url = {https://arxiv.org/abs/2112.10562},
author = {Breen-McKay, Michael and Lavallee, Brian and Sullivan, Blair D.},
keywords = {Computational Complexity (cs.CC), FOS: Computer and information sciences, FOS: Computer and information sciences},
title = {Hardness of the Generalized Coloring Numbers},
publisher = {arXiv},
note = {In Press, European Journal of Combinatorics, March 2023},
year = {2023},
copyright = {Creative Commons Attribution 4.0 International}
}
@article {Reiter2022,
shorttitle = {bioRxiv},
author = {Reiter, Taylor E. and Irber, Luiz and Gingrich, Alicia A. and Haynes, Dylan and Pierce-Ward, N. Tessa and Brooks, Phillip T. and Mizutani, Yosuke and Moritz, Dominik and Reidl, Felix and Willis, Amy D. and Sullivan, Blair D. and Brown, C. Titus},
title = {Meta-analysis of metagenomes via machine learning and assembly graphs reveals strain switches in Crohn{\textquoteright}s disease},
year = {2022},
publisher = {Cold Spring Harbor Laboratory},
URL = {https://www.biorxiv.org/content/early/2022/07/05/2022.06.30.498290},
journal = {bioRxiv}
}
@article{vandenHeuvel2021,
shorttitle = {EuJC},
title = {Uniform orderings for generalized coloring numbers},
journal = {European Journal of Combinatorics},
volume = {91},
pages = {103214},
year = {2021},
note = {Colorings and structural graph theory in context (a tribute to Xuding Zhu)},
author = {Jan {van den Heuvel} and H.A. Kierstead},
}
@article{vandenHeuvel2017,
shorttitle = {EuJC},
title = {On the generalised colouring numbers of graphs that exclude a fixed minor},
journal = {European Journal of Combinatorics},
volume = {66},
pages = {129-144},
year = {2017},
note = {Selected papers of EuroComb15},
% doi = {https://doi.org/10.1016/j.ejc.2017.06.019},
author = {Jan {van den Heuvel} and Patrice Ossona {de Mendez} and Daniel Quiroz and Roman Rabinovich and Sebastian Siebertz},
}
@article{Demaine2019,
shorttitle = {JCSS},
title = {Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs},
journal = {Journal of Computer and System Sciences},
volume = {105},
pages = {199-241},
year = {2019},
% doi = {https://doi.org/10.1016/j.jcss.2019.05.004},
author = {Erik D. Demaine and Felix Reidl and Peter Rossmanith and Fernando {Sánchez Villaamil} and Somnath Sikdar and Blair D. Sullivan},
}
@article{Dreier2022,
shorttitle = {DM},
title = {Twin-width and generalized coloring numbers},
journal = {Discrete Mathematics},
volume = {345},
number = {3},
pages = {112746},
year = {2022},
% doi = {https://doi.org/10.1016/j.disc.2021.112746},
author = {Jan Dreier and Jakub Gajarsk\'y and Yiting Jiang and Patrice {Ossona de Mendez} and Jean-Florent Raymond},
}
@article{Almulhim2022,
shorttitle = {DM},
title = {On the weak 2-coloring number of planar graphs},
journal = {Discrete Mathematics},
volume = {345},
number = {1},
pages = {112631},
year = {2022},
% doi = {https://doi.org/10.1016/j.disc.2021.112631},
author = {Ahlam Almulhim and H.A. Kierstead},
}
@article{Kierstead2020,
shorttitle = {DM},
title = {On coloring numbers of graph powers},
journal = {Discrete Mathematics},
volume = {343},
number = {6},
pages = {111712},
year = {2020},
% doi = {https://doi.org/10.1016/j.disc.2019.111712},
author = {H.A. Kierstead and Daqing Yang and Junjun Yi},
}
@article{Kierstead2003,
shorttitle = {Order},
title={Orderings on graphs and game coloring number},
author={Kierstead, Hal A and Yang, Daqing},
journal={Order},
volume={20},
number={3},
year={2003},
publisher={Springer}
}
@article{dvovrak2022weighted,
shorttitle = {JGT},
title={On weighted sublinear separators},
author={Dvo{\v{r}}{\'a}k, Zden{\v{e}}k},
journal={Journal of Graph Theory},
volume={100},
number={2},
pages={270--280},
year={2022},
publisher={Wiley Online Library}
}
@article{Nesetril2008,
shorttitle = {EuJC},
title = {Grad and classes with bounded expansion I. Decompositions},
journal = {European Journal of Combinatorics},
volume = {29},
number = {3},
pages = {760-776},
year = {2008},
% doi = {https://doi.org/10.1016/j.ejc.2006.07.013},
author = {Jaroslav Ne{\v{s}}et{\v{r}}il and Patrice {Ossona de Mendez}},
}
@article{dvorak2013constant,
shorttitle = {EuJC},
title = {Constant-factor approximation of the domination number in sparse graphs},
journal = {European Journal of Combinatorics},
volume = {34},
number = {5},
year = {2013},
% doi = {https://doi.org/10.1016/j.ejc.2012.12.004},
author={Dvo{\v{r}}{\'a}k, Zden{\v{e}}k},
}
@book{Cygan2015,
shorttitle = {Param. Alg},
% doi = {10.1007/978-3-319-21275-3},
year = {2015},
publisher = {Springer International Publishing},
author = {Marek Cygan and Fedor V. Fomin and {\L}ukasz Kowalik and Daniel Lokshtanov and D{\'{a}}niel Marx and Marcin Pilipczuk and Micha{\l} Pilipczuk and Saket Saurabh},
title = {Parameterized Algorithms}
}
@book{Downey1999,
shorttitle = {Param. Compexity},
% doi = {10.1007/978-1-4612-0515-9},
year = {1999},
publisher = {Springer New York},
author = {R. G. Downey and M. R. Fellows},
title = {Parameterized Complexity}
}
@article{Bulteau2019,
shorttitle = {Alg},
title={Parameterized Algorithms in Bioinformatics: An Overview},
volume={12},
% DOI={10.3390/a12120256},
number={12},
journal={Algorithms},
publisher={MDPI AG},
author={Bulteau, Laurent and Weller, Mathias},
year={2019},
month={12},
pages={256}
}
@article{Reidl2023,
shorttitle = {Algorithmica},
% doi = {10.1007/s00453-023-01096-1},
year = {2023},
month = feb,
publisher = {Springer Science and Business Media {LLC}},
author = {Felix Reidl and Blair D. Sullivan},
title = {A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes},
journal = {Algorithmica}
}