default search action
ACM Journal of Experimental Algorithmics, Volume 18
Volume 18, 2013
- Paola Festa:
Foreword to the special issue SEA 2010. - Charles Delort, Olivier Spanjaard:
A hybrid dynamic programming approach to the biobjective binary knapsack problem. - Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Alternative routes in road networks. - Gernot Veit Batz, Robert Geisberger, Peter Sanders, Christian Vetter:
Minimum time-dependent travel times with contraction hierarchies. - Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt, Dorothea Wagner:
Dynamic graph clustering combining modularity and smoothness. - Umberto Ferraro Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano:
Data structures resilient to memory faults: An experimental study of dictionaries.
- Simon Gog, Enno Ohlebusch:
Compressed suffix trees: Efficient computation and storage of LCP-values. - Stefan Canzar, Khaled M. Elbassioni, Julián Mestre:
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. - Micha Hofri:
Optimal selection and sorting via dynamic programming. - Charalampos S. Kouzinopoulos, Konstantinos G. Margaritis:
Exact online two-dimensional pattern matching using multiple pattern matching algorithms. - Tina M. Kouri, Dinesh P. Mehta:
Faster reaction mapping through improved naming techniques. - Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Wächter:
On branching rules for convex mixed-integer nonlinear optimization.
- David Eppstein, Maarten Löffler, Darren Strash:
Listing All Maximal Cliques in Large Sparse Real-World Graphs. - Chandrashekhar Nagarajan, David P. Williamson:
An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms.
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.