The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Workshop on Experimental and Efficient Algorithms (wea)
2005 (conf/wea/2005)

  1. Christos H. Papadimitriou
    ... The Interaction Between Algorithms and Game Theory. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:1-3 [Conf]
  2. Eraldo R. Fernandes, Celso C. Ribeiro
    Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:4-15 [Conf]
  3. David A. Bader
    High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:16-21 [Conf]
  4. Michele Flammini, Alfredo Navarra, Stéphane Pérennes
    The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:22-31 [Conf]
  5. Kurt Mehlhorn, Dimitrios Michail
    Implementing Minimum Cycle Basis Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:32-43 [Conf]
  6. Refael Hassin, Danny Segev
    Rounding to an Integral Program. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:44-54 [Conf]
  7. Laura Heinrich-Litan, Marco E. Lübbecke
    Rectangle Covers Revisited Computationally. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:55-66 [Conf]
  8. Holger Bast, Ingmar Weber
    Don't Compare Averages. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:67-76 [Conf]
  9. Alexis C. Kaporis, Lefteris M. Kirousis, E. I. Politopoulou, Paul G. Spirakis
    Experimental Results for Stackelberg Scheduling Strategies. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:77-88 [Conf]
  10. Torsten Fahle, Karsten Tiemann
    An Improved Branch-and-Bound Algorithm for the Test Cover Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:89-100 [Conf]
  11. Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
    Degree-Based Treewidth Lower Bounds. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:101-112 [Conf]
  12. Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, Bradley Huffaker, Kimberly C. Claffy, George F. Riley
    Inferring AS Relationships: Dead End or Lively Beginning? [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:113-125 [Conf]
  13. Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling
    Acceleration of Shortest Path and Constrained Shortest Path Computation. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:126-138 [Conf]
  14. Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir
    A General Buffer Scheme for the Windows Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:139-151 [Conf]
  15. Qiang Lu, Hu Zhang
    Implementation of Approximation Algorithms for the Multicast Congestion Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:152-164 [Conf]
  16. Mustapha Kchikech, Olivier Togni
    Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:165-176 [Conf]
  17. Bram De Wachter, Alexandre Genon, Thierry Massart
    From Static Code Distribution to More Shrinkage for the Multiterminal Cut. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:177-188 [Conf]
  18. Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
    Partitioning Graphs to Speed Up Dijkstra's Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:189-202 [Conf]
  19. Panagiota N. Panagopoulou, Paul G. Spirakis
    Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:203-215 [Conf]
  20. Emgad H. Bachoore, Hans L. Bodlaender
    New Upper Bound Heuristics for Treewidth. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:216-227 [Conf]
  21. Yvonne Bleischwitz, Georg Kliewer
    Accelerating Vickrey Payment Computation in Combinatorial Auctions for an Airline Alliance. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:228-239 [Conf]
  22. Falk Hüffner
    Algorithm Engineering for Optimal Graph Bipartization. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:240-252 [Conf]
  23. Xavier Pérez
    Empirical Analysis of the Connectivity Threshold of Mobile Agents on the Grid. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:253-264 [Conf]
  24. Domenico Cantone, Alfredo Ferro, Rosalba Giugno, Giuseppe Lo Presti, Alfredo Pulvirenti
    Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:265-276 [Conf]
  25. Daniel Sawitzki
    On Symbolic Scheduling Independent Tasks with Restricted Execution Times. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:277-289 [Conf]
  26. Rodrigue Ossamy
    A Simple Randomized k-Local Election Algorithm for Local Computations. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:290-301 [Conf]
  27. Maria I. Andreou, Vicky G. Papadopoulou, Paul G. Spirakis, B. Theodorides, A. Xeros
    Generating and Radiocoloring Families of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:302-314 [Conf]
  28. Dong Kyue Kim, Joong Chae Na, Ji Eun Kim, Kunsoo Park
    Efficient Implementation of Rank and Select Functions for Succinct Representation. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:315-327 [Conf]
  29. Romulo A. Pereira, Arnaldo V. Moura, Cid C. de Souza
    Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:328-340 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:341-353 [Conf]
  31. Christian Liebchen
    A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:354-366 [Conf]
  32. Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:367-379 [Conf]
  33. Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara
    New Bit-Parallel Indel-Distance Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:380-390 [Conf]
  34. Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi
    Dynamic Application Placement Under Service and Memory Constraints. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:391-402 [Conf]
  35. Azzedine Boukerche, Jeferson G. Koch, Alba Cristina Magalhaes Alves de Melo
    Integrating Coordinated Checkpointing and Recovery Mechanisms into DSM Synchronization Barriers. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:403-414 [Conf]
  36. Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich Theodor Vierhaus, Pawel Wlaz
    Synchronization Fault Cryptanalysis for Breaking A5/1. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:415-427 [Conf]
  37. Domenico Cantone, Salvatore Cristofaro, Simone Faro
    An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:428-439 [Conf]
  38. Maik Weinard
    The Necessity of Timekeeping in Adversarial Queueing. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:440-451 [Conf]
  39. Bernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer
    BDDs in a Branch and Cut Framework. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:452-463 [Conf]
  40. 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. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:464-475 [Conf]
  41. Justus Schwartz, Angelika Steger, Andreas Weißl
    Fast Algorithms for Weighted Bipartite Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:476-487 [Conf]
  42. Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani
    A Practical Minimal Perfect Hashing Method. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:488-500 [Conf]
  43. Dalila Boughaci, Habiba Drias
    Efficient and Experimental Meta-heuristics for MAX-SAT Problems. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:501-512 [Conf]
  44. Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismail
    Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:513-523 [Conf]
  45. Pekka Orponen, Satu Elisa Schaeffer
    Local Clustering of Large Graphs by Approximate Fiedler Vectors. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:524-533 [Conf]
  46. Anna Gambin, Damian Wójtowicz
    Almost FPRAS for Lattice Models of Protein Folding. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:534-544 [Conf]
  47. Eyjolfur Asgeirsson, Clifford Stein
    Vertex Cover Approximations: Experiments and Observations. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:545-557 [Conf]
  48. Marcos R. Q. de Andrade, Paulo M. F. de Andrade, Simone L. Martins, Alexandre Plastino
    GRASP with Path-Relinking for the Maximum Diversity Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:558-569 [Conf]
  49. George F. Georgakopoulos
    How to Splay for loglog N-Competitiveness. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:570-579 [Conf]
  50. Filippo Geraci, Roberto Grossi
    Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:580-592 [Conf]
  51. Thomas Kamphans, Elmar Langetepe
    Optimal Competitive Online Ray Search with an Error-Prone Robot. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:593-596 [Conf]
  52. Amr Elmasry, Abdelrahman Hammad
    An Empirical Study for Inversions-Sensitive Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:597-601 [Conf]
  53. Martin Kochol, Nad'a Krivonáková, Silvia Smejová
    Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:602-605 [Conf]
  54. Thomas Schank, Dorothea Wagner
    Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:606-609 [Conf]
  55. H. Bekker, E. P. Braad, Boris Goldengorin
    Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:610-613 [Conf]
  56. János Levendovszky, Csego Orosz
    Developing Novel Statistical Bandwidths for Communication Networks with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:614-617 [Conf]
  57. Yuxiao Jia, Dimitrios Makrakis, Nicolas D. Georganas, Dan Ionescu
    Dynamic Quality of Service Support in Virtual Private Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:618-621 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002