default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th SEA 2012: Bordeaux, France
- Ralf Klasing:
Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings. Lecture Notes in Computer Science 7276, Springer 2012, ISBN 978-3-642-30849-9
Invited Papers
- Marco E. Lübbecke
:
Automatic Decomposition and Branch-and-Price - A Status Report. 1-8 - Barbara Kempkes, Friedhelm Meyer auf der Heide:
Continuous Local Strategies for Robotic Formation Problems. 9-17 - Vitaly Osipov, Peter Sanders, Christian Schulz:
Engineering Graph Partitioning Algorithms. 18-26
Contributed Papers
- Benjamin Albrecht, Volker Heun:
Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns. 27-38 - Eric Angel, Romain Campigotto, Christian Laforest:
Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs. 39-50 - Annabell Berger, Matthias Müller-Hannemann:
How to Attack the NP-Complete Dag Realization Problem in Practice. 51-62 - Christina Büsing, Fabio D'Andreagiovanni:
New Results about Multi-band Uncertainty in Robust Optimization. 63-74 - Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine:
Compact Relaxations for Polynomial Programming Problems. 75-86 - Alberto Costa, Leo Liberti:
Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal. 87-98 - Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
On Computing the Diameter of Real-World Directed (Weighted) Graphs. 99-110 - Annalisa D'Andrea, Guido Proietti:
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications. 111-122 - Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Loop-Free Shortest Paths Routing Algorithm. 123-134 - Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale:
Fully Dynamic Maintenance of Arc-Flags in Road Networks. 135-147 - Martin Dietzfelbinger, Hendrik Peilke, Michael Rink:
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. 148-159 - Amr Elmasry, Jyrki Katajainen, Max Stenmark:
Branch Mispredictions Don't Affect Mergesort. 160-171 - Simone Faro, Thierry Lecroq:
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. 172-183 - Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu:
Algorithms for Subnetwork Mining in Heterogeneous Networks. 184-194 - Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi, Federico Santaroni:
Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs. 195-207 - Giorgos Georgiadis, Marina Papatriantafilou:
Adaptive Distributed b-Matching in Overlays with Preferences. 208-223 - Stelios Joannou, Rajeev Raman:
Dynamizing Succinct Tree Representations. 224-235 - Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo:
A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network. 236-247 - Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh:
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. 248-259 - Dennis Luxen, Dennis Schieferdecker:
Candidate Sets for Alternative Routes in Road Networks. 260-270 - David F. Manlove, Gregg O'Malley:
Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation. 271-282 - Farnaz Moradi, Tomas Olovsson, Philippas Tsigas:
An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic. 283-294 - Gonzalo Navarro, Eliana Providel:
Fast, Small, Simple Rank/Select on Bitmaps. 295-306 - Gonzalo Navarro, Daniel Valenzuela:
Space-Efficient Top-k Document Retrieval. 307-319 - Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert:
Engineering Efficient Paging Algorithms. 320-331 - Pierre Pesneau, Ruslan Sadykov, François Vanderbeck:
Feasibility Pump Heuristics for Column Generation Approaches. 332-343 - Michael N. Rice, Vassilis J. Tsotras:
Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems. 344-355 - Jörg Rothe, Lena Schend:
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach. 356-368 - Ilya Safro, Peter Sanders, Christian Schulz:
Advanced Coarsening Schemes for Graph Partitioning. 369-380 - Rodrigo F. Toso, Casimir A. Kulikowski, Ilya B. Muchnik:
A Heuristic for Non-convex Variance-Based Clustering Criteria. 381-392 - Jose L. Walteros, Panos M. Pardalos:
A Decomposition Approach for Solving Critical Clique Detection Problems. 393-404
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 2025-11-26 07:51 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:
