Abstract is missing.
- Future Directions in Computer Science ResearchJohn E. Hopcroft. 1 [doi]
- Combinatorial Geometry and Approximation AlgorithmsTimothy M. Chan. 2 [doi]
- Origami Robots and Star Trek ReplicatorsErik D. Demaine. 3 [doi]
- Strong Conflict-Free Coloring for IntervalsPanagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky. 4-13 [doi]
- Closing Complexity Gaps for Coloring Problems on H-Free GraphsPetr A. Golovach, Daniël Paulusma, Jian Song. 14-23 [doi]
- Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common NeighborsChing-Chen Kuo, Hsueh-I Lu. 24-33 [doi]
- Reconfiguration of List L(2, 1)-Labelings in a GraphTakehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou. 34-43 [doi]
- An 8/3 Lower Bound for Online Dynamic Bin PackingPrudence W. H. Wong, Fencol C. C. Yung, Mihai Burcea. 44-53 [doi]
- Computing k-center over Streaming Data for Small kHee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son. 54-63 [doi]
- Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data StreamsSumit Ganguly. 64-74 [doi]
- Competitive Design and Analysis for Machine-Minimizing Job Scheduling ProblemMong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner. 75-84 [doi]
- A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect MatchingsNanao Kita. 85-94 [doi]
- Fast and Simple Fully-Dynamic Cut Tree ConstructionTanja Hartmann, Dorothea Wagner. 95-105 [doi]
- Green Scheduling, Flows and MatchingsEvripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli. 106-115 [doi]
- Popular and Clan-Popular b-MatchingsKatarzyna E. Paluch. 116-125 [doi]
- Kernelization and Parameterized Complexity of Star Editing and Union EditingJiong Guo, Yash Raj Shrestha. 126-135 [doi]
- On the Advice Complexity of Buffer ManagementReza Dorrigiv, Meng He, Norbert Zeh. 136-145 [doi]
- On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded DegreeTatsuya Akutsu, Takeyuki Tamura. 146-155 [doi]
- Speeding Up Shortest Path AlgorithmsAndrej Brodnik, Marko Grgurovic. 156-165 [doi]
- How Many Potatoes Are in a Mesh?Marc J. van Kreveld, Maarten Löffler, János Pach. 166-176 [doi]
- On Higher Order Voronoi Diagrams of Line SegmentsEvanthia Papadopoulou, Maksym Zavershynskyi. 177-186 [doi]
- On the Farthest Line-Segment Voronoi DiagramEvanthia Papadopoulou, Sandeep K. Dey. 187-196 [doi]
- Computing the Longest Common Subsequence of Two Run-Length Encoded StringsYoshifumi Sakai. 197-206 [doi]
- Efficient Counting of Square Substrings in a TreeTomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 207-216 [doi]
- A General Method for Improving Insertion-Based Adaptive SortingRiku Saikkonen, Eljas Soisalon-Soininen. 217-226 [doi]
- Counting Partitions of GraphsPavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi. 227-236 [doi]
- Constant Unary Constraints and Symmetric Real-Weighted Counting CSPsTomoyuki Yamakami. 237-246 [doi]
- Interval Scheduling and Colorful Independent SetsRené van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller. 247-256 [doi]
- More on a Problem of ZarankiewiczChinmoy Dutta, Jaikumar Radhakrishnan. 257-266 [doi]
- Efficient Dominating and Edge Dominating Sets for Graphs and HypergraphsAndreas Brandstädt, Arne Leitert, Dieter Rautenbach. 267-277 [doi]
- On the Hyperbolicity of Small-World and Tree-Like Random GraphsWei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney. 278-288 [doi]
- On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating SetsMamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine. 289-298 [doi]
- Induced ImmersionsRémy Belmonte, Pim van 't Hof, Marcin Kaminski. 299-308 [doi]
- Rectilinear Covering for Imprecise Input Points - (Extended Abstract)Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa. 309-318 [doi]
- Robust Nonparametric Data Approximation of Point Sets via Data ReductionStephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala. 319-331 [doi]
- Optimal Point Movement for Covering Circular RegionsDanny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu. 332-341 [doi]
- Solving Circular Integral Block Decomposition in Polynomial TimeYunlong Liu, Xiaodong Wu. 342-351 [doi]
- The Canadian Traveller Problem RevisitedYamming Huang, Chung-Shou Liao. 352-361 [doi]
- Vehicle Scheduling on a Graph RevisitedWei Yu, Mordecai J. Golin, Guochuan Zhang. 362-371 [doi]
- A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit DisksTakehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno. 372-381 [doi]
- The Minimum Vulnerability ProblemSepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh. 382-391 [doi]
- A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic GraphsNorie Fu. 392-401 [doi]
- Cubic Augmentation of Planar GraphsTanja Hartmann, Jonathan Rollin, Ignaz Rutter. 402-412 [doi]
- On the Number of Upward Planar Orientations of Maximal Planar GraphsFabrizio Frati, Joachim Gudmundsson, Emo Welzl. 413-422 [doi]
- Universal Point Subsets for Planar GraphsPatrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto. 423-432 [doi]
- Abstract Flows over Time: A First Step towards Solving Dynamic Packing ProblemsJan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis. 433-443 [doi]
- Extending Partial Representations of Subclasses of Chordal GraphsPavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh. 444-454 [doi]
- Isomorphism for Graphs of Bounded Connected-Path-Distance-WidthYota Otachi. 455-464 [doi]
- Algorithmic Aspects of the Intersection and Overlap Numbers of a GraphDanny Hermelin, Romeo Rizzi, Stéphane Vialette. 465-474 [doi]
- Linear Layouts in Submodular SystemsHiroshi Nagamochi. 475-484 [doi]
- Segmental Mapping and Distance for Rooted Labeled Ordered TreesTomohiro Kan, Shoichi Higuchi, Kouichi Hirata. 485-494 [doi]
- Detecting Induced Minors in AT-Free GraphsPetr A. Golovach, Dieter Kratsch, Daniël Paulusma. 495-505 [doi]
- Degree-Constrained Orientations of Embedded GraphsYann Disser, Jannik Matuschke. 506-516 [doi]
- Interval Graph Representation with Given Interval and Intersection LengthsJohannes Köbler, Sebastian Kuhnert, Osamu Watanabe. 517-526 [doi]
- Finger Search in the Implicit ModelGerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen. 527-536 [doi]
- A Framework for Succinct Labeled Ordinal Trees over Large AlphabetsMeng He, J. Ian Munro, Gelin Zhou. 537-547 [doi]
- A Space-Efficient Framework for Dynamic Point LocationMeng He, Patrick K. Nicholson, Norbert Zeh. 548-557 [doi]
- Selection in the Presence of Memory Faults, with Applications to In-place Resilient SortingTsvi Kopelowitz, Nimrod Talmon. 558-567 [doi]
- An Improved Algorithm for Static 3D Dominance Reporting in the Pointer MachineChristos Makris, Konstantinos Tsakalidis. 568-577 [doi]
- The Multi-Service Center ProblemHung-I Yu, Cheng-Chung Li. 578-587 [doi]
- Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex WeightsBinay K. Bhattacharya, Tsunehiko Kameda, Zhao Song. 588-597 [doi]
- Fence Patrolling by Mobile Agents with Distinct SpeedsAkitoshi Kawamura, Yusuke Kobayashi. 598-608 [doi]
- Weak Visibility Queries of Line Segments in Simple PolygonsDanny Z. Chen, Haitao Wang. 609-618 [doi]
- Beyond Homothetic Polygons: Recognition and Maximum CliqueKonstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski. 619-628 [doi]
- Area Bounds of Rectilinear Polygons Realized by Angle SequencesSang Won Bae, Yoshio Okamoto, Chan-Su Shin. 629-638 [doi]
- A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix MultiplicationFrançois Le Gall. 639-648 [doi]
- On Almost Disjunct Matrices for Group TestingArya Mazumdar. 649-658 [doi]
- Parameterized Clique on Scale-Free NetworksTobias Friedrich, Anton Krohmer. 659-668 [doi]
- Multi-unit Auctions with Budgets and Non-uniform ValuationsH. F. Ting, Xiangzhong Xiang. 669-678 [doi]
- Efficient Computation of Power Indices for Weighted Majority GamesTakeaki Uno. 679-689 [doi]
- Revenue Maximization in a Bayesian Double Auction MarketXiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang. 690-699 [doi]