default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th SEA 2013: Rome, Italy
- Vincenzo Bonifaci
, Camil Demetrescu, Alberto Marchetti-Spaccamela:
Experimental Algorithms, 12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013. Proceedings. Lecture Notes in Computer Science 7933, Springer 2013, ISBN 978-3-642-38526-1
Invited Papers
- Martin Skutella:
Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines. 1-3 - Andrew V. Goldberg:
The Hub Labeling Algorithm. 4 - Roberto Grossi, Giuseppe Ottaviano:
Design of Practical Succinct Data Structures for Large Data Collections. 5-17
Transportation Networks and Graph Algorithms I
- Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Label Compression. 18-29 - Daniel Delling, Renato F. Werneck:
Faster Customization of Road Networks. 30-42 - Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Intriguingly Simple and Fast Transit Routing. 43-54 - Julian Arz, Dennis Luxen, Peter Sanders:
Transit Node Routing Reconsidered. 55-66
Combinatorics and Enumeration
- Lasse Kliemann, Ole Kliemann, Chellapilla Patvardhan, Volkmar Sauerland, Anand Srivastav:
A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. 67-78 - Roland Glück, Dominik Köppl, Günther Wirsching:
Computational Aspects of Ordered Integer Partition with Upper Bounds. 79-90 - Takahisa Toda:
Hypergraph Transversal Computation with Binary Decision Diagrams. 91-102 - Fredrik Manne, Sadia Sharmin:
Efficient Counting of Maximal Independent Sets in Sparse Graphs. 103-114
Data Structures and Compression
- Herman J. Haverkort, Mark McGranaghan, Laura Toma:
An Edge Quadtree for External Memory. 115-126 - Amr Elmasry, Jyrki Katajainen:
Branchless Search Programs. 127-138 - Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lightweight Lempel-Ziv Parsing. 139-150 - Dong Zhou, David G. Andersen, Michael Kaminsky:
Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences. 151-163
Network Partitioning and Bioinformatics
- Peter Sanders, Christian Schulz:
Think Locally, Act Globally: Highly Balanced Graph Partitioning. 164-175 - Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier:
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components. 176-187 - Sharon Bruckner, Bastian Kayser, Tim O. F. Conrad:
Finding Modules in Networks with Non-modular Regions. 188-199 - Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu:
Telling Stories Fast. 200-211
Mathematical Programming
- Timo Berthold, Ambros M. Gleixner:
Undercover Branching. 212-223 - Christoph Buchheim, Long Trieu:
Quadratic Outer Approximation for Convex Integer Programming with Box Constraints. 224-235 - Christoph Buchheim, Emiliano Traversi:
Separable Non-convex Underestimators for Binary Quadratic Programming. 236-247 - Fabio Furini, Emiliano Traversi:
Hybrid SDP Bounding Procedure. 248-259
Transportation Networks and Graph Algorithms II
- Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck:
Computing Multimodal Journeys in Practice. 260-271 - Andreas Gemsa, Thomas Pajor, Dorothea Wagner, Tobias Zündorf:
Efficient Computation of Jogging Routes. 272-283 - Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan:
Dominator Certification and Independent Spanning Trees: An Experimental Study. 284-295 - José Luis López-Presa, Luis Núñez Chiroque, Antonio Fernández Anta:
Novel Techniques for Automorphism Group Computation. 296-307
Geometry and Optimization
- Andreas Karrenbauer, Dominik Wöll:
Blinking Molecule Tracking. 308-319 - Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza:
The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm. 320-336 - Mathias Weller:
An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number. 337-353 - Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. 354-365
Scheduling and Local Search
- Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis:
Energy Minimization via a Primal-Dual Algorithm for a Convex Program. 366-377 - Benjamin Hiller, Torsten Klug, Jakob Witzig:
Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control. 378-389 - Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou, Yiannis Tasoulas:
Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows. 390-401 - Marjan van den Akker, Kevin van Blokland, Han Hoogeveen:
Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search. 402-413
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:
