default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th SEA 2015: Paris, France
- Evripidis Bampis
:
Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings. Lecture Notes in Computer Science 9125, Springer 2015, ISBN 978-3-319-20085-9
Data structures
- Leo Ferres, José Fuentes-Sepúlveda, Meng He, Norbert Zeh:
Parallel Construction of Succinct Trees. 3-14 - Lorenz Hübschle-Schneider, Rajeev Raman:
Tree Compression with Top Trees Revisited. 15-27 - Timo Bingmann, Thomas Keh, Peter Sanders:
A Bulk-Parallel Priority Queue in External Memory with STXXL. 28-40
Graph Problems I
- Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Greedily Improving Our Own Centrality in A Network. 43-55 - Takuya Akiba, Yoichi Iwata, Yuki Kawata:
An Exact Algorithm for Diameters of Large Real Directed Graphs. 56-67 - Sebastian Lamm, Peter Sanders, Christian Schulz:
Graph Partitioning for Independent Sets. 68-81 - Christian Komusiewicz, Manuel Sorge, Kolja Stahl:
Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. 82-93
Combinatorial Optimization I
- Stefano Coniglio, Martin Tieves:
On the Generation of Cutting Planes which Maximize the Bound Improvement. 97-109 - Marco E. Lübbecke, Jonas T. Witt:
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis. 110-121 - Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske:
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. 122-133
Scheduling and Allocation
- Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Emmanouil Zampetakis, Georgios Zois:
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors. 137-150 - Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong:
Station Assignment with Reallocation. 151-164 - Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti:
Online Knapsack of Unknown Capacity: - Energy Optimization for Smartphone Communications. 165-177
Combinatorial Optimization II
- Gerald Gamrath, Benjamin Hiller, Jakob Witzig:
Reoptimization Techniques for MIP Solvers. 181-192 - Andrew Orso, Jon Lee, Siqian Shen:
Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers. 193-204 - Daniel Hoske, Dimitar Lukarski, Henning Meyerhenke, Michael Wegner:
Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver. 205-218 - Luca Castelli Aleardi, Alexandre Nolin, Maks Ovsjanikov:
Efficient and Practical Tree Preconditioning for Solving Laplacian Systems. 219-231
Other Applications I
- Dominique Barth, Olivier David, Franck Quessette, Vincent Reinhard, Yann Strozecki, Sandrine Vial:
Efficient Generation of Stable Planar Cages for Chemistry. 235-246 - Carl Barton, Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment. 247-258 - Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Solving k-means on High-Dimensional Big Data. 259-270
Transportation Networks
- Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. 273-285 - Aaron Schild, Christian Sommer:
On Balanced Separators in Road Networks. 286-297 - Alexandros Efentakis, Dieter Pfoser, Yannis Vassiliou:
SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks. 298-311
Other Applications II
- Boran Adas, Ersin Bayraktar, M. Oguzhan Külekci:
Huffman Codes versus Augmented Non-Prefix-Free Codes. 315-326 - Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen:
Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps. 327-338 - John Fearnley, Tobenna Peter Igwe, Rahul Savani:
An Empirical Study of Finding Approximate Equilibria in Bimatrix Games. 339-351 - Michael A. Bekos, Michael Kaufmann, Robert Krug, Martin Siebenhaller:
The Effect of Almost-Empty Faces on Planar Kandinsky Drawings. 352-364
Graph Problems II
- Stefan Fafianie, Stefan Kratsch:
An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem. 367-378 - Borzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim:
On the Quadratic Shortest Path Problem. 379-390 - Thomas Bosman:
A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions. 391-402
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-11-08 20:18 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:
