
Conferences in DBLP
 Christos H. Papadimitriou
... The Interaction Between Algorithms and Game Theory. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:13 [Conf]
 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:415 [Conf]
 David A. Bader
HighPerformance Algorithm Engineering for LargeScale Graph Problems and Computational Biology. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:1621 [Conf]
 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:2231 [Conf]
 Kurt Mehlhorn, Dimitrios Michail
Implementing Minimum Cycle Basis Algorithms. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:3243 [Conf]
 Refael Hassin, Danny Segev
Rounding to an Integral Program. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:4454 [Conf]
 Laura HeinrichLitan, Marco E. Lübbecke
Rectangle Covers Revisited Computationally. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:5566 [Conf]
 Holger Bast, Ingmar Weber
Don't Compare Averages. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:6776 [Conf]
 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:7788 [Conf]
 Torsten Fahle, Karsten Tiemann
An Improved BranchandBound Algorithm for the Test Cover Problem. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:89100 [Conf]
 Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
DegreeBased Treewidth Lower Bounds. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:101112 [Conf]
 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:113125 [Conf]
 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:126138 [Conf]
 Amotz BarNoy, Jacob Christensen, Richard E. Ladner, Tami Tamir
A General Buffer Scheme for the Windows Scheduling Problem. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:139151 [Conf]
 Qiang Lu, Hu Zhang
Implementation of Approximation Algorithms for the Multicast Congestion Problem. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:152164 [Conf]
 Mustapha Kchikech, Olivier Togni
Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:165176 [Conf]
 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:177188 [Conf]
 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:189202 [Conf]
 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:203215 [Conf]
 Emgad H. Bachoore, Hans L. Bodlaender
New Upper Bound Heuristics for Treewidth. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:216227 [Conf]
 Yvonne Bleischwitz, Georg Kliewer
Accelerating Vickrey Payment Computation in Combinatorial Auctions for an Airline Alliance. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:228239 [Conf]
 Falk Hüffner
Algorithm Engineering for Optimal Graph Bipartization. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:240252 [Conf]
 Xavier Pérez
Empirical Analysis of the Connectivity Threshold of Mobile Agents on the Grid. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:253264 [Conf]
 Domenico Cantone, Alfredo Ferro, Rosalba Giugno, Giuseppe Lo Presti, Alfredo Pulvirenti
MultipleWinners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:265276 [Conf]
 Daniel Sawitzki
On Symbolic Scheduling Independent Tasks with Restricted Execution Times. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:277289 [Conf]
 Rodrigue Ossamy
A Simple Randomized kLocal Election Algorithm for Local Computations. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:290301 [Conf]
 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:302314 [Conf]
 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:315327 [Conf]
 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:328340 [Conf]
 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:341353 [Conf]
 Christian Liebchen
A CutBased Heuristic to Produce Almost Feasible Periodic Railway Timetables. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:354366 [Conf]
 Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
GRASP with PathRelinking for the Weighted Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:367379 [Conf]
 Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara
New BitParallel IndelDistance Algorithm. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:380390 [Conf]
 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:391402 [Conf]
 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:403414 [Conf]
 Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich Theodor Vierhaus, Pawel Wlaz
Synchronization Fault Cryptanalysis for Breaking A5/1. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:415427 [Conf]
 Domenico Cantone, Salvatore Cristofaro, Simone Faro
An Efficient Algorithm for alphaApproximate Matching with deltaBounded Gaps in Musical Sequences. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:428439 [Conf]
 Maik Weinard
The Necessity of Timekeeping in Adversarial Queueing. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:440451 [Conf]
 Bernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer
BDDs in a Branch and Cut Framework. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:452463 [Conf]
 Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio AyalaRincón, Thomas Mailleux Santana
Parallel SmithWaterman Algorithm for Local DNA Comparison in a Cluster of Workstations. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:464475 [Conf]
 Justus Schwartz, Angelika Steger, Andreas Weißl
Fast Algorithms for Weighted Bipartite Matching. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:476487 [Conf]
 Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani
A Practical Minimal Perfect Hashing Method. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:488500 [Conf]
 Dalila Boughaci, Habiba Drias
Efficient and Experimental Metaheuristics for MAXSAT Problems. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:501512 [Conf]
 Mark K. Goldberg, D. Hollinger, Malik MagdonIsmail
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:513523 [Conf]
 Pekka Orponen, Satu Elisa Schaeffer
Local Clustering of Large Graphs by Approximate Fiedler Vectors. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:524533 [Conf]
 Anna Gambin, Damian Wójtowicz
Almost FPRAS for Lattice Models of Protein Folding. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:534544 [Conf]
 Eyjolfur Asgeirsson, Clifford Stein
Vertex Cover Approximations: Experiments and Observations. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:545557 [Conf]
 Marcos R. Q. de Andrade, Paulo M. F. de Andrade, Simone L. Martins, Alexandre Plastino
GRASP with PathRelinking for the Maximum Diversity Problem. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:558569 [Conf]
 George F. Georgakopoulos
How to Splay for loglog NCompetitiveness. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:570579 [Conf]
 Filippo Geraci, Roberto Grossi
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:580592 [Conf]
 Thomas Kamphans, Elmar Langetepe
Optimal Competitive Online Ray Search with an ErrorProne Robot. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:593596 [Conf]
 Amr Elmasry, Abdelrahman Hammad
An Empirical Study for InversionsSensitive Sorting Algorithms. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:597601 [Conf]
 Martin Kochol, Nad'a Krivonáková, Silvia Smejová
Approximation Algorithm for Chromatic Index and EdgeColoring of Multigraphs. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:602605 [Conf]
 Thomas Schank, Dorothea Wagner
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:606609 [Conf]
 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:610613 [Conf]
 János Levendovszky, Csego Orosz
Developing Novel Statistical Bandwidths for Communication Networks with Incomplete Information. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:614617 [Conf]
 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:618621 [Conf]
