Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th COCOA 2014: Wailea, Maui, HI, USA
- Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du:
Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings. Lecture Notes in Computer Science 8881, Springer 2014, ISBN 978-3-319-12690-6
Classic Combinatorial Optimization
- Sean Yaw, Brendan Mumey:
An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling. 3-12 - Lin Chen
, Deshi Ye, Guochuan Zhang:
An Asymptotic Competitive Scheme for Online Bin Packing. 13-24 - Sebastian Abshoff, Christine Markarian, Friedhelm Meyer auf der Heide:
Randomized Online Algorithms for Set Cover Leasing Problems. 25-34
Geometric Optimization
- Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song:
Optimizing Squares Covering a Set of Points. 37-52 - Bogdan Armaselu, Ovidiu Daescu:
Algorithms for Fair Partitioning of Convex Polygons. 53-65 - Liang Song, Hejiao Huang, Hongwei Du:
A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW. 66-73 - Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang:
On-Line Strategies for Evacuating from a Convex Region in the Plane. 74-85 - Yi-Jun Chang, Hsu-Chun Yen:
Rectilinear Duals Using Monotone Staircase Polygons. 86-100 - Azadeh Tabatabaei, Mohammad Ghodsi:
Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot. 101-112 - Mark de Berg, Stephane Durocher, Saeed Mehrabi:
Guarding Monotone Art Galleries with Sliding Cameras in Linear Time. 113-125
Network Optimization
- Marek Chrobak, Kevin P. Costello, Leszek Gasieniec, Darek Kowalski:
Information Gathering in Ad-Hoc Radio Networks with Tree Topology. 129-145 - Binay K. Bhattacharya, Tsunehiko Kameda:
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. 146-160 - Zaobo He, Zhipeng Cai, Siyao Cheng, Xiaoming Wang:
Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks. 161-172 - Hongwei Du, Haiming Luo, Jing Zhang, Rongrong Zhu, Qiang Ye:
Interference-Free k-barrier Coverage in Wireless Sensor Networks. 173-183 - Jun Li, Xiaofeng Gao, Guihai Chen, Fengwei Gao, Ling Ding:
Performance Analysis and Improvement for the Construction of MCDS Problem in 3D Space. 184-199 - Dimitri Watel, Marc-Antoine Weisser:
A Practical Greedy Approximation for the Directed Steiner Tree Problem. 200-215 - Mirela Damian, Dumitru V. Voicu:
Spanning Properties of Theta-Theta Graphs. 216-230 - Hao Gu, Liang Song, Hejiao Huang, Hongwei Du:
A Bicriteria Approximation Algorithm for DVRP with Time Windows. 231-238
Optimization in Graphs
- Michael T. Goodrich, Joseph A. Simons:
Data-Oblivious Graph Algorithms in Outsourced External Memory. 241-257 - Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries:
A Dichotomy for Upper Domination in Monogenic Classes. 258-267 - Ernst Althaus, Markus Blumenstock, Alexej Disterhoft, Andreas Hildebrandt, Markus Krupp:
Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem. 268-282 - Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. 283-298 - Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou:
The Minimum Vulnerability Problem on Graphs. 299-313 - Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. 314-328 - Jianjie Zhou, Liying Kang, Erfang Shan:
Two Paths Location of a Tree with Positive or Negative Weights. 329-342 - Yilin Shen, Xiang Li, My T. Thai:
Approximation Algorithms for Optimization Problems in Random Power-Law Graphs. 343-355 - Cong X. Kang, Eunjeong Yi:
A Comparison Between the Zero Forcing Number and the Strong Metric Dimension of Graphs. 356-365 - Sicen Guo, Minming Li, Yingchao Zhao:
Optimal Trees for Minimizing Average Individual Updating Cost. 366-378 - Subhankar Mishra, Xiang Li, My T. Thai, Jungtaek Seo:
Cascading Critical Nodes Detection with Load Redistribution in Complex Systems. 379-394 - Barbara M. Anthony, Christine Chung:
The Power of Rejection in Online Bottleneck Matching. 395-411 - Xueliang Li, Jun Yue, Yan Zhao:
The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs. 412-425
Applied Optimization
- Péter Biró, Iain McBride:
Integer Programming Methods for Special College Admissions Problems. 429-443 - Beate Bollig:
On the Width of Ordered Binary Decision Diagrams. 444-458 - Jun Kawahara, Koji M. Kobayashi, Tomotaka Maeda:
Tight Analysis of Priority Queuing for Egress Traffic. 459-473 - Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell:
Optimally Bracing Grid Frameworks with Holes. 474-489 - Subhashis Majumder, Biswajit Sanyal, Prosenjit Gupta, Soumik Sinha, Shiladitya Pande, Wing-Kai Hon:
Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking. 490-505 - Annalisa De Bonis:
Efficient Group Testing Algorithms with a Constrained Number of Positive Responses. 506-521 - Ananya Christman, William Forcier:
Maximizing Revenues for On-Line Dial-a-Ride. 522-534
CSoNet
- Hyunjin Seo, Stuart Thorson:
Global Internet Connectedness: 2002-2011. 537-546 - Yongjia Song, Thang N. Dinh:
Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach. 547-556 - Golshan Golnari, Zhi-Li Zhang:
Multivariate Heavy Tails in Complex Networks. 557-570 - Michael L. Mayo, Ahmed Abdelzaher, Preetam Ghosh:
Mixed Degree-Degree Correlations in Directed Social Networks. 571-580 - Omid Atabati, Babak Farzad:
Social and Economic Network Formation: A Dynamic Model. 581-592 - Mario Ventresca, Dionne M. Aleman:
A Region Growing Algorithm for Detecting Critical Nodes. 593-602 - Mario Ventresca, Dionne M. Aleman:
A Fast Greedy Algorithm for the Critical Node Detection Problem. 603-612 - Neng Fan, Mehdi Golari:
Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs. 613-622
Complexity, Cryptography and Game
- Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. 625-636 - Iyad A. Kanj, Stefan Szeider:
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. 637-651 - Bjørn Kjos-Hanssen:
Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics. 652-665 - Zhenhua Duan, Jin Liu, Jie Li, Cong Tian:
Improved Even Order Magic Square Construction Algorithms and Their Applications. 666-680 - Shaun M. Fallat, Karen Meagher, Boting Yang:
The Complexity of the Positive Semidefinite Zero Forcing. 681-693 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. 694-709
Miscellaneous
- Naoyuki Kamiyama:
The Popular Matching and Condensation Problems Under Matroid Constraints. 713-728 - Gyan Ranjan, Zhi-Li Zhang, Daniel Boley:
Incremental Computation of Pseudo-Inverse of Laplacian. 729-749 - David Hay, Shahrzad Shirazipourazad, Arunabha Sen:
Optimal Tracking of Multiple Targets Using UAVs. 750-763 - Xiaosong Li, Zhao Zhang, Xiaohui Huang:
Approximation Algorithm for the Minimum Connected k -Path Vertex Cover Problem. 764-771
a service of 
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-04-26 18:41 CEST 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:
