default search action
Search dblp for Publications
export results for "toc:db/conf/alenex/alenex1999.bht:"
@inproceedings{DBLP:conf/alenex/AcharyaZS99, author = {Anurag Acharya and Huican Zhu and Kai Shen}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Adaptive Algorithms for Cache-Efficient Trie Search}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {296--311}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_18}, doi = {10.1007/3-540-48518-X\_18}, timestamp = {Thu, 27 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/AcharyaZS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/ArgeHVV99, author = {Lars Arge and Klaus H. Hinrichs and Jan Vahrenhold and Jeffrey Scott Vitter}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Efficient Bulk Operations on Dynamic R-trees}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {328--348}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_20}, doi = {10.1007/3-540-48518-X\_20}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/ArgeHVV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/CaldwellKM99, author = {Andrew E. Caldwell and Andrew B. Kahng and Igor L. Markov}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Design and Implementation of the Fiduccia-Mattheyses Heuristic for {VLSI} Netlist Partitioning}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {177--193}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_11}, doi = {10.1007/3-540-48518-X\_11}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/CaldwellKM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/CsirikJKSW99, author = {J{\'{a}}nos Csirik and David S. Johnson and Claire Kenyon and Peter W. Shor and Richard R. Weber}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {A Self Organizing Bin Packing Heuristic}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {246--265}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_15}, doi = {10.1007/3-540-48518-X\_15}, timestamp = {Mon, 28 Oct 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/CsirikJKSW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/CwilichDLPW99, author = {Sebastian Cwilich and Mei Deng and David F. Lynch and S. J. Philips and Jeffery R. Westbrook}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Algorithms for Restoration Planning in a Telecommunications Network}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {194--209}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_12}, doi = {10.1007/3-540-48518-X\_12}, timestamp = {Mon, 08 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/CwilichDLPW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/GoodrichHHT99, author = {Michael T. Goodrich and Mark Handy and Beno{\^{\i}}t Hudson and Roberto Tamassia}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Accessing the Internal Organization of Data Structures in the {JDSL} Library}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {124--139}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_8}, doi = {10.1007/3-540-48518-X\_8}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/GoodrichHHT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/HeilemanPA99, author = {Gregory L. Heileman and Carlos E. Pizano and Chaouki T. Abdallah}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Image Watermarking for Copyright Protection}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {226--245}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_14}, doi = {10.1007/3-540-48518-X\_14}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/HeilemanPA99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/HelmanJ99, author = {David R. Helman and Joseph F. J{\'{a}}J{\'{a}}}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Designing Practical Efficient Algorithms for Symmetric Multiprocessors}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {37--56}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_3}, doi = {10.1007/3-540-48518-X\_3}, timestamp = {Fri, 02 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/HelmanJ99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/Levine99, author = {Matthew S. Levine}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Finding the Right Cutting Planes for the {TSP}}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {266--281}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_16}, doi = {10.1007/3-540-48518-X\_16}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/Levine99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/MilidiuPL99, author = {Ruy Luiz Milidi{\'{u}} and Artur Alves Pessoa and Eduardo Sany Laber}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Efficient Implementation of the {WARM-UP} Algorithm for the Construction of Length-Restricted Prefix Codes}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {1--17}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_1}, doi = {10.1007/3-540-48518-X\_1}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/MilidiuPL99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/MountP99, author = {David M. Mount and Fan{-}Tao Pu}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Binary Space Partitions in Pl{\"{u}}cker Space}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {94--113}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_6}, doi = {10.1007/3-540-48518-X\_6}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/MountP99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/Muller-HannemannS99, author = {Matthias M{\"{u}}ller{-}Hannemann and Alexander Schwartz}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Implementing Weighted b-Matching Algorithms: Insights from a Computational Study}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {18--36}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_2}, doi = {10.1007/3-540-48518-X\_2}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/Muller-HannemannS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/PizzoniaB99, author = {Maurizio Pizzonia and Giuseppe Di Battista}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Object-Oriented Design of Graph Oriented Data Structures}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {140--155}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_9}, doi = {10.1007/3-540-48518-X\_9}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/PizzoniaB99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/Sanders99, author = {Peter Sanders}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Fast Priority Queues for Cached Memory}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {312--327}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_19}, doi = {10.1007/3-540-48518-X\_19}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/Sanders99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/Schirra99, author = {Stefan Schirra}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {A Case Study on the Cost of Geometric Computing}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {156--176}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_10}, doi = {10.1007/3-540-48518-X\_10}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/Schirra99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/Shibuya99, author = {Tetsuo Shibuya}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Computing the \emph{n {\texttimes} m} Shortest Paths Efficently}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {210--225}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_13}, doi = {10.1007/3-540-48518-X\_13}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/Shibuya99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/SixT99, author = {Janet M. Six and Ioannis G. Tollis}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Circular Drawings of Biconnected Graphs}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {57--73}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_4}, doi = {10.1007/3-540-48518-X\_4}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/SixT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/StallmannBG99, author = {Matthias F. M. Stallmann and Franc Brglez and Debabrata Ghosh}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Heuristics and Experimental Design for Bigraph Crossing Number Minimization}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {74--93}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_5}, doi = {10.1007/3-540-48518-X\_5}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/StallmannBG99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/WalkerS99, author = {Robert J. Walker and Jack Snoeyink}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Practical Point-in-Polygon Tests Using {CSG} Representations of Polygons}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {114--123}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_7}, doi = {10.1007/3-540-48518-X\_7}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/WalkerS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/ZachariasenW99, author = {Martin Zachariasen and Pawel Winter}, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm}, booktitle = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, pages = {282--295}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X\_17}, doi = {10.1007/3-540-48518-X\_17}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/ZachariasenW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/alenex/1999, editor = {Michael T. Goodrich and Catherine C. McGeoch}, title = {Algorithm Engineering and Experimentation, International Workshop {ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {1619}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48518-X}, doi = {10.1007/3-540-48518-X}, isbn = {3-540-66227-8}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/1999.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.