Selected Recent Publications of C.D. Zaroliagis

• D. Alberts, G. Cattaneo, G.F. Italiano, U. Nanni, and C. Zaroliagis
  ``A Software Library of Dynamic Graph Algorithms''
  in Proc. Workshop on Algorithms and Experiments - ALEX'98 (R. Battiti and A.A. Bertosi, eds.), 1998, pp.129-136.



• G.S. Brodal, J.L. Träff, and C. Zaroliagis
  ``A Parallel Priority Queue with Constant Time Operations''
  Journal of Parallel and Distributed Computing (1998), special issue on Parallel
  and Distributed Data Structures, in print; also Technical Report MPI-I-97-1-011.



• T. Miller and C. Zaroliagis
  ``A First Experimental Study of a Dynamic Transitive Closure Algorithm''
  in Proc. Workshop on Algorithm Engineering - WAE'97 (G.F. Italiano and S. Orlando, eds.), 1997, pp.64-73.



• G.S. Brodal, J.L. Träff, and C. Zaroliagis
  ``A Parallel Priority Data Structure with Applications''
  in Proc. 11th IEEE Int'l Parallel Processing Symp. - IPPS'97 (IEEE Computer Society Press, 1997), pp.689-694.



• S. Chaudhuri and C. Zaroliagis
  ``Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms''
  to appear in Algorithmica (1998), special issue on Treewidth, Graph Minors, and Algorithms.



• S. Chaudhuri and C. Zaroliagis
  ``Shortest Paths in Digraphs of Small Treewidth. Part II: Optimal Parallel Algorithms''
  Theoretical Computer Science (1998), special issue on ESA'95, in print.



• D. Kagaris, G. Pantziou, S. Tragoudas, and C. Zaroliagis
  ``Transmissions in a Network with Capacities and Delays''
  Networks (1998), in print.



• C. Zaroliagis
  ``Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem''
  Parallel Processing Letters 7:1 (1997), pp.25-37.



• S. Arikati, D.Z. Chen, L.P. Chew, G. Das, M. Smid, and C. Zaroliagis
  ``Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane''
  in Algorithms - ESA'96, Lecture Notes in Computer Science 1136 (Springer-Verlag, 1996), pp.514-528.



• S. Arikati, A. Maheshwari, and C. Zaroliagis
  ``Efficient Computation of Implicit Representations of Sparse Graphs''
  Discrete Applied Mathematics 78 (1997), pp.1-16.



• J.L. Träff and C. Zaroliagis
  ``A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs''
  in Parallel Algorithms for Irregularly Structured Problems - IRREGULAR'96,
  Lecture Notes in Computer Science 1117 (Springer-Verlag, 1996), pp.183-194.



• S. Arikati, S. Chaudhuri, and C. Zaroliagis
  ``All-Pairs Min-Cut in Sparse Networks''
  in Foundations of Software Technology and Theoretical Computer Science - FSTTCS'95,
  Lecture Notes in Computer Science 1026 (Springer-Verlag, 1995), pp.363-376.
  Full version as Technical Report MPI-I-96-1-007; also, to appear in Journal of Algorithms.



• D. Kavvadias, G. Pantziou, P. Spirakis, and C. Zaroliagis
  ``Hammock-on-Ears Decomposition: A Technique for the Efficient
  Parallel Solution of Shortest Paths and Other Problems''
  Theoretical Computer Science 168:1 (1996), pp.121-154 (special issue on MFCS'94).