Abstract is missing.
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a TreeBinay K. Bhattacharya, Tsunehiko Kameda. 1-12 [doi]
- A Simple D 2-Sampling Based PTAS for k-Means and other Clustering ProblemsRagesh Jaiswal, Amit Kumar, Sandeep Sen. 13-24 [doi]
- Speed Scaling for Maximum LatenessEvripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois. 25-36 [doi]
- Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell. 37-48 [doi]
- Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar GraphsIvona Bezáková, Zachary Langley. 49-60 [doi]
- Online Knapsack Problem with Removal CostXin Han, Yasushi Kawase, Kazuhisa Makino. 61-73 [doi]
- An Improved Exact Algorithm for TSP in Degree-4 GraphsMingyu Xiao, Hiroshi Nagamochi. 74-85 [doi]
- Dynamic Programming for H-minor-free GraphsJuanjo Rué, Ignasi Sau, Dimitrios M. Thilikos. 86-97 [doi]
- Restricted Max-Min Fair Allocations with Inclusion-Free IntervalsMonaldo Mastrolilli, Georgios Stamoulis. 98-108 [doi]
- An Improved Algorithm for Packing T-Paths in Inner Eulerian NetworksMaxim A. Babenko, Kamil Salikhov, Stepan Artamonov. 109-120 [doi]
- Towards Optimal and Expressive Kernelization for d-Hitting SetRené van Bevern. 121-132 [doi]
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and CographsJean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger. 133-144 [doi]
- A Local Algorithm for Finding Dense Bipartite-Like SubgraphsPan Peng. 145-156 [doi]
- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar GraphsTon Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang. 157-168 [doi]
- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones PropertyBiing-Feng Wang, Chih-Hsuan Li. 169-180 [doi]
- Rainbow Colouring of Split and Threshold GraphsL. Sunil Chandran, Deepak Rajendraprasad. 181-192 [doi]
- Approximating the Rainbow - Better Lower and Upper BoundsAlexandru Popa. 193-203 [doi]
- Ramsey Numbers for Line Graphs and Perfect GraphsRémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei. 204-215 [doi]
- Geodesic Order TypesOswin Aichholzer, Matias Korman, Alexander Pilz, Birgit Vogtenhuber. 216-227 [doi]
- Computing Partitions of Rectilinear Polygons with Minimum Stabbing NumberStephane Durocher, Saeed Mehrabi 0001. 228-239 [doi]
- Monotone Paths in Planar Convex SubdivisionsAdrian Dumitrescu, Günter Rote, Csaba D. Tóth. 240-251 [doi]
- The Cost of Bounded CurvatureHyo-Sil Kim, Otfried Cheong. 252-263 [doi]
- Optimally Solving a Transportation Problem Using Voronoi DiagramsDarius Geiß, Rolf Klein, Rainer Penninger. 264-274 [doi]
- Unexplored Steiner Ratios in Geometric NetworksPaz Carmi, Lilach Chaitman-Yerushalmi. 275-286 [doi]
- Geometric RAC Simultaneous Drawings of GraphsEvmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis. 287-298 [doi]
- Simultaneous Embeddings with Vertices Mapping to Pre-specified PointsTaylor Gordon. 299-310 [doi]
- Multilevel Drawings of Clustered GraphsFabrizio Frati. 311-322 [doi]
- Outerplanar Graph Drawings with Few SlopesKolja B. Knauer, Piotr Micek, Bartosz Walczak. 323-334 [doi]
- Fáry's Theorem for 1-Planar GraphsSeok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon. 335-346 [doi]
- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its ApplicationKunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura. 347-359 [doi]
- External Memory Soft Heap, and Hard Heap, a Meldable Priority QueueAlka Bhushan, Sajith Gopalan. 360-371 [doi]
- Partially Specified Nearest Neighbor SearchTomas Hruz, Marcel Schöngens. 372-383 [doi]
- Multi-pattern Matching with Bidirectional IndexesSimon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki. 384-395 [doi]
- Succinct Representations of Binary Trees for Range Minimum QueriesPooya Davoodi, Rajeev Raman, Srinivasa Rao Satti. 396-407 [doi]
- Lower Bounds against Weakly Uniform CircuitsRuiwen Chen, Valentine Kabanets. 408-419 [doi]
- On TC0 Lower Bounds for the PermanentJeff Kinne. 420-432 [doi]
- Formula Complexity of Ternary MajoritiesKenya Ueno. 433-444 [doi]
- On the Kernelization Complexity of Problems on Graphs without Long Odd CyclesFahad Panolan, Ashutosh Rai. 445-457 [doi]
- The Complexity of Unary Subset SumNutan Limaye, Meena Mahajan, Karteek Sreenivasaiah. 458-469 [doi]
- On the Advice Complexity of TournamentsSebastian Ben Daniel. 470-481 [doi]
- A Remark on One-Wayness versus PseudorandomnessPeriklis A. Papakonstantinou, Guang Yang. 482-494 [doi]
- Integral Mixed Unit Interval GraphsVan Bang Le, Dieter Rautenbach. 495-506 [doi]
- Complementary Vertices and Adjacency Testing in PolytopesBenjamin A. Burton. 507-518 [doi]
- Online Coloring of Bipartite Graphs with and without AdviceMaria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller. 519-530 [doi]
- Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time AlgorithmsPawel Górecki, Oliver Eulenstein. 531-542 [doi]
- On the 2-Central Path ProblemYongding Zhu, Jinhui Xu. 543-555 [doi]
- Making Profit in a Prediction MarketJen-Hou Chou, Chi-Jen Lu, Mu-En Wu. 556-567 [doi]
- Computing Shapley Value in Supermodular Coalitional GamesDavid Liben-Nowell, Alexa Sharp, Tom Wexler, Kevin Woods. 568-579 [doi]
- Equilibria of GSP for Range AuctionH. F. Ting, Xiangzhong Xiang. 580-591 [doi]
- Stretch in Bottleneck GamesCostas Busch, Rajgopal Kannan. 592-603 [doi]