The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "ALENEX"( http://dblp.L3S.de/Venues/ALENEX )

URL (DBLP): http://dblp.uni-trier.de/db/conf/alenex

Publication years (Num. hits)
1999 (21) 2001 (19) 2002 (16) 2003 (15) 2006 (17) 2007 (16) 2008 (16) 2009 (17) 2010 (17) 2011 (17) 2012 (17) 2013 (16) 2014 (16) 2015 (16) 2016 (16) 2017 (22) 2018 (20) 2019 (18) 2020 (18) 2021 (17) 2022 (19) 2023 (18)
Publication types (Num. hits)
inproceedings(362) proceedings(22)
Venues (Conferences, Journals, ...)
ALENEX(384)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords

Results
Found 384 publication records. Showing 384 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Eyjólfur Ingi Ásgeirsson, Cliff Stein 0001 Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1David M. Mount Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rodrigo Paredes, Gonzalo Navarro 0001 Optimal Incremental Sorting. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1John Hugg, Eynat Rafalin, Kathryn Seyboth, Diane L. Souvaine An Experimental Study of Old and New Depth Measures. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Efi Fogel, Dan Halperin Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Oskar Sandberg Distributed Routing in Small-World Networks. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Adam Kirsch, Michael Mitzenmacher Distance-Sensitive Bloom Filters. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Srinivas R. Kashyap, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik Fast Reconfiguration of Data Placement in Parallel Disks. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Idit Haran, Dan Halperin An Experimental Study of Point Location in General Planar Arrangements. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Rajeev Raman, Matthias F. Stallmann (eds.) Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, ALENEX 2006, Miami, Florida, USA, January 21, 2006 Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Grzegorz Malewicz Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty. Search on Bibsonomy ALENEX The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang 0001 Fast Prefix Matching of Bounded Strings. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Erik D. Demaine Open Problems from ALENEX 2003. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1F. Betül Atalay, David M. Mount Interpolation over Light Fields with Applications in Computer Graphics. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Lars Arge, Andrew Danner, Sha-Mayn Teh I/O-efficient Point Location Using Persistent B-Trees. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1John Hershberger 0001, Matthew Maxel, Subhash Suri Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Mauricio G. C. Resende, Renato Fonseca F. Werneck On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Richard E. Ladner (eds.) Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, January 11, 2003 Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Ranjan Sinha, Justin Zobel Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1David L. Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor The Cutting-Stock Approach to Bin Packing: Theory and Experiments. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Olivier Devillers, Sylvain Pion Efficient Exact Geometric Predicates for Delauny Triangulations. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Christos Gkantsidis, Milena Mihail, Ellen W. Zegura The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Lars Arge Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Luzi Anderegg, Stephan J. Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Gonzalo Navarro 0001, Rodrigo Paredes Practical Constraction of Metric t-Spanners. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions. Search on Bibsonomy ALENEX The full citation details ... 2003 DBLP  BibTeX  RDF
1Massimiliano Curcio, Stefano Leonardi 0001, Andrea Vitaletti An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jens Gustedt, Ole A. Mæhle, Jan Arne Telle The Treewidth of Java Programs. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari Partitioning Planar Graphs with Costs and Weights. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Frank Schulz 0001, Dorothea Wagner, Christos D. Zaroliagis Using Multi-level Graphs for Timetable Information in Railway Systems. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jingchao Chen An Improvement on Tree Selection Sort. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Marcus Poggi de Aragão, Renato Fonseca F. Werneck On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Eynat Rafalin, Diane L. Souvaine, Ileana Streinu Topological Sweep in Degenerate Cases. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Geeta Chaudhry, Thomas H. Cormen Getting More from Out-of-Core Columnsort. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Kirk Pruhs, Eric Wiewiora Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1DoRon B. Motter, Igor L. Markov A Compressed Breadth-First Search for Satisfiability. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Seth Pettie, Vijaya Ramachandran, Srinath Sridhar 0001 Experimental Evaluation of a New Shortest Path Algorithm. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1David M. Mount, Clifford Stein 0001 (eds.) Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Vinhthuy T. Phan, Pavel Sumazin, Steven Skiena A Time-Sensitive System for Black-Box Combinatorial Optimization. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Steven J. Phillips Acceleration of K-Means and Related Clustering Algorithms. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Walter Willinger New Algorithmic Challenges Arising in Measurement-Driven Networking Research. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Vitus J. Leung, Sandy Irani Experimental Results on Statistical Approaches to Page Replacement Policies. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  BibTeX  RDF
1Kurt Mehlhorn, Mark Ziegelmann CNOP - A Package for Constrained Network Optimization. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  BibTeX  RDF
1Eric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Anna R. Karlin Spectral Analysis for Data Mining. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Adam L. Buchsbaum, Jack Snoeyink (eds.) Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Irene Finocchi, Rossella Petreschi Hierarchical Clustering of Trees: Algorithms and Experiments. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha Biased Skip Lists for Highly Skewed Access Patterns. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Saurabh Sethia, Martin Held, Joseph S. B. Mitchell PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Ulrik Brandes, Frank Schulz 0001, Dorothea Wagner, Thomas Willhalm Travel Planning with Self-Made Maps. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Songrit Maneewongvatana, David M. Mount An Empirical Study of a New Approach to Nearest Neighbor Searching. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Veli Mäkinen Trade Off Between Compression and Search Times in Compact Suffix Array. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Michael Mitzenmacher, Sean Owen Estimating Resemblance of MIDI Documents. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Clint Hepner, Clifford Stein 0001 Implementation of a PTAS for Scheduling with Release Dates. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro Experiments on Adaptive Set Intersections for Text Retrieval Systems. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Edgar Chávez, Gonzalo Navarro 0001 A Probabilistic Spell for the Curse of Dimensionality. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Donald F. Towsley Network Tomography through End-to-End Measurements. Search on Bibsonomy ALENEX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Sebastian Cwilich, Mei Deng, David F. Lynch, S. J. Philips, Jeffery R. Westbrook Algorithms for Restoration Planning in a Telecommunications Network. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Tetsuo Shibuya Computing the n × m Shortest Paths Efficently. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia Accessing the Internal Organization of Data Structures in the JDSL Library. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Martin Zachariasen, Pawel Winter Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Matthew S. Levine Finding the Right Cutting Planes for the TSP. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Gregory L. Heileman, Carlos E. Pizano, Chaouki T. Abdallah Image Watermarking for Copyright Protection. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Robert J. Walker, Jack Snoeyink Practical Point-in-Polygon Tests Using CSG Representations of Polygons. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Janet M. Six, Ioannis G. Tollis Circular Drawings of Biconnected Graphs. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Matthias Müller-Hannemann, Alexander Schwartz Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1David R. Helman, Joseph F. JáJá Designing Practical Efficient Algorithms for Symmetric Multiprocessors. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber A Self Organizing Bin Packing Heuristic. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1David M. Mount, Fan-Tao Pu Binary Space Partitions in Plücker Space. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Peter Sanders 0001 Fast Priority Queues for Cached Memory. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Stefan Schirra A Case Study on the Cost of Geometric Computing. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter Efficient Bulk Operations on Dynamic R-trees. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Anurag Acharya 0001, Huican Zhu, Kai Shen Adaptive Algorithms for Cache-Efficient Trie Search. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh Heuristics and Experimental Design for Bigraph Crossing Number Minimization. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Crossing number minimization in graphs, graph equivalence classes, design of experiments
1Michael T. Goodrich, Catherine C. McGeoch (eds.) Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Maurizio Pizzonia, Giuseppe Di Battista Object-Oriented Design of Graph Oriented Data Structures. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #301 - #384 of 384 (100 per page; Change: )
Pages: [<<][1][2][3][4]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license