default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th COCOON 2018: Qing Dao, China
- Lusheng Wang, Daming Zhu:
Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings. Lecture Notes in Computer Science 10976, Springer 2018, ISBN 978-3-319-94775-4
Abstracts of Invited Talks
- Michael Segal:
Privacy Aspects in Data Querying. x - Ming Li:
Challenges from Cancer Immunotherapy. xii-x - Russell Schwartz:
Reconstructing Tumor Evolution and Progression in Structurally Variant Cancer Cells. x-
Papers
- Shih-Shun Kao
, Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu:
Constructing Independent Spanning Trees on Bubble-Sort Networks. 1-13 - Yunyun Deng, Longkun Guo, Peihuang Huang:
Exact Algorithms for Finding Partial Edge-Disjoint Paths. 14-25 - Haitao Jiang, Lianrong Pu, Letu Qingge, David Sankoff, Binhai Zhu:
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications. 26-38 - Weiwen Liu, Shuai Li, Shengyu Zhang:
Contextual Dependent Click Bandit Algorithm for Web Recommendation. 39-50 - Takuro Fukunaga:
LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering. 51-62 - Kameng Nip, Zhenbo Wang:
Approximation Algorithms for a Two-Phase Knapsack Problem. 63-75 - Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano:
More Routes for Evacuation. 76-83 - Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza:
Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem. 84-95 - Shi Li, Jinhui Xu, Minwei Ye:
Approximating Global Optimum for Probabilistic Truth Discovery. 96-107 - Koji M. Kobayashi:
Online Interval Scheduling to Maximize Total Satisfaction. 108-119 - Gill Barequet, Gil Ben-Shachar:
Properties of Minimal-Perimeter Polyominoes. 120-129 - Gill Barequet, Minati De, Michael T. Goodrich:
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. 130-142 - Eunjin Oh, Hee-Kap Ahn:
Polygon Queries for Convex Hulls of Points. 143-155 - Jérémy Barbay, Carlos Ochoa:
Synergistic Solutions for Merging and Computing Planar Convex Hulls. 156-167 - Pawel Górecki, Alexey Markin, Oliver Eulenstein:
Cophenetic Distances: A Near-Linear Time Algorithmic Framework. 168-179 - Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing Coverage Kernels Under Restricted Settings. 180-191 - Liyu Zhang, Mahmoud Quweider, Hansheng Lei, Fitra Khan:
Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-Table Autoreducible Sets. 192-204 - Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang:
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. 205-217 - Chun-Hsiang Chan, Hsu-Chun Yen:
On Contact Representations of Directed Planar Graphs. 218-229 - Johannes Blum, Sabine Storandt:
Computation and Growth of Road Network Dimensions. 230-241 - Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings. 242-254 - Frank Gurski, Carolin Rehs:
Directed Path-Width and Directed Tree-Width of Directed Co-graphs. 255-267 - Raffaello Carosi, Gianpiero Monaco:
Generalized Graph k-Coloring Games. 268-279 - Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco:
On Colorful Bin Packing Games. 280-292 - Nanao Kita:
Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality. 293-304 - Chenyang Xu, Guochuan Zhang:
The Path Set Packing Problem. 305-315 - Pratik Ghosal, Katarzyna E. Paluch:
Manipulation Strategies for the Rank-Maximal Matching Problem. 316-327 - Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. 328-340 - R. Krithika, Pranabendu Misra, Prafullkumar Tale:
An FPT Algorithm for Contraction to Cactus. 341-352 - Wenchang Luo, Bing Su, Yao Xu, Guohui Lin:
An Approximation Framework for Bounded Facility Location Problems. 353-364 - Jean Cardinal, Erik D. Demaine, David Eppstein, Robert A. Hearn, Andrew Winslow:
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect. 365-377 - Alexey Markin, Venkata Sai Krishna Teja Vadali, Oliver Eulenstein:
Solving the Gene Duplication Feasibility Problem in Linear Time. 378-390 - Syed Mohammad Meesum:
An Efficiently Recognisable Subset of Hypergraphic Sequences. 391-402 - Nikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth:
Partial Homology Relations - Satisfiability in Terms of Di-Cographs. 403-415 - Yingying Wang, Kun Cheng, Zimao Li:
Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds. 416-427 - Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring Spanning and Induced Subgraphs. 428-440 - T.-H. Hubert Chan, Zhibin Liang:
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators. 441-453 - Kunihiro Wasa, Takeaki Uno:
Efficient Enumeration of Bipartite Subgraphs in Graphs. 454-466 - Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite Graphs of Small Readability. 467-479 - Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham:
Maximum Colorful Cliques in Vertex-Colored Graphs. 480-491 - Bin Fu:
Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage. 492-503 - Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. 504-515 - Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's Dominating Set in Unit Disk Graphs. 516-528 - Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy:
Minimum Spanning Tree of Line Segments. 529-541 - Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal:
Improved Learning of k-Parities. 542-553 - Axel Goblet, Steven Kelk, Matús Mihalák, Georgios Stamoulis:
On a Fixed Haplotype Variant of the Minimum Error Correction Problem. 554-566 - Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. 567-578 - Debajyoti Bera:
Amplitude Amplification for Operator Identification and Randomized Classes. 579-591 - Evgeny Dantsin, Alexander Wolpert:
Reconstruction of Boolean Formulas in Conjunctive Normal Form. 592-601 - Nikolaos Melissinos, Aris Pagourtzis:
A Faster FPTAS for the Subset-Sums Ratio Problem. 602-614 - Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. 615-625 - Benjamin Hescott, Caleb Malchik, Andrew Winslow:
Non-determinism Reduces Construction Time in Active Self-assembly Using an Insertion Primitive. 626-637 - N. S. Narayanaswamy, S. M. Dhannya, C. Ramya:
Minimum Membership Hitting Sets of Axis Parallel Segments. 638-649 - Niranka Banerjee, Varunkumar Jayapaul, Srinivasa Rao Satti:
Minimum Transactions Problem. 650-661 - Radu Stefan Mincu, Alexandru Popa:
Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem. 662-674 - Sepideh Aghamolaei, Fatemeh Baharifard, Mohammad Ghodsi:
Geometric Spanners in the MapReduce Model. 675-687 - T.-H. Hubert Chan, Bintao Sun:
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands. 688-700 - C. Ramya, B. V. Raghavendra Rao:
Lower Bounds for Special Cases of Syntactic Multilinear ABPs. 701-712 - Guangwei Wu, Jianer Chen:
Approximation Algorithms on Multiple Two-Stage Flowshops. 713-725 - Mugang Lin, Bin Fu, Qilong Feng:
Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem. 726-737 - Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma:
New Bounds for Energy Complexity of Boolean Functions. 738-750 - Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh:
Hitting and Covering Partially. 751-763
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-03-08 00:51 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:
