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