SEA B

31 papers

YearTitle / Authors
2015A Bulk-Parallel Priority Queue in External Memory with STXXL.
Timo Bingmann, Thomas Keh, Peter Sanders
2015A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions.
Thomas Bosman
2015Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment.
Carl Barton, Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis, Ahmad Retha, Fatima Vayani
2015An Empirical Study of Finding Approximate Equilibria in Bimatrix Games.
John Fearnley, Tobenna Peter Igwe, Rahul Savani
2015An Exact Algorithm for Diameters of Large Real Directed Graphs.
Takuya Akiba, Yoichi Iwata, Yuki Kawata
2015An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem.
Stefan Fafianie, Stefan Kratsch
2015Efficient Generation of Stable Planar Cages for Chemistry.
Dominique Barth, Olivier David, Franck Quessette, Vincent Reinhard, Yann Strozecki, Sandrine Vial
2015Efficient and Practical Tree Preconditioning for Solving Laplacian Systems.
Luca Castelli Aleardi, Alexandre Nolin, Maks Ovsjanikov
2015Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings
Evripidis Bampis
2015Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps.
Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen
2015Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments.
Christian Komusiewicz, Manuel Sorge, Kolja Stahl
2015Graph Partitioning for Independent Sets.
Sebastian Lamm, Peter Sanders, Christian Schulz
2015Greedily Improving Our Own Centrality in A Network.
Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2015Huffman Codes versus Augmented Non-Prefix-Free Codes.
Boran Adas, Ersin Bayraktar, M. Oguzhan Külekci
2015Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver.
Daniel Hoske, Dimitar Lukarski, Henning Meyerhenke, Michael Wegner
2015On Balanced Separators in Road Networks.
Aaron Schild, Christian Sommer
2015On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space.
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
2015On the Generation of Cutting Planes which Maximize the Bound Improvement.
Stefano Coniglio, Martin Tieves
2015On the Quadratic Shortest Path Problem.
Borzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim
2015Online Knapsack of Unknown Capacity: - Energy Optimization for Smartphone Communications.
Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti
2015Parallel Construction of Succinct Trees.
Leo Ferres, José Fuentes-Sepúlveda, Meng He, Norbert Zeh
2015Public Transit Labeling.
Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck
2015Reoptimization Techniques for MIP Solvers.
Gerald Gamrath, Benjamin Hiller, Jakob Witzig
2015SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks.
Alexandros Efentakis, Dieter Pfoser, Yannis Vassiliou
2015Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors.
Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Emmanouil Zampetakis, Georgios Zois
2015Separation of Generic Cutting Planes in Branch-and-Price Using a Basis.
Marco E. Lübbecke, Jonas T. Witt
2015Solving k-means on High-Dimensional Big Data.
Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
2015Station Assignment with Reallocation.
Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong
2015Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers.
Andrew Orso, Jon Lee, Siqian Shen
2015The Effect of Almost-Empty Faces on Planar Kandinsky Drawings.
Michael A. Bekos, Michael Kaufmann, Robert Krug, Martin Siebenhaller
2015Tree Compression with Top Trees Revisited.
Lorenz Hübschle-Schneider, Rajeev Raman