Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. (English) Zbl 1342.68014

Dinh, Thang N. (ed.); Thai, My T. (ed.)

Lecture Notes in Computer Science 9797. Cham: Springer (ISBN 978-3-319-42633-4/pbk; 978-3-319-42634-1/ebook). xiii, 634 p. (2016).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1316.68028].
Indexed articles:
Brandes, Philipp; Huang, Zengfeng; Su, Hsin-Hao; Wattenhofer, Roger, Clairvoyant mechanisms for online auctions, 3-14 [Zbl 06622015]
Angel, Eric; Bampis, Evripidis; Pascual, Fanny; Thibault, Nicolas, Truthfulness for the sum of weighted completion times, 15-26 [Zbl 06622016]
Chen, Xujin; Diao, Zhuo, Network topologies for weakly Pareto optimal nonatomic selfish routing, 27-38 [Zbl 06622017]
Anastasiadis, Eleftherios; Deng, Xiaotie; Krysta, Piotr; Li, Minming; Qiao, Han; Zhang, Jinshan, New results for network pollution games, 39-51 [Zbl 06622018]
Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod, Polynomial-time algorithm for isomorphism of graphs with clique-width at most three, 55-66 [Zbl 06622019]
Fiala, Jiří; Gavenčiak, Tomáš; Knop, Dušan; Koutecký, Martin; Kratochvíl, Jan, Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems. (extended abstract), 67-78 [Zbl 06622020]
Xiao, Mingyu, A parameterized algorithm for bounded-degree vertex deletion, 79-91 [Zbl 06622021]
Abu-Khzam, Faisal N.; Li, Shouwei; Markarian, Christine; Meyer auf der Heide, Friedhelm; Podlipyan, Pavel, The monotone circuit value problem with bounded genus is in NC, 92-102 [Zbl 06622022]
Pacuk, Andrzej; Sankowski, Piotr; Wegrzycki, Karol; Wygocki, Piotr, Locality-sensitive hashing without false negatives for \(l_p\), 105-118 [Zbl 06622023]
Banerjee, Niranka; Chakraborty, Sankardeep; Raman, Venkatesh, Improved space efficient algorithms for BFS, DFS and applications, 119-130 [Zbl 06622024]
Chang, Ching-Lueh, Metric 1-median selection: query complexity vs. approximation ratio, 131-142 [Zbl 1425.68139]
Bera, Debajyoti; Pratap, Rameshwar, Frequent-itemset mining using locality-sensitive hashing, 143-155 [Zbl 06622026]
Jelínek, Vít; Jelínková, Eva; Kratochvíl, Jan, On the hardness of switching to a small number of edges, 159-170 [Zbl 06622027]
Engels, Christian; Raghavendra Rao, B. V., On hard instances of non-commutative permanent, 171-181 [Zbl 06622028]
Becker, Florent; Anta, Antonio Fernández; Rapaport, Ivan; Rémila, Eric, The effect of range and bandwidth on the round complexity in the congested clique model, 182-193 [Zbl 06622029]
Hell, Pavol; Nevisi, Mayssam Mohammadi, Minimum cost homomorphisms with constrained costs, 194-206 [Zbl 06622030]
Alipour, Sharareh; Ghodsi, Mohammad; Jafari, Amir, An improved constant-factor approximation algorithm for planar visibility counting problem, 209-221 [Zbl 06622031]
Chen, Li-Hsuan; Cheng, Dun-Wei; Hsieh, Sun-Yuan; Hung, Ling-Ju; Lee, Chia-Wei; Wu, Bang Ye, Approximation algorithms for the star \(k\)-hub center problem in metric graphs, 222-234 [Zbl 06622032]
Iglesias, Jennifer; Rajaraman, Rajmohan; Ravi, R.; Sundaram, Ravi, Balls and funnels: energy efficient group-to-group anycasts, 235-246 [Zbl 06622033]
Nakano, Shin-ichi, Assigning proximity facilities for gatherings, 247-253 [Zbl 06622034]
Zhang, Cong; Cash, David; Wang, Xiuhua; Yu, Xiaoqi; Chow, Sherman S. M., Combiners for chosen-ciphertext security, 257-268 [Zbl 1394.94944]
Fouque, Pierre-Alain; Hadjibeyli, Benjamin; Kirchner, Paul, Homomorphic evaluation of lattice-based symmetric encryption schemes, 269-280 [Zbl 1394.94931]
Ding, Ning; Ren, Yanli; Gu, Dawu, Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits, 281-292 [Zbl 1394.94930]
Mefenza, Thierry, Inferring sequences produced by a linear congruential generator on elliptic curves using Coppersmith’s methods, 293-304 [Zbl 1394.94937]
Chen, Wei; Li, Qiang; Sun, Xiaoming; Zhang, Jialin, The routing of complex contagion in Kleinberg’s small-world networks, 307-318 [Zbl 1394.94971]
Shahmohammadi, Farhad; Sharif-Zadeh, Amir; Zarrabi-Zadeh, Hamid, The maximum disjoint routing problem, 319-329 [Zbl 1394.94975]
Pourmiri, Ali, Balanced allocation on graphs: a random walk approach, 330-341 [Zbl 06622041]
Strash, Darren, On the power of simple reductions for the maximum independent set problem, 345-356 [Zbl 06622042]
Barba, Luis; Milatz, Malte; Nummenpalo, Jerri; Thomas, Antonis, Deterministic algorithms for unique sink orientations of grids, 357-369 [Zbl 06622043]
Ben-Ameur, Walid; Glorieux, Antoine; Neto, José, From graph orientation to the unweighted maximum cut, 370-384 [Zbl 06622044]
Karthick, T.; Maffray, Frédéric, Maximum weight independent sets in (\(S_{1,1,3}\), bull)-free graphs, 385-392 [Zbl 06622045]
Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena, Decomposing cubic graphs into connected subgraphs of size three, 393-404 [Zbl 06622046]
Dvořák, Pavel; Valla, Tomáš, Automorphisms of the cube \(n^d\), 405-416 [Zbl 06622047]
Sunil Chandran, L.; Issac, Davis; Zhou, Sanming, Hadwiger’s conjecture and squares of chordal graphs, 417-428 [Zbl 06622048]
Acharyya, Ankush; Nandy, Subhas C.; Roy, Sasanka, Minimum width color spanning annulus, 431-442 [Zbl 1390.68700]
Bae, Sang Won, Computing a minimum-width square or rectangular annulus with outliers. [extended abstract], 443-454 [Zbl 06622050]
Bald, Samuel; Johnson, Matthew P.; Liu, Ou, Approximating the maximum rectilinear crossing number, 455-467 [Zbl 06622051]
Chen, Zhi-Zhong; Machida, Eita; Wang, Lusheng, An improved approximation algorithm for rSPR distance, 468-479 [Zbl 06622052]
Dutot, Pierre-Francois; Saule, Erik; Srivastav, Abhinav; Trystram, Denis, Online non-preemptive scheduling to optimize max stretch on a single machine, 483-495 [Zbl 06622053]
Khonji, Majid; Karapetyan, Areg; Elbassioni, Khaled; Chau, Chi-Kin, Complex-demand scheduling problem with application in smart grid, 496-509 [Zbl 06622054]
Lucarelli, Giorgio; Srivastav, Abhinav; Trystram, Denis, From preemptive to non-preemptive scheduling using rejections, 510-519 [Zbl 06622055]
Chau, Vincent; Fong, Ken C. K.; Li, Minming; Wang, Kai, Flow shop for dual CPUs in dynamic voltage scaling, 520-531 [Zbl 06622056]
Gayen, Sutanu; Vinodchandran, N. V., Algorithms for \(k\)-median clustering over distributed streams, 535-546 [Zbl 06622057]
Bahoo, Yeganeh; Durocher, Stephane; Keil, J. Mark; Mehrabi, Saeed; Mehrpour, Sahar; Mondal, Debajyoti, Polygon simplification by minimizing convex corners, 547-559 [Zbl 06622058]
Alexeev, Nikita; Alekseyev, Max A., Combinatorial scoring of phylogenetic networks, 560-572 [Zbl 06622059]
Moon, Jucheol; Friedberg, Iddo; Eulenstein, Oliver, Highly bi-connected subgraphs for computational protein function annotation, 573-584 [Zbl 06622060]
Krebs, Andreas; Limaye, Nutan; Ludwig, Michael, Cost register automata for nested words, 587-598 [Zbl 06622061]
Shu, Xinfeng; Duan, Zhenhua, Extending MSVL with semaphore, 599-610 [Zbl 06622062]
Liu, Yao; Duan, Zhenhua; Tian, Cong; Cui, Bin, Satisfiability of linear time mu-calculus on finite traces, 611-622 [Zbl 06622063]
Miao, Dongjing; Cai, Zhipeng; Liu, Xianmin; Li, Jianzhong, On the complexity of insertion propagation with functional dependency constraints, 623-632 [Zbl 06622064]

MSC:

68-06	Proceedings, conferences, collections, etc. pertaining to computer science
68Rxx	Discrete mathematics in relation to computer science
00B25	Proceedings of conferences of miscellaneous specific interest