@article{Li-Zhang/07,
AUTHOR = {Li, Xueliang and Zhang, Xiaoyan},
TITLE = {On the minimum monochromatic or multicolored subgraph partition problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {1-10},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {monochromatic, multicolored, partition, complexity, inapproximability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NNWCMN-3/2/09f6bddd23ea682ba70c43b45f48b5b1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Andre-Caron-Debarbieux-Roos-Tison/07,
AUTHOR = {Andr{\'e}, Y. and Caron, A.C. and Debarbieux, D. and Roos, Y. and Tison, S.},
TITLE = {Path constraints in semistructured data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {11-33},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semistructured data graph, path inclusion, prefix rewriting, (finite) exact model},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NS0KYP-1/2/cdaddeadd06a63f9450e478a2d1053c1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Das-Flocchini-Kutten-Nayak-Santoro/07,
AUTHOR = {Das, Shantanu and Flocchini, Paola and Kutten, Shay and Nayak, Amiya and Santoro, Nicola},
TITLE = {Map construction of unknown graphs by multiple agents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {34-48},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {labelled map construction, graph exploration, leader election, rendezvous, anonymous mobile agents},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NS0KYP-3/2/30d5debd630f51800fb9c65457319fa1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Thai-Zhang-Tiwari-Xu/07,
AUTHOR = {Thai, My T. and Zhang, Ning and Tiwari, Ravi and Xu, Xiaochun},
TITLE = {On approximation algorithms of $k$-connected $m$-dominating sets in disk graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {49-59},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {connected dominating set, virtual backbone, fault tolerance, wireless ad hoc network, disk graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NT84WC-1/2/29bb0e0be3ca5fd864be2d255a7d07ef},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Broersma-Li/07,
AUTHOR = {Broersma, Hajo and Li, Xueliang},
TITLE = {On the complexity of dominating set problems related to the minimum all-ones problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {60-70},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {all-ones problem, odd dominating set, computational complexity, bipartite graph, planar graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-1/2/dadf37ce32991ed0757df3f26efd21f6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Chen/07,
AUTHOR = {Wang, Weifan and Chen, Yongzhu},
TITLE = {A sufficient condition for a planar graph to be class 1},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {71-77},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {planar graph, edge colouring, chromatic index, cycle},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-2/2/b2ddda611aca84b9de8bab0d35352010},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Galbiati-Maffioli/07,
AUTHOR = {Galbiati, Giulia and Maffioli, Francesco},
TITLE = {Approximation algorithms for maximum cut with limited unbalance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {78-87},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {randomized approximation algorithm, semidefinite programming, maximum cut, limited unbalance cut},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NYSXTN-1/2/2b370b9cf66a833f9a0c3726ca58cfbb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hsieh-Tsai/07,
AUTHOR = {Hsieh, Ming Yu and Tsai, Shi-Chun},
TITLE = {On the fairness and complexity of generalized $k$-in-a-row games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {88-100},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {k-in-a-row games, computational complexity, mathematical games},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-4/2/1257df011f17ad9e7d2868f5e5a5a19f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Khan-Pandurangan-Kumar/07,
AUTHOR = {Khan, Maleq and Pandurangan, Gopal and Kumar, V.S. Anil},
TITLE = {A simple randomized scheme for constructing low-weight $k$-connected spanning subgraphs with applications to distributed algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {101-114},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {k-connected spanning subgraph, minimum spanning tree, randomized approximation algorithm, distributed algorithm, probabilistic analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-5/2/14a7e5131aab110d035b338785adcdb2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Popov/07,
AUTHOR = {Popov, V.Yu.},
TITLE = {Multiple genome rearrangement by swaps and by element duplications},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {115-126},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multiple sorting, distance function, np-complete},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-6/2/cfa57d0cee77e646eb64c2e31b8551ed},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Na-Park/07,
AUTHOR = {Na, Joong Chae and Park, Kunsoo},
TITLE = {Alphabet-independent linear-time construction of compressed suffix arrays using $o(n \log n)$-bit working space},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {127-136},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {compressed suffix array, fm-index, index data structure, burrows-wheeler transform},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-7/2/e4d5de43aa149faf61b75f48274ec7ac},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carpi/07,
AUTHOR = {Carpi, Arturo},
TITLE = {On Dejean's conjecture over large alphabets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {137-151},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {fractional repetition, repetition threshold, dejean conjecture},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NYJ0YH-2/2/f503030ef089ddfdaac1fc0bdf3d621d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epifanio-Gabriele-Mignosi-Restivo-Sciortino/07,
AUTHOR = {Epifanio, C. and Gabriele, A. and Mignosi, F. and Restivo, A. and Sciortino, M.},
TITLE = {Languages with mismatches},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {152-166},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, formal languages, approximate string matching, indexing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-8/2/0e3a1d3351e2b28b03a8bb9d417dd94a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pavan-Selman-Sengupta-Vinodchandran/07,
AUTHOR = {Pavan, A. and Selman, Alan L. and Sengupta, Samik and Vinodchandran, N.V.},
TITLE = {Polylogarithmic-round interactive proofs for $coNP$ collapse the exponential hierarchy},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {167-178},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interactive proof systems, complexity classes, non-uniform complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P4NPMF-1/2/8af6658e55d8a1e56450969a726862e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blanchet-Sadri-Wetzler/07,
AUTHOR = {Blanchet-Sadri, F. and Wetzler, Nathan D.},
TITLE = {Partial words and the critical factorization theorem revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {179-192},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {word, partial word, period, weak period, local period},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P47GPW-1/2/f45e4e614062f0afed249eb0200c7702},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Becher-Grigorieff/07,
AUTHOR = {Becher, Ver{\'o}nica and Grigorieff, Serge},
TITLE = {Random reals {\`a} la Chaitin with or without prefix-freeness},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {193-201},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic randomness, random reals, kolmogorov complexity, omega numbers},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-9/2/84d4f40cb026f41c73648c34883466fb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berger-Fukunaga-Nagamochi-Parekh/07,
AUTHOR = {Berger, Andr{\'e} and Fukunaga, Takuro and Nagamochi, Hiroshi and Parekh, Ojas},
TITLE = {Approximability of the capacitated $b$-edge dominating set problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {202-213},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {edge dominating set, approximation algorithm, integrality gap},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-2/2/4923e7c310252ec5013c8091218138b1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bedaride/07,
AUTHOR = {Bedaride, Nicolas},
TITLE = {Classification of rotations on the torus $T^2$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {214-225},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {billiard, symbolic dynamic, words, complexity, sturmian words},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-3/2/2c4a35fe5adbc85f9b4de2f20846e0f9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kratsch-Liedloff/07,
AUTHOR = {Kratsch, Dieter and Liedloff, Mathieu},
TITLE = {An exact algorithm for the minimum dominating clique problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {226-240},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithms, exponential time algorithms, dominating clique, dominating set},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P4NPMF-2/2/1eaaf63361dc72aac4f4e7f08d2557e5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blin-Fertin-Vialette/07,
AUTHOR = {Blin, Guillaume and Fertin, Guillaume and Vialette, St{\'e}phane},
TITLE = {Extracting constrained 2-interval subsets in 2-interval sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {241-263},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {2-intervals, pattern matching, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P4NPMF-5/2/7e970a537b17994b32c892b6acb214b8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Malvestuto-Mezzini-Moscarini/07,
AUTHOR = {Malvestuto, Francesco M. and Mezzini, Mauro and Moscarini, Marina},
TITLE = {An analytical approach to the inference of summary data of additive type},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {264-285},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {category hierarchy, summary database, evaluability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P7R8CX-1/2/c27fd11e438d37fc6278b2296c813ea1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fang/07,
AUTHOR = {Fang, Jywe-Fei},
TITLE = {The bipanconnectivity and $m$-panconnectivity of the folded hypercube},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {286-300},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interconnection networks, algorithms, panconnectivity, folded hypercubes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P7R8CX-2/2/0c33253ddd675aac5512b39a4065a630},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}