@article{Bonsma/13,
AUTHOR = {Bonsma, Paul},
TITLE = {The complexity of rerouting shortest paths},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {510},
PAGES = {1-12},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {shortest path, reconfiguration, reachability, pspace-hard, claw-free graph, chordal graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006920},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dosa-Li-Han-Tuza/13,
AUTHOR = {D{\'o}sa, Gy{\"o}rgy and Li, Rongheng and Han, Xin and Tuza, Zsolt},
TITLE = {Tight absolute bound for First Fit Decreasing bin-packing: $FFD(L)\le 11/9\ OPT(L)+6/9$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {510},
PAGES = {13-61},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {first fit decreasing, tight bound},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006774},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Prisco-De_Santis/13,
AUTHOR = {De Prisco, Roberto and De Santis, Alfredo},
TITLE = {Color visual cryptography schemes for black and white secret images},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {510},
PAGES = {62-86},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {secret sharing, visual cryptography, threshold schemes, b\&w secret images, colored shares},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006750},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Eom-Han/13,
AUTHOR = {Eom, Hae-Sung and Han, Yo-Sub},
TITLE = {State complexity of combined operations for suffix-free regular languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {510},
PAGES = {87-93},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {state complexity, suffix-free regular languages, combined operations},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006944},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Hao-Feng/13,
AUTHOR = {Cheng, Dongqin and Hao, Rong-Xia and Feng, Yan-Quan},
TITLE = {Conditional edge-fault pancyclicity of augmented cubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {510},
PAGES = {94-101},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {augmented cubes, pancyclicity, fault-tolerant embedding, faulty edges, interconnection network},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006907},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dosa-Imreh/13,
AUTHOR = {D{\'o}sa, Gy{\"o}rgy and Imreh, Csan{\'a}d},
TITLE = {The generalization of scheduling with machine cost},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {510},
PAGES = {102-110},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, scheduling, packing},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006798},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Boros-Cepek-Kucera/13,
AUTHOR = {Boros, Endre and {\v{C}}epek, Ond{\v{r}}ej and Ku{\v{c}}era, Petr},
TITLE = {A decomposition method for CNF minimality proofs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {510},
PAGES = {111-126},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {boolean functions, cnf, boolean minimization, horn minimization, decomposition method},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006968},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dourado-Rautenbach-dos_Santos-Schafer-Szwarcfiter/13,
AUTHOR = {Dourado, Mitre C. and Rautenbach, Dieter and dos Santos, Vin{\'{i}}cius Fernandes and Sch{\"a}fer, Philipp M. and Szwarcfiter, Jayme L.},
TITLE = {On the Carath{\'e}odory number of interval and graph convexities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {510},
PAGES = {127-135},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {convexity space, carath{\'e}odory number, interval convexity, geodetic convexity, monophonic convexity, p 3 -convexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513006749},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}