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/algorithmica57.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/Ailon10,
author = {Nir Ailon},
title = {Aggregation of Partial Rankings, \emph{p}-Ratings and Top-\emph{m}
Lists},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {284--300},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9211-1},
doi = {10.1007/S00453-008-9211-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ailon10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AkutsuFT10,
author = {Tatsuya Akutsu and
Daiji Fukagawa and
Atsuhiro Takasu},
title = {Approximating Tree Edit Distance through String Edit Distance},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {325--348},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9213-z},
doi = {10.1007/S00453-008-9213-Z},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AkutsuFT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersJ10,
author = {Susanne Albers and
Tobias Jacobs},
title = {An Experimental Study of New and Known Online Packet Buffering Algorithms},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {725--746},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9230-y},
doi = {10.1007/S00453-008-9230-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndersonHHHKSSW10,
author = {Eric Anderson and
Joseph Hall and
Jason D. Hartline and
M. Hobbes and
Anna R. Karlin and
Jared Saia and
Ram Swaminathan and
John Wilkes},
title = {Algorithms for Data Migration},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {349--380},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9214-y},
doi = {10.1007/S00453-008-9214-Y},
timestamp = {Wed, 31 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndersonHHHKSSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AttiyaEST10,
author = {Hagit Attiya and
Leah Epstein and
Hadas Shachnai and
Tami Tamir},
title = {Transactional Contention Management as a Non-Clairvoyant Scheduling
Problem},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {44--61},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9195-x},
doi = {10.1007/S00453-008-9195-X},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AttiyaEST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AugerT10,
author = {Anne Auger and
Olivier Teytaud},
title = {Continuous Lunches Are Free Plus the Design of Optimal Optimization
Algorithms},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {121--146},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9244-5},
doi = {10.1007/S00453-008-9244-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AugerT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarFG10,
author = {Yossi Azar and
Uriel Feige and
Daniel Glasner},
title = {A Preemptive Algorithm for Maximizing Disjoint Paths on Trees},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {517--537},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9305-4},
doi = {10.1007/S00453-009-9305-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarFG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BalakrishnanBCKKS10,
author = {Kannan Balakrishnan and
Bostjan Bresar and
Manoj Changat and
Sandi Klavzar and
Matjaz Kovse and
Ajitha R. Subhamathi},
title = {Computing median and antimedian sets in median graphs},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {207--216},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9200-4},
doi = {10.1007/S00453-008-9200-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BalakrishnanBCKKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BekosKNS10,
author = {Michael A. Bekos and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Antonios Symvonis},
title = {Boundary Labeling with Octilinear Leaders},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {436--461},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9283-6},
doi = {10.1007/S00453-009-9283-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BekosKNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BenoitR10,
author = {Anne Benoit and
Yves Robert},
title = {Complexity Results for Throughput and Latency Optimization of Replicated
and Data-parallel Workflows},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {689--724},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9229-4},
doi = {10.1007/S00453-008-9229-4},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BenoitR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeregDJ10,
author = {Sergey Bereg and
Adrian Dumitrescu and
Minghui Jiang},
title = {On Covering Problems of Rado},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {538--561},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9298-z},
doi = {10.1007/S00453-009-9298-Z},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BeregDJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlunckV10,
author = {Henrik Blunck and
Jan Vahrenhold},
title = {In-Place Algorithms for Computing (Layers of) Maxima},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {1--21},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9193-z},
doi = {10.1007/S00453-008-9193-Z},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlunckV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarF10,
author = {Joan Boyar and
Lene M. Favrholdt},
title = {Scheduling Jobs on Grid Processors},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {819--847},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9257-0},
doi = {10.1007/S00453-008-9257-0},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaiH10,
author = {Liming Cai and
Xiuzhen Huang},
title = {Fixed-Parameter Approximation: Conceptual Framework and Approximability
Results},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {398--412},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9223-x},
doi = {10.1007/S00453-008-9223-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CaiH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChoG10,
author = {Sung{-}woo Cho and
Ashish Goel},
title = {Pricing for Fairness: Distributed Resource Allocation for Multiple
Objectives},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {873--892},
year = {2010},
url = {https://doi.org/10.1007/s00453-010-9405-1},
doi = {10.1007/S00453-010-9405-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChoG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChristHOU10,
author = {Tobias Christ and
Michael Hoffmann and
Yoshio Okamoto and
Takeaki Uno},
title = {Improved Bounds for Wireless Localization},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {499--516},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9287-2},
doi = {10.1007/S00453-009-9287-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChristHOU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Damaschke10,
author = {Peter Damaschke},
title = {Homogeneous String Segmentation using Trees and Weighted Independent
Sets},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {621--640},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9225-8},
doi = {10.1007/S00453-008-9225-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Damaschke10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DegenerGL10,
author = {Bastian Degener and
Joachim Gehweiler and
Christiane Lammersen},
title = {Kinetic Facility Location},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {562--584},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9250-7},
doi = {10.1007/S00453-008-9250-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DegenerGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DemaineLP10,
author = {Erik D. Demaine and
Stefan Langerman and
Eric Price},
title = {Confluently Persistent Tries for Efficient Version Control},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {462--483},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9274-z},
doi = {10.1007/S00453-008-9274-Z},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DemaineLP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DerungsJW10,
author = {J{\"{o}}rg Derungs and
Riko Jacob and
Peter Widmayer},
title = {Approximate Shortest Paths Guided by a Small Index},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {668--688},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9228-5},
doi = {10.1007/S00453-008-9228-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DerungsJW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DoerrNW10,
author = {Benjamin Doerr and
Frank Neumann and
Ingo Wegener},
title = {Editorial},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {119--120},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9373-5},
doi = {10.1007/S00453-009-9373-5},
timestamp = {Mon, 30 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrNW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DraganY10,
author = {Feodor F. Dragan and
Chenyu Yan},
title = {Collective Tree Spanners in Graphs with Bounded Parameters},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {22--43},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9194-y},
doi = {10.1007/S00453-008-9194-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DraganY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FanelliFM10,
author = {Angelo Fanelli and
Michele Flammini and
Luca Moscardelli},
title = {On the Convergence of Multicast Games in Directed Networks},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {301--324},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9212-0},
doi = {10.1007/S00453-008-9212-0},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FanelliFM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Fernau10,
author = {Henning Fernau},
title = {A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting
Set},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {97--118},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9199-6},
doi = {10.1007/S00453-008-9199-6},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Fernau10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiacomoLT10,
author = {Emilio Di Giacomo and
Giuseppe Liotta and
Francesco Trotta},
title = {Drawing Colored Graphs with Constrained Vertex Positions and Few Bends
per Edge},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {796--818},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9255-2},
doi = {10.1007/S00453-008-9255-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiacomoLT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GibsonKKPV10,
author = {Matt Gibson and
Gaurav Kanade and
Erik Krohn and
Imran A. Pirwani and
Kasturi R. Varadarajan},
title = {On Metric Clustering to Minimize the Sum of Radii},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {484--498},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9282-7},
doi = {10.1007/S00453-009-9282-7},
timestamp = {Thu, 01 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GibsonKKPV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Gudmundsson10,
author = {Joachim Gudmundsson},
title = {Editorial, {SWAT} 2008 Special Issue},
journal = {Algorithmica},
volume = {57},
number = {3},
pages = {435},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9327-y},
doi = {10.1007/S00453-009-9327-Y},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Gudmundsson10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HoangKLSS10,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Marcin Kaminski and
Vadim V. Lozin and
Joe Sawada and
Xiao Shu},
title = {Deciding \emph{k}-Colorability of \emph{P}\({}_{\mbox{5}}\)-Free Graphs
in Polynomial Time},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {74--81},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9197-8},
doi = {10.1007/S00453-008-9197-8},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HoangKLSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HungT10,
author = {Regant Y. S. Hung and
Hing{-}Fung Ting},
title = {Design and Analysis of Online Batching Systems},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {217--231},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9201-3},
doi = {10.1007/S00453-008-9201-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HungT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/InnamiKMS10,
author = {N. Innami and
B. H. Kim and
Y. Mashiko and
K. Shiohama},
title = {The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be Open},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {869--872},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9254-3},
doi = {10.1007/S00453-008-9254-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/InnamiKMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenW10,
author = {Thomas Jansen and
Dennis Weyland},
title = {Analysis of Evolutionary Algorithms for the Longest Common Subsequence
Problem},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {170--186},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9243-6},
doi = {10.1007/S00453-008-9243-6},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KellererS10,
author = {Hans Kellerer and
Vitaly A. Strusevich},
title = {Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack
Problem and its Scheduling Applications},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {769--795},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9248-1},
doi = {10.1007/S00453-008-9248-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KellererS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhullerKW10,
author = {Samir Khuller and
Yoo{-}Ah Kim and
Yung{-}Chun (Justin) Wan},
title = {Broadcasting on Networks of Workstations},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {848--868},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9249-0},
doi = {10.1007/S00453-008-9249-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhullerKW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KontogiannisS10,
author = {Spyros C. Kontogiannis and
Paul G. Spirakis},
title = {Well Supported Approximate Equilibria in Bimatrix Games},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {653--667},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9227-6},
doi = {10.1007/S00453-008-9227-6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KontogiannisS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KormanPR10,
author = {Amos Korman and
David Peleg and
Yoav Rodeh},
title = {Constructing Labeling Schemes through Universal Matrices},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {641--652},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9226-7},
doi = {10.1007/S00453-008-9226-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KormanPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kovacs10,
author = {Annam{\'{a}}ria Kov{\'{a}}cs},
title = {New Approximation Bounds for Lpt Scheduling},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {413--433},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9224-9},
doi = {10.1007/S00453-008-9224-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kovacs10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiMM10,
author = {Li (Erran) Li and
Mohammad Mahdian and
Vahab S. Mirrokni},
title = {Secure Overlay Network Design},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {82--96},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9198-7},
doi = {10.1007/S00453-008-9198-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LinYX10,
author = {Mingen Lin and
Yang Yang and
Jinhui Xu},
title = {Improved Approximation Algorithms for Maximum Resource Bin Packing
and Lazy Bin Covering Problems},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {232--251},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9202-2},
doi = {10.1007/S00453-008-9202-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LinYX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Marx10,
author = {D{\'{a}}niel Marx},
title = {Chordal Deletion is Fixed-Parameter Tractable},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {747--768},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9233-8},
doi = {10.1007/S00453-008-9233-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Marx10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NavarroP10,
author = {Gonzalo Navarro and
Rodrigo Paredes},
title = {On Sorting, Heaps, and Minimum Spanning Trees},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {585--620},
year = {2010},
url = {https://doi.org/10.1007/s00453-010-9400-6},
doi = {10.1007/S00453-010-9400-6},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/NavarroP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PanduranganS10,
author = {Gopal Pandurangan and
Wojciech Szpankowski},
title = {A Universal Online Caching Algorithm Based on Pattern Matching},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {62--73},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9196-9},
doi = {10.1007/S00453-008-9196-9},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PanduranganS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PuertoRT10,
author = {Justo Puerto and
Antonio M. Rodr{\'{\i}}guez{-}Ch{\'{\i}}a and
Arie Tamir},
title = {On the Planar Piecewise Quadratic 1-Center Problem},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {252--283},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9210-2},
doi = {10.1007/S00453-008-9210-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PuertoRT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ReichelS10,
author = {Joachim Reichel and
Martin Skutella},
title = {Evolutionary Algorithms and Matroid Optimization Problems},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {187--206},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9253-4},
doi = {10.1007/S00453-008-9253-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ReichelS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/TheileJ10,
author = {Madeleine Theile and
Thomas Jansen},
title = {Stability in the Self-Organized Evolution of Networks},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {147--169},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9242-7},
doi = {10.1007/S00453-008-9242-7},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/TheileJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Zhang10,
author = {Huaming Zhang},
title = {Planar Polyline Drawings via Graph Transformations},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {381--397},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9215-x},
doi = {10.1007/S00453-008-9215-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Zhang10.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-09-03 16:19 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:
