Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th COCOA 2018: Atlanta, GA, USA
- Donghyun Kim, R. N. Uma, Alexander Zelikovsky:
Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings. Lecture Notes in Computer Science 11346, Springer 2018, ISBN 978-3-030-04650-7
Graph Theory
- Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
:
Fast Approximation of Centrality and Distances in Hyperbolic Graphs. 3-18 - Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Rectilinear Shortest Paths Among Transient Obstacles. 19-34 - Kunihiro Wasa, Takeaki Uno:
An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. 35-45 - Fernanda Couto, Luís Felipe I. Cunha:
Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently. 46-61 - Alexandre M. Bayen, Jesse Goodman, Eugene Vinitsky:
On the Approximability of Time Disjoint Walks. 62-78 - Frank Gurski, Carolin Rehs, Jochen Rethmann:
Directed Path-Width of Sequence Digraphs. 79-93 - Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau:
New Results About the Linearization of Scaffolds Sharing Repeated Contigs. 94-107 - Cristina Bazgan, Paul Beaujean, Éric Gourdin:
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem. 108-122 - Kelly B. Yancey, Matthew P. Yancey:
Bipartite Communities via Spectral Partitioning. 123-137 - Mark Korenblit:
Generating Algebraic Expressions for Labeled Grid Graphs. 138-153 - Huda Chuangpishit, Manuel Lafond, Lata Narayanan:
Editing Graphs to Satisfy Diversity Requirements. 154-168 - Tameem Choudhury, R. Inkulu:
Computing a Rectilinear Shortest Path amid Splinegons in Plane. 169-182 - Alexis Cornet, Christian Laforest:
Graph Problems with Obligations. 183-197 - Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Bipartizing with a Matching. 198-213
Network Flow and Security
- Gleb Polevoy, Stojan Trajanovski, Paola Grosso, Cees de Laat:
Removing Undesirable Flows by Edge Deletion. 217-232 - Yi Hong, Jiandong Liu, Chuanwen Luo, Deying Li:
Min-Max-Flow Based Algorithm for Evacuation Network Planning in Restricted Spaces. 233-245 - Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone:
Practical and Easy-to-Understand Card-Based Implementation of Yao's Millionaire Protocol. 246-261 - Meng Han, Dongjing Miao, Jinbao Wang, Liyuan Liu:
Defend the Clique-based Attack for Data Privacy. 262-280 - Hirofumi Suzuki, Masakazu Ishihata, Shin-ichi Minato:
Exact Computation of Strongly Connected Reliability by Binary Decision Diagrams. 281-295
Combinatorial Optimization
- Tatiana Belova, Ivan Bliznets:
Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSAT. 299-313 - Siyun Zhang, Kameng Nip, Zhenbo Wang:
Related Machine Scheduling with Machine Speeds Satisfying Linear Constraints. 314-328 - An Zhang, Yong Chen, Randy Goebel, Guohui Lin:
Open-Shop Scheduling for Unit Jobs Under Precedence Constraints. 329-340 - Daniel R. Page, Roberto Solis-Oba, Marten Maack:
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments. 341-356 - Sofiat Olaosebikan, David F. Manlove:
Super-Stability in the Student-Project Allocation Problem with Ties. 357-371 - Yingli Ran, Yishuo Shi, Zhao Zhang:
Primal Dual Algorithm for Partial Set Multi-cover. 372-385 - Cong Tian, Jiaying Wang, Zhenhua Duan, Liang Zhao:
Reducing Extension Edges of Concurrent Programs for Reachability Analysis. 386-401 - Ananya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold, David S. Yuen:
Robustly Assigning Unstable Items. 402-420 - Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit:
Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems. 421-435 - Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. 436-448 - Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson:
Heuristics for the Score-Constrained Strip-Packing Problem. 449-462
Computational Geometry and Combinatorial Optimization
- Heng-Zhao Ma, Jianzhong Li:
An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(\log n) Query Time. 465-479 - Anirban Ghosh, Samuel Schwartz:
Exact and Approximate Map-Reduce Algorithms for Convex Hull. 480-494 - Amirhossein Mozafari, Thomas C. Shermer:
Transmitting Particles in a Polygonal Domain by Repulsion. 495-508 - Ovidiu Daescu, Hemant Malik:
Does a Robot Path Have Clearance C? 509-521 - Diego Delle Donne, Guido Tagliavini:
Star Routing: Between Vehicle Routing and Vertex Cover. 522-536
Combinatorial Optimization and Data Structure
- Christopher J. Lowrance, Dominic M. Larkin, Sang M. Yim:
Effect of Crowd Composition on the Wisdom of Artificial Crowds Metaheuristic. 539-551 - Ivan Avramovic, Dana S. Richards:
Analysis of Consensus Sorting via the Cycle Metric. 552-565 - Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik:
On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem. 566-576 - Mohammad Ghodsi, Mohamad Latifian, Arman Mohammadi, Sadra Moradian, Masoud Seddighin:
Rent Division Among Groups. 577-591 - Shuhei Denzumi:
Sequence Sentential Decision Diagrams. 592-606
Clustering
- Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Online Unit Covering in Euclidean Space. 609-623 - Mark Velednitsky, Dorit S. Hochbaum:
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem. 624-639 - Kazutoshi Ando, Kazuya Shoji:
Characterizing Cycle-Complete Dissimilarities in Terms of Associated Indexed 2-Hierarchies. 640-650 - Syed Ali Ahmed, Saman Farhat, Saad Mneimneh:
Making Multiple RNA Interaction Practical. 651-671 - Tetsuya Araki, Shin-Ichi Nakano:
Max-Min Dispersion on a Line. 672-678
Miscellaneous
- Franklin Kenter, Daphne E. Skipper:
Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs. 681-695 - Dongjing Miao, Zhipeng Cai:
On the Complexity of Resilience for Aggregation Queries. 696-706 - Barbara M. Anthony, Christine Chung:
Inefficiency of Equilibria in Doodle Polls. 707-721 - Rahul Swamy, Timothy Murray, Jugal Garg:
Network Cost-Sharing Games: Equilibrium Computation and Applications to Election Modeling. 722-738 - Catalina Aranzazu Suescun, Mihaela Cardei:
Weak-Barrier Coverage with Adaptive Sensor Rotation. 739-754
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-22 21:13 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:
