The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Christos D. Zaroliagis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. C. Zaroliagis, P. Soupos, S. Goutas, Dimitris Christodoulakis
    The GRASPIN DB - A Syntax Directed, Language Independent Software Engineering Database. [Citation Graph (2, 0)][DBLP]
    OODBS, 1986, pp:235- [Conf]
  2. Shiva Chaudhuri, Christos D. Zaroliagis
    Shortest Path Queries in Digraphs of Small Treewidth. [Citation Graph (1, 0)][DBLP]
    ICALP, 1995, pp:244-255 [Conf]
  3. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    On-line and Dynamic Algorithms for Shorted Path Problems. [Citation Graph (1, 0)][DBLP]
    STACS, 1995, pp:193-204 [Conf]
  4. Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Using Multi-level Graphs for Timetable Information in Railway Systems. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:43-59 [Conf]
  5. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Experimental Comparison of Shortest Path Approaches for Timetable Information. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:88-99 [Conf]
  6. Ioannis Chatzigiannakis, Athanasios Kinalis, Athanassios S. Poulakidas, Grigorios Prasinos, Christos D. Zaroliagis
    DAP: A Generic Platform for the Simulation of Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    Annual Simulation Symposium, 2004, pp:167-177 [Conf]
  7. Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
    Saving Bits Made Easy. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:140-146 [Conf]
  8. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    On the Efficient Generation of Elliptic Curves over Prime Fields. [Citation Graph (0, 0)][DBLP]
    CHES, 2002, pp:333-348 [Conf]
  9. Paul G. Spirakis, Christos D. Zaroliagis
    Distributed Algorithm Engineering. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:197-228 [Conf]
  10. Christos D. Zaroliagis
    Implementations and Experimental Studies of Dynamic Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:229-278 [Conf]
  11. Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis
    Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:514-528 [Conf]
  12. Shiva Chaudhuri, Christos D. Zaroliagis
    Optimal Parallel Shortest Paths in Small Treewidth Digraphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:31-45 [Conf]
  13. Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis
    An Experimental Study of Dynamic Algorithms for Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:368-380 [Conf]
  14. Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Engineering Planar Separator Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:628-639 [Conf]
  15. Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis
    Improved Bounds for Finger Search on a RAM. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:325-336 [Conf]
  16. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    A Software Library for Elliptic Curve Cryptography. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:625-636 [Conf]
  17. Ioannis Krommidas, Christos D. Zaroliagis
    An Experimental Study of Algorithms for Fully Dynamic Transitive Closure. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:544-555 [Conf]
  18. George Tsaggouris, Christos D. Zaroliagis
    Non-additive Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:822-834 [Conf]
  19. Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis
    Topic 12: Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2006, pp:799- [Conf]
  20. Andrea Pietracaprina, Kieran T. Herley, Christos D. Zaroliagis, Casiano Rodriguez-Leon
    Topic 12 Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:929- [Conf]
  21. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    On the Use of Weber Polynomials in Elliptic Curve Cryptography. [Citation Graph (0, 0)][DBLP]
    EuroPKI, 2004, pp:335-349 [Conf]
  22. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:191-200 [Conf]
  23. Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
    All-Pairs Min-Cut in Sparse Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:363-376 [Conf]
  24. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1989, pp:20-29 [Conf]
  25. Dimitrios Kagaris, Spyros Tragoudas, Grammati E. Pantziou, Christos D. Zaroliagis
    Quickest paths: parallelization and dynamization . [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:39-40 [Conf]
  26. Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
    Computing Mimicking Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:556-567 [Conf]
  27. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Computing Shortest Paths and Distances in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:327-338 [Conf]
  28. Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis
    Dynamic Interpolation Search Revisited. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:382-394 [Conf]
  29. Elisavet Konstantinou, Aristides Kontogeorgis, Yannis C. Stamatiou, Christos D. Zaroliagis
    Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations. [Citation Graph (0, 0)][DBLP]
    ICISC, 2004, pp:261-278 [Conf]
  30. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    On the Construction of Prime Order Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2003, pp:309-322 [Conf]
  31. Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
    A Parallel Priority Data Structure with Applications. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:689-693 [Conf]
  32. Jesper Larsson Träff, Christos D. Zaroliagis
    A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1996, pp:183-194 [Conf]
  33. Alexis C. Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis
    ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:318-327 [Conf]
  34. Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:270-278 [Conf]
  35. George Tsaggouris, Christos D. Zaroliagis
    Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:389-398 [Conf]
  36. Gabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis
    On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. [Citation Graph (0, 0)][DBLP]
    ISPA, 2006, pp:406-417 [Conf]
  37. Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:462-472 [Conf]
  38. Ioannis Chatzigiannakis, Panagiotis Kokkinos, Christos D. Zaroliagis
    Routing protocols for efficient communication in wireless ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    PE-WASUN, 2006, pp:90-97 [Conf]
  39. Christos D. Zaroliagis
    Recent Advances in Multiobjective Optimization. [Citation Graph (0, 0)][DBLP]
    SAGA, 2005, pp:45-47 [Conf]
  40. Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis
    Attack propagation in networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:67-76 [Conf]
  41. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Efficient Parallel Algorithms for Shortest Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:288-300 [Conf]
  42. Dimitrios Kagaris, Spyros Tragoudas, Grammati E. Pantziou, Christos D. Zaroliagis
    On the Computation of Fast Data Transmissions in Networks with Capacities and Delays. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:291-302 [Conf]
  43. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Nearchos Paspallis, Paul G. Spirakis, Christos D. Zaroliagis
    An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:159-171 [Conf]
  44. Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Fast Parallel Algorithms for Coloring Random Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:135-147 [Conf]
  45. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Optimal Parallel Algorithms for Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:1-17 [Conf]
  46. Athanasios Papagelis, Christos D. Zaroliagis
    Searching the Web Through User Information Spaces. [Citation Graph (0, 0)][DBLP]
    WISE, 2005, pp:611-612 [Conf]
  47. Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis
    Computing Mimicking Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:31-49 [Journal]
  48. Shiva Chaudhuri, Christos D. Zaroliagis
    Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:212-226 [Journal]
  49. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Improved Algorithms for Dynamic Shortest Paths. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:4, pp:367-389 [Journal]
  50. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:215-236 [Journal]
  51. Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
    Efficient Computation of Implicit Representations of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:1-16 [Journal]
  52. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:92, n:, pp:85-103 [Journal]
  53. Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
    Dynamic Shortest Paths Containers. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:92, n:, pp:65-84 [Journal]
  54. Christos D. Zaroliagis
    Introduction - Algorithmic MeThods and Models for Optimization of RailwayS - ATMOS 2001. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:50, n:1, pp:- [Journal]
  55. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    Efficient generation of secure elliptic curves. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2007, v:6, n:1, pp:47-63 [Journal]
  56. Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
    All-Pairs Min-Cut in Sparse Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:1, pp:82-110 [Journal]
  57. Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis
    An Experimental Study of Dynamic Algorithms for Transitive Closure. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:9- [Journal]
  58. Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
    Geometric containers for efficient shortest-path computation. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
  59. Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis
    A Parallel Priority Queue with Constant Time Operations. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:4-21 [Journal]
  60. Jesper Larsson Träff, Christos D. Zaroliagis
    A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:9, pp:1103-1124 [Journal]
  61. Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis
    Attack Propagation in Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:5, pp:553-574 [Journal]
  62. Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis
    Transmissions in a network with capacities and delays. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:3, pp:167-174 [Journal]
  63. Christos D. Zaroliagis
    Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:1, pp:25-37 [Journal]
  64. Shiva Chaudhuri, Christos D. Zaroliagis
    Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:2, pp:205-223 [Journal]
  65. Devdatt P. Dubhashi, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    The Fourth Moment in Luby's Distribution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:1, pp:133-140 [Journal]
  66. Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:1, pp:121-154 [Journal]
  67. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Efficient models for timetable information in public transportation systems. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]

  68. TRAILS, a Toolkit for Efficient, Realistic and Evolving Models of Mobility, Faults and Obstacles in Wireless Networks. [Citation Graph (, )][DBLP]


  69. Searchius: A Collaborative Search Engine. [Citation Graph (, )][DBLP]


  70. Iclone: towards online social navigation. [Citation Graph (, )][DBLP]


  71. Enabling Social Navigation on the Web. [Citation Graph (, )][DBLP]


  72. On Assessing Robustness in Transportation Planning. [Citation Graph (, )][DBLP]


  73. The Railway Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  74. Timetable Information: Models and Algorithms. [Citation Graph (, )][DBLP]


  75. Efficient Route Planning in Flight Networks. [Citation Graph (, )][DBLP]


  76. QoS-aware Multicommodity Flows and Transportation Planning. [Citation Graph (, )][DBLP]


  77. Robust Line Planning under Unknown Incentives and Elasticity of Frequencies. [Citation Graph (, )][DBLP]


  78. Distributed simulation of heterogeneous systems of small programmable objects and traditional processors. [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002