default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd WEA 2003: Ascona, Switzerland
- Klaus Jansen, Marian Margraf, Monaldo Mastrolilli
, José D. P. Rolim:
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings. Lecture Notes in Computer Science 2647, Springer 2003, ISBN 3-540-40205-5 - Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand:
Improving Linear Programming Approaches for the Steiner Tree Problem. 1-14 - Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis:
Algorithms and Experiments on Colouring Squares of Planar Graphs. 15-32 - Vittorio Bilò, Michele Flammini, Roberto Giovannelli:
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. 33-46 - Domenico Cantone, Simone Faro:
Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm. 47-58 - Massimiliano Caramia, Stefano Giordani, Antonio Iovanella:
An On-Line Algorithm for the Rectangle Packing Problem with Rejection. 59-69 - François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre:
New Lower and Upper Bounds for Graph Treewidth. 70-80 - Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano:
Search Data Structures for Skewed Strings. 81-96 - Josep Díaz, Jordi Petit, Maria J. Serna:
Evaluation of Basic Protocols for Optical Smart Dust Networks. 97-106 - Doratha E. Drake, Stefan Hougardy:
Linear Time Local Improvements for Weighted Matchings in Graphs. 107-119 - Rudolf Fleischer, Gerhard Trippen:
Experimental Studies of Graph Traversal Algorithms. 120-133 - Karlis Freivalds:
A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning. 134-147 - Alexander Hall, Hanjo Täubig:
Comparing Push- and Pull-Based Broadcasting. 148-164 - Martin Hoefer:
Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location. 165-178 - Víctor M. Jiménez, Andrés Marzal:
A Lazy Version of Eppstein's K Shortest Paths Algorithm. 179-190 - Martin Kochol:
Linear Algorithm for 3-Coloring of Locally Connected Graphs. 191-194 - Wei-Fu Lu, Wen-Lian Hsu:
A Clustering Algorithm for Interval Graph Test on Noisy Data. 195-208 - Monaldo Mastrolilli, Leonora Bianchi:
Core Instances for Testing: A Case Study. 209-221 - Kurt Mehlhorn:
The Reliable Algorithmic Software Challenge RASC. 222 - Marco Pranzo, Carlo Meloni, Dario Pacciarelli:
A New Class of Greedy Heuristics for Job Shop Scheduling Problems. 223-236 - Mitali Singh, Viktor K. Prasanna:
Algorithmic Techniques for Memory Energy Reduction. 237-252 - Roberto Solis-Oba:
A Framework for Designing Approximation Algorithms for Scheduling Problems. 253-260 - Dorothea Wagner:
Analysis and Visualization of Social Networks. 261-266
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-01-21 20:23 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:
