default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th COCOA 2010: Kailua-Kona, HI, USA
- Weili Wu, Ovidiu Daescu:
Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II. Lecture Notes in Computer Science 6509, Springer 2010, ISBN 978-3-642-17460-5 - Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose
, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-Transmitters in the Presence of Obstacles. 1-15 - Beate Bollig:
On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem. 16-30 - Xujin Chen, Xiaodong Hu, Weidong Ma:
Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations. 31-45 - Deying Li, Zheng Li, Wenkai Ma, Hong Chen:
Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks. 46-57 - Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro:
Time Optimal Algorithms for Black Hole Search in Rings. 58-71 - Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho:
Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle. 72-86 - Martin Olsen, Anastasios Viglas, Ilia Zvedeniouk:
A Constant-Factor Approximation Algorithm for the Link Building Problem. 87-96 - Artem Chebotko, Bin Fu:
XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme. 97-106 - Marjan Marzban, Qian-Ping Gu, Xiaohua Jia:
Computational Study for Planar Connected Dominating Set Problem. 107-116 - Peter Damaschke, Azam Sheikh Muhammad:
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives. 117-130 - Tomoshi Otsuki, Hideyuki Aisu, Toshiaki Tanaka:
A Search-Based Approach to the Railway Rolling Stock Allocation Problem. 131-143 - Viet Hung Nguyen:
Approximation Algorithm for the Minimum Directed Tree Cover. 144-159 - Jing He, Hongyu Liang:
An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs. 160-169 - Guizhen Liu, Xuejun Pan, Jonathan Z. Sun:
A New Result on [k, k + 1]-Factors Containing Given Hamiltonian Cycles. 170-180 - Mirela Damian, Kristin Raudonis:
Yao Graphs Span Theta Graphs. 181-194 - Tadao Takaoka, Mashitoh Hashim:
A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2logn) Expected Time. 195-206 - Arthur H. Busch, Feodor F. Dragan, R. Sritharan:
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. 207-218 - Bang Ye Wu:
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. 219-227 - Boting Yang:
Fast Edge-Searching and Related Problems. 228-242 - Wei Ding, Guohui Lin, Guoliang Xue:
Diameter-Constrained Steiner Tree. 243-253 - Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. 254-267 - Wei Ding, Guoliang Xue:
A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree. 268-280 - Deying Li, Zheng Li, Wenkai Ma, Wenping Chen:
Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks. 281-291 - Hongbing Fan, Yu-Liang Wu:
Structured Overlay Network for File Distribution. 292-302 - Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny:
Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations. 303-316 - Jinsong Tan:
The Networked Common Goods Game. 317-331 - James Nastos, Yong Gao:
A Novel Branching Strategy for Parameterized Graph Modification Problems. 332-346 - Bingbing Zhuang, Hiroshi Nagamochi:
Listing Triconnected Rooted Plane Graphs. 347-361 - Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Bipartite Permutation Graphs Are Reconstructible. 362-373 - Cong Tian, Zhenhua Duan:
A Transformation from PPTL to S1S. 374-386 - Mingyu Xiao:
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs. 387-400 - Asish Mukhopadhyay, Animesh Sarker, Tom Switzer:
Approximate Ellipsoid in the Streaming Model. 401-413
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-08 22:51 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:
