@article{Ferraro-Godin/03,
AUTHOR = {Ferraro, Pascal and Godin, Christophe},
TITLE = {An edit distance between quotiented trees},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {1},
PAGES = {1-39},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Bazzi-Mitter/03,
AUTHOR = {Bazzi, Louay and Mitter, Sanjoy},
TITLE = {The solution of linear probabilistic recurrence relations},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {1},
PAGES = {41-57},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Katz-Nielsen-Segal/03,
AUTHOR = {Katz, Matthew J. and Nielsen, Frank and Segal, Michael},
TITLE = {Maintenance of a piercing set for intervals with applications},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {1},
PAGES = {59-73},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Bast-Mehlhorn-Schafer-Tamaki/03,
AUTHOR = {Bast, Holger and Mehlhorn, Kurt and Sch{\"a}fer, Guido and Tamaki, Hisao},
TITLE = {A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {1},
PAGES = {75-88},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Sun/03,
AUTHOR = {Sun, Xiaoming},
TITLE = {A 3-party simultaneous protocol for SUM-INDEX},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {1},
PAGES = {89-91},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Xu/03,
AUTHOR = {Xu, Ying},
TITLE = {An $O(n^{1.5})$ deterministic gossiping algorithm for radio networks},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {1},
PAGES = {93-96},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Dehne-Dittrich-Hutchinson/03,
AUTHOR = {Dehne, Frank and Dittrich, Wolfgang and Hutchinson, David},
TITLE = {Efficient external memory algorithms by simulating coarse-grained parallel algorithms},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {2},
PAGES = {97-122},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Adler-Khanna-Rajaraman-Rosen/03,
AUTHOR = {Adler, Micah and Khanna, Sanjeev and Rajaraman, Rajmohan and Ros{\'e}n, Adi},
TITLE = {Time-constrained scheduling of weighted packets on trees and meshes},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {2},
PAGES = {123-152},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Hong-Eades/03,
AUTHOR = {Hong, Seok-Hee and Eades, Peter},
TITLE = {Drawing trees symmetrically in three dimensions},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {2},
PAGES = {153-178},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Calinescu-Fernandes-Karloff-Zelikovsky/03,
AUTHOR = {C{\v{a}}linescu, Gruia and Fernandes, Cristina G. and Karloff, Howard and Zelikovsky, Alexander},
TITLE = {A new approximation algorithm for finding heavy planar subgraphs},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {2},
PAGES = {179-205},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Karlin-Kenyon-Randall/03,
AUTHOR = {Karlin, Anna R. and Kenyon, Claire and Randall, Dana},
TITLE = {Dynamic TPC acknowledgment and other stories about $e/(e-1)$},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {3},
PAGES = {209-224},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Bar-Noy-Freund-Landa-Naor/03,
AUTHOR = {Bar-Noy, Amotz and Freund, Ari and Landa, Shimon and Naor, Joseph (Seffi)},
TITLE = {Competitive on-line switching policies},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {3},
PAGES = {225-247},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Blum-Chawla-Kalai/03,
AUTHOR = {Blum, Avrim and Chawla, Shuchi and Kalai, Adam},
TITLE = {Static optimality and dynamic search-optimality in lists and trees},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {3},
PAGES = {249-260},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Seiden-van_Stee/03,
AUTHOR = {Seiden, Steven S. and van Stee, Rob},
TITLE = {New bounds for multidimensional packing},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {3},
PAGES = {261-293},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Armon-Azar-Epstein-Regev/03,
AUTHOR = {Armon, Amitai and Azar, Yossi and Epstein, Leah and Regev, Oded},
TITLE = {Temporary tasks assignment resolved},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {3},
PAGES = {295-314},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Edmonds-Pruhs/03,
AUTHOR = {Edmonds, Jeff and Pruhs, Kirk},
TITLE = {Multicast pull scheduling: When fairness is fine},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {3},
PAGES = {315-330},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Iwata/03,
AUTHOR = {Iwata, Satoru},
TITLE = {Computing the maximum degree of minors in matrix pencils via combinatorial relaxation},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {4},
PAGES = {331-341},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Chan-Chin-Ting/03,
AUTHOR = {Chan, Wun-Tat and Chin, Francis Y.L. and Ting, Hing-Fung},
TITLE = {Escaping a grid by edge-disjoint paths},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {4},
PAGES = {343-359},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Galluccio-Proietti/03,
AUTHOR = {Galluccio, Anna and Proietti, Guido},
TITLE = {Polynomial time algorithms for 2-edge-connectivity augmentation problems},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {4},
PAGES = {361-374},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}
@article{Bodlaender-Rotics/03,
AUTHOR = {Bodlaender, Hans L. and Rotics, Udi},
TITLE = {Computing the treewidth and the minimum fill-in with the modular decomposition},
JOURNAL = {Algorithmica},
VOLUME = {36},
NUMBER = {4},
PAGES = {375-408},
YEAR = {2003},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
TYPE = {inproceedings},
}