Oskar-Bordeaux: Dépôts récents
Voici les éléments 6201-6220 de 103547
-
A complexomic study of Escherichia coli using two-dimensional blue native/SDS polyacrylamide gel electrophoresis
(Electrophoresis. vol. 27, pp. 3306--3321, 2007)Article de revue -
ProteomeBinders: planning a European resource of affinity reagents for analysis of the human proteome
(Nature Methods. vol. 4, pp. 13-17, 2007)Article de revue -
Tangible Interaction in Mixed Reality Systems
(Springer-Verlag, 2010)Chapitre d'ouvrage -
The activation of modality in virtual objects assembly
(Journal on Multimodal User Interfaces. vol. 3, n° 3, pp. 189-196, 2010)Article de revue -
Molecular typing of wine yeast strains Saccharomyces uvarum using microsatellite markers
(Systematic and Applied Microbiology. vol. 30, pp. 75-82, 2007)Article de revue -
Fast Periodic Graph Exploration with Constant Memory
Communication dans un congrès -
Single nucleotide resolution QTL mapping of an enological trait from derived wild Saccharomyces cerevisiae strains
(FEMS Yeast Research. vol. in press, pp. 1295-1306, 2007)Article de revue -
Fast Periodic Graph Exploration with Constant Memory
(Journal of Computer and System Sciences. vol. 74, n° 5, pp. 808--822, 2008)Article de revue -
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
(Algorithmic Operations Research. vol. 3, n° 1, pp. 43-50, 2008)Article de revue -
Increased Expression of Two Multidrug Transporter-Like Genes Is Associated with Ethidium Bromide and Ciprofloxacin Resistance in Mycoplasma hominis
(Antimicrobial Agents and Chemotherapy. vol. 49, n° 1, pp. 421-424, 2005-01-01)Article de revueLibre accès -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Communication dans un congrès -
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
(Theoretical Computer Science. vol. 285, n° 1, pp. 3--24, 2002-08)Article de revue -
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
(Theoretical Computer Science. vol. 326, n° 1--3, pp. 137--153, 2004-10)Article de revue -
On k-Connectivity Problems with Sharpened Triangle Inequality
(Journal of Discrete Algorithms. vol. 6, n° 4, pp. 605--617, 2008)Article de revue -
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract)
Communication dans un congrès -
Improved approximation results for the Minimum Energy Broadcasting problem in Wireless Ad Hoc Networks
(Algorithmica. vol. 49, n° 4, pp. 318--336, 2007-12)Article de revue -
Improved approximation results for the Minimum Energy Broadcasting Problem
Communication dans un congrès -
Tightening the upper bound for the Minimum Energy Broadcasting
(Wireless Networks. vol. 14, n° 5, pp. 659--669, 2008)Article de revue -
Dominating Sets in Web Graphs
Communication dans un congrès -
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
(Internet Mathematics. vol. 2, n° 3, pp. 275--300, 2005)Article de revue