Abstract is missing.
- Algorithm Engineering for Route Planning - An Update -Dorothea Wagner. 1-5 [doi]
- Semidefinite Programming and Approximation Algorithms: A SurveySanjeev Arora. 6-9 [doi]
- The School Bus Problem on TreesAdrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità. 10-19 [doi]
- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-SubgraphM. Reza Khani, Mohammad R. Salavatipour. 20-29 [doi]
- Improved Approximation Algorithms for Routing Shop SchedulingWei Yu, Guochuan Zhang. 30-39 [doi]
- Contraction-Based Steiner Tree Approximations in PracticeMarkus Chimani, Matthias Woste. 40-49 [doi]
- Covering and Piercing Disks with Two CentersHee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron. 50-59 [doi]
- Generating Realistic Roofs over a Rectilinear PolygonHee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron. 60-69 [doi]
- Computing the Visibility Polygon Using Few VariablesLuis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira. 70-79 [doi]
- Minimizing Interference in Ad-Hoc Networks with Bounded Communication RadiusMatias Korman. 80-89 [doi]
- Hamiltonian Paths in the Square of a TreeJakub Radoszewski, Wojciech Rytter. 90-99 [doi]
- Dominating Induced Matchings for P 7-free Graphs in Linear TimeAndreas Brandstädt, Raffaele Mosca. 100-109 [doi]
- Finding Contractions and Induced Minors in Chordal Graphs via Disjoint PathsRémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma. 110-119 [doi]
- Recognizing Polar Planar Graphs Using New Results for MonopolarityVan Bang Le, Ragnar Nevries. 120-129 [doi]
- Robustness of Minimum Cost ArborescencesNaoyuki Kamiyama. 130-139 [doi]
- Path Queries in Weighted TreesMeng He, J. Ian Munro, Gelin Zhou. 140-149 [doi]
- Dynamic Range Majority Data StructuresAmr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson. 150-159 [doi]
- Dynamic Range Selection in Linear SpaceMeng He, J. Ian Munro, Patrick K. Nicholson. 160-169 [doi]
- A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query TimeYakov Nekrich. 170-179 [doi]
- Encoding 2D Range Maximum QueriesMordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao 0001. 180-189 [doi]
- Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary DimensionsTobias Friedrich, Thomas Sauerwald, Alexandre Stauffer. 190-199 [doi]
- Broadcasting in Heterogeneous Tree Networks with UncertaintyCheng-Hsiao Tsou, Gen-Huey Chen, Ching-Chi Lin. 200-209 [doi]
- Optimal File Distribution in Peer-to-Peer NetworksKai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller. 210-219 [doi]
- Animal TestingAdrian Dumitrescu, Evan Hilscher. 220-229 [doi]
- Cutting Out Polygons with a Circular SawAdrian Dumitrescu, Masud Hasan. 230-239 [doi]
- Fast Fréchet QueriesMark de Berg, Atlas F. Cook IV, Joachim Gudmundsson. 240-249 [doi]
- Angle-Restricted Steiner Arborescences for Flow Map LayoutKevin Buchin, Bettina Speckmann, Kevin Verbeek. 250-259 [doi]
- Treemaps with Bounded Aspect RatioMark de Berg, Bettina Speckmann, Vincent van der Weele. 260-270 [doi]
- Simultaneous Embedding of Embedded Planar GraphsPatrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. 271-280 [doi]
- Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph RepresentationsMuhammad Jawaherul Alam, Therese C. Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov. 281-291 [doi]
- Fully Retroactive Approximate Range and Nearest Neighbor SearchingMichael T. Goodrich, Joseph A. Simons. 292-301 [doi]
- Compact Representation of PosetsArash Farzan, Johannes Fischer. 302-311 [doi]
- Explicit Array-Based Compact Data Structures for TriangulationsLuca Castelli Aleardi, Olivier Devillers. 312-322 [doi]
- Space-Efficient Data-Analysis Queries on GridsGonzalo Navarro, Luís M. S. Russo. 323-332 [doi]
- A Polynomial Kernel for Feedback Arc Set on Bipartite TournamentsPranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh. 333-343 [doi]
- Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite TournamentsSheng-Ying Hsiao. 344-353 [doi]
- Parameterized Algorithms for Inclusion of Linear MatchingsSylvain Guillemot. 354-363 [doi]
- Computational Study on Bidimensionality Theory Based Algorithm for Longest Path ProblemChunhao Wang, Qian-Ping Gu. 364-373 [doi]
- Sorting, Searching, and Simulation in the MapReduce FrameworkMichael T. Goodrich, Nodari Sitchinava, Qin Zhang. 374-383 [doi]
- External-Memory MultimapsElaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler. 384-394 [doi]
- External Memory Orthogonal Range Reporting with Fast UpdatesYakov Nekrich. 395-404 [doi]
- Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract)Jörg Lässig, Dirk Sudholt. 405-414 [doi]
- Verifying Nash Equilibria in PageRank Games on Undirected Web GraphsDavid Avis, Kazuo Iwama, Daichi Paku. 415-424 [doi]
- Improved Collaborative FilteringAviv Nisgav, Boaz Patt-Shamir. 425-434 [doi]
- Asymptotic Modularity of Some Graph ClassesFabien de Montgolfier, Mauricio Soto, Laurent Viennot. 435-444 [doi]
- Program Size and Temperature in Self-AssemblyHo-Lin Chen, David Doty, Shinnosuke Seki. 445-453 [doi]
- Optimization, Randomized Approximability, and Boolean Constraint Satisfaction ProblemsTomoyuki Yamakami. 454-463 [doi]
- Lower Bounds for Myopic DPLL Algorithms with a Cut HeuristicDmitry Itsykson, Dmitry Sokolov. 464-473 [doi]
- Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional PlaneRyuta Ando, Tomomi Matsui. 474-483 [doi]
- Packing-Based Approximation Algorithm for the k-Set Cover ProblemMartin Fürer, Huiwen Yu. 484-493 [doi]
- Capacitated Domination: Constant Factor Approximations for Planar GraphsMong-Jen Kao, D. T. Lee. 494-503 [doi]
- On Power-Law Distributed Balls in Bins and Its Applications to View Size EstimationIoannis Atsonios, Olivier Beaumont, Nicolas Hanusse, Yusik Kim. 504-513 [doi]
- A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) SpaceMasatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita. 514-523 [doi]
- A Nearly-Quadratic Gap between Adaptive and Non-adaptive Property Testers - (Extended Abstract)Jeremy Hurwitz. 524-533 [doi]
- Online Linear Optimization over PermutationsShota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda. 534-543 [doi]
- On the Best Possible Competitive Ratio for Multislope Ski RentalHiroshi Fujiwara, Takuma Kitano, Toshihiro Fujito. 544-553 [doi]
- Input-Thrifty Extrema TestingKuan-Chieh Robert Tseng, David G. Kirkpatrick. 554-563 [doi]
- Edit Distance to Monotonicity in Sliding WindowsHo-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang. 564-573 [doi]
- Folding Equilateral Plane GraphsZachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz. 574-583 [doi]
- Efficient Algorithms for the Weighted k-Center Problem on a Real LineDanny Z. Chen, Haitao Wang. 584-593 [doi]
- Outlier Respecting Points ApproximationDanny Z. Chen, Haitao Wang. 594-603 [doi]
- An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility AnglesDanny Z. Chen, Haitao Wang. 604-613 [doi]
- The Parameterized Complexity of Local Search for TSP, More RefinedJiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý. 614-623 [doi]
- On the Parameterized Complexity of Consensus ClusteringMartin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller. 624-633 [doi]
- Two Fixed-Parameter Algorithms for the Cocoloring ProblemVictor Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva. 634-642 [doi]
- Parameterized Complexity of the Firefighter ProblemCristina Bazgan, Morgan Chopin, Michael R. Fellows. 643-652 [doi]
- Faster Approximate Pattern Matching in Compressed Repetitive TextsTravis Gagie, Pawel Gawrychowski, Simon J. Puglisi. 653-662 [doi]
- A New Algorithm for the Characteristic String Problem under Loose Similarity CriteriaYoshifumi Sakai. 663-672 [doi]
- Succinct Indexes for Circular PatternsWing-Kai Hon, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan. 673-682 [doi]
- Range LCPAmihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat. 683-692 [doi]
- Computing Knapsack Solutions with Cardinality RobustnessNaonori Kakimura, Kazuhisa Makino, Kento Seimi. 693-702 [doi]
- Max-Throughput for (Conservative) k-of-n TestingLisa Hellerstein, Özgür Özkan, Linda Sellie. 703-713 [doi]
- Closest Periodic Vectors in L p SpacesAmihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein. 714-723 [doi]
- Maximum Weight Digital Regions Decomposable into Digital Star-Shaped RegionsMatt Gibson, Dongfeng Han, Milan Sonka, Xiaodong Wu. 724-733 [doi]
- Finding Maximum Sum Segments in Sequences with UncertaintyHung-I Yu, Tien-Ching Lin, D. T. Lee. 734-743 [doi]
- Algorithms for Building Consensus MUL-treesYun Cui, Jesper Jansson, Wing-Kin Sung. 744-753 [doi]
- Adaptive Phenotype Testing for AND/OR ItemsFrancis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu. 754-763 [doi]
- An Index Structure for Spaced Seed SearchTaku Onodera, Tetsuo Shibuya. 764-772 [doi]