0 | -- | 0 | Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel. An SDP approach to multi-level crossing minimization |
0 | -- | 0 | Eduardo Uchoa, Renato Fonseca F. Werneck. Fast local search for the steiner problem in graphs |
0 | -- | 0 | Matthias F. Stallmann. A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study |
0 | -- | 0 | Matthias Müller-Hannemann, Renato Fonseca F. Werneck. Introduction to special issue ALENEX'11 |
0 | -- | 0 | Guy E. Blelloch, Dan Halperin. Introduction to special issue ALENEX'10 |
0 | -- | 0 | Robert Geisberger, Michael N. Rice, Peter Sanders, Vassilis J. Tsotras. Route planning with flexible edge restrictions |
0 | -- | 0 | Marcel R. Ackermann, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, Christian Sohler. StreamKM++: A clustering algorithm for data streams |
0 | -- | 0 | Charles Reams. Anatree: A Fast Data Structure for Anagrams |
0 | -- | 0 | Alexander Kröller, Tobias Baumgartner, Sándor P. Fekete, Christiane Schmidt. Exact solutions and bounds for general art gallery problems |
0 | -- | 0 | Christian Bachmaier, Wolfgang Brunner, Andreas Gleißner. Grid sifting: Leveling and crossing reduction |
0 | -- | 0 | Kai Christian Bader, Mikhail J. Atallah, Christian Grothoff. Efficient relaxed search in hierarchically clustered sequence datasets |
0 | -- | 0 | Isabelle Stanton, Ali Pinar. Constructing and sampling graphs with a prescribed joint degree distribution |
0 | -- | 0 | Daniel Delling, Bastian Katz, Thomas Pajor. Parallel computation of best connections in public transportation networks |
0 | -- | 0 | Jyothish Soman, Kishore Kothapalli, P. J. Narayanan. Discrete range searching primitive for the GPU and its applications |
0 | -- | 0 | John M. Ennis, Charles M. Fayle, Daniel M. Ennis. Assignment-minimum clique coverings |
0 | -- | 0 | Peter Sanders, Dominik Schultes. Engineering highway hierarchies |
0 | -- | 0 | David A. Bader, Philippas Tsigas. ACM journal on experimental algorithmics special issue on multicore algorithms |
0 | -- | 0 | Matthew Dellinger, Aaron Lindsay, Binoy Ravindran. An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms |
0 | -- | 0 | Iulian Moraru, David G. Andersen. Exact pattern matching with feed-forward bloom filters |
0 | -- | 0 | Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh. A topological sorting algorithm for large graphs |
0 | -- | 0 | Tolu Alabi, Jeffrey D. Blanchard, Bradley Gordon, Russel Steinbach. Fast <it>k</it>-selection algorithms for graphics processing units |