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/algorithmica45.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/Abu-KhzamLSS06,
author = {Faisal N. Abu{-}Khzam and
Michael A. Langston and
Pushkar Shanbhag and
Christopher T. Symons},
title = {Scalable Parallel Algorithms for {FPT} Problems},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {269--284},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1214-1},
doi = {10.1007/S00453-006-1214-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Abu-KhzamLSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbersR06,
author = {Susanne Albers and
Tomasz Radzik},
title = {Foreword},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {1--2},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1186-6},
doi = {10.1007/S00453-005-1186-6},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbersR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlvesCS06,
author = {Carlos E. R. Alves and
Edson C{\'{a}}ceres and
Siang Wun Song},
title = {A Coarse-Grained Parallel Algorithm for the All-Substrings Longest
Common Subsequence Problem},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {301--335},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1216-z},
doi = {10.1007/S00453-006-1216-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlvesCS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmirEP06,
author = {Amihood Amir and
Estrella Eisenberg and
Ely Porat},
title = {Swap and Mismatch Edit Distance},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {109--120},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1192-8},
doi = {10.1007/S00453-005-1192-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmirEP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarL06,
author = {Yossi Azar and
Arik Litichevskey},
title = {Maximizing Throughput in Multi-Queue Switches},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {69--90},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1190-x},
doi = {10.1007/S00453-005-1190-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeierV06,
author = {Ren{\'{e}} Beier and
Berthold V{\"{o}}cking},
title = {An Experimental Study of Random Knapsack Problems},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {121--136},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1193-7},
doi = {10.1007/S00453-005-1193-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BeierV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhattFWRT06,
author = {Mehul Bhatt and
Andrew Flahive and
Carlo Wouters and
J. Wenny Rahayu and
David Taniar},
title = {{MOVE:} {A} Distributed Framework for Materialized Ontology View Extraction},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {457--481},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1221-2},
doi = {10.1007/S00453-006-1221-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BhattFWRT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrakerskiNP06,
author = {Zvika Brakerski and
Aviv Nisgav and
Boaz Patt{-}Shamir},
title = {General Perfectly Periodic Scheduling},
journal = {Algorithmica},
volume = {45},
number = {2},
pages = {183--208},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1182-x},
doi = {10.1007/S00453-005-1182-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BrakerskiNP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuschMMS06,
author = {Costas Busch and
Malik Magdon{-}Ismail and
Marios Mavronicolas and
Paul G. Spirakis},
title = {Direct Routing: Algorithms and Complexity},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {45--68},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1189-3},
doi = {10.1007/S00453-005-1189-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuschMMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChaudhryC06,
author = {Geeta Chaudhry and
Thomas H. Cormen},
title = {Slabpose Columnsort: {A} New Oblivious Algorithm for Out-of-Core Sorting
on Distributed-Memory Clusters},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {483--508},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1222-1},
doi = {10.1007/S00453-006-1222-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChaudhryC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenGP06,
author = {Zhi{-}Zhong Chen and
Michelangelo Grigni and
Christos H. Papadimitriou},
title = {Recognizing Hole-Free 4-Map Graphs in Cubic Time},
journal = {Algorithmica},
volume = {45},
number = {2},
pages = {227--262},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1184-8},
doi = {10.1007/S00453-005-1184-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenGP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChepoiENV06,
author = {Victor Chepoi and
Bertrand Estellon and
Karim Nouioua and
Yann Vax{\`{e}}s},
title = {Mixed Covering of Trees and the Augmentation Problem with Odd Diameter
Constraints},
journal = {Algorithmica},
volume = {45},
number = {2},
pages = {209--226},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1183-9},
doi = {10.1007/S00453-005-1183-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChepoiENV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CheriyanS06,
author = {Joseph Cheriyan and
Mohammad R. Salavatipour},
title = {Hardness and Approximation Results for Packing Steiner Trees},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {21--43},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1188-4},
doi = {10.1007/S00453-005-1188-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CheriyanS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChiKG06,
author = {Jie Chi and
Mehmet Koyut{\"{u}}rk and
Ananth Grama},
title = {{CONQUEST:} {A} Coarse-Grained Algorithm for Constructing Summaries
of Distributed Discrete Datasets},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {377--401},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1218-x},
doi = {10.1007/S00453-006-1218-X},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChiKG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChilsonNWZ06,
author = {James Chilson and
Raymond T. Ng and
Alan Wagner and
Ruben H. Zamar},
title = {Parallel Computation of High-Dimensional Robust Correlation and Covariance
Matrices},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {403--431},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1219-9},
doi = {10.1007/S00453-006-1219-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChilsonNWZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Dehne06,
author = {Frank K. H. A. Dehne},
title = {Guest Editor's Introduction},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {263--267},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1213-2},
doi = {10.1007/S00453-006-1213-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Dehne06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DrigaLSSCP06,
author = {Adrian Driga and
Paul Lu and
Jonathan Schaeffer and
Duane Szafron and
Kevin Charter and
Ian Parsons},
title = {FastLSA: {A} Fast, Linear-Space, Parallel and Sequential Algorithm
for Sequence Alignment},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {337--375},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1217-y},
doi = {10.1007/S00453-006-1217-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DrigaLSSCP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DujmovicFHKLMNRRSWW06,
author = {Vida Dujmovic and
Michael R. Fellows and
Michael T. Hallett and
Matthew Kitching and
Giuseppe Liotta and
Catherine McCartin and
Naomi Nishimura and
Prabhakar Ragde and
Frances A. Rosamond and
Matthew Suderman and
Sue Whitesides and
David R. Wood},
title = {A Fixed-Parameter Approach to 2-Layer Planarization},
journal = {Algorithmica},
volume = {45},
number = {2},
pages = {159--182},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1181-y},
doi = {10.1007/S00453-005-1181-Y},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DujmovicFHKLMNRRSWW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ElkinK06,
author = {Michael Elkin and
Guy Kortsarz},
title = {An Approximation Algorithm for the Directed Telephone Multicast Problem},
journal = {Algorithmica},
volume = {45},
number = {4},
pages = {569--583},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1196-4},
doi = {10.1007/S00453-005-1196-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ElkinK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FleischerGZ06,
author = {Rudolf Fleischer and
Mordecai J. Golin and
Yan Zhang},
title = {Online Maintenance of k-Medians and k-Covers on a Line},
journal = {Algorithmica},
volume = {45},
number = {4},
pages = {549--567},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1195-5},
doi = {10.1007/S00453-005-1195-5},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FleischerGZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GiacomoDLW06,
author = {Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Stephen K. Wismath},
title = {Book Embeddability of Series-Parallel Digraphs},
journal = {Algorithmica},
volume = {45},
number = {4},
pages = {531--547},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1185-7},
doi = {10.1007/S00453-005-1185-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GiacomoDLW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolubchikKKSW06,
author = {Leana Golubchik and
Samir Khuller and
Yoo Ah Kim and
Svetlana Shargorodskaya and
Yung{-}Chun (Justin) Wan},
title = {Data Migration on Parallel Disks: Algorithms and Evaluation},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {137--158},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1194-6},
doi = {10.1007/S00453-005-1194-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolubchikKKSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GovindarajanLMZ06,
author = {Sathish Govindarajan and
Tam{\'{a}}s Lukovszki and
Anil Maheshwari and
Norbert Zeh},
title = {I/O-Efficient Well-Separated Pair Decomposition and Applications},
journal = {Algorithmica},
volume = {45},
number = {4},
pages = {585--614},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1197-3},
doi = {10.1007/S00453-005-1197-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GovindarajanLMZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HarveyDB06,
author = {Daniel J. Harvey and
Sajal K. Das and
Rupak Biswas},
title = {Design and Performance of a Heterogeneous Grid Partitioner},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {509--530},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1223-0},
doi = {10.1007/S00453-006-1223-0},
timestamp = {Tue, 10 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HarveyDB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KeanePNTM06,
author = {Thomas M. Keane and
Andrew J. Page and
Thomas J. Naughton and
Simon A. A. Travers and
James O. McInerney},
title = {Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {285--300},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1215-0},
doi = {10.1007/S00453-006-1215-0},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KeanePNTM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KreveldS06,
author = {Marc J. van Kreveld and
A. Frank van der Stappen},
title = {Approximate Unions of Lines and Minkowski Sums},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {91--107},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1191-9},
doi = {10.1007/S00453-005-1191-9},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KreveldS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MuchaS06,
author = {Marcin Mucha and
Piotr Sankowski},
title = {Maximum Matchings in Planar Graphs via Gaussian Elimination},
journal = {Algorithmica},
volume = {45},
number = {1},
pages = {3--20},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1187-5},
doi = {10.1007/S00453-005-1187-5},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MuchaS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SouzaMJ06,
author = {Jerffeson {Teixeira de Souza} and
Stan Matwin and
Nathalie Japkowicz},
title = {Parallelizing Feature Selection},
journal = {Algorithmica},
volume = {45},
number = {3},
pages = {433--456},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-1220-3},
doi = {10.1007/S00453-006-1220-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/SouzaMJ06.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-24 18:01 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:
