Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23. COCOON 2017: Hong Kong, China
- Yixin Cao
, Jianer Chen:
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings. Lecture Notes in Computer Science 10392, Springer 2017, ISBN 978-3-319-62388-7
COCOON 2017
- Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri:
A Time-Space Trade-Off for Triangulations of Points in the Plane. 3-12 - Ei Ando, Shuji Kijima:
An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes. 13-24 - Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan:
Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing. 25-37 - Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Depth Distribution in High Dimensions. 38-49 - Gill Barequet, Mira Shalah, Yufei Zheng:
An Improved Lower Bound on the Growth Constant of Polyiamonds. 50-61 - Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained Routing Between Non-Visible Vertices. 62-74 - Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza:
Deletion Graph Problems Based on Deadlock Resolution. 75-86 - Sankardeep Chakraborty, Srinivasa Rao Satti:
Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. 87-98 - Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. 99-111 - Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing:
The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality. 112-123 - Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang:
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. 124-136 - Zhou Chen, Yukun Cheng, Qi Qi, Xiang Yan:
Incentive Ratios of a Proportional Sharing Mechanism in Resource Sharing. 137-149 - Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa:
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. 150-161 - Wenkai Dai:
Reoptimization of Minimum Latency Problem. 162-174 - Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash Equilibria in Restricted Budget Games. 175-187 - Qilong Feng, Senmin Zhu, Jianxin Wang:
A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound. 188-199 - Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. 200-211 - Stanley P. Y. Fung:
Optimal Online Two-Way Trading with Bounded Number of Transactions. 212-223 - Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized Shifted Combinatorial Optimization. 224-236 - Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Approximate Minimum Diameter. 237-249 - Purnata Ghosal, Om Prakash, B. V. Raghavendra Rao:
On Constant Depth Circuits Parameterized by Degree: Identity Testing and Depth Reduction. 250-261 - Kun He, Qian Li, Xiaoming Sun:
A Tighter Relation Between Sensitivity Complexity and Certificate Complexity. 262-274 - Kuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen:
Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus. 275-286 - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of Maximum-Weight b-Matchings in a Graph. 287-296 - Yiyao Jiang:
Constant Approximation for Stochastic Orienteering Problem with (1+ε)-Budget Relaxiation. 297-308 - Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki:
Quantum Query Complexity of Unitary Operator Discrimination. 309-320 - Elena Khramtcova, Evanthia Papadopoulou:
Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended. 321-332 - Mikko Koivisto, Petteri Laakkonen, Juho Lauri:
NP-completeness Results for Partitioning a Graph into Total Dominating Sets. 333-345 - Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos:
Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. 346-358 - Hoàng-Oanh Le, Van Bang Le:
Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs. 359-370 - Serge Gaspers, Edward J. Lee:
Faster Graph Coloring in Polynomial Space. 371-383 - Qian Li, Xiaoming Sun:
On the Modulo Degree Complexity of Boolean Functions. 384-395 - Saeed Mehrabi:
Approximating Weighted Duo-Preservation in Comparative Genomics. 396-406 - Ruta Mehta, Vijay V. Vazirani:
An Incentive Compatible, Efficient Market for Air Traffic Flow Management. 407-419 - Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. 420-432 - Prajakta Nimbhorkar, V Arvind Rameshwar:
Dynamic Rank-Maximal Matchings. 433-444 - Rahnuma Islam Nishat, Sue Whitesides:
Bend Complexity and Hamiltonian Cycles in Grid Graphs. 445-456 - Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. 457-468 - Vladimir Shenmaier:
Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum. 469-480 - Xuehou Tan, Bo Jiang:
Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem. 481-491 - Satoshi Tayu, Shuichi Ueno:
Stable Matchings in Trees. 492-503 - Sumedh Tirodkar, Sundar Vishwanathan:
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models. 504-515 - Guangwei Wu, Jianxin Wang:
Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops. 516-528 - Jian Xu, Soumya Banerjee, Wenjing Rao:
The Existence of Universally Agreed Fairest Semi-matchings in Any Given Bipartite Graph. 529-541 - Wei Yu, Zhaohui Liu:
Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. 542-554 - Congsong Zhang, Yong Gao:
On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs. 555-567 - Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu, Zhenning Zhang:
A Local Search Approximation Algorithm for the k-means Problem with Penalties. 568-574 - Aizhong Zhou, Haitao Jiang, Jiong Guo, Haodi Feng, Nan Liu, Binhai Zhu:
Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction. 575-587
CSoNet Papers
- Konstantin E. Avrachenkov, Aleksei Yu. Kondratev, Vladimir V. Mazalov:
Cooperative Game Theory Approaches for Network Partitioning. 591-602 - Pavla Drázdilová, Jan Konecny, Milos Kudelka:
Chain of Influencers: Multipartite Intra-community Ranking. 603-614 - Jing (Selena) He, Ying Xie, Tianyu Du, Shouling Ji, Zhao Li:
Influence Spread in Social Networks with both Positive and Negative Influences. 615-629 - Pavel Krömer, Jana Nowaková:
Guided Genetic Algorithm for the Influence Maximization Problem. 630-641 - Suchi Kumari, Anurag Singh, Hocine Cherifi:
Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks. 642-653 - Eliska Ochodkova, Sarka Zehnalova, Milos Kudelka:
Graph Construction Based on Local Representativeness. 654-665 - Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
SHADE Algorithm Dynamic Analyzed Through Complex Network. 666-677 - Siman Zhang, Jiping Zheng:
An Efficient Potential Member Promotion Algorithm in Social Networks via Skyline. 678-690
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-18 21:30 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:
