default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th COCOON 2019: Xi'an, China
- Ding-Zhu Du, Zhenhua Duan, Cong Tian:
Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings. Lecture Notes in Computer Science 11653, Springer 2019, ISBN 978-3-030-26175-7 - Niranka Banerjee, Venkatesh Raman, Saket Saurabh:
Fully Dynamic Arboricity Maintenance. 1-12 - Gill Barequet, Minati De
:
A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice. 13-24 - Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
An FPTAS for a General Class of Parametric Optimization Problems. 25-37 - Sukanya Bhattacharjee, R. Inkulu:
Geodesic Fault-Tolerant Additive Weighted Spanners. 38-51 - Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Diameter of Colorings Under Kempe Changes. 52-64 - Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee:
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. 65-77 - Vincent Chau, Minming Li, Yinling Wang, Ruilong Zhang, Yingchao Zhao:
Minimizing the Cost of Batch Calibrations. 78-89 - Prasad Chaugule, Nutan Limaye, Aditya Varre:
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. 90-102 - Junjie Chen, Takanori Maehara:
Chance-Constrained Submodular Knapsack Problem. 103-114 - Miroslav Chlebík, Janka Chlebíková:
Approximation Hardness of Travelling Salesman via Weighted Amplifiers. 115-127 - Pratyush Dayal, Neeldhara Misra:
Deleting to Structured Trees. 128-139 - Krishnamoorthy Dinesh, Jayalal Sarma:
Sensitivity, Affine Transforms and Quantum Communication Complexity. 140-152 - Ning Ding:
On Exactly Learning Disjunctions and DNFs Without Equivalence Queries. 153-165 - Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Tatsuya Sasaki, Hideaki Sone:
Interactive Physical Zero-Knowledge Proof for Norinori. 166-177 - Purnata Ghosal, B. V. Raghavendra Rao:
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models. 178-192 - Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy:
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. 193-205 - Pawel Górecki, Alexey Markin, Oliver Eulenstein:
Feasibility Algorithms for the Duplication-Loss Cost. 206-218 - Jan Gorzny, Jonathan F. Buss:
Imbalance, Cutwidth, and the Structure of Optimal Orderings. 219-231 - Grzegorz Guspiel:
Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs. 232-239 - Hovhannes A. Harutyunyan, Zhiyuan Li:
A Simple Construction of Broadcast Graphs. 240-253 - Md. Manzurul Hasan, Md. Saidur Rahman:
No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract). 254-265 - Alessandro Hill, Stefan Voß, Roberto Baldacci:
Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts. 266-278 - Yi Hong, Deying Li, Qiang Wu, Hua Xu:
3D Path Network Planning: Using a Global Optimization Heuristic for Mine Water-Inrush Evacuation. 279-290 - Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Max-Min 3-Dispersion Problems. 291-300 - Sun-Yuan Hsieh, Hoàng-Oanh Le, Van Bang Le, Sheng-Lung Peng:
Matching Cut in Graphs with Large Minimum Degree. 301-312 - Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki:
Incremental Optimization of Independent Sets Under the Reconfiguration Framework. 313-324 - Ashwin Jacob, Venkatesh Raman, Vibha Sahlot:
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems. 325-337 - Kai Jin:
On 1-Factorizations of Bipartite Kneser Graphs. 338-349 - Koji M. Kobayashi:
An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead. 350-362 - Mehul Kumar, Amit Kumar, C. Pandu Rangan:
Reoptimization of Path Vertex Cover Problem. 363-374 - Hung Le, Baigong Zheng:
A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs. 375-386 - Min Li, Yishui Wang, Dachuan Xu, Dongmei Zhang:
The Seeding Algorithm for Functional k-Means Problem. 387-396 - Daogao Liu:
More Efficient Algorithms for Stochastic Diameter and Some Unapproximated Problems in Metric Space. 397-411 - S. Cliff Liu:
Lower Bounds for Small Ramsey Numbers on Hypergraphs. 412-424 - Yang Liu, Kristiaan Pelckmans:
APTER: Aggregated Prognosis Through Exponential Re-weighting. 425-436 - Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh:
An Erdős-Pósa Theorem on Neighborhoods and Domination Number. 437-444 - Dongjing Miao, Zhipeng Cai:
On the Hardness of Reachability Reduction. 445-455 - Hideaki Ohashi, Yasuhito Asano, Toshiyuki Shimizu, Masatoshi Yoshikawa:
Give and Take: Adaptive Balanced Allocation for Peer Assessments. 456-468 - Holger Petersen:
LIKE Patterns and Complexity. 469-477 - Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy:
Data Structures for Incremental Interval Coloring. 478-489 - Ivan Bliznets, Danil Sagunov:
Lower Bounds for the Happy Coloring Problems. 490-502 - Xinfeng Shu, Nan Zhang:
An Efficient Decision Procedure for Propositional Projection Temporal Logic. 503-515 - Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia:
On the Relationship Between Energy Complexity and Other Boolean Function Measures. 516-528 - Xiaoming Sun, Yuan Sun, Zhiyu Xia, Jialin Zhang:
The One-Round Multi-player Discrete Voronoi Game on Grids and Trees. 529-540 - Taiki Todo, Atsushi Iwasaki, Makoto Yokoo:
Competitive Auctions and Envy-Freeness for Group of Agents. 541-553 - Mingyu Xiao:
Upper and Lower Bounds on Approximating Weighted Mixed Domination. 554-566 - Mingyu Xiao, Jianan Zhang, Weibo Lin:
Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints. 567-579 - Shengjun Xie, Haodi Feng, Haitao Jiang, Junfeng Luan, Daming Zhu:
An Approximation Algorithm for Sorting by Bounded Singleton Moves. 580-590 - Yicheng Xu, Dachuan Xu, Yong Zhang, Juan Zou:
Universal Facility Location in Generalized Metric Space. 591-602 - Ruidong Yan, Yi Li, Deying Li, Yuqing Zhu, Yongcai Wang, Hongwei Du:
Activation Probability Maximization for Target Users Under Influence Decay Model. 603-614 - Ruiqi Yang, Dachuan Xu, Donglei Du, Yicheng Xu, Xihong Yan:
Maximization of Constrained Non-submodular Functions. 615-626 - Deshi Ye, Feng Xie, Guochuan Zhang:
Truthful Mechanism Design of Reversed Auction on Cloud Computing. 627-638 - Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Distance Constrained Vehicle Routing Problem to Minimize the Total Cost. 639-650 - Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint. 651-662 - Liang Zhao, Xiaobing Wang, Xinfeng Shu, Nan Zhang:
A Proof System for a Unified Temporal Logic. 663-676
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-04-01 23:51 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:
