default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th COCOA 2019: Xiamen, China
- Yingshu Li, Mihaela Cardei, Yan Huang:
Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings. Lecture Notes in Computer Science 11949, Springer 2019, ISBN 978-3-030-36411-3 - Yuichi Asahiro, Jesper Jansson
, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. 1-12 - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. 13-25 - Peter Ballen:
Critical Rows of Almost-Factorable Matrices. 26-38 - Juan José Besa Vial, Michael T. Goodrich, Timothy Johnson, Martha C. Osegueda:
Minimum-Width Drawings of Phylogenetic Trees. 39-55 - Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. 56-68 - Jeremy T. Bradley, Dimitrios Letsios, Ruth Misener, Natasha Page:
Approximating Bounded Job Start Scheduling with Application in Royal Mail Deliveries Under Uncertainty. 69-81 - Chun-Hsiang Chan, Hsu-Chun Yen:
Contact Representations of Directed Planar Graphs in 2D and 3D. 82-93 - Sijie Chen, Ziwei Quan, Yong Liu:
Identifying Structural Hole Spanners in Social Networks via Graph Embedding. 94-106 - Xujin Chen, Xiaodong Hu, Xiaoying Wu:
The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler. 107-118 - Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A Randomized Approximation Algorithm for Metric Triangle Packing. 119-129 - Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation Algorithms for Maximally Balanced Connected Graph Partition. 130-141 - Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh:
Edge Exploration of a Graph by Mobile Agent. 142-154 - Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Fast Diameter Computation Within Split Graphs. 155-167 - Binayak Dutta, Sasanka Roy:
Approximate Shortest Paths in Polygons with Violations. 168-180 - Stefan Funke, Sabine Storandt:
Parametrized Runtimes for Label Tournaments. 181-196 - Jinxiang Gan, Guochuan Zhang:
The k-Delivery Traveling Salesman Problem: Revisited. 197-209 - Guichen Gao, Li Ning, Hing-Fung Ting, Yong Zhang, Yifei Zou:
Algorithmic Pricing for the Partial Assignment. 210-222 - Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Recognizing the Tractability in Big Data Computing. 223-234 - Longjiang Guo, De Wang, Peng Li, Lichen Zhang, Meirei Ren, Hong Liu, A'na Wang:
A Novel Virtual Traffic Light Algorithm Based on V2V for Single Intersection in Vehicular Networks. 235-251 - Frank Gurski, Dominique Komander, Carolin Rehs:
Characterizations for Special Directed Co-graphs. 252-264 - Chaoyu He, Zhiyi Tan:
Scheduling Game with Machine Modification in the Random Setting. 265-276 - Zaobo He, Yan Huang:
Tracking Histogram of Attributes over Private Social Data in Data Markets. 277-288 - Zhiwei Hu, Zhaogong Zhang, Zongchao Huang, Dayuan Zheng, Ziliang Zhang:
Feature Selection Based on Graph Structure. 289-302 - Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara, Taiga Sone, Akihiro Yamamoto:
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. 303-315 - Jianshu Li, Xiaoyin Hu, Junjie Luo, Jinchuan Cui:
A Fast Exact Algorithm for Airplane Refueling Problem. 316-327 - Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting, Yong Zhang:
Approximation Algorithm and Incentive Ratio of the Selling with Preference. 328-339 - Haodong Liu, Kelin Luo, Yinfeng Xu, Huili Zhang:
Car-Sharing Problem: Online Scheduling with Flexible Advance Bookings. 340-351 - Pengcheng Liu, Xiaohui Huang, Zhao Zhang:
Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem. 352-361 - Heng-Zhao Ma, Jianzhong Li:
A True O(nlog n) Algorithm for the All-k-Nearest-Neighbors Problem. 362-374 - Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong:
Approximation Algorithms for Some Minimum Postmen Cover Problems. 375-386 - Joseph S. B. Mitchell, Supantha Pandit:
New Results on a Family of Geometric Hitting Set Problems in the Plane. 387-399 - Kameng Nip, Zhenbo Wang:
Two-Machine Flow Shop Scheduling Problem Under Linear Constraints. 400-411 - Kameng Nip, Zhenbo Wang, Tianning Shi:
Some Graph Optimization Problems with Weights Satisfying Linear Constraints. 412-424 - Supantha Pandit:
On the Hardness of Some Geometric Optimization Problems with Rectangles. 425-436 - Subhabrata Paul, Keshav Ranjan:
On Vertex-Edge and Independent Vertex-Edge Domination. 437-448 - Benoît Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs. 449-460 - Ken Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone:
Card-Based Secure Ranking Computations. 461-472 - Xuehou Tan, Charatsanyakul Sakthip, Bo Jiang:
Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position. 473-484 - Mark Velednitsky:
Solving (k-1)-Stable Instances of k-terminal cut with Isolating Cuts. 485-495 - A'na Wang, Lichen Zhang, Longjiang Guo, Meirui Ren, Peng Li, Bin Yan:
A Task Assignment Approach with Maximizing User Type Diversity in Mobile Crowdsensing. 496-506 - Chenhao Wang, Xiaoying Wu:
Cake Cutting with Single-Peaked Valuations. 507-516 - Lusheng Wang, Boting Yang:
The One-Cop-Moves Game on Graphs of Small Treewidth. 517-528 - Yong Wang:
Bounded Degree Graphs Computed for Traveling Salesman Problem Based on Frequency Quadrilaterals. 529-540 - Zhen Wang, Jinghua Zhu, Doudou Li:
Prediction Based Reverse Auction Incentive Mechanism for Mobile Crowdsensing System. 541-552 - Yuchen Xia, Zhitian Xu, Xiaofeng Gao, Mo Chi, Guihai Chen:
PATRON: A Unified Pioneer-Assisted Task RecommendatiON Framework in Realistic Crowdsourcing System. 553-564 - Ruiqi Yang, Dachuan Xu, Longkun Guo, Dongmei Zhang:
Sequence Submodular Maximization Meets Streaming. 565-575 - Sean Yaw, Richard S. Middleton, Brendan A. Hoover:
Graph Simplification for Infrastructure Network Design. 576-589 - Dayuan Zheng, Zhaogong Zhang, Yuting Zhang:
TNT: An Effective Method for Finding Correlations Between Two Continuous Variables. 590-600 - Onur Çagirici, Subir Kumar Ghosh, Petr Hlinený, Bodhayan Roy:
On Conflict-Free Chromatic Guarding of Simple Polygons. 601-612
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-11-27 02:26 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:
