@article{DallAsta-Alvarez-Hamelin-Barrat-Vazquez-Vespignani/06,
AUTHOR = {Dall'Asta, Luca and Alvarez-Hamelin, Ignacio and Barrat, Alain and V{\'a}zquez, Alexei and Vespignani, Alessandro},
TITLE = {Exploring networks with traceroute-like probes: Theory and simulations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {1},
PAGES = {6-24},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {traceroute, internet exploration, topology inference},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J614M7-1/2/dec42136c986421f76d05f58e8d5439f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Annexstein-Berman-Jovanovic/06,
AUTHOR = {Annexstein, Fred S. and Berman, Kenneth A. and Jovanovi{\'c}, Mijhalo A.},
TITLE = {Broadcasting in unstructured peer-to-peer overlay networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {1},
PAGES = {25-36},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {peer-to-peer overlay networks, network broadcasting and flooding, distributed network algorithms, network reliability and reachability, network simulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J78WYP-2/2/c2490c17a247dd1e5263e5df7b036e8d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Behrisch-Taraz/06,
AUTHOR = {Behrisch, Michael and Taraz, Anusch},
TITLE = {Efficiently covering complex networks with cliques of similar vertices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {1},
PAGES = {37-47},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random graphs, intersection graphs, clique cover algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J2CMVP-2/2/88e754f080610b643b8a44b171eac4c8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sarshar-Boykin-Roychowdhury/06,
AUTHOR = {Sarshar, Nima and Boykin, Oscar and Roychowdhury, Vwani},
TITLE = {Scalable percolation search on complex networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {1},
PAGES = {48-64},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {peer-to-peer networks, unstructured complex networks, scalable search, percolation search algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J78WYP-1/2/c07706e13530f6bf639c7c7fe762385a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fraigniaud-Gauron/06,
AUTHOR = {Fraigniaud, Pierre and Gauron, Philippe},
TITLE = {D2B: A de Bruijn based content-addressable network},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {1},
PAGES = {65-79},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {p2p, dht, de bruijn graph, overlay network},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J2CMVP-3/2/d84b357afcceb9052b8ae2c00a33ddb4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Stauffer-Barbosa/06,
AUTHOR = {Stauffer, Alexandre O. and Barbosa, Valmir C.},
TITLE = {Local heuristics and the emergence of spanning subgraphs in complex networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {1},
PAGES = {80-95},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {complex networks, local heuristics, spanning subgraphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J2CMVP-4/2/d7304550af305e757d350b56c36166e1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duchon-Hanusse-Lebhar-Schabanel/06a,
AUTHOR = {Duchon, Philippe and Hanusse, Nicolas and Lebhar, Emmanuelle and Schabanel, Nicolas},
TITLE = {Could any graph be turned into a small-world?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {1},
PAGES = {96-103},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {small-world, random graph model, routing algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J2KP04-2/2/c8379bdba65376907d99a71d82841cf8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alessi-Barbanera-Dezani-Ciancaglini/06,
AUTHOR = {Alessi, Fabio and Barbanera, Franco and Dezani-Ciancaglini, Mariangiola},
TITLE = {Intersection types and lambda models},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {108-126},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$\lambda$-calculus, intersection types, $\lambda$-models, $\beta$- and $\eta$-reduction/expansion},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J614M7-3/2/770b4bd89e053d040846d38e677ea3f3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Allender/06,
AUTHOR = {Allender, Eric},
TITLE = {NL-printable sets and nondeterministic Kolmogorov complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {127-138},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kolmogorov complexity, unambiguous logspace, nl-printability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J614M7-5/2/a3629f00e82461d3a2c0fe78a1bf8f4b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bechet-Foret/06,
AUTHOR = {B{\'e}chet, Denis and Foret, Annie},
TITLE = {$k$-valued non-associative Lambek grammars are learnable from generalized functor-argument structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {139-152},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {grammatical inference, categorial grammars, non-associative lambek calculus, learning from positive examples, model of gold},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J6230G-2/2/d6bac1fc017ab2c6130ca292a91e1ba9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Finger-Wassermann/06,
AUTHOR = {Finger, Marcelo and Wassermann, Renata},
TITLE = {The universe of propositional approximations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {153-166},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automated reasoning, deductive systems, approximate reasoning, non-classical logics, knowledge representation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J79YJ3-1/2/c357d63266c1017b383d5ebe6e031658},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hartmann-Link-Schewe/06,
AUTHOR = {Hartmann, Sven and Link, Sebastian and Schewe, Klaus-Dieter},
TITLE = {Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {167-196},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semantics in databases, data types, axiomatisation, functional dependency, brouwerian algebra},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J6230G-1/2/8da519d19da5c93e5a631ebe612709d1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Theor.~Comput.~Sci., Vol. 360, 2006, No. 1-3, 459-459},
}
@article{Hella-Turull-Torres/06,
AUTHOR = {Hella, Lauri and Turull-Torres, Jos{\'e} Mar{\'{i}}a},
TITLE = {Computing queries with higher-order logics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {197-214},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {higher-order logics, descriptive complexity, complete languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J614M7-6/2/d25e7efaa2074812ad693b2986b4cc6d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lamo-Walicki/06,
AUTHOR = {Lamo, Yngve and Walicki, Micha{\l}},
TITLE = {Quantifier-free logic for nondeterministic theories},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {215-227},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multialgebra, algebraic specification, nondeterminism, rasiowa-sikorski technique, strong completeness, specific cut},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J72Y03-2/2/7c8fb2b99e65f17bddb1018a414bfc64},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rott/06,
AUTHOR = {Rott, Hans},
TITLE = {Revision by comparison as a unifying framework: Severe withdrawal, irrevocable revision and irrefutable revision},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {228-242},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {belief revision, theory change, severe withdrawal, irrevocable revision, irrefutable revision},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J5T4YB-3/2/6ba33a64e67440efee39854fa977f8d6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zaionc/06,
AUTHOR = {Zaionc, Marek},
TITLE = {Probability distribution for simple tautologies},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {2},
PAGES = {243-260},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {asymptotic probability in logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J5D6H6-2/2/66c805a56ae687b42efd52356251c97b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kolliopoulos-Steiner/06,
AUTHOR = {Kolliopoulos, Stavros G. and Steiner, George},
TITLE = {Approximation algorithms for minimizing the total weighted tardiness on a single machine},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {261-273},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, weighted tardiness, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J49CYP-1/2/e8697178f0459b516e691a246f871711},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Malheiro/06,
AUTHOR = {Malheiro, Ant{\'o}nio},
TITLE = {Finite derivation type for Rees matrix semigroups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {274-290},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite derivation type, semigroup, presentation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J5T4YB-2/2/a0087577076018a18bb03bae240676be},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Li/06a,
AUTHOR = {Xu, Ke and Li, Wei},
TITLE = {Many hard examples in exact phase transitions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {291-302},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {constraint satisfaction problem (csp), random problems, resolution complexity, phase transitions, sat},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J5D6H6-1/2/570ef115fb3a438d8d38c35dd68a2132},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu-Chang-Wang/06,
AUTHOR = {Wu, Ro-Yu and Chang, Jou-Ming and Wang, Yue-Li},
TITLE = {A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {303-314},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, amortized analysis, binary trees, rotations, tree transformation, enumeration, lexicographic order},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J7H357-1/2/85d4634cc2b7800d25f0f63bcb163602},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Marco-Gargano-Kranakis-Krizanc-Pelc-Vaccaro/06,
AUTHOR = {De Marco, Gianluca and Gargano, Luisa and Kranakis, Evangelos and Krizanc, Danny and Pelc, Andrzej and Vaccaro, Ugo},
TITLE = {Asynchronous deterministic rendezvous in graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {315-326},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {rendezvous, graph, asynchronous, deterministic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J7H357-2/2/bd0869d5cb3b54b9a646cf943401133f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sanchez-Couso-Fernandez-Camacho/06,
AUTHOR = {S{\'a}nchez-Couso, Jos{\'e}-Ram{\'o}n and Fern{\'a}ndez-Camacho, Mar{\'{i}}a-In{\'e}s},
TITLE = {Reductions in binary search trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {327-353},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bottom-up algorithm, generating function, analytic convergence, singularity analysis, complex asymptotics, differential equation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J85PJN-1/2/963a5ec91621b03655537cda22b0ffd6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jin-Li/06,
AUTHOR = {Jin, Zemin and Li, Xueliang},
TITLE = {On the $k$-path cover problem for cacti},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {354-363},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$k$-path cover, steiner cover, efficient algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J90V21-1/2/5ae10c8a8d1babd1b562adbd4e91d3a7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Simone-de_Mello/06,
AUTHOR = {De Simone, Caterina and de Mello, C.P.},
TITLE = {Edge-colouring of join graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {364-370},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {edge-colourings, join graphs, overfull graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J5T4YB-1/2/c0baa40a49f72d925b218dae2061cacf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Flajolet-Nebel-Prodinger/06,
AUTHOR = {Flajolet, Philippe and Nebel, Markus and Prodinger, Helmut},
TITLE = {The scientific works of Rainer Kemp (1949-2004)},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {371-381},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {analysis of algorithms, combinatorial enumeration, asymptotic methods},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J614M7-2/2/09f21f290c7a69e76fd3e1f266947c6d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hitchcock/06a,
AUTHOR = {Hitchcock, John M.},
TITLE = {Hausdorff dimension and oracle constructions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {382-388},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, relativization, oracles, hausdorff dimension},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4JB9GS8-1/2/24c2480e37e4ec2cea9f7dbe35d2c1b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bazgan-Tuza-Vanderpooten/06,
AUTHOR = {Bazgan, Cristina and Tuza, Zsolt and Vanderpooten, Daniel},
TITLE = {Degree-constrained decompositions of graphs: Bounded treewidth and planarity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {355},
NUMBER = {3},
PAGES = {389-395},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph decomposition, treewidth, planar graph, polynomial algorithm, ptas},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4J8D7D2-2/2/3c606a7b16e693fd67a85a145c232b77},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}