Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica61.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AbamBFGS11,
author = {Mohammad Ali Abam and
Mark de Berg and
Mohammad Farshi and
Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Geometric Spanners for Weighted Point Sets},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {207--225},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9465-2},
doi = {10.1007/S00453-010-9465-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AbamBFGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Al-JubehIRSTV11,
author = {Marwan Al{-}Jubeh and
Mashhood Ishaque and
Krist{\'{o}}f R{\'{e}}dei and
Diane L. Souvaine and
Csaba D. T{\'{o}}th and
Pavel Valtr},
title = {Augmenting the Edge Connectivity of Planar Straight Line Graphs to
Three},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {971--999},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9551-0},
doi = {10.1007/S00453-011-9551-0},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Al-JubehIRSTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonGKSY11,
author = {Noga Alon and
Gregory Z. Gutin and
Eun Jung Kim and
Stefan Szeider and
Anders Yeo},
title = {Solving MAX-\emph{r}-SAT Above a Tight Lower Bound},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {638--655},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9428-7},
doi = {10.1007/S00453-010-9428-7},
timestamp = {Thu, 22 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlonGKSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlthausCEKM11,
author = {Ernst Althaus and
Stefan Canzar and
Khaled M. Elbassioni and
Andreas Karrenbauer and
Juli{\'{a}}n Mestre},
title = {Approximation Algorithms for the Interval Constrained Coloring Problem},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {342--361},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9406-0},
doi = {10.1007/S00453-010-9406-0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlthausCEKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Babenko11,
author = {Maxim A. Babenko},
title = {An Efficient Scaling Algorithm for the Minimum Weight Bibranching
Problem},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {898--922},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9377-1},
doi = {10.1007/S00453-009-9377-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Babenko11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaeCLT11,
author = {Sang Won Bae and
Sunghee Choi and
Chunseok Lee and
Shin{-}ichi Tanigawa},
title = {Exact Algorithms for the Bottleneck Steiner Tree Problem},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {924--948},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9553-y},
doi = {10.1007/S00453-011-9553-Y},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BaeCLT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeierFMS11,
author = {Ren{\'{e}} Beier and
Stefan Funke and
Domagoj Matijevic and
Peter Sanders},
title = {Energy-Efficient Paths in Radio Networks},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {298--319},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9414-0},
doi = {10.1007/S00453-010-9414-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BeierFMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BenderBFGHHIL11,
author = {Michael A. Bender and
Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Dongdong Ge and
Simai He and
Haodong Hu and
John Iacono and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {The Cost of Cache-Oblivious Searching},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {463--505},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9394-0},
doi = {10.1007/S00453-010-9394-0},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BenderBFGHHIL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloBKKMSZ11,
author = {Davide Bil{\`{o}} and
Hans{-}Joachim B{\"{o}}ckenhauer and
Dennis Komm and
Richard Kr{\'{a}}lovic and
Tobias M{\"{o}}mke and
Sebastian Seibert and
Anna Zych},
title = {Reoptimization of the Shortest Common Superstring Problem},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {227--251},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9419-8},
doi = {10.1007/S00453-010-9419-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloBKKMSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiloFFM11,
author = {Vittorio Bil{\`{o}} and
Angelo Fanelli and
Michele Flammini and
Luca Moscardelli},
title = {Graphical Congestion Games},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {274--297},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9417-x},
doi = {10.1007/S00453-010-9417-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiloFFM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlaserH11,
author = {Markus Bl{\"{a}}ser and
Christian Hoffmann},
title = {Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {3--35},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9439-4},
doi = {10.1007/S00453-010-9439-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlaserH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderFLRRW11,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Michael A. Langston and
Mark A. Ragan and
Frances A. Rosamond and
Mark Weyer},
title = {Quadratic Kernelization for Convex Recoloring of Trees},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {362--388},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9404-2},
doi = {10.1007/S00453-010-9404-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderFLRRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderHV11,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Yngve Villanger},
title = {Faster Parameterized Algorithms for Minimum Fill-in},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {817--838},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9421-1},
doi = {10.1007/S00453-010-9421-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderHV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchinLMM11,
author = {Kevin Buchin and
Maarten L{\"{o}}ffler and
Pat Morin and
Wolfgang Mulzer},
title = {Preprocessing Imprecise Points for Delaunay Triangulation: Simplified
and Extended},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {674--693},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9430-0},
doi = {10.1007/S00453-010-9430-0},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BuchinLMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Burton11,
author = {Benjamin A. Burton},
title = {Searching a Bitstream in Linear Time for the Longest Substring of
Any Given Density},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {555--579},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9424-y},
doi = {10.1007/S00453-010-9424-Y},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Burton11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaiL11,
author = {Jin{-}yi Cai and
Pinyan Lu},
title = {Signature Theory in Holographic Algorithms},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {779--816},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9383-3},
doi = {10.1007/S00453-009-9383-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CaiL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaragiannisFKKM11,
author = {Ioannis Caragiannis and
Michele Flammini and
Christos Kaklamanis and
Panagiotis Kanellopoulos and
Luca Moscardelli},
title = {Tight Bounds for Selfish and Greedy Load Balancing},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {606--637},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9427-8},
doi = {10.1007/S00453-010-9427-8},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CaragiannisFKKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChanELLMP11,
author = {Ho{-}Leung Chan and
Jeff Edmonds and
Tak Wah Lam and
Lap{-}Kei Lee and
Alberto Marchetti{-}Spaccamela and
Kirk Pruhs},
title = {Nonclairvoyant Speed Scaling for Flow and Energy},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {507--517},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9420-2},
doi = {10.1007/S00453-010-9420-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChanELLMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CharikarHK11,
author = {Moses Charikar and
MohammadTaghi Hajiaghayi and
Howard J. Karloff},
title = {Improved Approximation Algorithms for Label Cover Problems},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {190--206},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9464-3},
doi = {10.1007/S00453-010-9464-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CharikarHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenDL11,
author = {Xi Chen and
Xiaotie Deng and
Becky Jie Liu},
title = {On Incentive Compatible Competitive Selection Protocols},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {447--462},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9395-z},
doi = {10.1007/S00453-010-9395-Z},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenDL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenEW11,
author = {Danny Z. Chen and
Konrad Engel and
Chao Wang},
title = {A New Algorithm for a Field Splitting Problem in Intensity-Modulated
Radiation Therapy},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {656--673},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9429-6},
doi = {10.1007/S00453-010-9429-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenEW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChristodoulouKS11,
author = {George Christodoulou and
Elias Koutsoupias and
Paul G. Spirakis},
title = {On the Performance of Approximate Equilibria in Congestion Games},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {116--140},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9449-2},
doi = {10.1007/S00453-010-9449-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChristodoulouKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DaiG11,
author = {Decheng Dai and
Rong Ge},
title = {Another Sub-exponential Algorithm for the Simple Stochastic Game},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {1092--1104},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9413-1},
doi = {10.1007/S00453-010-9413-1},
timestamp = {Fri, 26 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DaiG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DiakonikolasLMSW11,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
title = {Efficiently Testing Sparse \emph{GF}(2) Polynomials},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {580--605},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9426-9},
doi = {10.1007/S00453-010-9426-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DiakonikolasLMSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DowdenA11,
author = {Chris Dowden and
Louigi Addario{-}Berry},
title = {Subgraphs of 4-Regular Planar Graphs},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {758--776},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9435-8},
doi = {10.1007/S00453-010-9435-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DowdenA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DumitrescuJ11a,
author = {Adrian Dumitrescu and
Minghui Jiang},
title = {Piercing Translates and Homothets of a Convex Body},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {94--115},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9410-4},
doi = {10.1007/S00453-010-9410-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DumitrescuJ11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Emek11,
author = {Yuval Emek},
title = {\emph{k}-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning
Trees},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {141--160},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9423-z},
doi = {10.1007/S00453-010-9423-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Emek11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FerraginaNV11,
author = {Paolo Ferragina and
Igor Nitto and
Rossano Venturini},
title = {On Optimally Partitioning a Text to Improve Its Compression},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {51--74},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9437-6},
doi = {10.1007/S00453-010-9437-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FerraginaNV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fiat11,
author = {Amos Fiat},
title = {Special Issue: European Symposium on Algorithms, Design and Analysis},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {1--2},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9527-0},
doi = {10.1007/S00453-011-9527-0},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Fiat11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominGHMVW11,
author = {Fedor V. Fomin and
Petr A. Golovach and
Alexander Hall and
Mat{\'{u}}s Mihal{\'{a}}k and
Elias Vicari and
Peter Widmayer},
title = {How to Guard a Graph?},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {839--856},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9382-4},
doi = {10.1007/S00453-009-9382-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominGHMVW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominGKKL11,
author = {Fedor V. Fomin and
Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Dieter Kratsch and
Mathieu Liedloff},
title = {Branch and Recharge: Exact Algorithms for Generalized Domination},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {252--273},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9418-9},
doi = {10.1007/S00453-010-9418-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominGKKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GoyalOS11,
author = {Navin Goyal and
Neil Olver and
F. Bruce Shepherd},
title = {Dynamic vs. Oblivious Routing in Network Design},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {161--173},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9455-4},
doi = {10.1007/S00453-010-9455-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GoyalOS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoKKU11,
author = {Jiong Guo and
Iyad A. Kanj and
Christian Komusiewicz and
Johannes Uhlmann},
title = {Editing Graphs into Disjoint Unions of Dense Clusters},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {949--970},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9487-4},
doi = {10.1007/S00453-011-9487-4},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoKKU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HongN11,
author = {Seok{-}Hee Hong and
Hiroshi Nagamochi},
title = {Editorial: {ISAAC} 2008 Special Issue},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {777--778},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9507-4},
doi = {10.1007/S00453-011-9507-4},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HongN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HongN11a,
author = {Seok{-}Hee Hong and
Hiroshi Nagamochi},
title = {Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical
Polyhedra},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {1022--1076},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9570-x},
doi = {10.1007/S00453-011-9570-X},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HongN11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangKMN11,
author = {Chien{-}Chung Huang and
Telikepalli Kavitha and
Dimitrios Michail and
Meghana Nasre},
title = {Bounded Unpopularity Matchings},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {738--757},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9434-9},
doi = {10.1007/S00453-010-9434-9},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangKMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IoannidouMN11,
author = {Kyriaki Ioannidou and
George B. Mertzios and
Stavros D. Nikolopoulos},
title = {The Longest Path Problem has a Polynomial Solution on Interval Graphs},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {320--341},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9411-3},
doi = {10.1007/S00453-010-9411-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/IoannidouMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaoCWJ11,
author = {Kuo{-}Hua Kao and
Jou{-}Ming Chang and
Yue{-}Li Wang and
Justie Su{-}tzu Juan},
title = {A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {402--418},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9402-4},
doi = {10.1007/S00453-010-9402-4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KaoCWJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaplanN11,
author = {Haim Kaplan and
Yahav Nussbaum},
title = {Maximum Flow in Directed Planar Graphs with Vertex Capacities},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {174--189},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9436-7},
doi = {10.1007/S00453-010-9436-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KaplanN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KaplanN11a,
author = {Haim Kaplan and
Yahav Nussbaum},
title = {A Simpler Linear-Time Recognition of Circular-Arc Graphs},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {694--737},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9432-y},
doi = {10.1007/S00453-010-9432-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KaplanN11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KingPSY11,
author = {Valerie King and
Cynthia A. Phillips and
Jared Saia and
Maxwell Young},
title = {Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio
Networks},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {518--554},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9422-0},
doi = {10.1007/S00453-010-9422-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KingPSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KneisLR11,
author = {Joachim Kneis and
Alexander Langer and
Peter Rossmanith},
title = {A New Algorithm for Finding Trees with Many Leaves},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {882--897},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9454-5},
doi = {10.1007/S00453-010-9454-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KneisLR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiWY11,
author = {Minming Li and
Peng{-}Jun Wan and
F. Frances Yao},
title = {Tighter Approximation Bounds for Minimum {CDS} in Unit Disk Graphs},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {1000--1021},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9512-7},
doi = {10.1007/S00453-011-9512-7},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiWY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Lingas11,
author = {Andrzej Lingas},
title = {A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {36--50},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9441-x},
doi = {10.1007/S00453-010-9441-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Lingas11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MishraRSSS11,
author = {Sounaka Mishra and
Venkatesh Raman and
Saket Saurabh and
Somnath Sikdar and
C. R. Subramanian},
title = {The Complexity of K{\"{o}}nig Subgraph Problems and Above-Guarantee
Vertex Cover},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {857--881},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9412-2},
doi = {10.1007/S00453-010-9412-2},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MishraRSSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MoscibrodaSW11,
author = {Thomas Moscibroda and
Stefan Schmid and
Roger Wattenhofer},
title = {Topological Implications of Selfish Neighbor Selection in Unstructured
Peer-to-Peer Networks},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {419--446},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9398-9},
doi = {10.1007/S00453-010-9398-9},
timestamp = {Mon, 06 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MoscibrodaSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PritchardC11,
author = {David Pritchard and
Deeparnab Chakrabarty},
title = {Approximability of Sparse Integer Programs},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {75--93},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9431-z},
doi = {10.1007/S00453-010-9431-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PritchardC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RodittyZ11,
author = {Liam Roditty and
Uri Zwick},
title = {On Dynamic Shortest Paths Problems},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {389--401},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9401-5},
doi = {10.1007/S00453-010-9401-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RodittyZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/X11,
title = {Editors' Note: {ISAAC} 2009 Special Section},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {923},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9577-3},
doi = {10.1007/S00453-011-9577-3},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/X11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/YamaguchiIMM11,
author = {Daisuke Yamaguchi and
Shinji Imahori and
Ryuhei Miyashiro and
Tomomi Matsui},
title = {An Improved Approximation Algorithm for the Traveling Tournament Problem},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {1077--1091},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9579-1},
doi = {10.1007/S00453-011-9579-1},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/YamaguchiIMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-25 17:51 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
