![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
6th COCOA 2012: Banff, AB, Canada
- Guohui Lin:
Combinatorial Optimization and Applications - 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings. Lecture Notes in Computer Science 7402, Springer 2012, ISBN 978-3-642-31769-9 - Jing He, Shouling Ji, Yi Pan
, Zhipeng Cai:
Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks. 1-12 - Adrian Kosowski, Alfredo Navarra
, Dominik Pajak
, Maria Cristina Pinotti
:
Maximum Matching in Multi-Interface Networks. 13-24 - Evangelos Kranakis
, Fraser MacQuarrie, Oscar Morales-Ponce:
Stretch Factor in Wireless Sensor Networks with Directional Antennae. 25-36 - Wei Ding
, Guoliang Xue:
On the Minimum Diameter Cost-Constrained Steiner Tree Problem. 37-48 - Eddie Cheng
, Ke Qiu, Zhizhang Shen
:
The Edge-Centered Surface Area of the Arrangement Graph. 49-60 - Eunjeong Yi:
On Zero Forcing Number of Permutation Graphs. 61-72 - Basile Couëtoux, Jérôme Monnot, Sonia Toubaline:
Complexity Results for the Empire Problem in Collection of Stars. 73-82 - Sudip Biswas, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat
:
Hamiltonian Paths and Cycles in Planar Graphs. 83-94 - Chaoyi Wang, Tian Liu, Wei Jiang, Ke Xu:
Feedback Vertex Sets on Tree Convex Bipartite Graphs. 95-102 - Karin Arikushi, Csaba D. Tóth:
Crossing Angles of Geometric Graphs. 103-114 - Martin Lackner
, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Multicut on Graphs of Bounded Clique-Width. 115-126 - Chihao Zhang, Haitao Jiang, Binhai Zhu:
Radiation Hybrid Map Construction Problem Parameterized. 127-137 - Yongding Zhu, Jinhui Xu:
On the Central Path Problem. 138-150 - Hong Liu, Peng Zhang:
On the Generalized Multiway Cut in Trees Problem. 151-162 - Zhewei Liang, Kaizhong Zhang:
Algorithms for Forest Local Similarity. 163-175 - Yelena Frid, Dan Gusfield:
Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method. 176-187 - Zhi-Zhong Chen, Lusheng Wang
:
An Improved Approximation Algorithm for the Bandpass-2 Problem. 188-199 - Mourad El Ouali, Gerold Jäger:
The b-Matching Problem in Hypergraphs: Hardness and Approximability. 200-211 - Qiang Zhang, Weiwei Wu, Minming Li
:
Resource Scheduling with Supply Constraint and Linear Cost. 212-222 - Iyad A. Kanj, Ge Xia:
On Certain Geometric Properties of the Yao-Yao Graphs. 223-233 - Hiroshi Eto, Fengrui Guo, Eiji Miyano
:
Distance-d Independent Set Problems for Bipartite and Chordal Graphs. 234-244 - Sheung-Hung Poon
, William Chung-Kung Yen, Chin-Ting Ung:
Domatic Partition on Several Classes of Graphs. 245-256 - Barbara M. Anthony
, Christine Chung
:
Online Bottleneck Matching. 257-268 - Chung Keung Poon
, Binhai Zhu:
Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls. 269-280 - Guanqun Ni, Yinfeng Xu:
Online Joint Pricing and Booking Policies in Airline Revenue Management. 281-290 - Yumei Huo, Boris Reznichenko, Hairong Zhao:
Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability. 291-300 - Ken Ibara, Hiroshi Nagamochi:
Characterizing Mechanisms in Obnoxious Facility Game. 301-311 - Xujin Chen, Xiaodong Hu, Weidong Ma, Changjun Wang:
Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines. 312-323 - Boting Yang:
Fast-Mixed Searching on Graphs. 324-335 - Jin-Yi Cai, Xi Chen
, Heng Guo, Pinyan Lu
:
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. 336-347 - Luís Paquete
, Mathias Jaschob, Kathrin Klamroth
, Jochen Gorski:
Dynamic Programming for a Biobjective Search Problem in a Line. 348-359 - Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
, Dimitrios M. Thilikos:
Characterizing Graphs of Small Carving-Width. 360-370 - Neng Fan, Jean-Paul Watson:
Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming. 371-383 - Zheng Fang, You Li, Jie Wang:
Measuring Structural Similarities of Graphs in Linear Time. 384-395
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.