Search dblp for Publications

export results for "toc:db/journals/algorithmica/algorithmica53.bht:"

 download as .bib file

@article{DBLP:journals/algorithmica/AbamBPS09,
  author       = {Mohammad Ali Abam and
                  Mark de Berg and
                  Sheung{-}Hung Poon and
                  Bettina Speckmann},
  title        = {Kinetic Collision Detection for Convex Fat Objects},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {457--473},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9019-4},
  doi          = {10.1007/S00453-007-9019-4},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AbamBPS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AfshaniC09,
  author       = {Peyman Afshani and
                  Timothy M. Chan},
  title        = {Dynamic Connectivity for Axis-Parallel Rectangles},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {474--487},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9234-7},
  doi          = {10.1007/S00453-008-9234-7},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AfshaniC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AmbuhlM09,
  author       = {Christoph Amb{\"{u}}hl and
                  Monaldo Mastrolilli},
  title        = {Single Machine Precedence Constrained Scheduling Is a Vertex Cover
                  Problem},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {488--503},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9251-6},
  doi          = {10.1007/S00453-008-9251-6},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AmbuhlM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AmirBLP09,
  author       = {Amihood Amir and
                  Ayelet Butman and
                  Moshe Lewenstein and
                  Ely Porat},
  title        = {Real Two Dimensional Scaled Matching},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {314--336},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9021-x},
  doi          = {10.1007/S00453-007-9021-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AmirBLP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ArgeBH09,
  author       = {Lars Arge and
                  Mark de Berg and
                  Herman J. Haverkort},
  title        = {Cache-Oblivious R-Trees},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {1},
  pages        = {50--68},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9007-8},
  doi          = {10.1007/S00453-007-9007-8},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ArgeBH09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ArpeM09,
  author       = {Jan Arpe and
                  Bodo Manthey},
  title        = {Approximability of Minimum AND-Circuits},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {337--357},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9039-0},
  doi          = {10.1007/S00453-007-9039-0},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ArpeM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AzarE09,
  author       = {Yossi Azar and
                  Thomas Erlebach},
  title        = {Foreword},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {455--456},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9262-3},
  doi          = {10.1007/S00453-008-9262-3},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AzarE09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BeregDJ09,
  author       = {Sergey Bereg and
                  Ovidiu Daescu and
                  Minghui Jiang},
  title        = {A {PTAS} for Cutting Out Polygons with Lines},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {2},
  pages        = {157--171},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9182-2},
  doi          = {10.1007/S00453-008-9182-2},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BeregDJ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BermanJ09,
  author       = {Piotr Berman and
                  Jieun K. Jeong},
  title        = {Consistent Sets of Secondary Structures in Proteins},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {1},
  pages        = {16--34},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9068-8},
  doi          = {10.1007/S00453-007-9068-8},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BermanJ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChanWY09,
  author       = {Joseph Wun{-}Tat Chan and
                  Prudence W. H. Wong and
                  Fencol C. C. Yung},
  title        = {On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation
                  Analysis},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {2},
  pages        = {172--206},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9185-z},
  doi          = {10.1007/S00453-008-9185-Z},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChanWY09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChenC09,
  author       = {Xujin Chen and
                  Bo Chen},
  title        = {Approximation Algorithms for Soft-Capacitated Facility Location in
                  Capacitated Network Design},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {263--297},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9032-7},
  doi          = {10.1007/S00453-007-9032-7},
  timestamp    = {Wed, 21 Mar 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChenC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChenD09,
  author       = {Xi Chen and
                  Xiaotie Deng},
  title        = {A Simplicial Approach for Discrete Fixed Point Theorems},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {2},
  pages        = {250--262},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9183-1},
  doi          = {10.1007/S00453-008-9183-1},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChenD09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChenL09,
  author       = {Danny Z. Chen and
                  D. T. Lee},
  title        = {Guest Editors' Forward},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {2},
  pages        = {155--156},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9186-y},
  doi          = {10.1007/S00453-008-9186-Y},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChenL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/CohenFIKP09,
  author       = {Reuven Cohen and
                  Pierre Fraigniaud and
                  David Ilcinkas and
                  Amos Korman and
                  David Peleg},
  title        = {Labeling Schemes for Tree Representation},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {1},
  pages        = {1--15},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9089-3},
  doi          = {10.1007/S00453-007-9089-3},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CohenFIKP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/EbenlendrJS09,
  author       = {Tom{\'{a}}s Ebenlendr and
                  Wojciech Jawor and
                  Jir{\'{\i}} Sgall},
  title        = {Preemptive Online Scheduling: Optimal Algorithms for All Speeds},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {504--522},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9235-6},
  doi          = {10.1007/S00453-008-9235-6},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/EbenlendrJS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/EisenbrandKSX09,
  author       = {Friedrich Eisenbrand and
                  Andreas Karrenbauer and
                  Martin Skutella and
                  Chihao Xu},
  title        = {Multiline Addressing by Network Flow},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {583--596},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9252-5},
  doi          = {10.1007/S00453-008-9252-5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/EisenbrandKSX09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/EnglertW09,
  author       = {Matthias Englert and
                  Matthias Westermann},
  title        = {Lower and Upper Bounds on {FIFO} Buffer Management in QoS Switches},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {523--548},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9236-5},
  doi          = {10.1007/S00453-008-9236-5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/EnglertW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/EpsteinEL09,
  author       = {Leah Epstein and
                  Thomas Erlebach and
                  Asaf Levin},
  title        = {Variable Sized Online Interval Coloring with Bandwidth},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {385--401},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9071-0},
  doi          = {10.1007/S00453-007-9071-0},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/EpsteinEL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FominFN09,
  author       = {Fedor V. Fomin and
                  Pierre Fraigniaud and
                  Nicolas Nisse},
  title        = {Nondeterministic Graph Searching: From Pathwidth to Treewidth},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {358--373},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9041-6},
  doi          = {10.1007/S00453-007-9041-6},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FominFN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GangulyB09,
  author       = {Sumit Ganguly and
                  Lakshminath Bhuvanagiri},
  title        = {Hierarchical Sampling from Sketches: Estimating Functions over Data
                  Streams},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {549--582},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9260-5},
  doi          = {10.1007/S00453-008-9260-5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GangulyB09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HajiaghayiKS09,
  author       = {Mohammad Taghi Hajiaghayi and
                  Guy Kortsarz and
                  Mohammad R. Salavatipour},
  title        = {Approximating Buy-at-Bulk and Shallow-Light \emph{k}-Steiner Trees},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {1},
  pages        = {89--103},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9013-x},
  doi          = {10.1007/S00453-007-9013-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HajiaghayiKS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Hoefer09,
  author       = {Martin Hoefer},
  title        = {Non-Cooperative Tree Creation},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {1},
  pages        = {104--131},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9014-9},
  doi          = {10.1007/S00453-007-9014-9},
  timestamp    = {Fri, 26 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Hoefer09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KarakostasK09,
  author       = {George Karakostas and
                  Stavros G. Kolliopoulos},
  title        = {Stackelberg Strategies for Selfish Routing in General Multicommodity
                  Networks},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {1},
  pages        = {132--153},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9018-5},
  doi          = {10.1007/S00453-007-9018-5},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KarakostasK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KarakostasK09a,
  author       = {George Karakostas and
                  Stavros G. Kolliopoulos},
  title        = {Edge Pricing of Multicommodity Networks for Selfish Users with Elastic
                  Demands},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {2},
  pages        = {225--249},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9181-3},
  doi          = {10.1007/S00453-008-9181-3},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KarakostasK09a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LeeLL09,
  author       = {D. T. Lee and
                  Tien{-}Ching Lin and
                  Hsueh{-}I Lu},
  title        = {Fast Algorithms for the Density Finding Problem},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {298--313},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9023-8},
  doi          = {10.1007/S00453-007-9023-8},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LeeLL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LiuKW09,
  author       = {Pangfeng Liu and
                  May{-}Chen Kuo and
                  Da{-}Wei Wang},
  title        = {An Approximation Algorithm and Dynamic Programming for Reduction in
                  Heterogeneous Environments},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {425--453},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9113-7},
  doi          = {10.1007/S00453-007-9113-7},
  timestamp    = {Tue, 17 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LiuKW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/MantheyR09,
  author       = {Bodo Manthey and
                  L. Shankar Ram},
  title        = {Approximation Algorithms for Multi-Criteria Traveling Salesman Problems},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {1},
  pages        = {69--88},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9011-z},
  doi          = {10.1007/S00453-007-9011-Z},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MantheyR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Nagamochi09,
  author       = {Hiroshi Nagamochi},
  title        = {A Detachment Algorithm for Inferring a Graph from Path Frequency},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {2},
  pages        = {207--224},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9184-0},
  doi          = {10.1007/S00453-008-9184-0},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Nagamochi09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/PetrilloFI09,
  author       = {Umberto Ferraro Petrillo and
                  Irene Finocchi and
                  Giuseppe F. Italiano},
  title        = {The Price of Resiliency: a Case Study on Sorting with Memory Faults},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {597--620},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9264-1},
  doi          = {10.1007/S00453-008-9264-1},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/PetrilloFI09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Rizzi09,
  author       = {Romeo Rizzi},
  title        = {Minimum Weakly Fundamental Cycle Bases Are Hard To Find},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {402--424},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9112-8},
  doi          = {10.1007/S00453-007-9112-8},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Rizzi09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Seiferas09,
  author       = {Joel I. Seiferas},
  title        = {Sorting Networks of Logarithmic Depth, Further Simplified},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {3},
  pages        = {374--384},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9025-6},
  doi          = {10.1007/S00453-007-9025-6},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Seiferas09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/SoaresS09,
  author       = {Jos{\'{e}} Soares and
                  Marco Aurelio Stefanes},
  title        = {Algorithms for Maximum Independent Set in Convex Bipartite Graphs},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {1},
  pages        = {35--49},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-007-9006-9},
  doi          = {10.1007/S00453-007-9006-9},
  timestamp    = {Mon, 13 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/SoaresS09.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.