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