4. WEA 2005:
Santorini Island,
Greece
Sotiris E. Nikoletseas (Ed.):
Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings.
Lecture Notes in Computer Science 3503 Springer 2005, ISBN 3-540-25920-1 BibTeX
Invited Talks
Contributed Regular Papers
- Michele Flammini, Alfredo Navarra, Stéphane Pérennes:
The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting.
22-31
Electronic Edition (link) BibTeX
- Kurt Mehlhorn, Dimitrios Michail:
Implementing Minimum Cycle Basis Algorithms.
32-43
Electronic Edition (link) BibTeX
- Refael Hassin, Danny Segev:
Rounding to an Integral Program.
44-54
Electronic Edition (link) BibTeX
- Laura Heinrich-Litan, Marco E. Lübbecke:
Rectangle Covers Revisited Computationally.
55-66
Electronic Edition (link) BibTeX
- Holger Bast, Ingmar Weber:
Don't Compare Averages.
67-76
Electronic Edition (link) BibTeX
- Alexis C. Kaporis, Lefteris M. Kirousis, E. I. Politopoulou, Paul G. Spirakis:
Experimental Results for Stackelberg Scheduling Strategies.
77-88
Electronic Edition (link) BibTeX
- Torsten Fahle, Karsten Tiemann:
An Improved Branch-and-Bound Algorithm for the Test Cover Problem.
89-100
Electronic Edition (link) BibTeX
- Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender:
Degree-Based Treewidth Lower Bounds.
101-112
Electronic Edition (link) BibTeX
- Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, Bradley Huffaker, Kimberly C. Claffy, George F. Riley:
Inferring AS Relationships: Dead End or Lively Beginning?
113-125
Electronic Edition (link) BibTeX
- Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling:
Acceleration of Shortest Path and Constrained Shortest Path Computation.
126-138
Electronic Edition (link) BibTeX
- Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir:
A General Buffer Scheme for the Windows Scheduling Problem.
139-151
Electronic Edition (link) BibTeX
- Qiang Lu, Hu Zhang:
Implementation of Approximation Algorithms for the Multicast Congestion Problem.
152-164
Electronic Edition (link) BibTeX
- Mustapha Kchikech, Olivier Togni:
Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes.
165-176
Electronic Edition (link) BibTeX
- Bram De Wachter, Alexandre Genon, Thierry Massart:
From Static Code Distribution to More Shrinkage for the Multiterminal Cut.
177-188
Electronic Edition (link) BibTeX
- Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
Partitioning Graphs to Speed Up Dijkstra's Algorithm.
189-202
Electronic Edition (link) BibTeX
- Panagiota N. Panagopoulou, Paul G. Spirakis:
Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games.
203-215
Electronic Edition (link) BibTeX
- Emgad H. Bachoore, Hans L. Bodlaender:
New Upper Bound Heuristics for Treewidth.
216-227
Electronic Edition (link) BibTeX
- Yvonne Bleischwitz, Georg Kliewer:
Accelerating Vickrey Payment Computation in Combinatorial Auctions for an Airline Alliance.
228-239
Electronic Edition (link) BibTeX
- Falk Hüffner:
Algorithm Engineering for Optimal Graph Bipartization.
240-252
Electronic Edition (link) BibTeX
- Xavier Pérez-Giménez:
Empirical Analysis of the Connectivity Threshold of Mobile Agents on the Grid.
253-264
Electronic Edition (link) BibTeX
- Domenico Cantone, Alfredo Ferro, Rosalba Giugno, Giuseppe Lo Presti, Alfredo Pulvirenti:
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces.
265-276
Electronic Edition (link) BibTeX
- Daniel Sawitzki:
On Symbolic Scheduling Independent Tasks with Restricted Execution Times.
277-289
Electronic Edition (link) BibTeX
- Rodrigue Ossamy:
A Simple Randomized k-Local Election Algorithm for Local Computations.
290-301
Electronic Edition (link) BibTeX
- Maria I. Andreou, Vicky G. Papadopoulou, Paul G. Spirakis, B. Theodorides, A. Xeros:
Generating and Radiocoloring Families of Perfect Graphs.
302-314
Electronic Edition (link) BibTeX
- Dong Kyue Kim, Joong Chae Na, Ji Eun Kim, Kunsoo Park:
Efficient Implementation of Rank and Select Functions for Succinct Representation.
315-327
Electronic Edition (link) BibTeX
- Romulo A. Pereira, Arnaldo V. Moura, Cid C. de Souza:
Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem.
328-340
Electronic Edition (link) BibTeX
- Pierre Leone, Paul Albuquerque, Christian Mazza, José D. P. Rolim:
A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization Protocol.
341-353
Electronic Edition (link) BibTeX
- Christian Liebchen:
A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables.
354-366
Electronic Edition (link) BibTeX
- Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem.
367-379
Electronic Edition (link) BibTeX
- Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara:
New Bit-Parallel Indel-Distance Algorithm.
380-390
Electronic Edition (link) BibTeX
- Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi:
Dynamic Application Placement Under Service and Memory Constraints.
391-402
Electronic Edition (link) BibTeX
- Azzedine Boukerche, Jeferson G. Koch, Alba Cristina Magalhaes Alves de Melo:
Integrating Coordinated Checkpointing and Recovery Mechanisms into DSM Synchronization Barriers.
403-414
Electronic Edition (link) BibTeX
- Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich Theodor Vierhaus, Pawel Wlaz:
Synchronization Fault Cryptanalysis for Breaking A5/1.
415-427
Electronic Edition (link) BibTeX
- Domenico Cantone, Salvatore Cristofaro, Simone Faro:
An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences.
428-439
Electronic Edition (link) BibTeX
- Maik Weinard:
The Necessity of Timekeeping in Adversarial Queueing.
440-451
Electronic Edition (link) BibTeX
- Bernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer:
BDDs in a Branch and Cut Framework.
452-463
Electronic Edition (link) BibTeX
- Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio Ayala-Rincón, Thomas Mailleux Santana:
Parallel Smith-Waterman Algorithm for Local DNA Comparison in a Cluster of Workstations.
464-475
Electronic Edition (link) BibTeX
- Justus Schwartz, Angelika Steger, Andreas Weißl:
Fast Algorithms for Weighted Bipartite Matching.
476-487
Electronic Edition (link) BibTeX
- Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani:
A Practical Minimal Perfect Hashing Method.
488-500
Electronic Edition (link) BibTeX
- Dalila Boughaci, Habiba Drias:
Efficient and Experimental Meta-heuristics for MAX-SAT Problems.
501-512
Electronic Edition (link) BibTeX
- Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismail:
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs.
513-523
Electronic Edition (link) BibTeX
- Pekka Orponen, Satu Elisa Schaeffer:
Local Clustering of Large Graphs by Approximate Fiedler Vectors.
524-533
Electronic Edition (link) BibTeX
- Anna Gambin, Damian Wójtowicz:
Almost FPRAS for Lattice Models of Protein Folding.
534-544
Electronic Edition (link) BibTeX
- Eyjolfur Asgeirsson, Clifford Stein:
Vertex Cover Approximations: Experiments and Observations.
545-557
Electronic Edition (link) BibTeX
- Marcos R. Q. de Andrade, Paulo M. F. de Andrade, Simone L. Martins, Alexandre Plastino:
GRASP with Path-Relinking for the Maximum Diversity Problem.
558-569
Electronic Edition (link) BibTeX
- George F. Georgakopoulos:
How to Splay for loglog N-Competitiveness.
570-579
Electronic Edition (link) BibTeX
- Filippo Geraci, Roberto Grossi:
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms.
580-592
Electronic Edition (link) BibTeX
Contributed Short Papers
- Thomas Kamphans, Elmar Langetepe:
Optimal Competitive Online Ray Search with an Error-Prone Robot.
593-596
Electronic Edition (link) BibTeX
- Amr Elmasry, Abdelrahman Hammad:
An Empirical Study for Inversions-Sensitive Sorting Algorithms.
597-601
Electronic Edition (link) BibTeX
- Martin Kochol, Nad'a Krivonáková, Silvia Smejová:
Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs.
602-605
Electronic Edition (link) BibTeX
- Thomas Schank, Dorothea Wagner:
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study.
606-609
Electronic Edition (link) BibTeX
- H. Bekker, E. P. Braad, Boris Goldengorin:
Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching.
610-613
Electronic Edition (link) BibTeX
- János Levendovszky, Csego Orosz:
Developing Novel Statistical Bandwidths for Communication Networks with Incomplete Information.
614-617
Electronic Edition (link) BibTeX
- Yuxiao Jia, Dimitrios Makrakis, Nicolas D. Georganas, Dan Ionescu:
Dynamic Quality of Service Support in Virtual Private Networks.
618-621
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:47:31 2009
by Michael Ley (ley@uni-trier.de)
