Entry Bonomo:2011:BCC from tcs2010.bib
Last update: Sun Mar 31 03:12:29 MDT 2019
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Bonomo:2011:BCC,
author = "Flavia Bonomo and Sara Mattia and Gianpaolo Oriolo",
title = "Bounded coloring of co-comparability graphs and the
pickup and delivery tour combination problem",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "45",
pages = "6261--6268",
day = "21",
month = oct,
year = "2011",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2011.07.012",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Nov 29 19:11:39 MST 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397511006220",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- bounded,
411(2)470,
411(16)1770,
411(31)2784,
411(34)3181,
411(34)3188,
411(40)3587,
412(45)6269,
412(45)6359,
412(50)6926,
412(52)7147,
418(1)14,
425(1)58,
432(1)10,
449(1)134,
452(1)21,
454(1)206,
460(1)1,
480(z)43,
501(z)72,
508(z)2,
543(z)24,
547(z)1,
548(z)68,
554(z)135,
560(z)33
- coloring,
411(16)1734,
411(26)2619,
411(43)3873,
412(18)1696,
412(23)2513,
412(29)3487,
412(35)4704,
412(35)4721,
412(46)6464,
414(1)9,
418(1)1,
428(1)10,
444(1)28,
444(1)40,
462(1)23,
465(z)21,
472(z)9,
476(z)16,
485(z)49,
486(z)20,
491(z)119,
494(z)86,
511(z)42,
516(z)133,
518(z)1,
518(z)124,
520(z)124,
522(z)54,
526(z)120,
532(z)51,
540(z)89,
553(z)37,
554(z)22,
554(z)40,
557(z)59,
558(z)18,
651(z)87
- combination,
460(1)10
- delivery,
412(3)270,
412(39)5333,
422(1)39,
438(1)55,
491(z)94,
553(z)91
- tour,
412(27)2964,
500(z)68