Abstract is missing.
- Approximability of Symmetric Bimatrix Games and Related ExperimentsSpyros C. Kontogiannis, Paul G. Spirakis. 1-20 [doi]
- Metaheuristic Optimization: Algorithm Analysis and Open ProblemsXin-She Yang. 21-32 [doi]
- Convexity and Optimization of Condense Discrete FunctionsEmre Tokgöz, Sara Nourazari, Hillel Kumin. 33-42 [doi]
- Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness ResultsAndré Berger, Heiko Röglin, Ruben van der Zwaan. 43-53 [doi]
- Hierarchical Delaunay Triangulation for MeshingShu Ye, Karen Daniels. 54-64 [doi]
- A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman ProblemWeiqi Li. 65-75 [doi]
- Online Dictionary Matching with Variable-Length GapsTuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen. 76-87 [doi]
- Dynamic Arc-Flags in Road NetworksGianlorenzo D Angelo, Daniele Frigioni, Camillo Vitale. 88-99 [doi]
- Efficient Routing in Road Networks with Turn CostsRobert Geisberger, Christian Vetter. 100-111 [doi]
- On Minimum Changeover Cost ArborescencesGiulia Galbiati, Stefano Gualandi, Francesco Maffioli. 112-123 [doi]
- Localizing Program Logical Errors Using Extraction of Knowledge from InvariantsMojtaba Daryabari, Behrouz Minaei-Bidgoli, Hamid Parvin. 124-135 [doi]
- Compressed String DictionariesNieves R. Brisaboa, Rodrigo Cánovas, Francisco Claude, Miguel A. Martínez-Prieto, Gonzalo Navarro. 136-147 [doi]
- Combinatorial Optimization for Weighing Matrices with the Ordering Messy Genetic AlgorithmChristos Koukouvinos, Dimitris E. Simos. 148-156 [doi]
- Improved Automated Reaction MappingTina Kouri, Dinesh Mehta. 157-168 [doi]
- An Experimental Evaluation of Incremental and Hierarchical ::::k::::-Median AlgorithmsChandrashekhar Nagarajan, David P. Williamson. 169-180 [doi]
- Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling ProblemMarc Goerigk, Anita Schöbel. 181-192 [doi]
- Practical Compressed Document RetrievalGonzalo Navarro, Simon J. Puglisi, Daniel Valenzuela. 193-205 [doi]
- Influence of Pruning Devices on the Solution of Molecular Distance Geometry ProblemsAntonio Mucherino, Carlile Lavor, Therese E. Malliavin, Leo Liberti, Michael Nilges, Nelson Maculan. 206-217 [doi]
- An Experimental Evaluation of Treewidth at Most Four ReductionsAlexander Hein, Arie M. C. A. Koster. 218-229 [doi]
- A Hub-Based Labeling Algorithm for Shortest Paths in Road NetworksIttai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck. 230-241 [doi]
- Hierarchy Decomposition for Faster User Equilibria on Road NetworksDennis Luxen, Peter Sanders. 242-253 [doi]
- Matching in Bipartite Graph Streams in a Small Number of PassesLasse Kliemann. 254-266 [doi]
- Beyond Unit Propagation in SAT SolvingMichael Kaufmann, Stephan Kottler. 267-279 [doi]
- Designing Difficult Office Space Allocation Problem Instances with Mathematical ProgrammingÖzgür Ülker, Dario Landa Silva. 280-291 [doi]
- Speed Dating - An Algorithmic Case Study Involving Matching and SchedulingBastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner. 292-303 [doi]
- Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn CostsIgor R. de Assis, Cid C. de Souza. 304-314 [doi]
- A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing ProblemRafael Martinelli, Diego Pecin, Marcus Poggi, Humberto Longo. 315-326 [doi]
- A Biased Random Key Genetic Algorithm Approach for Unit Commitment ProblemLuís A. C. Roque, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes. 327-339 [doi]
- A Column Generation Approach to Scheduling of Periodic TasksErnst Althaus, Rouven Naujoks, Eike Thaden. 340-351 [doi]
- Fuzzy Clustering the Backward Dynamic Slices of Programs to Identify the Origins of FailureSaeed Parsa, Farzaneh Zareie, Mojtaba Vahidi-Asl. 352-363 [doi]
- Listing All Maximal Cliques in Large Sparse Real-World GraphsDavid Eppstein, Darren Strash. 364-375 [doi]
- Customizable Route PlanningDaniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck. 376-387 [doi]
- Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless NetworksDennis Schieferdecker, Markus Völker, Dorothea Wagner. 388-399 [doi]
- Explanations for the Cumulative Constraint: An Experimental StudyStefan Heinz, Jens Schulz. 400-409 [doi]
- GRASP with Path-Relinking for Data Clustering: A Case Study for Biological DataRafael M. D. Frinhani, Ricardo M. A. Silva, Geraldo R. Mateus, Paola Festa, Mauricio G. C. Resende. 410-420 [doi]
- An Iterative Refinement Algorithm for the Minimum Branch Vertices ProblemDiego M. Silva, Ricardo M. A. Silva, Geraldo R. Mateus, José Fernando Gonçalves, Mauricio G. C. Resende, Paola Festa. 421-433 [doi]
- Generating Time Dependencies in Road NetworksSascha Meinert, Dorothea Wagner. 434-446 [doi]
- An Empirical Evaluation of Extendible ArraysStelios Joannou, Rajeev Raman. 447-458 [doi]