default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th SEA 2011: Kolimpari, Chania, Crete, Greece
- Panos M. Pardalos, Steffen Rebennack
:
Experimental Algorithms - 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings. Lecture Notes in Computer Science 6630, Springer 2011, ISBN 978-3-642-20661-0
Invited Papers
- Spyros C. Kontogiannis, Paul G. Spirakis:
Approximability of Symmetric Bimatrix Games and Related Experiments. 1-20 - Xin-She Yang:
Metaheuristic Optimization: Algorithm Analysis and Open Problems. 21-32
Contributed Papers
- Emre Tokgöz, Sara Nourazari, Hillel Kumin:
Convexity and Optimization of Condense Discrete Functions. 33-42 - André Berger, Heiko Röglin, Ruben van der Zwaan:
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. 43-53 - Shu Ye, Karen Daniels:
Hierarchical Delaunay Triangulation for Meshing. 54-64 - Weiqi Li:
A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem. 65-75 - Tuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen:
Online Dictionary Matching with Variable-Length Gaps. 76-87 - Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale:
Dynamic Arc-Flags in Road Networks. 88-99 - Robert Geisberger, Christian Vetter:
Efficient Routing in Road Networks with Turn Costs. 100-111 - Giulia Galbiati, Stefano Gualandi, Francesco Maffioli:
On Minimum Changeover Cost Arborescences. 112-123 - Mojtaba Daryabari, Behrouz Minaei-Bidgoli, Hamid Parvin:
Localizing Program Logical Errors Using Extraction of Knowledge from Invariants. 124-135 - Nieves R. Brisaboa, Rodrigo Cánovas, Francisco Claude, Miguel A. Martínez-Prieto, Gonzalo Navarro:
Compressed String Dictionaries. 136-147 - Christos Koukouvinos, Dimitris E. Simos:
Combinatorial Optimization for Weighing Matrices with the Ordering Messy Genetic Algorithm. 148-156 - Tina M. Kouri, Dinesh P. Mehta:
Improved Automated Reaction Mapping. 157-168 - Chandrashekhar Nagarajan, David P. Williamson:
An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms. 169-180 - Marc Goerigk, Anita Schöbel:
Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem. 181-192 - Gonzalo Navarro, Simon J. Puglisi, Daniel Valenzuela:
Practical Compressed Document Retrieval. 193-205 - Antonio Mucherino, Carlile Lavor, Therese E. Malliavin, Leo Liberti, Michael Nilges, Nelson Maculan:
Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems. 206-217 - Alexander Hein, Arie M. C. A. Koster:
An Experimental Evaluation of Treewidth at Most Four Reductions. 218-229 - Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. 230-241 - Dennis Luxen, Peter Sanders:
Hierarchy Decomposition for Faster User Equilibria on Road Networks. 242-253 - Lasse Kliemann:
Matching in Bipartite Graph Streams in a Small Number of Passes. 254-266 - Michael Kaufmann, Stephan Kottler:
Beyond Unit Propagation in SAT Solving. 267-279 - Özgür Ülker, Dario Landa-Silva:
Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming. 280-291 - Bastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner:
Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. 292-303 - Igor R. de Assis, Cid C. de Souza:
Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs. 304-314 - Rafael Martinelli, Diego Pecin, Marcus Poggi, Humberto J. Longo:
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem. 315-326 - Luís A. C. Roque, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem. 327-339 - Ernst Althaus, Rouven Naujoks, Eike Thaden:
A Column Generation Approach to Scheduling of Periodic Tasks. 340-351 - Saeed Parsa, Farzaneh Zareie, Mojtaba Vahidi-Asl:
Fuzzy Clustering the Backward Dynamic Slices of Programs to Identify the Origins of Failure. 352-363 - David Eppstein, Darren Strash:
Listing All Maximal Cliques in Large Sparse Real-World Graphs. 364-375 - Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck:
Customizable Route Planning. 376-387 - Dennis Schieferdecker, Markus Völker, Dorothea Wagner:
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks. 388-399 - Stefan Heinz, Jens Schulz:
Explanations for the Cumulative Constraint: An Experimental Study. 400-409 - Rafael M. D. Frinhani, Ricardo M. A. Silva, Geraldo R. Mateus, Paola Festa, Mauricio G. C. Resende:
GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data. 410-420 - Diego M. Silva, Ricardo M. A. Silva, Geraldo R. Mateus, José Fernando Gonçalves, Mauricio G. C. Resende, Paola Festa:
An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem. 421-433 - Sascha Meinert, Dorothea Wagner:
Generating Time Dependencies in Road Networks. 434-446 - Stelios Joannou, Rajeev Raman:
An Empirical Evaluation of Extendible Arrays. 447-458
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
