default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14. COCOON 2008: Dalian, China
- Xiaodong Hu, Jie Wang:
Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings. Lecture Notes in Computer Science 5092, Springer 2008, ISBN 978-3-540-69732-9
Algorithms and Data Structures
- Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki:
Efficient Compression of Web Graphs. 1-11 - Christian Hundt, Ulf Ochsenfahrt:
Damaged BZip Files Are Difficult to Repair. 12-21 - B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das
:
Isoperimetric Problem and Meta-Fibonacci Sequences. 22-30
Algorithmic Game Theory and Online Algorithms
- Joaquim Gabarró, Alina García, Maria J. Serna:
On the Complexity of Equilibria Problems in Angel-Daemon Games. 31-40 - Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi:
Average-Case Competitive Analyses for One-Way Trading. 41-51 - Boting Yang, Yi Cao:
On the Monotonicity of Weak Searching. 52-61
Automata, Languages, Logic, and Computability
- José Luis Montaña, Luis Miguel Pardo, Mar Callau:
VC Dimension Bounds for Analytic Algebraic Computations. 62-71 - Ulrich Hertrampf, Christoph Minnameier:
Resource Bounded Frequency Computations with Three Errors. 72-81 - Bin Fu, Zhixiang Chen:
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. 82-91 - Jun Tarui:
Smallest Formulas for Parity of 2k. 92-99
Combinatorics Related to Algorithms and Complexity
- Gadi Aleksandrowicz, Gill Barequet:
Counting Polycubes without the Dimensionality Curse. 100-109 - Balázs Keszegh:
Polychromatic Colorings of n-Dimensional Guillotine-Partitions. 110-118 - Martin Olsen:
The Computational Complexity of Link Building. 119-129 - Jianxin Wang, Qilong Feng:
Improved Parameterized Algorithms for Weighted 3-Set Packing. 130-139 - Epameinondas Fritzilas, Yasmín Á. Ríos-Solís, Sven Rahmann:
Structural Identifiability in Low-Rank Matrix Factorization. 140-148 - Miki Hermann, Reinhard Pichler:
Complexity of Counting the Optimal Solutions. 149-159
Complexity Theory
- Vikraman Arvind, T. C. Vijayaraghavan:
The Orbit Problem Is in the GapL Hierarchy. 160-169 - Xi Chen, Xiaoming Sun, Shang-Hua Teng:
Quantum Separation of Local Search and Fixed Point Computation. 170-179 - Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita:
Multi-party Quantum Communication Complexity with Routed Messages. 180-190 - Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka:
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. 191-203 - Michael Krüger, Harald Hempel:
Approximating Alternative Solutions. 204-214 - Jack H. Lutz, Elvira Mayordomo:
Dimensions of Points in Self-similar Fractals. 215-224
Cryptography, Reliability and Security, and Database Theory
- Steve Lu, Daniel Manchala, Rafail Ostrovsky:
Visual Cryptography on Graphs. 225-234 - Nitin Vats:
Algebraic Cryptanalysis of CTRU Cryptosystem. 235-244
Computational Biology and Bioinformatics - Model
- Wei Ren, Guiying Yan, Guohui Lin, Caifeng Du, Xiaofeng Han:
Detecting Community Structure by Network Vectorization. 245-254 - Xiaowen Liu, Jinyan Li, Lusheng Wang:
Quasi-bicliques: Complexity and Binding Pairs. 255-264 - Anne Condon, Ján Manuch, Chris Thachuk:
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. 265-275 - Julia Mixtacki:
Genome Halving under DCJ Revisited. 276-286 - Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. 287-298
Computational Biology and Bioinformatics - Algorithms
- Bhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng:
Adjacent Swaps on Strings. 299-308 - Yaw-Ling Lin:
Efficient Algorithms for SNP Haplotype Block Selection Problems. 309-318 - Guan-Shieng Huang, Jia Jie Liu, Yue-Li Wang:
Sequence Alignment Algorithms for Run-Length-Encoded Strings. 319-330 - Xiaowen Lou, Daming Zhu:
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations. 331-341 - Minzhu Xie, Jianxin Wang, Jianer Chen:
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. 342-351
Computational Algebra, Geometry, and Number Theory
- Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. 352-362 - Shakhar Smorodinsky, Marek Sulovský, Uli Wagner:
On Center Regions and Balls Containing Many Points. 363-373 - Sheung-Hung Poon:
On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees. 374-384 - Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
New Algorithms for Online Rectangle Filling with k-Lookahead. 385-394 - Yongding Zhu, Jinhui Xu, Yang Yang, Naoki Katoh, Shin-ichi Tanigawa:
Geometric Spanner of Objects under L1 Distance. 395-404
Graph Drawing and Information Visualization
- Seok-Hee Hong, Hiroshi Nagamochi:
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. 405-414
Graph Theory and Algorithms
- Pim van 't Hof, Daniël Paulusma:
A New Characterization of P6-Free Graphs. 415-424 - Masaya Mito, Satoshi Fujita:
Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction. 425-433 - Li-Pu Yeh, Biing-Feng Wang:
Efficient Algorithms for the kSmallest Cuts Enumeration. 434-443 - Naoyuki Kamiyama, Naoki Katoh:
Covering Directed Graphs by In-Trees. 444-457 - Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno:
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. 458-467 - David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng:
Probe Ptolemaic Graphs. 468-477
Communication Networks and Optimization
- Sun-Yuan Hsieh, Chia-Wei Lee:
Diagnosability of Two-Matching Composition Networks. 478-486 - Sergio Rajsbaum, Michel Raynal, Corentin Travers:
The Iterated Restricted Immediate Snapshot Model. 487-497 - Regant Y. S. Hung, Kwok Fai Lai, Hing-Fung Ting:
Finding Frequent Items in a Turnstile Data Stream. 498-509 - Hung Q. Ngo, Yang Wang, Anh Le:
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints. 510-520 - Weiwei Wu, Minming Li, Enhong Chen:
Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost. 521-530
Wireless Network
- Hejiao Huang, Yun Peng:
Throughput Maximization with Traffic Profile in Wireless Mesh Network. 531-540 - Deying Li, Hongwei Du, Lin Liu, Scott C.-H. Huang:
Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment. 541-550 - Xiaofeng Gao, Yaochun Huang, Zhao Zhang, Weili Wu:
(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. 551-557 - Xiang-Yang Li, Ping Xu, Shaojie Tang, Xiaowen Chu:
Spectrum Bidding in Wireless Networks and Related. 558-567
Network Optimization
- Xianyue Li, Yaochun Huang, Feng Zou, Donghyun Kim, Weili Wu:
(1+rho)-Approximation for Selected-Internal Steiner Minimum Tree. 568-576 - Xianchao Zhang, Weifa Liang, Guoliang Chen:
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities. 577-586 - Ching-Lueh Chang, Yuh-Dauh Lyuu:
Spreading Messages. 587-599 - Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou:
On Some City Guarding Problems. 600-610 - Matias Korman, Takeshi Tokuyama:
Optimal Insertion of a Segment Highway in a City Metric. 611-620 - Ehab Morsy, Hiroshi Nagamochi:
Approximating the Generalized Capacitated Tree-Routing Problem. 621-630 - Edna Ayako Hoshino, Cid C. de Souza:
Column Generation Algorithms for the Capacitated m-Ring-Star Problem. 631-641
Scheduling Problem
- Peng Liu, Lixin Tang:
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine. 642-650 - Hua Gong, Lixin Tang:
A Two-Stage Flexible Flowshop Problem with Deterioration. 651-660 - Tianping Shuai, Donglei Du:
A Lower Bound for the On-Line Preemptive Machine Scheduling with lp. 661-669 - Hua Gong, Lixin Tang:
The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. 670-677
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-11-30 23:59 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:
