The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "ACM Journal of Experimental Algorithmics"( http://dblp.L3S.de/Venues/ACM_Journal_of_Experimental_Algorithmics )

URL (DBLP): http://dblp.uni-trier.de/db/journals/jea

Publication years (Num. hits)
1996-1998 (18) 1999-2000 (25) 2001-2002 (22) 2003-2005 (27) 2006 (17) 2007-2008 (41) 2009 (28) 2010-2011 (35) 2012 (16) 2013-2014 (32) 2015-2016 (25) 2017-2018 (21)
Publication types (Num. hits)
article(307)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 218 occurrences of 170 keywords

Results
Found 307 publication records. Showing 307 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Moritz von Looz, Henning Meyerhenke Updating Dynamic Random Hyperbolic Graphs in Sublinear Time. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Sami Sieranoja, Pasi Fränti Constructing a High-Dimensional kNN-Graph Using a Z-Order Curve. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Michael Hamann, Ben Strasser Graph Bisection with Pareto Optimization. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj Improving the Betweenness Centrality of a Node by Adding Links. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano Computing Critical Nodes in Directed Graphs. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Michael Hamann, Ulrich Meyer 0001, Manuel Penschuck, Hung Tran, Dorothea Wagner I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Constantinos Tsirogiannis, Frank Staals, Vincent Pellissier Computing the Expected Value and Variance of Geometric Measures. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Monika Henzinger, Alexander Noe, Christian Schulz 0003, Darren Strash Practical Minimum Cut Algorithms. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Jeffrey A. Robinson, Susan V. Vrbsky, Xiaoyan Hong, Brian P. Eddy Analysis of a High-Performance TSP Solver on the GPU. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Zoltán Ádám Mann Complexity of Coloring Random Graphs: An Experimental Study of the Hardest Region. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Peyman Afshani, Mark de Berg, Henri Casanova, Ben Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner Connection Scan Algorithm. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Valentin Polischchuk, Vijaya Ramachandran, Rezaul A. Chowdhury Editorial: ALENEX 2017 Special Issue. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Flavio Vella, Massimo Bernaschi, Giancarlo Carbone Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2018 DBLP  BibTeX  RDF
1Michael Kerber, Dmitriy Morozov, Arnur Nigmetov Geometry Helps to Compare Persistence Diagrams. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Paul-Virak Khuong, Pat Morin Array Layouts for Comparison-Based Searching. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Uwe Baier, Timo Beller, Enno Ohlebusch Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tommi Hirvola, Jorma Tarhio Bit-Parallel Approximate Matching of Circular Strings with k Mismatches. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Simon Gog, Roberto Konow, Gonzalo Navarro Practical Compact Indexes for Top-k Document Retrieval. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Michael Horton, Stef Sijben Compact Flow Diagrams for State Sequences. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Matthias Poloczek, David P. Williamson An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Joachim Gudmundsson, Jyrki Katajainen Editorial, SEA 2014 Special Issue. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Conrad W. Rosenbrock, Wiley S. Morgan, Gus L. W. Hart, Stefano Curtarolo, Rodney W. Forcade Numerical Algorithm for Pólya Enumeration Theorem. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter Evaluation of Labeling Strategies for Rotating Maps. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Martin Marinov, Nicholas Nash, David Gregg Practical Algorithms for Finding Extremal Sets. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Takahisa Toda, Takehide Soh Implementing Efficient All Solutions SAT Solvers. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Timo Bingmann, Johannes Fischer 0001, Vitaly Osipov Inducing Suffix and LCP Arrays in External Memory. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gonzalo Navarro, Alberto Ordóñez Pereira Faster Compressed Suffix Trees for Repetitive Collections. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Roland Glantz, Henning Meyerhenke, Christian Schulz 0003 Tree-Based Coarsening and Partitioning of Complex Networks. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jiju Peethambaran, Amal Dev Parakkat, Ramanathan Muthuganapathy An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Peter Sanders 0001, Norbert Zeh Introduction to Special Issue ALENEX 2013. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi Lazy Lempel-Ziv Factorization Algorithms. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alexandros Efentakis, Dieter Pfoser ReHub: Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale Networks. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Juha Kärkkäinen, Dominik Kempa LCP Array Construction in External Memory. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Catherine C. McGeoch In Memoriam: David S. Johnson. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1David Coudert, Dorian Mazauric, Nicolas Nisse Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Martin Bergner, Marco E. Lübbecke, Jonas T. Witt A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Julian Dibbelt, Ben Strasser, Dorothea Wagner Customizable Contraction Hierarchies. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer 0001 Short and Simple Cycle Separators in Planar Graphs. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ivor T. A. Spence Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nathann Cohen, David Coudert, Aurélien Lancin On Computing the Gromov Hyperbolicity. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Markus Chimani, Robert Zeranski Upward Planarity Testing in Practice: SAT Formulations and Comparative Study. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Julian R. Ullmann Degree Reduction in Labeled Graph Retrieval. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ivo Hedtke Upgrading Subgroup Triple-Product-Property Triples. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Irene Finocchi, Marco Finocchi, Emanuele G. Fusco Clique Counting in MapReduce: Algorithms and Experiments. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ilya Safro, Peter Sanders 0001, Christian Schulz 0003 Advanced Coarsening Schemes for Graph Partitioning. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1B. O. Fagginger Auer, Rob H. Bisseling Efficient Matching for Column Intersection Graphs. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Gonzalo Navarro, Simon J. Puglisi, Daniel Valenzuela 0001 General Document Retrieval in Compact Space. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Asaf Frieder, Liam Roditty An Experimental Study on Approximating k Shortest Simple Paths. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Julian Dibbelt, Thomas Pajor, Dorothea Wagner User-Constrained Multimodal Route Planning. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Rodrigo González, Gonzalo Navarro, Hector Ferrada Locally Compressed Suffix Arrays. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Robert Görke, Andrea Kappes, Dorothea Wagner Experiments on Density-Constrained Graph Clustering. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Claudio Angione, Annalisa Occhipinti, Giuseppe Nicosia Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Roberto Grossi, Giuseppe Ottaviano Fast Compressed Tries through Path Decompositions. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Dennis Luxen, Dennis Schieferdecker Candidate Sets for Alternative Routes in Road Networks. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Gustavo Rodrigues Galvão, Zanoni Dias An Audit Tool for Genome Rearrangement Algorithms. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1David A. Bader, Petra Mutzel Introduction to Special Issue ALENEX'12. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1David F. Manlove, Gregg O'Malley Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Magnus Wahlström Randomized Rounding in the Presence of a Cardinality Constraint. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ralf Klasing Editorial. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Tomasz Jurkiewicz, Kurt Mehlhorn On a Model of Virtual Address Translation. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Gabriel Moruz, Andrei Negoescu, Christian Neumann, Volker Weichert Engineering Efficient Paging Algorithms. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Tina M. Kouri, Dinesh P. Mehta Faster reaction mapping through improved naming techniques. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Gernot Veit Batz, Robert Geisberger, Peter Sanders 0001, Christian Vetter Minimum time-dependent travel times with contraction hierarchies. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Charles Delort, Olivier Spanjaard A hybrid dynamic programming approach to the biobjective binary knapsack problem. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt, Dorothea Wagner Dynamic graph clustering combining modularity and smoothness. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1David Eppstein, Maarten Löffler, Darren Strash Listing All Maximal Cliques in Large Sparse Real-World Graphs. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Umberto Ferraro Petrillo, Fabrizio Grandoni 0001, Giuseppe F. Italiano Data structures resilient to memory faults: An experimental study of dictionaries. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Micha Hofri Optimal selection and sorting via dynamic programming. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Paola Festa Foreword to the special issue SEA 2010. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Chandrashekhar Nagarajan, David P. Williamson An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Charalampos S. Kouzinopoulos, Konstantinos G. Margaritis Exact online two-dimensional pattern matching using multiple pattern matching algorithms. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Pierre Bonami, Jon Lee 0001, Sven Leyffer, Andreas Wächter On branching rules for convex mixed-integer nonlinear optimization. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Stefan Canzar, Khaled M. Elbassioni, Julián Mestre A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck Alternative routes in road networks. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Simon Gog, Enno Ohlebusch Compressed suffix trees: Efficient computation and storage of LCP-values. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christian Bachmaier, Wolfgang Brunner, Andreas Gleißner Grid sifting: Leveling and crossing reduction. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marcel R. Ackermann, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, Christian Sohler StreamKM++: A clustering algorithm for data streams. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kai Christian Bader, Mikhail J. Atallah, Christian Grothoff Efficient relaxed search in hierarchically clustered sequence datasets. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jyothish Soman, Kishore Kothapalli, P. J. Narayanan Discrete range searching primitive for the GPU and its applications. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Peter Sanders 0001, Dominik Schultes Engineering highway hierarchies. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1John M. Ennis, Charles M. Fayle, Daniel M. Ennis Assignment-minimum clique coverings. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tolu Alabi, Jeffrey D. Blanchard, Bradley Gordon, Russel Steinbach Fast k-selection algorithms for graphics processing units. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Eduardo Uchoa, Renato Fonseca F. Werneck Fast local search for the steiner problem in graphs. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Charles Reams Anatree: A Fast Data Structure for Anagrams. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Matthew Dellinger, Aaron Lindsay, Binoy Ravindran An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1David A. Bader, Philippas Tsigas ACM journal on experimental algorithmics special issue on multicore algorithms. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Guy E. Blelloch, Dan Halperin Introduction to special issue ALENEX'10. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexander Kröller, Tobias Baumgartner 0001, Sándor P. Fekete, Christiane Schmidt 0001 Exact solutions and bounds for general art gallery problems. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Delling, Bastian Katz, Thomas Pajor Parallel computation of best connections in public transportation networks. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Matthias F. Stallmann A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert Geisberger, Michael N. Rice, Peter Sanders 0001, Vassilis J. Tsotras Route planning with flexible edge restrictions. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefan Huber 0001, Martin Held Motorcycle graphs: Stochastic properties motivate an efficient yet simple implementation. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Tobias Friedrich 0001, Marvin Künnemann, Thomas Sauerwald Quasirandom rumor spreading: An experimental analysis. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Iulian Moraru, David G. Andersen Exact pattern matching with feed-forward bloom filters. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Patrick Prosser, Chris Unsworth Limited discrepancy search revisited. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lionel Tabourier, Camille Roth, Jean-Philippe Cointet Generating constrained random graphs using multiple edge switches. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh A topological sorting algorithm for large graphs. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 307 (100 per page; Change: )
Pages: [1][2][3][4][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license