default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22. COCOON 2016: Ho Chi Minh City, Vietnam
- Thang N. Dinh, My T. Thai:
Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings. Lecture Notes in Computer Science 9797, Springer 2016, ISBN 978-3-319-42633-4
Game Theory and Algorithms
- Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, Roger Wattenhofer:
Clairvoyant Mechanisms for Online Auctions. 3-14 - Eric Angel, Evripidis Bampis
, Fanny Pascual, Nicolas Thibault:
Truthfulness for the Sum of Weighted Completion Times. 15-26 - Xujin Chen, Zhuo Diao:
Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing. 27-38 - Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang:
New Results for Network Pollution Games. 39-51
Parameterized Complexity and Algorithms
- Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three. 55-66 - Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). 67-78 - Mingyu Xiao:
A Parameterized Algorithm for Bounded-Degree Vertex Deletion. 79-91 - Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
The Monotone Circuit Value Problem with Bounded Genus Is in NC. 92-102
Database and Data Structures
- Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
Locality-Sensitive Hashing Without False Negatives for l_p. 105-118 - Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman:
Improved Space Efficient Algorithms for BFS, DFS and Applications. 119-130 - Ching-Lueh Chang:
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio. 131-142 - Debajyoti Bera, Rameshwar Pratap:
Frequent-Itemset Mining Using Locality-Sensitive Hashing. 143-155
Computational Complexity
- Vít Jelínek, Eva Jelínková, Jan Kratochvíl:
On the Hardness of Switching to a Small Number of Edges. 159-170 - Christian Engels, B. V. Raghavendra Rao:
On Hard Instances of Non-Commutative Permanent. 171-181 - Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila:
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. 182-193 - Pavol Hell, Mayssam Mohammadi Nevisi:
Minimum Cost Homomorphisms with Constrained Costs. 194-206
Approximation Algorithms
- Sharareh Alipour, Mohammad Ghodsi, Amir Jafari:
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem. 209-221 - Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, Bang Ye Wu:
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs. 222-234 - Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Balls and Funnels: Energy Efficient Group-to-Group Anycasts. 235-246 - Shin-Ichi Nakano:
Assigning Proximity Facilities for Gatherings. 247-253
Cryptography
- Cong Zhang, David Cash, Xiuhua Wang, Xiaoqi Yu, Sherman S. M. Chow:
Combiners for Chosen-Ciphertext Security. 257-268 - Pierre-Alain Fouque, Benjamin Hadjibeyli, Paul Kirchner:
Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes. 269-280 - Ning Ding, Yanli Ren, Dawu Gu:
Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits. 281-292 - Thierry Mefenza:
Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith's Methods. 293-304
Network and Algorithms
- Wei Chen, Qiang Li, Xiaoming Sun, Jialin Zhang:
The Routing of Complex Contagion in Kleinberg's Small-World Networks. 307-318 - Farhad Shahmohammadi, Amir Sharif-Zadeh, Hamid Zarrabi-Zadeh:
The Maximum Disjoint Routing Problem. 319-329 - Ali Pourmiri:
Balanced Allocation on Graphs: A Random Walk Approach. 330-341
Graph Theory and Algorithms
- Darren Strash:
On the Power of Simple Reductions for the Maximum Independent Set Problem. 345-356 - Luis Barba, Malte Milatz, Jerri Nummenpalo, Antonis Thomas:
Deterministic Algorithms for Unique Sink Orientations of Grids. 357-369 - Walid Ben-Ameur, Antoine Glorieux, José Neto:
From Graph Orientation to the Unweighted Maximum Cut. 370-384 - T. Karthick, Frédéric Maffray:
Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs. 385-392 - Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. 393-404 - Pavel Dvorák, Tomás Valla:
Automorphisms of the Cube n^d. 405-416 - L. Sunil Chandran, Davis Issac, Sanming Zhou:
Hadwiger's Conjecture and Squares of Chordal Graphs. 417-428
Computational Geometry
- Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Minimum Width Color Spanning Annulus. 431-442 - Sang Won Bae:
Computing a Minimum-Width Square or Rectangular Annulus with Outliers - [Extended Abstract]. 443-454 - Samuel Bald, Matthew P. Johnson, Ou Liu:
Approximating the Maximum Rectilinear Crossing Number. 455-467 - Zhi-Zhong Chen, Eita Machida, Lusheng Wang:
An Improved Approximation Algorithm for rSPR Distance. 468-479
Scheduling Algorithms and Circuit Complexity
- Pierre-François Dutot, Erik Saule, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine. 483-495 - Majid Khonji, Areg Karapetyan, Khaled M. Elbassioni, Sid Chi-Kin Chau:
Complex-Demand Scheduling Problem with Application in Smart Grid. 496-509 - Giorgio Lucarelli, Abhinav Srivastav, Denis Trystram:
From Preemptive to Non-preemptive Scheduling Using Rejections. 510-519 - Vincent Chau, Ken C. K. Fong, Minming Li, Kai Wang:
Flow Shop for Dual CPUs in Dynamic Voltage Scaling. 520-531
Computational Geometry and Computational Biology
- Sutanu Gayen, N. V. Vinodchandran:
Algorithms for k-median Clustering over Distributed Streams. 535-546 - Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal:
Polygon Simplification by Minimizing Convex Corners. 547-559 - Nikita Alexeev, Max A. Alekseyev:
Combinatorial Scoring of Phylogenetic Networks. 560-572 - Jucheol Moon, Iddo Friedberg, Oliver Eulenstein:
Highly Bi-Connected Subgraphs for Computational Protein Function Annotation. 573-584
Logic, Algebra and Automata
- Andreas Krebs, Nutan Limaye, Michael Ludwig:
Cost Register Automata for Nested Words. 587-598 - Xinfeng Shu, Zhenhua Duan:
Extending MSVL with Semaphore. 599-610 - Yao Liu, Zhenhua Duan, Cong Tian, Bin Cui:
Satisfiability of Linear Time Mu-Calculus on Finite Traces. 611-622 - Dongjing Miao, Zhipeng Cai, Xianmin Liu, Jianzhong Li:
On the Complexity of Insertion Propagation with Functional Dependency Constraints. 623-632
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 2026-01-29 23:23 CET 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:
