Abstract is missing.
- Fast Approximation of Centrality and Distances in Hyperbolic GraphsVictor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed. 3-18 [doi]
- Rectilinear Shortest Paths Among Transient ObstaclesAnil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack. 19-34 [doi]
- An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded DegeneracyKunihiro Wasa, Takeaki Uno. 35-45 [doi]
- Tree t-Spanners of a Graph: Minimizing Maximum Distances EfficientlyFernanda Couto, Luís Felipe I. Cunha. 46-61 [doi]
- On the Approximability of Time Disjoint WalksAlexandre M. Bayen, Jesse Goodman, Eugene Vinitsky. 62-78 [doi]
- Directed Path-Width of Sequence DigraphsFrank Gurski, Carolin Rehs, Jochen Rethmann. 79-93 [doi]
- New Results About the Linearization of Scaffolds Sharing Repeated ContigsDorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau. 94-107 [doi]
- Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph ProblemCristina Bazgan, Paul Beaujean, Éric Gourdin. 108-122 [doi]
- Bipartite Communities via Spectral PartitioningKelly B. Yancey, Matthew P. Yancey. 123-137 [doi]
- Generating Algebraic Expressions for Labeled Grid GraphsMark Korenblit. 138-153 [doi]
- Editing Graphs to Satisfy Diversity RequirementsHuda Chuangpishit, Manuel Lafond, Lata Narayanan. 154-168 [doi]
- Computing a Rectilinear Shortest Path amid Splinegons in PlaneTameem Choudhury, R. Inkulu. 169-182 [doi]
- Graph Problems with ObligationsAlexis Cornet, Christian Laforest. 183-197 [doi]
- Bipartizing with a MatchingCarlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter. 198-213 [doi]
- Removing Undesirable Flows by Edge DeletionGleb Polevoy, Stojan Trajanovski, Paola Grosso, Cees de Laat. 217-232 [doi]
- Min-Max-Flow Based Algorithm for Evacuation Network Planning in Restricted SpacesYi Hong 0003, Jiandong Liu, Chuanwen Luo, Deying Li. 233-245 [doi]
- Practical and Easy-to-Understand Card-Based Implementation of Yao's Millionaire ProtocolDaiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone. 246-261 [doi]
- Defend the Clique-based Attack for Data PrivacyMeng Han, Dongjing Miao, Jinbao Wang, Liyuan Liu. 262-280 [doi]
- Exact Computation of Strongly Connected Reliability by Binary Decision DiagramsHirofumi Suzuki, Masakazu Ishihata, Shin-ichi Minato. 281-295 [doi]
- Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSATTatiana Belova, Ivan Bliznets. 299-313 [doi]
- Related Machine Scheduling with Machine Speeds Satisfying Linear ConstraintsSiyun Zhang, Kameng Nip, Zhenbo Wang. 314-328 [doi]
- Open-Shop Scheduling for Unit Jobs Under Precedence ConstraintsAn Zhang, Yong Chen, Randy Goebel, Guohui Lin. 329-340 [doi]
- Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job AssignmentsDaniel R. Page, Roberto Solis-Oba, Marten Maack. 341-356 [doi]
- Super-Stability in the Student-Project Allocation Problem with TiesSofiat Olaosebikan, David Manlove. 357-371 [doi]
- Primal Dual Algorithm for Partial Set Multi-coverYingli Ran, Yishuo Shi, Zhao Zhang 0002. 372-385 [doi]
- Reducing Extension Edges of Concurrent Programs for Reachability AnalysisCong Tian, Jiaying Wang, Zhenhua Duan, Liang Zhao. 386-401 [doi]
- Robustly Assigning Unstable ItemsAnanya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold, David S. Yuen. 402-420 [doi]
- Hardness Results and Approximation Schemes for Discrete Packing and Domination ProblemsRaghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit. 421-435 [doi]
- Approximability of Covering Cells with Line SegmentsPaz Carmi, Anil Maheshwari, Saeed Mehrabi 0001, Luís Fernando Schultz Xavier da Silveira. 436-448 [doi]
- Heuristics for the Score-Constrained Strip-Packing ProblemAsyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson. 449-462 [doi]
- An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(\log n) Query TimeHeng-Zhao Ma, Jianzhong Li. 465-479 [doi]
- Exact and Approximate Map-Reduce Algorithms for Convex HullAnirban Ghosh, Samuel Schwartz. 480-494 [doi]
- Transmitting Particles in a Polygonal Domain by RepulsionAmirhossein Mozafari, Thomas C. Shermer. 495-508 [doi]
- Does a Robot Path Have Clearance C?Ovidiu Daescu, Hemant Malik. 509-521 [doi]
- Star Routing: Between Vehicle Routing and Vertex CoverDiego Delle Donne, Guido Tagliavini. 522-536 [doi]
- Effect of Crowd Composition on the Wisdom of Artificial Crowds MetaheuristicChristopher J. Lowrance, Dominic M. Larkin, Sang M. Yim. 539-551 [doi]
- Analysis of Consensus Sorting via the Cycle MetricIvan Avramovic, Dana S. Richards. 552-565 [doi]
- On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller ProblemPierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik. 566-576 [doi]
- Rent Division Among GroupsMohammad Ghodsi, Mohamad Latifian, Arman Mohammadi, Sadra Moradian, Masoud Seddighin. 577-591 [doi]
- Sequence Sentential Decision DiagramsShuhei Denzumi. 592-606 [doi]
- Online Unit Covering in Euclidean SpaceAdrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth. 609-623 [doi]
- Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut ProblemMark Velednitsky, Dorit S. Hochbaum. 624-639 [doi]
- Characterizing Cycle-Complete Dissimilarities in Terms of Associated Indexed 2-HierarchiesKazutoshi Ando, Kazuya Shoji. 640-650 [doi]
- Making Multiple RNA Interaction PracticalSyed Ali Ahmed, Saman Farhat, Saad Mneimneh. 651-671 [doi]
- Max-Min Dispersion on a LineTetsuya Araki, Shin-Ichi Nakano. 672-678 [doi]
- Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product GraphsFranklin Kenter, Daphne Skipper. 681-695 [doi]
- On the Complexity of Resilience for Aggregation QueriesDongjing Miao, Zhipeng Cai. 696-706 [doi]
- Inefficiency of Equilibria in Doodle PollsBarbara M. Anthony, Christine Chung. 707-721 [doi]
- Network Cost-Sharing Games: Equilibrium Computation and Applications to Election ModelingRahul Swamy, Timothy Murray, Jugal Garg. 722-738 [doi]
- Weak-Barrier Coverage with Adaptive Sensor RotationCatalina Aranzazu Suescun, Mihaela Cardei. 739-754 [doi]