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/jal/jal19.bht:"
download as .bib file
@article{DBLP:journals/jal/AggarwalBKKS95,
author = {Alok Aggarwal and
Amotz Bar{-}Noy and
Samir Khuller and
Dina Kravets and
Baruch Schieber},
title = {Efficient Minimum Cost Matching and Transportation Using the Quadrangle
Inequality},
journal = {J. Algorithms},
volume = {19},
number = {1},
pages = {116--143},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1030},
doi = {10.1006/JAGM.1995.1030},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AggarwalBKKS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AggarwalT95,
author = {Alok Aggarwal and
Takeshi Tokuyama},
title = {An Improved Algorithm for the Traveler's Problem},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {318--330},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1039},
doi = {10.1006/JAGM.1995.1039},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AggarwalT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BampisHMS95,
author = {Evripidis Bampis and
Mohamed El Haddad and
Yannis Manoussakis and
Miklos Santha},
title = {A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {432--440},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1045},
doi = {10.1006/JAGM.1995.1045},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BampisHMS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BlumS95,
author = {Avrim Blum and
Joel Spencer},
title = {Coloring Random and Semi-Random k-Colorable Graphs},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {204--234},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1034},
doi = {10.1006/JAGM.1995.1034},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BlumS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BoseT95,
author = {Prosenjit Bose and
Godfried T. Toussaint},
title = {Growing a Tree from Its Branches},
journal = {J. Algorithms},
volume = {19},
number = {1},
pages = {86--103},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1028},
doi = {10.1006/JAGM.1995.1028},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BoseT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChandruGMRS95,
author = {Vijay Chandru and
Subir Kumar Ghosh and
Anil Maheshwari and
V. T. Rajan and
Sanjeev Saluja},
title = {NC-Algorithms for Minimum Link Path and Related Problems},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {173--203},
year = {1995},
timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ChandruGMRS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DattaLSS95,
author = {Amitava Datta and
Hans{-}Peter Lenhof and
Christian Schwarz and
Michiel H. M. Smid},
title = {Static and Dynamic Algorithms for \emph{k}-Point Clustering Problems},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {474--503},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1048},
doi = {10.1006/JAGM.1995.1048},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/DattaLSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/EddyS95,
author = {William F. Eddy and
Mark J. Schervish},
title = {How Many Comparisons Does Quicksort Use?},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {402--431},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1044},
doi = {10.1006/JAGM.1995.1044},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/EddyS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Engel95,
author = {Konrad Engel},
title = {An Algorithm for the Determination of the Variance of a Partially
Ordered Set},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {441--448},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1046},
doi = {10.1006/JAGM.1995.1046},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Engel95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Frederickson95,
author = {Greg N. Frederickson},
title = {Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths
Problems},
journal = {J. Algorithms},
volume = {19},
number = {1},
pages = {45--85},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1027},
doi = {10.1006/JAGM.1995.1027},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Frederickson95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GolumbicKS95,
author = {Martin Charles Golumbic and
Haim Kaplan and
Ron Shamir},
title = {Graph Sandwich Problems},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {449--473},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1047},
doi = {10.1006/JAGM.1995.1047},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/GolumbicKS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GuptaJS95,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
title = {Further Results on Generalized Intersection Searching Problems: Counting,
Reporting, and Dynamization},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {282--317},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1038},
doi = {10.1006/JAGM.1995.1038},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GuptaJS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HsuS95,
author = {Wen{-}Lian Hsu and
Jeremy P. Spinrad},
title = {Independent Sets in Circular-Arc Graphs},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {145--160},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1031},
doi = {10.1006/JAGM.1995.1031},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HsuS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/JohnsonM95,
author = {Donald B. Johnson and
Panagiotis Takis Metaxas},
title = {A Parallel Algorithm for Computing Minimum Spanning Trees},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {383--401},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1043},
doi = {10.1006/JAGM.1995.1043},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/JohnsonM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KleinR95,
author = {Philip N. Klein and
R. Ravi},
title = {A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner
Trees},
journal = {J. Algorithms},
volume = {19},
number = {1},
pages = {104--115},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1029},
doi = {10.1006/JAGM.1995.1029},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KleinR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KloksK95,
author = {Ton Kloks and
Dieter Kratsch},
title = {Treewidth of Chordal Bipartite Graphs},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {266--281},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1037},
doi = {10.1006/JAGM.1995.1037},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KloksK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ManneS95,
author = {Fredrik Manne and
Tor S{\o}revik},
title = {Optimal Partitioning of Sequences},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {235--249},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1035},
doi = {10.1006/JAGM.1995.1035},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ManneS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/PomeranceS95,
author = {Carl Pomerance and
Jonathan P. Sorenson},
title = {Counting the Integers Factorable via Cyclotomic Methods},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {250--265},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1036},
doi = {10.1006/JAGM.1995.1036},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/PomeranceS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Rajasekaran95,
author = {Sanguthevar Rajasekaran},
title = {k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {361--382},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1042},
doi = {10.1006/JAGM.1995.1042},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Rajasekaran95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Sen95,
author = {Sandeep Sen},
title = {Fractional Cascading Revisited},
journal = {J. Algorithms},
volume = {19},
number = {2},
pages = {161--172},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1032},
doi = {10.1006/JAGM.1995.1032},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Sen95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Sherk95,
author = {Murray Sherk},
title = {Self-Adjusting k-ary Search Trees},
journal = {J. Algorithms},
volume = {19},
number = {1},
pages = {25--44},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1026},
doi = {10.1006/JAGM.1995.1026},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Sherk95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/TorreK95,
author = {Pilar de la Torre and
Clyde P. Kruskal},
title = {Fast Parallel Algorithms for All-Sources Lexicographic Search and
Path-Algebra Problems},
journal = {J. Algorithms},
volume = {19},
number = {1},
pages = {1--24},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1025},
doi = {10.1006/JAGM.1995.1025},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/TorreK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/WuMM95,
author = {Sun Wu and
Udi Manber and
Eugene W. Myers},
title = {A Subquadratic Algorithm for Approximate Regular Expression Matching},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {346--360},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1041},
doi = {10.1006/JAGM.1995.1041},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/WuMM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Zhu95,
author = {Xuding Zhu},
title = {A Polynomial Algorithm for Homomorphisms to Oriented Cycles},
journal = {J. Algorithms},
volume = {19},
number = {3},
pages = {333--345},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1040},
doi = {10.1006/JAGM.1995.1040},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Zhu95.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-05-03 02:45 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:
