
Conferences in DBLP
 Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand
Improving Linear Programming Approaches for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:114 [Conf]
 Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis
Algorithms and Experiments on Colouring Squares of Planar Graphs. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:1532 [Conf]
 Vittorio Bilò, Michele Flammini, Roberto Giovannelli
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:3346 [Conf]
 Domenico Cantone, Simone Faro
FastSearch: A New Efficient Variant of the BoyerMoore String Matching Algorithm. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:4758 [Conf]
 Massimiliano Caramia, Stefano Giordani, Antonio Iovanella
An OnLine Algorithm for the Rectangle Packing Problem with Rejection. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:5969 [Conf]
 François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre
New Lower and Upper Bounds for Graph Treewidth. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:7080 [Conf]
 Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
Search Data Structures for Skewed Strings. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:8196 [Conf]
 Josep Díaz, Jordi Petit, Maria J. Serna
Evaluation of Basic Protocols for Optical Smart Dust Networks. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:97106 [Conf]
 Doratha E. Drake, Stefan Hougardy
Linear Time Local Improvements for Weighted Matchings in Graphs. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:107119 [Conf]
 Rudolf Fleischer, Gerhard Trippen
Experimental Studies of Graph Traversal Algorithms. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:120133 [Conf]
 Karlis Freivalds
A Nondifferentiable Optimization Approach to RatioCut Partitioning. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:134147 [Conf]
 Alexander Hall, Hanjo Täubig
Comparing Push and PullBased Broadcasting. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:148164 [Conf]
 Martin Hoefer
Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:165178 [Conf]
 Víctor M. Jiménez, Andrés Marzal
A Lazy Version of Eppstein's K Shortest Paths Algorithm. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:179190 [Conf]
 Martin Kochol
Linear Algorithm for 3Coloring of Locally Connected Graphs. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:191194 [Conf]
 WeiFu Lu, WenLian Hsu
A Clustering Algorithm for Interval Graph Test on Noisy Data. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:195208 [Conf]
 Monaldo Mastrolilli, Leonora Bianchi
Core Instances for Testing: A Case Study. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:209221 [Conf]
 Kurt Mehlhorn
The Reliable Algorithmic Software Challenge RASC. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:222 [Conf]
 Marco Pranzo, Carlo Meloni, Dario Pacciarelli
A New Class of Greedy Heuristics for Job Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:223236 [Conf]
 Mitali Singh, Viktor K. Prasanna
Algorithmic Techniques for Memory Energy Reduction. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:237252 [Conf]
 Roberto SolisOba
A Framework for Designing Approximation Algorithms for Scheduling Problems. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:253260 [Conf]
 Dorothea Wagner
Analysis and Visualization of Social Networks. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:261266 [Conf]
