@article{Veldhorst/86,
AUTHOR = {Veldhorst, Marinus},
TITLE = {The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees},
JOURNAL = {J. Algorithms},
VOLUME = {7},
PAGES = {1-34},
YEAR = {1986},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Jerrum/86,
AUTHOR = {Jerrum, Mark},
TITLE = {A compact representation for permutation groups},
JOURNAL = {J. Algorithms},
VOLUME = {7},
PAGES = {60-78},
YEAR = {1986},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Hochbaum-Nishizeki-Shmoys/86,
AUTHOR = {Hochbaum, Dorit S. and Nishizeki, Takao and Shmoys, David B.},
TITLE = {A better than ``best possible'' algorithm to edge color multigraphs},
JOURNAL = {J. Algorithms},
VOLUME = {7},
PAGES = {79-104},
YEAR = {1986},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Tiwari/86,
AUTHOR = {Tiwari, Prasoon},
TITLE = {An efficient parallel algorithm for shifting the root of a depth first spanning tree},
JOURNAL = {J. Algorithms},
VOLUME = {7},
PAGES = {105-119},
YEAR = {1986},
}
@article{Skowronska-Syslo-Zamfirescu/86,
AUTHOR = {Skowro{\'n}ska, Miroslawa and Syslo, Maciej M. and Zamfirescu, Cristina},
TITLE = {An algorithmic characterization of total digraphs},
JOURNAL = {J. Algorithms},
VOLUME = {7},
PAGES = {120-133},
YEAR = {1986},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Arkin-Papadimitriou/86,
AUTHOR = {Arkin, Esther M. and Papadimitriou, Christos H.},
TITLE = {On the complexity of circulations},
JOURNAL = {J. Algorithms},
VOLUME = {7},
PAGES = {134-145},
YEAR = {1986},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}