Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th AAIM 2016: Bergamo, Italy
- Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri
:
Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9778, Springer 2016, ISBN 978-3-319-41167-5 - Evangelos Markakis, Orestis Telelis:
Item Pricing for Combinatorial Public Projects. 1-13 - H. K. Dai, H. C. Su:
Norm-Based Locality Measures of Two-Dimensional Hilbert Curves. 14-25 - Massimiliano Goldwurm, Jianyi Lin, Francesco Saccà:
On the Complexity of Clustering with Relaxed Size Constraints. 26-38 - Bastien Cazaux, Gustavo Sacomoto, Eric Rivals:
Superstring Graph: A New Approach for Genome Assembly. 39-52 - Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca:
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. 53-64 - Simone Faro:
A Very Fast String Matching Algorithm Based on Condensed Alphabets. 65-76 - Marwane Bouznif, Frédéric Havet, Myriam Preissmann:
Minimum-Density Identifying Codes in Square Grids. 77-88 - Thomas Bellitto:
Separating Codes and Traffic Monitoring. 89-100 - Konstantinos Georgiou, George Karakostas, Evangelos Kranakis, Danny Krizanc:
Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract). 101-112 - Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. 113-124 - Christos Kaklamanis, Panagiotis Kanellopoulos, Sophia Tsokana:
On Network Formation Games with Heterogeneous Players and Basic Network Creation Games. 125-136 - Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch:
Parameterized Complexity of Team Formation in Social Networks. 137-149 - Evangelos Kranakis, Danny Krizanc, Yun Lu:
Reconstructing Cactus Graphs from Shortest Path Information - (Extended Abstract). 150-161 - Martin Nehéz:
Near-Optimal Dominating Sets via Random Sampling. 162-172 - Jason Crampton, Gregory Z. Gutin, Rémi Watrigant:
A Multivariate Approach for Checking Resiliency in Access Control. 173-184 - Simone Faro, M. Oguzhan Külekci:
Efficient Algorithms for the Order Preserving Pattern Matching Problem. 185-196 - Albert Jhih-Heng Huang, Hung-Lung Wang, Kun-Mao Chao:
Computing the Line-Constrained k-center in the Plane for Small k. 197-208 - Sizhe Wang, Yinfeng Xu:
Online k-max Search Algorithms with Applications to the Secretary Problem. 209-221
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
