default search action
Search dblp for Publications
export results for "toc:db/conf/alenex/alenex2002.bht:"
@inproceedings{DBLP:conf/alenex/AleksandrovDGM02, author = {Lyudmil Aleksandrov and Hristo N. Djidjev and Hua Guo and Anil Maheshwari}, editor = {David M. Mount and Clifford Stein}, title = {Partitioning Planar Graphs with Costs and Weights}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {98--110}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_8}, doi = {10.1007/3-540-45643-0\_8}, timestamp = {Wed, 14 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/AleksandrovDGM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/AragaoW02, author = {Marcus Poggi de Arag{\~{a}}o and Renato Fonseca F. Werneck}, editor = {David M. Mount and Clifford Stein}, title = {On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {1--15}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_1}, doi = {10.1007/3-540-45643-0\_1}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/AragaoW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/CattaneoFPI02, author = {Giuseppe Cattaneo and Pompeo Faruolo and Umberto Ferraro Petrillo and Giuseppe F. Italiano}, editor = {David M. Mount and Clifford Stein}, title = {Maintaining Dynamic Minimum Spanning Trees: An Experimental Study}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {111--125}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_9}, doi = {10.1007/3-540-45643-0\_9}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/CattaneoFPI02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/ChaudhryC02, author = {Geeta Chaudhry and Thomas H. Cormen}, editor = {David M. Mount and Clifford Stein}, title = {Getting More from Out-of-Core Columnsort}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {143--154}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_11}, doi = {10.1007/3-540-45643-0\_11}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/ChaudhryC02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/Chen02, author = {Jingchao Chen}, editor = {David M. Mount and Clifford Stein}, title = {An Improvement on Tree Selection Sort}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {194--206}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_15}, doi = {10.1007/3-540-45643-0\_15}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/Chen02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/CurcioLV02, author = {Massimiliano Curcio and Stefano Leonardi and Andrea Vitaletti}, editor = {David M. Mount and Clifford Stein}, title = {An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {71--85}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_6}, doi = {10.1007/3-540-45643-0\_6}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/CurcioLV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/GustedtMT02, author = {Jens Gustedt and Ole A. M{\ae}hle and Jan Arne Telle}, editor = {David M. Mount and Clifford Stein}, title = {The Treewidth of Java Programs}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {86--97}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_7}, doi = {10.1007/3-540-45643-0\_7}, timestamp = {Thu, 01 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/GustedtMT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/MotterM02, author = {DoRon B. Motter and Igor L. Markov}, editor = {David M. Mount and Clifford Stein}, title = {A Compressed Breadth-First Search for Satisfiability}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {29--42}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_3}, doi = {10.1007/3-540-45643-0\_3}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/MotterM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/PettieRS02, author = {Seth Pettie and Vijaya Ramachandran and Srinath Sridhar}, editor = {David M. Mount and Clifford Stein}, title = {Experimental Evaluation of a New Shortest Path Algorithm}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {126--142}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_10}, doi = {10.1007/3-540-45643-0\_10}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/PettieRS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/PhanSS02, author = {Vinhthuy T. Phan and Pavel Sumazin and Steven Skiena}, editor = {David M. Mount and Clifford Stein}, title = {A Time-Sensitive System for Black-Box Combinatorial Optimization}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {16--18}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_2}, doi = {10.1007/3-540-45643-0\_2}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/PhanSS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/Phillips02, author = {Steven J. Phillips}, editor = {David M. Mount and Clifford Stein}, title = {Acceleration of K-Means and Related Clustering Algorithms}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {166--177}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_13}, doi = {10.1007/3-540-45643-0\_13}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/Phillips02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/ProcopiucAH02, author = {Cecilia Magdalena Procopiuc and Pankaj K. Agarwal and Sariel Har{-}Peled}, editor = {David M. Mount and Clifford Stein}, title = {STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {178--193}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_14}, doi = {10.1007/3-540-45643-0\_14}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/ProcopiucAH02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/PruhsW02, author = {Kirk Pruhs and Eric Wiewiora}, editor = {David M. Mount and Clifford Stein}, title = {Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {60--70}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_5}, doi = {10.1007/3-540-45643-0\_5}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/PruhsW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/RafalinSS02, author = {Eynat Rafalin and Diane L. Souvaine and Ileana Streinu}, editor = {David M. Mount and Clifford Stein}, title = {Topological Sweep in Degenerate Cases}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {155--165}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_12}, doi = {10.1007/3-540-45643-0\_12}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/RafalinSS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/SchulzWZ02, author = {Frank Schulz and Dorothea Wagner and Christos D. Zaroliagis}, editor = {David M. Mount and Clifford Stein}, title = {Using Multi-level Graphs for Timetable Information in Railway Systems}, booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, pages = {43--59}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0\_4}, doi = {10.1007/3-540-45643-0\_4}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/SchulzWZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/alenex/2002, editor = {David M. Mount and Clifford Stein}, title = {Algorithm Engineering and Experiments, 4th International Workshop, {ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2409}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45643-0}, doi = {10.1007/3-540-45643-0}, isbn = {3-540-43977-3}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/2002.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.