default search action
20. COCOON 2014: Atlanta, GA, USA
- Zhipeng Cai, Alex Zelikovsky, Anu G. Bourgeois:
Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings. Lecture Notes in Computer Science 8591, Springer 2014, ISBN 978-3-319-08782-5
Sampling and Randomized Methods
- Meena Mahajan
, B. V. Raghavendra Rao
Building above Read-once Polynomials: Identity Testing and Hardness of Representation. 1-12 - Vladimir Braverman, Gregory Vorsanger:
Sampling from Dense Streams without Penalty - Improved Bounds for Frequency Moments and Heavy Hitters. 13-24 - Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima
L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. 25-36 - Dongjing Miao, Xianmin Liu, Jianzhong Li:
Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm. 37-48
Logic, Algebra and Automata
- Chia-Jung Lee, Shi-Chun Tsai, Ming-Chuan Yang:
Online Prediction Problems with Variation. 49-60 - Kayleigh Hyde, Bjørn Kjos-Hanssen:
Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words. 61-70 - Nan Zhang, Zhenhua Duan, Cong Tian:
An Axiomatization for Cylinder Computation Model. 71-83 - Zhenhua Duan, Cong Tian, Nan Zhang:
Normal Form Expressions of Propositional Projection Temporal Logic. 84-93
Database and Data Structures
- Weitian Tong
On the Smoothed Heights of Trie and Patricia Index Trees. 94-103 - Haitao Wang, Jingru Zhang:
One-Dimensional k-Center on Uncertain Data. 104-115 - Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi
The Range 1 Query (R1Q) Problem. 116-128 - Christine Chung
Competitive Cost-Savings in Data Stream Management Systems. 129-140
Parameterized Complexity and Algorithms(I)
- Manu Basavaraju, Fahad Panolan
On the Kernelization Complexity of String Problems. 141-153 - Peng Sun, Jiong Guo, Jan Baumbach
Complexity of Dense Bicluster Editing Problems. 154-165 - Jiong Guo, Yash Raj Shrestha
Parameterized Complexity of Edge Interdiction Problems. 166-178 - Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra:
Vertex Cover Gets Faster and Harder on Low Degree Graphs. 179-190
Computational Complexity
- Thomas Holenstein, Robin Künzler:
A Protocol for Generating Random Elements with Their Probabilities. 191-202 - Thomas Holenstein, Robin Künzler:
A New View on Worst-Case to Average-Case Reductions for NP Problems. 203-214 - Jacob Hendricks, Matthew J. Patitz
The Power of Duples (in Self-Assembly): It's Not So Hip to Be Square. 215-226
Computational Biology and Computational Geometry
- Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David A. Bader
A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents. 227-238 - Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflection Radius in a Simple Polygon. 239-250 - Meng-Huan Liou, Sheung-Hung Poon
On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic Holes. 251-262
Parameterized Complexity and Algorithms(II)
- Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Directed Steiner Tree with Branching Constraint. 263-275 - Xianmin Liu, Jianzhong Li, Hong Gao:
On the Parameterized Complexity of Labelled Correlation Clustering Problem. 276-287 - Minghui Jiang, Haitao Wang:
Shortest Color-Spanning Intervals. 288-299 - Benjamin A. Burton
Fixed Parameter Tractable Algorithms in Combinatorial Topology. 300-311
Approximation Algorithm(I)
- Xian Qiu, Walter Kern:
Improved Approximation Algorithms for a Bilevel Knapsack Problem. 312-323 - Chenchen Wu, Dachuan Xu
A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem. 324-335 - Dachuan Xu
Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties. 336-345 - Peng Zhang:
A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem. 346-356
Approximation Algorithm(II)
- Xujin Chen, Changjun Wang:
Approximability of the Minimum Weighted Doubly Resolving Set Problem. 357-368 - Michael A. Schuh, Tim Wylie, Chang Liu, Rafal A. Angryk
Approximating High-Dimensional Range Queries with kNN Indexing Techniques. 369-380 - Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. 381-392 - Subhankar Mishra
Optimal Inspection Points for Malicious Attack Detection in Smart Grids. 393-404
Graph Theory and Algorithms(I)
- Akira Suzuki
Reconfiguration of Dominating Sets. 405-416 - Binay K. Bhattacharya, Minati De
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. 417-428 - François Le Gall, Harumichi Nishimura, Seiichiro Tani
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. 429-440
Approximation Algorithm(III)
- Di Wu, Zhao Zhang, Weili Wu, Xiaohui Huang:
Approximation Algorithm for the Balanced 2-Connected Bipartition Problem. 441-452 - Masoud T. Omran, Jörg-Rüdiger Sack
Improved Approximation for Time-Dependent Shortest Paths. 453-464 - Farzad Farnoud Hassanzadeh, Eitan Yaakobi, Jehoshua Bruck
Approximate Sorting of Data Streams with Limited Storage. 465-476
Graph Theory and Algorithms(II)
- Seok-Hee Hong, Hiroshi Nagamochi:
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. 477-488 - Konrad Kazimierz Dabrowski
Classifying the Clique-Width of H-Free Bipartite Graphs. 489-500 - Evangelos Kranakis
Displacing Random Sensors to Avoid Interference. 501-512
Game Theory and Cryptography
- Vittorio Bilò
On the Performance of Mildly Greedy Players in Cut Games. 513-524 - Pierre-Alain Fouque
Statistical Properties of Short RSA Distribution and Their Cryptographic Applications. 525-536 - Bryce Sandlund, Kerrick Staley, Michael Dixon, Steve Butler:
Numerical Tic-Tac-Toe on the 4×4 Board. 537-546 - Vittorio Bilò
On Linear Congestion Games with Altruistic Social Context. 547-558
Scheduling Algorithms and Circuit Complexity
- Esteban Feuerstein, Alberto Marchetti-Spaccamela
Scheduling over Scenarios on Two Machines. 559-571 - Vikraman Arvind, S. Raja:
The Complexity of Bounded Register and Skew Arithmetic Computation. 572-583 - Suman Kalyan Bera, Syamantak Das, Amit Kumar
Minimizing Average Flow-Time under Knapsack Constraint. 584-595 - Sajin Koroth
Depth Lower Bounds against Circuits with Sparse Orientation. 596-607
CSoNet I
- Donghyun Kim, Jiaofei Zhong, Minhyuk Lee, Deying Li, Alade O. Tokuta:
Efficient Respondents Selection for Biased Survey Using Online Social Networks. 608-615 - Georgios Askalidis, Randall A. Berry
Explaining Snapshots of Network Diffusions: Structural and Hardness Results. 616-625 - Kumar Gaurav
Pioneers of Influence Propagation in Social Networks. 626-636 - Douglas Oliveira, Marco M. Carvalho
Empirical Models for Complex Network Dynamics: A Preliminary Study. 637-646
CSoNet II
- Chunyu Ai, Wei Zhong, Mingyuan Yan, Feng Gu
Partner Matching Applications of Social Networks. 647-656 - Rushed Kanawati:
YASCA: An Ensemble-Based Approach for Community Detection in Complex Networks. 657-666 - Jingzong Yang, Li Wang, Weili Wu:
Mining the Key Structure of the Information Diffusion Network. 667-675 - Ming Jia, Jie Wang:
Handling Big Data of Online Social Networks on a Small Machine. 676-685
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 2025-01-13 21:18 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: