Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/algorithmica/AbamABY11,
  author       = {Mohammad Ali Abam and
                  Pankaj K. Agarwal and
                  Mark de Berg and
                  Hai Yu},
  title        = {Out-of-Order Event Processing in Kinetic Data Structures},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {250--273},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9335-y},
  doi          = {10.1007/S00453-009-9335-Y},
  timestamp    = {Mon, 01 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AbamABY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AngeliniBP11,
  author       = {Patrizio Angelini and
                  Giuseppe Di Battista and
                  Maurizio Patrignani},
  title        = {Finding a Minimum-depth Embedding of a Planar Graph in \emph{O}(\emph{n}\({}^{\mbox{4}}\))
                  Time},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {890--937},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9380-6},
  doi          = {10.1007/S00453-009-9380-6},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AngeliniBP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ArnoldO11,
  author       = {Michael Arnold and
                  Enno Ohlebusch},
  title        = {Linear Time Algorithms for Generalizations of the Longest Common Substring
                  Problem},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {806--818},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9369-1},
  doi          = {10.1007/S00453-009-9369-1},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ArnoldO11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AronovKLS11,
  author       = {Boris Aronov and
                  Marc J. van Kreveld and
                  Maarten L{\"{o}}ffler and
                  Rodrigo I. Silveira},
  title        = {Peeling Meshed Potatoes},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {349--367},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9346-8},
  doi          = {10.1007/S00453-009-9346-8},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AronovKLS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BansalBCP11,
  author       = {Nikhil Bansal and
                  David P. Bunde and
                  Ho{-}Leung Chan and
                  Kirk Pruhs},
  title        = {Average Rate Speed Scaling},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {877--889},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9379-z},
  doi          = {10.1007/S00453-009-9379-Z},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BansalBCP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BansalCCHLMSW11,
  author       = {Nikhil Bansal and
                  Danny Z. Chen and
                  Don Coppersmith and
                  Xiaobo Sharon Hu and
                  Shuang Luan and
                  Ewa Misiolek and
                  Baruch Schieber and
                  Chao Wang},
  title        = {Shape Rectangularization Problems in Intensity-Modulated Radiation
                  Therapy},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {421--450},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9354-8},
  doi          = {10.1007/S00453-009-9354-8},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BansalCCHLMSW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BarbeauBCCK11,
  author       = {Michel Barbeau and
                  Prosenjit Bose and
                  Paz Carmi and
                  Mathieu Couture and
                  Evangelos Kranakis},
  title        = {Location-Oblivious Distributed Unit Disk Graph Coloring},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {236--249},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9334-z},
  doi          = {10.1007/S00453-009-9334-Z},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BarbeauBCCK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BeinLNR11,
  author       = {Wolfgang W. Bein and
                  Lawrence L. Larmore and
                  John Noga and
                  R{\"{u}}diger Reischuk},
  title        = {Knowledge State Algorithms},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {653--678},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9366-4},
  doi          = {10.1007/S00453-009-9366-4},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BeinLNR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Bley11,
  author       = {Andreas Bley},
  title        = {An Integer Programming Algorithm for Routing Optimization in {IP}
                  Networks},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {1},
  pages        = {21--45},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9381-5},
  doi          = {10.1007/S00453-009-9381-5},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Bley11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BockerBK11,
  author       = {Sebastian B{\"{o}}cker and
                  Sebastian Briesemeister and
                  Gunnar W. Klau},
  title        = {Exact Algorithms for Cluster Editing: Evaluation and Experiments},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {316--334},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9339-7},
  doi          = {10.1007/S00453-009-9339-7},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BockerBK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BrandesEEFFGGHKKa11,
  author       = {Ulrik Brandes and
                  Cesim Erten and
                  Alejandro Estrella{-}Balderrama and
                  J. Joseph Fowler and
                  Fabrizio Frati and
                  Markus Geyer and
                  Carsten Gutwenger and
                  Seok{-}Hee Hong and
                  Michael Kaufmann and
                  Stephen G. Kobourov and
                  Giuseppe Liotta and
                  Petra Mutzel and
                  Antonios Symvonis},
  title        = {Colored Simultaneous Geometric Embeddings and Universal Pointsets},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {569--592},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9433-x},
  doi          = {10.1007/S00453-010-9433-X},
  timestamp    = {Thu, 27 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BrandesEEFFGGHKKa11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Buresh-OppenheimDI11,
  author       = {Joshua Buresh{-}Oppenheim and
                  Sashka Davis and
                  Russell Impagliazzo},
  title        = {A Stronger Model of Dynamic Programming Algorithms},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {938--968},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9385-1},
  doi          = {10.1007/S00453-009-9385-1},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Buresh-OppenheimDI11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/CabelloM11,
  author       = {Sergio Cabello and
                  Bojan Mohar},
  title        = {Crossing Number and Weighted Crossing Number of Near-Planar Graphs},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {484--504},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9357-5},
  doi          = {10.1007/S00453-009-9357-5},
  timestamp    = {Fri, 15 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CabelloM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChenLW11,
  author       = {Danny Z. Chen and
                  Shuang Luan and
                  Chao Wang},
  title        = {Coupled Path Planning, Region Optimization, and Applications in Intensity-modulated
                  Radiation Therapy},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {1},
  pages        = {152--174},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9363-7},
  doi          = {10.1007/S00453-009-9363-7},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChenLW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ChenLW11a,
  author       = {Zhi{-}Zhong Chen and
                  Guohui Lin and
                  Lusheng Wang},
  title        = {An Approximation Algorithm for the Minimum Co-Path Set Problem},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {969--986},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9389-x},
  doi          = {10.1007/S00453-010-9389-X},
  timestamp    = {Mon, 10 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChenLW11a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/CranstonKY11,
  author       = {Daniel W. Cranston and
                  Seog{-}Jin Kim and
                  Gexin Yu},
  title        = {Injective Colorings of Graphs with Low Average Degree},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {553--568},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9425-x},
  doi          = {10.1007/S00453-010-9425-X},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CranstonKY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DabrowskiP11,
  author       = {Robert Dabrowski and
                  Wojciech Plandowski},
  title        = {On Word Equations in One Variable},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {819--828},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9375-3},
  doi          = {10.1007/S00453-009-9375-3},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DabrowskiP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Delling11,
  author       = {Daniel Delling},
  title        = {Time-Dependent SHARC-Routing},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {1},
  pages        = {60--94},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9341-0},
  doi          = {10.1007/S00453-009-9341-0},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Delling11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DivakaranS11,
  author       = {Srikrishnan Divakaran and
                  Michael E. Saks},
  title        = {An Online Algorithm for a Problem in Scheduling with Set-ups and Release
                  Times},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {301--315},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9337-9},
  doi          = {10.1007/S00453-009-9337-9},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DivakaranS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DjordjevicGPW11,
  author       = {Bojan Djordjevic and
                  Joachim Gudmundsson and
                  Anh Pham and
                  Thomas Wolle},
  title        = {Detecting Regular Visit Patterns},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {829--852},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9376-2},
  doi          = {10.1007/S00453-009-9376-2},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DjordjevicGPW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DumitrescuJ11,
  author       = {Adrian Dumitrescu and
                  Minghui Jiang},
  title        = {Sweeping Points},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {703--717},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9364-6},
  doi          = {10.1007/S00453-009-9364-6},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DumitrescuJ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DumitrescuT11,
  author       = {Adrian Dumitrescu and
                  Csaba D. T{\'{o}}th},
  title        = {Minimum Weight Convex Steiner Partitions},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {627--652},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9329-9},
  doi          = {10.1007/S00453-009-9329-9},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DumitrescuT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ElbassioniKMMS11,
  author       = {Khaled M. Elbassioni and
                  Erik Krohn and
                  Domagoj Matijevic and
                  Juli{\'{a}}n Mestre and
                  Domagoj Severdija},
  title        = {Improved Approximations for Guarding 1.5-Dimensional Terrains},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {451--463},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9358-4},
  doi          = {10.1007/S00453-009-9358-4},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ElbassioniKMMS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/EpsteinK11,
  author       = {Leah Epstein and
                  Elena Kleiman},
  title        = {Selfish Bin Packing},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {368--394},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9348-6},
  doi          = {10.1007/S00453-009-9348-6},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/EpsteinK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FischerY11,
  author       = {Eldar Fischer and
                  Orly Yahalom},
  title        = {Testing Convexity Properties of Tree Colorings},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {766--805},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9368-2},
  doi          = {10.1007/S00453-009-9368-2},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FischerY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FournierV11,
  author       = {Herv{\'{e}} Fournier and
                  Antoine Vigneron},
  title        = {Fitting a Step Function to a Point Set},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {1},
  pages        = {95--109},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9342-z},
  doi          = {10.1007/S00453-009-9342-Z},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FournierV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FriggstadS11,
  author       = {Zachary Friggstad and
                  Mohammad R. Salavatipour},
  title        = {Approximability of Packing Disjoint Cycles},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {395--400},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9349-5},
  doi          = {10.1007/S00453-009-9349-5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FriggstadS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/FuscoP11,
  author       = {Emanuele G. Fusco and
                  Andrzej Pelc},
  title        = {Trade-offs Between the Size of Advice and Broadcasting Time in Trees},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {719--734},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9361-9},
  doi          = {10.1007/S00453-009-9361-9},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FuscoP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GhodsiMMZ11,
  author       = {Mohammad Ghodsi and
                  Hamid Mahini and
                  Vahab S. Mirrokni and
                  Morteza Zadimoghaddam},
  title        = {Permutation Betting Markets: Singleton Betting with Extra Information},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {853--876},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9378-0},
  doi          = {10.1007/S00453-009-9378-0},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GhodsiMMZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GoodrichTT11,
  author       = {Michael T. Goodrich and
                  Roberto Tamassia and
                  Nikos Triandopoulos},
  title        = {Efficient Authenticated Data Structures for Graph Connectivity and
                  Geometric Search Problems},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {505--552},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9355-7},
  doi          = {10.1007/S00453-009-9355-7},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GoodrichTT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GudmundssonMS11,
  author       = {Joachim Gudmundsson and
                  Pat Morin and
                  Michiel H. M. Smid},
  title        = {Algorithms for Marketing-Mix Optimization},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {1004--1016},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9393-1},
  doi          = {10.1007/S00453-010-9393-1},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GudmundssonMS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HalperinM11,
  author       = {Dan Halperin and
                  Kurt Mehlhorn},
  title        = {Guest Editorial: Selected Papers from European Symposium on Algorithms},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {1},
  pages        = {1--2},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9409-x},
  doi          = {10.1007/S00453-010-9409-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HalperinM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/HeberMS11,
  author       = {Steffen Heber and
                  Richard Mayr and
                  Jens Stoye},
  title        = {Common Intervals of Multiple Permutations},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {175--206},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9332-1},
  doi          = {10.1007/S00453-009-9332-1},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HeberMS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Hoefer11,
  author       = {Martin Hoefer},
  title        = {Competitive Cost Sharing with Economies of Scale},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {743--765},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9367-3},
  doi          = {10.1007/S00453-009-9367-3},
  timestamp    = {Fri, 26 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Hoefer11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/IerselK11,
  author       = {Leo van Iersel and
                  Steven Kelk},
  title        = {Constructing the Simplest Possible Phylogenetic Network from Triplets},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {207--235},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9333-0},
  doi          = {10.1007/S00453-009-9333-0},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/IerselK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KaoLL11,
  author       = {Mong{-}Jen Kao and
                  Chung{-}Shou Liao and
                  D. T. Lee},
  title        = {Capacitated Domination Problem},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {274--300},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9336-x},
  doi          = {10.1007/S00453-009-9336-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KaoLL11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Kiraly11,
  author       = {Zolt{\'{a}}n Kir{\'{a}}ly},
  title        = {Better and Simpler Approximation Algorithms for the Stable Marriage
                  Problem},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {1},
  pages        = {3--20},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9371-7},
  doi          = {10.1007/S00453-009-9371-7},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Kiraly11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KortsarzMNT11,
  author       = {Guy Kortsarz and
                  Vahab S. Mirrokni and
                  Zeev Nutov and
                  Elena Tsanko},
  title        = {Approximating Minimum-Power Degree and Connectivity Problems},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {735--742},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9365-5},
  doi          = {10.1007/S00453-009-9365-5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KortsarzMNT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KoutsonasT11,
  author       = {Athanassios Koutsonas and
                  Dimitrios M. Thilikos},
  title        = {Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and
                  Subexponential Algorithms},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {987--1003},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9390-4},
  doi          = {10.1007/S00453-010-9390-4},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KoutsonasT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LachishN11,
  author       = {Oded Lachish and
                  Ilan Newman},
  title        = {Testing Periodicity},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {401--420},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9351-y},
  doi          = {10.1007/S00453-009-9351-Y},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LachishN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LipskyP11,
  author       = {Ohad Lipsky and
                  Ely Porat},
  title        = {Approximate Pattern Matching with the \emph{L}\({}_{\mbox{1}}\), \emph{L}\({}_{\mbox{2}}\)
                  and \emph{L}\({}_{\mbox{{\(\infty\)}}}\) Metrics},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {335--348},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9345-9},
  doi          = {10.1007/S00453-009-9345-9},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LipskyP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/LitmanM11,
  author       = {Ami Litman and
                  Shiri Moran{-}Schein},
  title        = {On Centralized Smooth Scheduling},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {2},
  pages        = {464--480},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9360-x},
  doi          = {10.1007/S00453-009-9360-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/LitmanM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/NagarajanR11,
  author       = {Viswanath Nagarajan and
                  R. Ravi},
  title        = {The Directed Orienteering Problem},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {4},
  pages        = {1017--1030},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-011-9509-2},
  doi          = {10.1007/S00453-011-9509-2},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/NagarajanR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/PelsmajerSS11,
  author       = {Michael J. Pelsmajer and
                  Marcus Schaefer and
                  Daniel Stefankovic},
  title        = {Crossing Numbers of Graphs with Rotation Systems},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {679--702},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9343-y},
  doi          = {10.1007/S00453-009-9343-Y},
  timestamp    = {Thu, 17 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/PelsmajerSS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/SchaeferSS11,
  author       = {Marcus Schaefer and
                  Eric Sedgwick and
                  Daniel Stefankovic},
  title        = {Spiraling and Folding: The Word View},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {609--626},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9362-8},
  doi          = {10.1007/S00453-009-9362-8},
  timestamp    = {Thu, 17 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/SchaeferSS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Shahrokhi11,
  author       = {Farhad Shahrokhi},
  title        = {Guest Editor's Foreword: Algorithms, Combinatorics, {\&} Geometry},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {481--483},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-011-9493-6},
  doi          = {10.1007/S00453-011-9493-6},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Shahrokhi11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Zarrabi-Zadeh11,
  author       = {Hamid Zarrabi{-}Zadeh},
  title        = {An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed
                  Dimensions},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {1},
  pages        = {46--59},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9392-2},
  doi          = {10.1007/S00453-010-9392-2},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Zarrabi-Zadeh11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/ZhangJC11,
  author       = {Fenghui Zhang and
                  Anxiao Jiang and
                  Jianer Chen},
  title        = {On the Planarization of Wireless Sensor Networks},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {3},
  pages        = {593--608},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9476-z},
  doi          = {10.1007/S00453-010-9476-Z},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ZhangJC11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Zuylen11,
  author       = {Anke van Zuylen},
  title        = {Deterministic Sampling Algorithms for Network Design},
  journal      = {Algorithmica},
  volume       = {60},
  number       = {1},
  pages        = {110--151},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9344-x},
  doi          = {10.1007/S00453-009-9344-X},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Zuylen11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.