Abstract is missing.
- ... The Interaction Between Algorithms and Game TheoryChristos H. Papadimitriou. 1-3 [doi]
- Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by HybridizationEraldo L. R. Fernandes, Celso C. Ribeiro. 4-15 [doi]
- High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational BiologyDavid A. Bader. 16-21 [doi]
- The Real Approximation Factor of the MST Heuristic for the Minimum Energy BroadcastingMichele Flammini, Alfredo Navarra, Stéphane Pérennes. 22-31 [doi]
- Implementing Minimum Cycle Basis AlgorithmsKurt Mehlhorn, Dimitrios Michail. 32-43 [doi]
- Rounding to an Integral ProgramRefael Hassin, Danny Segev. 44-54 [doi]
- Rectangle Covers Revisited ComputationallyLaura Heinrich-Litan, Marco E. Lübbecke. 55-66 [doi]
- Don t Compare AveragesHolger Bast, Ingmar Weber. 67-76 [doi]
- Experimental Results for Stackelberg Scheduling StrategiesAlexis C. Kaporis, Lefteris M. Kirousis, E. I. Politopoulou, Paul G. Spirakis. 77-88 [doi]
- An Improved Branch-and-Bound Algorithm for the Test Cover ProblemTorsten Fahle, Karsten Tiemann. 89-100 [doi]
- Degree-Based Treewidth Lower BoundsArie M. C. A. Koster, Thomas Wolle, Hans Leo Bodlaender. 101-112 [doi]
- Inferring AS Relationships: Dead End or Lively Beginning?Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, Bradley Huffaker, Kimberly C. Claffy, George F. Riley. 113-125 [doi]
- Acceleration of Shortest Path and Constrained Shortest Path ComputationEkkehard Köhler, Rolf H. Möhring, Heiko Schilling. 126-138 [doi]
- A General Buffer Scheme for the Windows Scheduling ProblemAmotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir. 139-151 [doi]
- Implementation of Approximation Algorithms for the Multicast Congestion ProblemQiang Lu, Hu Zhang. 152-164 [doi]
- Frequency Assignment and Multicoloring Powers of Square and Triangular MeshesMustapha Kchikech, Olivier Togni. 165-176 [doi]
- From Static Code Distribution to More Shrinkage for the Multiterminal CutBram De Wachter, Alexandre Genon, Thierry Massart. 177-188 [doi]
- Partitioning Graphs to Speed Up Dijkstra s AlgorithmRolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm. 189-202 [doi]
- Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion GamesPanagiota N. Panagopoulou, Paul G. Spirakis. 203-215 [doi]
- New Upper Bound Heuristics for TreewidthEmgad H. Bachoore, Hans Leo Bodlaender. 216-227 [doi]
- Accelerating Vickrey Payment Computation in Combinatorial Auctions for an Airline AllianceYvonne Bleischwitz, Georg Kliewer. 228-239 [doi]
- Algorithm Engineering for Optimal Graph BipartizationFalk Hüffner. 240-252 [doi]
- Empirical Analysis of the Connectivity Threshold of Mobile Agents on the GridXavier Pérez-Giménez. 253-264 [doi]
- Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric SpacesDomenico Cantone, Alfredo Ferro, Rosalba Giugno, Giuseppe Lo Presti, Alfredo Pulvirenti. 265-276 [doi]
- On Symbolic Scheduling Independent Tasks with Restricted Execution TimesDaniel Sawitzki. 277-289 [doi]
- A Simple Randomized k-Local Election Algorithm for Local ComputationsRodrigue Ossamy. 290-301 [doi]
- Generating and Radiocoloring Families of Perfect GraphsMaria I. Andreou, Vicky G. Papadopoulou, Paul G. Spirakis, B. Theodorides, A. Xeros. 302-314 [doi]
- Efficient Implementation of Rank and Select Functions for Succinct RepresentationDong Kyue Kim, Joong Chae Na, Ji Eun Kim, Kunsoo Park. 315-327 [doi]
- Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling ProblemRomulo A. Pereira, Arnaldo V. Moura, Cid C. de Souza. 328-340 [doi]
- A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization ProtocolPierre Leone, Paul Albuquerque, Christian Mazza, José D. P. Rolim. 341-353 [doi]
- A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway TimetablesChristian Liebchen. 354-366 [doi]
- GRASP with Path-Relinking for the Weighted Maximum Satisfiability ProblemPaola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende. 367-379 [doi]
- New Bit-Parallel Indel-Distance AlgorithmHeikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara. 380-390 [doi]
- Dynamic Application Placement Under Service and Memory ConstraintsTracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi. 391-402 [doi]
- Integrating Coordinated Checkpointing and Recovery Mechanisms into DSM Synchronization BarriersAzzedine Boukerche, Jeferson G. Koch, Alba Cristina Magalhaes Alves de Melo. 403-414 [doi]
- Synchronization Fault Cryptanalysis for Breaking A5/1Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich Theodor Vierhaus, Pawel Wlaz. 415-427 [doi]
- An Efficient Algorithm for alpha-Approximate Matching with ::::delta::::-Bounded Gaps in Musical SequencesDomenico Cantone, Salvatore Cristofaro, Simone Faro. 428-439 [doi]
- The Necessity of Timekeeping in Adversarial QueueingMaik Weinard. 440-451 [doi]
- BDDs in a Branch and Cut FrameworkBernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer. 452-463 [doi]
- Parallel Smith-Waterman Algorithm for Local DNA Comparison in a Cluster of WorkstationsAzzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio Ayala-Rincón, Thomas Mailleux Santana. 464-475 [doi]
- Fast Algorithms for Weighted Bipartite MatchingJustus Schwartz, Angelika Steger, Andreas Weißl. 476-487 [doi]
- A Practical Minimal Perfect Hashing MethodFabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani. 488-500 [doi]
- Efficient and Experimental Meta-heuristics for MAX-SAT ProblemsDalila Boughaci, Habiba Drias. 501-512 [doi]
- Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random GraphsMark K. Goldberg, D. Hollinger, Malik Magdon-Ismail. 513-523 [doi]
- Local Clustering of Large Graphs by Approximate Fiedler VectorsPekka Orponen, Satu Elisa Schaeffer. 524-533 [doi]
- Almost FPRAS for Lattice Models of Protein FoldingAnna Gambin, Damian Wójtowicz. 534-544 [doi]
- Vertex Cover Approximations: Experiments and ObservationsEyjolfur Asgeirsson, Clifford Stein. 545-557 [doi]
- GRASP with Path-Relinking for the Maximum Diversity ProblemMarcos R. Q. de Andrade, Paulo M. F. de Andrade, Simone L. Martins, Alexandre Plastino. 558-569 [doi]
- How to Splay for loglog N-CompetitivenessGeorge F. Georgakopoulos. 570-579 [doi]
- Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup AlgorithmsFilippo Geraci, Roberto Grossi. 580-592 [doi]
- Optimal Competitive Online Ray Search with an Error-Prone RobotThomas Kamphans, Elmar Langetepe. 593-596 [doi]
- An Empirical Study for Inversions-Sensitive Sorting AlgorithmsAmr Elmasry, Abdelrahman Hammad. 597-601 [doi]
- Approximation Algorithm for Chromatic Index and Edge-Coloring of MultigraphsMartin Kochol, Nad a Krivonáková, Silvia Smejová. 602-605 [doi]
- Finding, Counting and Listing All Triangles in Large Graphs, an Experimental StudyThomas Schank, Dorothea Wagner. 606-609 [doi]
- Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based MatchingH. Bekker, E. P. Braad, Boris Goldengorin. 610-613 [doi]
- Developing Novel Statistical Bandwidths for Communication Networks with Incomplete InformationJános Levendovszky, Csego Orosz. 614-617 [doi]
- Dynamic Quality of Service Support in Virtual Private NetworksYuxiao Jia, Dimitrios Makrakis, Nicolas D. Georganas, Dan Ionescu. 618-621 [doi]