default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th WEA 2007: Rome, Italy
- Camil Demetrescu:
Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings. Lecture Notes in Computer Science 4525, Springer 2007, ISBN 978-3-540-72844-3
Invited Lectures
- Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
An Alternative Ranking Problem for Search Engines. 1-22 - Peter Sanders, Dominik Schultes:
Engineering Fast Route Planning Algorithms. 23-36 - Maria J. Serna:
Random Models for Geometric Graphs (Abstract). 37
Route Planning
- Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck:
Better Landmarks Within Reach. 38-51 - Daniel Delling, Dorothea Wagner:
Landmark-Based Routing in Dynamic Graphs. 52-65 - Dominik Schultes, Peter Sanders:
Dynamic Highway-Node Routing. 66-79
Dynamic Trees, Skip Lists, and Bloom Filters
- Robert Endre Tarjan, Renato Fonseca F. Werneck:
Dynamic Trees in Practice. 80-93 - Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia:
On the Cost of Persistence and Authentication in Skip Lists. 94-107 - Felix Putze, Peter Sanders, Johannes Singler:
Cache-, Hash- and Space-Efficient Bloom Filters. 108-121
Crossing Minimizationm, TSP, and Vehicle Routing
- Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler:
Crossing Minimization in Weighted Bipartite Graphs. 122-135 - Vladimir G. Deineko, Alexandre Tiskin
:
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. 136-149 - Artur Alves Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa:
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem. 150-160
Network Routing and Stability
- Olivier Powell, Sotiris E. Nikoletseas:
Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks. 161-174 - Marcelo C. P. Santos, Lúcia M. A. Drummond, Eduardo Uchoa:
A Distributed Primal-Dual Heuristic for Steiner Problems in Networks. 175-188 - Maria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos:
An Experimental Study of Stability in Heterogeneous Networks. 189-202
Strings and Range Searching
- Kimmo Fredriksson, Fedor Nikitin:
Simple Compression Code Supporting Random Access and Fast String Matching. 203-216 - Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen:
Engineering a Compressed Suffix Tree Implementation. 217-228 - Karina Figueroa, Kimmo Fredriksson:
Simple Space-Time Trade-Offs for AESA. 229-241
Matching, Flows, and Spanners
- Jens Maue, Peter Sanders:
Engineering Algorithms for Approximate Weighted Matching. 242-255 - Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou:
Experimental Evaluation of Parametric Max-Flow Algorithms. 256-269 - Mohammad Farshi, Joachim Gudmundsson:
Experimental Study of Geometric t-Spanners: A Running Time Comparison. 270-284
Covering, Coloring, and Partitioning
- Eyjolfur Ingi Asgeirsson, Clifford Stein:
Vertex Cover Approximations on Random Graphs. 285-296 - Falk Hüffner, Nadja Betzler, Rolf Niedermeier:
Optimal Edge Deletions for Signed Graph Balancing. 297-310 - Ekaterina Smorodkina, Mayur Thakur, Daniel R. Tauritz:
Algorithms for the Balanced Edge Partitioning Problem. 311-323
Applications
- Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli:
Experimental Evaluations of Algorithms for IP Table Minimization. 324-337 - Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu:
Algorithms for Longer OLED Lifetime. 338-351 - Fei Ye, Yan Guo, Andrew Lawson, Jijun Tang:
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data. 352-364
Spanning Trees
- Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi:
Benchmarks for Strictly Fundamental Cycle Bases. 365-378 - Markus Behle, Michael Jünger, Frauke Liers:
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. 379-392 - Celso C. Ribeiro, Rodrigo F. Toso:
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights. 393-405
Packing and Auctions
- Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. 406-419 - Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth:
Trunk Packing Revisited. 420-432 - Dries R. Goossens, Frits C. R. Spieksma:
Exact Algorithms for the Matrix Bid Auction. 433-445
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-02-15 00:26 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:
