-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathus.bib
770 lines (715 loc) · 27.1 KB
/
us.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
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
@Article{ almeter.demircan.ea:graph,
author = {Jordan Almeter and Samet Demircan and Andrew Kallmeyer and
Kevin G. Milans and Robert Winslow},
title = {Graph 2-rankings},
journal = {Graphs and Combinatorics},
volume = {35},
number = {1},
pages = {91--102},
year = {2019},
url = {https://doi.org/10.1007/s00373-018-1979-4},
doi = {10.1007/s00373-018-1979-4},
timestamp = {Fri, 18 Jan 2019 23:22:46 +0100},
biburl = {https://dblp.org/rec/journals/gc/AlmeterDKMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ bodlaender.deogun.ea:rankings,
author = {Hans L. Bodlaender and Jitender S. Deogun and Klaus Jansen
and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller and
Zsolt Tuza},
title = {Rankings of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {168--181},
year = {1998},
url = {https://doi.org/10.1137/S0895480195282550},
doi = {10.1137/S0895480195282550},
timestamp = {Sat, 25 Apr 2020 13:56:57 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderDJKKMT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ bodlaender.gilbert.ea:approximating,
author = {Hans L. Bodlaender and John R. Gilbert and Hj{\'{a}}lmtyr
Hafsteinsson and Ton Kloks},
title = {Approximating Treewidth, Pathwidth, Frontsize, and
Shortest Elimination Tree},
journal = {J. Algorithms},
volume = {18},
number = {2},
pages = {238--255},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1009},
doi = {10.1006/jagm.1995.1009},
timestamp = {Sun, 02 Jun 2019 20:52:08 +0200},
biburl = {https://dblp.org/rec/journals/jal/BodlaenderGHK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ deogun.kloks.ea:on,
author = {Jitender S. Deogun and Ton Kloks and Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {On the Vertex Ranking Problem for Trapezoid, Circular-arc
and Other Graphs},
journal = {Discret. Appl. Math.},
volume = {98},
number = {1-2},
pages = {39--63},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00179-1},
doi = {10.1016/S0166-218X(99)00179-1},
timestamp = {Thu, 20 Feb 2020 15:48:54 +0100},
biburl = {https://dblp.org/rec/journals/dam/DeogunKKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@InProceedings{ dereniowski.kubale:cholesky,
author = {Dariusz Dereniowski and Marek Kubale},
editor = {Roman Wyrzykowski and Jack J. Dongarra and Marcin
Paprzycki and Jerzy Wasniewski},
title = {Cholesky Factorization of Matrices in Parallel and Ranking
of Graphs},
booktitle = {Parallel Processing and Applied Mathematics, 5th
International Conference, {PPAM} 2003, Czestochowa, Poland,
September 7-10, 2003. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3019},
pages = {985--992},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24669-5\_127},
doi = {10.1007/978-3-540-24669-5\_127},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ppam/DereniowskiK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ dereniowski.nadolski:vertex,
author = {Dariusz Dereniowski and Adam Nadolski},
title = {Vertex rankings of chordal graphs and weighted trees},
journal = {Inf. Process. Lett.},
volume = {98},
number = {3},
pages = {96--100},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.12.006},
doi = {10.1016/j.ipl.2005.12.006},
timestamp = {Fri, 30 Nov 2018 13:29:07 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DereniowskiN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Book{ diestel:graph,
author = {Reinhard Diestel},
title = {Graph Theory, 4th Edition},
series = {Graduate texts in mathematics},
volume = {173},
publisher = {Springer},
year = {2012},
isbn = {978-3-642-14278-9},
timestamp = {Mon, 04 Mar 2013 20:55:42 +0100},
biburl = {https://dblp.org/rec/books/daglib/0030488.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ duff.reid:multifrontal,
author = {Iain S. Duff and John K. Reid},
title = {The Multifrontal Solution of Indefinite Sparse Symmetric
Linear},
journal = {{ACM} Trans. Math. Softw.},
volume = {9},
number = {3},
pages = {302--325},
year = {1983},
url = {https://doi.org/10.1145/356044.356047},
doi = {10.1145/356044.356047},
timestamp = {Tue, 06 Nov 2018 12:51:10 +0100},
biburl = {https://dblp.org/rec/journals/toms/DuffR83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{debski.felsner.ea:improved,
author = {Michal Debski and
Stefan Felsner and
Piotr Micek and
Felix Schr{\"{o}}der},
editor = {Shuchi Chawla},
title = {Improved bounds for centered colorings},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2212--2226},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.136},
doi = {10.1137/1.9781611975994.136},
timestamp = {Fri, 31 Jan 2020 13:53:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/DebskiFMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@InProceedings{ dujmovic.joret.ea:planar_conf,
author = {Vida Dujmovi\'{c} and Gwena{\"{e}}l Joret and Piotr Micek
and Pat Morin and Torsten Ueckerdt and David R. Wood},
editor = {David Zuckerman},
title = {Planar Graphs have Bounded Queue-Number},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer
Science, {FOCS} 2019, Baltimore, Maryland, USA, November
9-12, 2019},
pages = {862--875},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00056},
doi = {10.1109/FOCS.2019.00056},
timestamp = {Tue, 07 Jan 2020 13:31:39 +0100},
biburl = {https://dblp.org/rec/conf/focs/DujmovicJMMUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{dujmovic.joret.ea:planar,
author = {Vida Dujmovi\'{c} and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
title = {Planar Graphs Have Bounded Queue-Number},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {22:1--22:38},
year = {2020},
url = {https://dl.acm.org/doi/10.1145/3385731},
timestamp = {Thu, 17 Sep 2020 12:01:03 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DujmovicJMMUW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ dujmovic.morin.ea:structure,
author = {Vida Dujmović and Pat Morin and David R. Wood},
title = {The structure of k-planar graphs},
journal = {CoRR},
volume = {abs/1907.05168},
year = {2019},
url = {http://arxiv.org/abs/1907.05168},
archiveprefix = {arXiv},
eprint = {1907.05168},
timestamp = {Wed, 17 Jul 2019 10:27:36 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-05168.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ even.smorodinsky:hitting,
author = {Guy Even and Shakhar Smorodinsky},
title = {Hitting sets online and unique-max coloring},
journal = {Discret. Appl. Math.},
volume = {178},
pages = {71--82},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.06.019},
doi = {10.1016/j.dam.2014.06.019},
timestamp = {Thu, 20 Feb 2020 15:48:18 +0100},
biburl = {https://dblp.org/rec/journals/dam/EvenS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ gallian:dynamic,
author = {Joseph A. Gallian},
title = {A Dynamic Survey of Graph Labeling},
journal = {Electronic Journal of Combinatorics},
doi = {10.37236/27},
note = {Version 22, published December 15, 2019.}
}
@Article{ karpas.neiman.ea:on,
author = {Ilan Karpas and Ofer Neiman and Shakhar Smorodinsky},
title = {On vertex rankings of graphs and its relatives},
journal = {Discret. Math.},
volume = {338},
number = {8},
pages = {1460--1467},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.03.008},
doi = {10.1016/j.disc.2015.03.008},
timestamp = {Sat, 22 Feb 2020 13:57:54 +0100},
biburl = {https://dblp.org/rec/journals/dm/KarpasNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ karpas.neiman.ea:on-arxiv,
author = {Ilan Karpas and Ofer Neiman and Shakhar Smorodinsky},
title = {On Vertex Rankings of Graphs and its Relatives},
journal = {CoRR},
volume = {abs/1609.06111},
year = {2016},
url = {http://arxiv.org/abs/1609.06111},
archiveprefix = {arXiv},
eprint = {1609.06111},
timestamp = {Mon, 13 Aug 2018 16:48:34 +0200},
biburl = {https://dblp.org/rec/journals/corr/KarpasNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ katchalski.mccuaig.ea:ordered,
author = {Meir Katchalski and William McCuaig and Suzanne M.
Seager},
title = {Ordered colourings},
journal = {Discret. Math.},
volume = {142},
number = {1-3},
pages = {141--154},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(93)E0216-Q},
doi = {10.1016/0012-365X(93)E0216-Q},
timestamp = {Sat, 22 Feb 2020 14:00:32 +0100},
biburl = {https://dblp.org/rec/journals/dm/KatchalskiMS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Book{ kloks:treewidth,
author = {T. Kloks},
title = {Treewidth–Computations and Approximations},
series = {Lecture Notes in Computer Science},
volume = {842},
publisher = {Springer-Verlag},
address = {New York},
year = {1994}
}
@InProceedings{ leiserson:area,
author = {Charles E. Leiserson},
title = {Area-Efficient Graph Layouts (for {VLSI)}},
booktitle = {21st Annual Symposium on Foundations of Computer Science,
Syracuse, New York, USA, 13-15 October 1980},
pages = {270--281},
publisher = {{IEEE} Computer Society},
year = {1980},
url = {https://doi.org/10.1109/SFCS.1980.13},
doi = {10.1109/SFCS.1980.13},
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
biburl = {https://dblp.org/rec/conf/focs/Leiserson80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ liu:role,
author = {J. W. H. Liu},
title = {The role of elimination trees in sparse factorization},
journal = {SIAM J. Matrix Anal. Appl.},
volume = {11},
year = {1990},
pages = {134–172}
}
@Article{ llewellyn.tovey.ea:erratum,
author = {Donna Crystal Llewellyn and Craig A. Tovey and Michael A.
Trick},
title = {Erratum: Local Optimization on Graphs},
journal = {Discret. Appl. Math.},
volume = {46},
number = {1},
pages = {93--94},
year = {1993},
timestamp = {Thu, 20 Feb 2020 15:48:09 +0100},
biburl = {https://dblp.org/rec/journals/dam/LlewellynTT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ llewellyn.tovey.ea:local,
author = {Donna Crystal Llewellyn and Craig A. Tovey and Michael A.
Trick},
title = {Local optimization on graphs},
journal = {Discret. Appl. Math.},
volume = {23},
number = {2},
pages = {157--178},
year = {1989},
url = {https://doi.org/10.1016/0166-218X(89)90025-5},
doi = {10.1016/0166-218X(89)90025-5},
timestamp = {Thu, 20 Feb 2020 15:49:39 +0100},
biburl = {https://dblp.org/rec/journals/dam/LlewellynTT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ morin:fast,
author = {Pat Morin},
title = {A Fast Algorithm for the Product Structure of Planar
Graphs},
journal = {CoRR},
volume = {abs/2004.02530},
year = {2020},
url = {https://arxiv.org/abs/2004.02530},
archiveprefix = {arXiv},
eprint = {2004.02530},
timestamp = {Wed, 08 Apr 2020 17:08:25 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-02530.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
InProceedings{ pilipczuk.siebertz:polynomial,
author = {Michal Pilipczuk and Sebastian Siebertz},
editor = {Timothy M. Chan},
title = {Polynomial bounds for centered colorings on proper
minor-closed graph classes},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium
on Discrete Algorithms, {SODA} 2019, San Diego, California,
USA, January 6-9, 2019},
pages = {1501--1520},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.91},
doi = {10.1137/1.9781611975482.91},
timestamp = {Wed, 25 Sep 2019 18:02:13 +0200},
biburl = {https://dblp.org/rec/conf/soda/PilipczukS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Article{ pilipczuk.siebertz:polynomial-arxiv,
author = {Michal Pilipczuk and Sebastian Siebertz},
title = {Polynomial bounds for centered colorings on proper
minor-closed graph classes},
journal = {CoRR},
volume = {abs/1807.03683},
year = {2018},
url = {http://arxiv.org/abs/1807.03683},
archiveprefix = {arXiv},
eprint = {1807.03683},
timestamp = {Mon, 13 Aug 2018 16:47:53 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-03683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ schaeffer:optimal,
author = {Alejandro A. Sch\"{a}ffer},
title = {Optimal vertex ranking of trees in linear time},
journal = {Inf. Process. Lett.},
volume = {33},
pages = {91–99},
doi = {10.1016/0020-0190(89)90161-0},
year = {1988}
}
@article{iyer.ratliff.ea:optimal,
author = {Ananth V. Iyer and
H. Donald Ratliff and
Gopalakrishnan Vijayan},
title = {Optimal Node Ranking of Trees},
journal = {Inf. Process. Lett.},
volume = {28},
number = {5},
pages = {225--229},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90194-9},
doi = {10.1016/0020-0190(88)90194-9},
timestamp = {Wed, 14 Nov 2018 10:49:27 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IyerRV88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ sen.deng.ea:on,
author = {Arunabha Sen and Haiyong Deng and Sumanta Guha},
title = {On a Graph Partition Problem with Application to {VLSI}
Layout},
journal = {Inf. Process. Lett.},
volume = {43},
number = {2},
pages = {87--94},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90017-P},
doi = {10.1016/0020-0190(92)90017-P},
timestamp = {Fri, 26 May 2017 22:54:45 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SenDG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@InProceedings{ shalu.antony:complexity,
author = {M. A. Shalu and Cyriac Antony},
editor = {Manoj Changat and Sandip Das},
title = {Complexity of Restricted Variant of Star Colouring},
booktitle = {Algorithms and Discrete Applied Mathematics - 6th
International Conference, {CALDAM} 2020, Hyderabad, India,
February 13-15, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12016},
pages = {3--14},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-39219-2\_1},
doi = {10.1007/978-3-030-39219-2\_1},
timestamp = {Thu, 06 Feb 2020 18:14:53 +0100},
biburl = {https://dblp.org/rec/conf/caldam/ShaluA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Article{ torre.greenlaw.ea:optimal,
author = {Pilar de la Torre and Raymond Greenlaw and Alejandro A.
Sch{\"{a}}ffer},
title = {Optimal Edge Ranking of Trees in Polynomial Time},
journal = {Algorithmica},
volume = {13},
number = {6},
pages = {592--618},
year = {1995},
url = {https://doi.org/10.1007/BF01189071},
doi = {10.1007/BF01189071},
timestamp = {Wed, 17 May 2017 14:25:14 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TorreGS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{knauer.ueckerdt:simple,
author = {Kolja Knauer and Torsten Ueckerdt},
title = {Simple treewidth},
editor = {Pavel Rytír},
booktitle = {Midsummer Combinatorial Workshop Prague},
year = {2012},
url = {https://kam.mff.cuni.cz/workshops/mcw/work18/mcw2012booklet.pdf}
}
@misc{wulf:stacked,
author = {Lasse Wulf},
title = {Stacked treewidth and the {C}olin de {V}erdiére number},
howpublished = {Bachelorthesis,
\newblock Department of Informatics, Institute of Theoretical Computer Science, Karlsruhe Institute of Technology},
url = {https://i11www.iti.kit.edu/_media/teaching/theses/ba-wulf-16.pdf},
year = {2016},
}
@article{markenzon.justel.ea:subclasses,
author = {Lilian Markenzon and
Cl{\'{a}}udia Marcela Justel and
N. Paciornik},
title = {Subclasses of \emph{k}-trees: Characterization and recognition},
journal = {Discret. Appl. Math.},
volume = {154},
number = {5},
pages = {818--825},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.05.021},
doi = {10.1016/j.dam.2005.05.021},
timestamp = {Thu, 20 Feb 2020 15:47:06 +0100},
biburl = {https://dblp.org/rec/journals/dam/MarkenzonJP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{kratochvil.vaner:note,
author = {Jan Kratochv{\'{\i}}l and
Michal Vaner},
title = {A note on planar partial 3-trees},
journal = {CoRR},
volume = {abs/1210.8113},
year = {2012},
url = {http://arxiv.org/abs/1210.8113},
archivePrefix = {arXiv},
eprint = {1210.8113},
timestamp = {Mon, 13 Aug 2018 16:47:22 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-8113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{elmallah.colbourn:on,
author = {Ehab S. Elmallah and
Charles J. Colbourn},
title = {On two dual classes of planar graphs},
journal = {Discret. Math.},
volume = {80},
number = {1},
pages = {21--40},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90293-Q},
doi = {10.1016/0012-365X(90)90293-Q},
timestamp = {Sat, 22 Feb 2020 13:57:23 +0100},
biburl = {https://dblp.org/rec/journals/dm/El-MallahC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Misc{dujmovic.morin.ea:notes,
author = {Vida Dujmović and Pat Morin and David R. Wood},
title = {Notes on Simple Treewidth},
howpublished = {Manuscript},
year = {2020}
}
misc{wulf:stacked,
author = {Lasse Wulf},
title = {Stacked treewidth and the {C}olin de {V}erdière number},
howpublished = {Bachelorthesis,
\newblock Department of Informatics, Institute of Theoretical Computer Science, Karlsruhe Institute of Technology},
year = {2016},
}
@inproceedings{abel.alvarez.ea:conflict-free,
author = {Zachary Abel and
Victor Alvarez and
Erik D. Demaine and
S{\'{a}}ndor P. Fekete and
Aman Gour and
Adam Hesterberg and
Phillip Keldenich and
Christian Scheffer},
editor = {Philip N. Klein},
title = {Three Colors Suffice: Conflict-Free Coloring of Planar Graphs},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1951--1963},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.127},
doi = {10.1137/1.9781611974782.127},
timestamp = {Fri, 23 Aug 2019 17:39:43 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbelADFGHKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Misc{wood:personal,
author = {David R. Wood},
howpublished = {Personal Communication},
month = {May},
year = {2020}
}
@article{nesetril.ossona:tree-depth,
author = {Nešetřil, Jaroslav and
Ossona de Mendez, Patrice},
title = {Tree-depth, subgraph coloring and homomorphism bounds},
journal = {Eur. J. Comb.},
volume = {27},
number = {6},
pages = {1022--1041},
year = {2006},
url = {https://doi.org/10.1016/j.ejc.2005.01.010},
doi = {10.1016/j.ejc.2005.01.010},
timestamp = {Sat, 16 Sep 2017 12:02:58 +0200},
biburl = {https://dblp.org/rec/journals/ejc/NesetrilM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{nesetril.ossona:grad,
author = {Nešetřil, Jaroslav and
Ossona de Mendez, Patrice},
title = {Grad and classes with bounded expansion I. Decompositions},
journal = {Eur. J. Comb.},
volume = {29},
number = {3},
pages = {760--776},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2006.07.013},
doi = {10.1016/j.ejc.2006.07.013},
timestamp = {Sat, 16 Sep 2017 12:02:58 +0200},
biburl = {https://dblp.org/rec/journals/ejc/NesetrilM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{zhu:colouring,
author = {Xuding Zhu},
title = {Colouring graphs with bounded generalized colouring number},
journal = {Discret. Math.},
volume = {309},
number = {18},
pages = {5562--5568},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.03.024},
doi = {10.1016/j.disc.2008.03.024},
timestamp = {Sat, 22 Feb 2020 14:01:58 +0100},
biburl = {https://dblp.org/rec/journals/dm/Zhu09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{pach.tardos:conflict-free,
author = {J{\'{a}}nos Pach and
G{\'{a}}bor Tardos},
title = {Conflict-Free Colourings of Graphs and Hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {18},
number = {5},
pages = {819--834},
year = {2009},
url = {https://doi.org/10.1017/S0963548309990290},
doi = {10.1017/S0963548309990290},
timestamp = {Thu, 12 Mar 2020 15:55:30 +0100},
biburl = {https://dblp.org/rec/journals/cpc/PachT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{glebov.szabo.ea:conflict-free,
author = {Roman Glebov and
Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
title = {Conflict-Free Colouring of Graphs},
journal = {Comb. Probab. Comput.},
volume = {23},
number = {3},
pages = {434--448},
year = {2014},
url = {https://doi.org/10.1017/S0963548313000540},
doi = {10.1017/S0963548313000540},
timestamp = {Thu, 12 Mar 2020 15:55:51 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GlebovST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{gargano.rescigno:complexity,
author = {Luisa Gargano and
Adele A. Rescigno},
title = {Complexity of conflict-free colorings of graphs},
journal = {Theor. Comput. Sci.},
volume = {566},
pages = {39--49},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.11.029},
doi = {10.1016/j.tcs.2014.11.029},
timestamp = {Sun, 28 May 2017 13:20:09 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GarganoR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{distel.hickingbotham.ea:improved,
title={Improved Product Structure for Graphs on Surfaces},
author={Marc Distel and Robert Hickingbotham and Tony Huynh and David R. Wood},
year = {2021},
arXiv = {2112.10025},
}
@article{nesetril.ossona:on,
author = {Nešetřil, Jaroslav and
Ossona de Mendez, Patrice},
title = {On Low Tree-Depth Decompositions},
journal = {Graphs Comb.},
volume = {31},
number = {6},
pages = {1941--1963},
year = {2015},
url = {https://doi.org/10.1007/s00373-015-1569-7},
doi = {10.1007/s00373-015-1569-7},
timestamp = {Thu, 04 Jun 2020 19:41:06 +0200},
biburl = {https://dblp.org/rec/journals/gc/NesetrilM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{bose.morin.ea:optimal,
author = {Prosenjit Bose and
Pat Morin and
Saeed Odak},
editor = {Artur Czumaj and
Qin Xin},
title = {An Optimal Algorithm for Product Structure in Planar Graphs},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.19},
doi = {10.4230/LIPIcs.SWAT.2022.19},
timestamp = {Thu, 23 Jun 2022 15:53:59 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoseMO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{nesetril.ossona:sparsity,
author = {Nešetřil, Jaroslav and
Ossona de Mendez, Patrice},
title = {Sparsity: Graphs, Structures, and Algorithms},
series = {Algorithms and combinatorics},
volume = {28},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-27875-4},
doi = {10.1007/978-3-642-27875-4},
isbn = {978-3-642-27874-7},
timestamp = {Wed, 14 Nov 2018 10:12:21 +0100},
biburl = {https://dblp.org/rec/books/daglib/0030491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{robertson.seymour:graph,
author = {N. Robertson and P.D. Seymour},
title = {Graph minors. {II}. Algorithmic aspects of tree-width},
journal = {Journal of Algorithms},
volume = {7},
number = {3},
year = {1986},
pages = {309--322}
}
@article{bodlaender:partial,
author = {Hans L. Bodlaender},
title = {A Partial \emph{k}-Arboretum of Graphs with Bounded Treewidth},
journal = {Theor. Comput. Sci.},
volume = {209},
number = {1-2},
pages = {1--45},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00228-4},
doi = {10.1016/S0304-3975(97)00228-4},
timestamp = {Wed, 17 Feb 2021 22:00:44 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bodlaender98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{pilipczuk.siebertz:polynomial,
author = {Michał Pilipczuk and
Sebastian Siebertz},
title = {Polynomial bounds for centered colorings on proper minor-closed graph
classes},
journal = {J. Comb. Theory, Ser. {B}},
volume = {151},
pages = {111--147},
year = {2021},
url = {https://doi.org/10.1016/j.jctb.2021.06.002},
doi = {10.1016/j.jctb.2021.06.002},
timestamp = {Thu, 14 Oct 2021 16:38:29 +0200},
biburl = {https://dblp.org/rec/journals/jctb/PilipczukS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}