default search action
Search dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica15.bht:"
@article{DBLP:journals/algorithmica/AgarwalK96, author = {Pankaj K. Agarwal and Marc J. van Kreveld}, title = {Connected Component and Simple Polygon Intersection Searching}, journal = {Algorithmica}, volume = {15}, number = {6}, pages = {626--660}, year = {1996}, url = {https://doi.org/10.1007/BF01940884}, doi = {10.1007/BF01940884}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalK96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/AndersonBB96, author = {Richard J. Anderson and Paul Beame and Erik Brisson}, title = {Parallel Algorithms for Arrangements}, journal = {Algorithmica}, volume = {15}, number = {2}, pages = {104--125}, year = {1996}, url = {https://doi.org/10.1007/BF01941684}, doi = {10.1007/BF01941684}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AndersonBB96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ApostolicoP96, author = {Alberto Apostolico and Franco P. Preparata}, title = {Data Structures and Algorithms for the String Statistics Problem}, journal = {Algorithmica}, volume = {15}, number = {5}, pages = {481--494}, year = {1996}, url = {https://doi.org/10.1007/BF01955046}, doi = {10.1007/BF01955046}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ApostolicoP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BalasX96, author = {Egon Balas and Jue Xue}, title = {Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring}, journal = {Algorithmica}, volume = {15}, number = {5}, pages = {397--412}, year = {1996}, url = {https://doi.org/10.1007/BF01955041}, doi = {10.1007/BF01955041}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BalasX96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BaruahCPV96, author = {Sanjoy K. Baruah and N. K. Cohen and C. Greg Plaxton and Donald A. Varvel}, title = {Proportionate Progress: {A} Notion of Fairness in Resource Allocation}, journal = {Algorithmica}, volume = {15}, number = {6}, pages = {600--625}, year = {1996}, url = {https://doi.org/10.1007/BF01940883}, doi = {10.1007/BF01940883}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BaruahCPV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BattistaT96, author = {Giuseppe Di Battista and Roberto Tamassia}, title = {On-Line Maintenance of Triconnected Components with SPQR-Trees}, journal = {Algorithmica}, volume = {15}, number = {4}, pages = {302--318}, year = {1996}, url = {https://doi.org/10.1007/BF01961541}, doi = {10.1007/BF01961541}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BattistaT96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CaiK96, author = {Yang Cai and M. C. Kong}, title = {Nonpreemptive Scheduling of Periodic Tasks in Uni- and Multiprocessor Systems}, journal = {Algorithmica}, volume = {15}, number = {6}, pages = {572--599}, year = {1996}, url = {https://doi.org/10.1007/BF01940882}, doi = {10.1007/BF01940882}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/CaiK96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChazelleEGSS96, author = {Bernard Chazelle and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Jorge Stolfi}, title = {Lines in Space: Combinatorics and Algorithms}, journal = {Algorithmica}, volume = {15}, number = {5}, pages = {428--447}, year = {1996}, url = {https://doi.org/10.1007/BF01955043}, doi = {10.1007/BF01955043}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChazelleEGSS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CheriyanM96, author = {Joseph Cheriyan and Kurt Mehlhorn}, title = {Algorithms for Dense Graphs and Networks on the Random Access Computer}, journal = {Algorithmica}, volume = {15}, number = {6}, pages = {521--549}, year = {1996}, url = {https://doi.org/10.1007/BF01940880}, doi = {10.1007/BF01940880}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/CheriyanM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DillencourtS96, author = {Michael B. Dillencourt and Hanan Samet}, title = {Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees}, journal = {Algorithmica}, volume = {15}, number = {1}, pages = {82--102}, year = {1996}, url = {https://doi.org/10.1007/BF01942608}, doi = {10.1007/BF01942608}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DillencourtS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/EaswarakumarKRS96, author = {K. S. Easwarakumar and S. V. Krishnan and C. Pandu Rangan and S. Seshadri}, title = {Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph}, journal = {Algorithmica}, volume = {15}, number = {3}, pages = {242--255}, year = {1996}, url = {https://doi.org/10.1007/BF01975868}, doi = {10.1007/BF01975868}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/EaswarakumarKRS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/EdelsbrunnerS96, author = {Herbert Edelsbrunner and Nimish R. Shah}, title = {Incremental Topological Flipping Works for Regular Triangulations}, journal = {Algorithmica}, volume = {15}, number = {3}, pages = {223--241}, year = {1996}, url = {https://doi.org/10.1007/BF01975867}, doi = {10.1007/BF01975867}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/EdelsbrunnerS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Frederickson96, author = {Greg N. Frederickson}, title = {Searching Among Intervals and Compact Routing Tables}, journal = {Algorithmica}, volume = {15}, number = {5}, pages = {448--466}, year = {1996}, url = {https://doi.org/10.1007/BF01955044}, doi = {10.1007/BF01955044}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Frederickson96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GoodrichGB96, author = {Michael T. Goodrich and Mujtaba R. Ghouse and J. Bright}, title = {Sweep Methods for Parallel Computational Geometry}, journal = {Algorithmica}, volume = {15}, number = {2}, pages = {126--153}, year = {1996}, url = {https://doi.org/10.1007/BF01941685}, doi = {10.1007/BF01941685}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/GoodrichGB96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/HeideOW96, author = {Friedhelm Meyer auf der Heide and Brigitte Oesterdiekhoff and Rolf Wanka}, title = {Strongly Adaptive Token Distribution}, journal = {Algorithmica}, volume = {15}, number = {5}, pages = {413--427}, year = {1996}, url = {https://doi.org/10.1007/BF01955042}, doi = {10.1007/BF01955042}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/HeideOW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KalpakisY96, author = {Konstantinos Kalpakis and Yelena Yesha}, title = {Scheduling Tree DAGs on Parallel Architectures}, journal = {Algorithmica}, volume = {15}, number = {4}, pages = {373--396}, year = {1996}, url = {https://doi.org/10.1007/BF01961545}, doi = {10.1007/BF01961545}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KalpakisY96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KirkpatrickP96, author = {David G. Kirkpatrick and Teresa M. Przytycka}, title = {Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt}, journal = {Algorithmica}, volume = {15}, number = {2}, pages = {172--192}, year = {1996}, url = {https://doi.org/10.1007/BF01941687}, doi = {10.1007/BF01941687}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KirkpatrickP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KrizancNR96, author = {Danny Krizanc and Lata Narayanan and Rajeev Raman}, title = {Fast Deterministic Selection on Mesh-Connected Processor Arrays}, journal = {Algorithmica}, volume = {15}, number = {4}, pages = {319--331}, year = {1996}, url = {https://doi.org/10.1007/BF01961542}, doi = {10.1007/BF01961542}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KrizancNR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KuchemWW96, author = {Ruth Kuchem and Dorothea Wagner and Frank Wagner}, title = {Optimizing Area for Three-Layer Knock-Knee Channel Routing}, journal = {Algorithmica}, volume = {15}, number = {5}, pages = {495--519}, year = {1996}, url = {https://doi.org/10.1007/BF01955047}, doi = {10.1007/BF01955047}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KuchemWW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Lisper96, author = {Bj{\"{o}}rn Lisper}, title = {Preconditioning Index Set Transformations for Time-Optimal Affine Scheduling}, journal = {Algorithmica}, volume = {15}, number = {2}, pages = {193--203}, year = {1996}, url = {https://doi.org/10.1007/BF01941688}, doi = {10.1007/BF01941688}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Lisper96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Maley96, author = {F. Miller Maley}, title = {Testing Homotopic Routability Under Polygonal Wiring Rules}, journal = {Algorithmica}, volume = {15}, number = {1}, pages = {1--16}, year = {1996}, url = {https://doi.org/10.1007/BF01942604}, doi = {10.1007/BF01942604}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Maley96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Mishra96, author = {Bhubaneswar Mishra}, title = {Bidirectional Edges Problem: Part {I-A} Simple Algorithm}, journal = {Algorithmica}, volume = {15}, number = {3}, pages = {256--286}, year = {1996}, url = {https://doi.org/10.1007/BF01975869}, doi = {10.1007/BF01975869}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Mishra96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Nazareth96, author = {John L. Nazareth}, title = {The Implementation of Linear Programming Algorithms Bases on Homotopies}, journal = {Algorithmica}, volume = {15}, number = {4}, pages = {332--350}, year = {1996}, url = {https://doi.org/10.1007/BF01961543}, doi = {10.1007/BF01961543}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Nazareth96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/PanSL96, author = {Peichen Pan and Weiping Shi and C. L. Liu}, title = {Area Minimization for Hierarchical Floorplans}, journal = {Algorithmica}, volume = {15}, number = {6}, pages = {550--571}, year = {1996}, url = {https://doi.org/10.1007/BF01940881}, doi = {10.1007/BF01940881}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/PanSL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/PrasannaM96, author = {G. N. Srinivasa Prasanna and Bruce R. Musicus}, title = {The Optimal Control Approach to Generalized Multiprocessor Scheduling}, journal = {Algorithmica}, volume = {15}, number = {1}, pages = {17--49}, year = {1996}, url = {https://doi.org/10.1007/BF01942605}, doi = {10.1007/BF01942605}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/PrasannaM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ProvanS96, author = {J. Scott Provan and Douglas R. Shier}, title = {A Paradigm for Listing (s, t)-Cuts in Graphs}, journal = {Algorithmica}, volume = {15}, number = {4}, pages = {351--372}, year = {1996}, url = {https://doi.org/10.1007/BF01961544}, doi = {10.1007/BF01961544}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ProvanS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Rubinfeld96, author = {Ronitt Rubinfeld}, title = {Designing Checkers for Programs that Run in Parallel}, journal = {Algorithmica}, volume = {15}, number = {4}, pages = {287--301}, year = {1996}, url = {https://doi.org/10.1007/BF01961540}, doi = {10.1007/BF01961540}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Rubinfeld96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Sprugnoli96, author = {Renzo Sprugnoli}, title = {Recurrence Relations on Heaps}, journal = {Algorithmica}, volume = {15}, number = {5}, pages = {467--480}, year = {1996}, url = {https://doi.org/10.1007/BF01955045}, doi = {10.1007/BF01955045}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Sprugnoli96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/TamassiaV96, author = {Roberto Tamassia and Jeffrey Scott Vitter}, title = {Optimal Cooperative Search in Fractional Cascaded Data Structures}, journal = {Algorithmica}, volume = {15}, number = {2}, pages = {154--171}, year = {1996}, url = {https://doi.org/10.1007/BF01941686}, doi = {10.1007/BF01941686}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/TamassiaV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/TangZW96, author = {Shouwen Tang and Kaizhong Zhang and Xiaolin Wu}, title = {Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics}, journal = {Algorithmica}, volume = {15}, number = {1}, pages = {68--81}, year = {1996}, url = {https://doi.org/10.1007/BF01942607}, doi = {10.1007/BF01942607}, timestamp = {Thu, 09 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/TangZW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/WuMM96, author = {Sun Wu and Udi Manber and Eugene W. Myers}, title = {A Subquadratic Algorithm for Approximate Limited Expression Matching}, journal = {Algorithmica}, volume = {15}, number = {1}, pages = {50--67}, year = {1996}, url = {https://doi.org/10.1007/BF01942606}, doi = {10.1007/BF01942606}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/WuMM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Zhang96, author = {Kaizhong Zhang}, title = {A Constrained Edit Distance Between Unordered Labeled Trees}, journal = {Algorithmica}, volume = {15}, number = {3}, pages = {205--222}, year = {1996}, url = {https://doi.org/10.1007/BF01975866}, doi = {10.1007/BF01975866}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Zhang96.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.