The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Aris Pagourtzis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis
    Distributed Routing in Tree Networks with Few Landmarks. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:45-57 [Conf]
  2. Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis
    Oblivious gossiping in ad-hoc radio networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:44-51 [Conf]
  3. Leszek Gasieniec, Aris Pagourtzis, Igor Potapov
    Deterministic Communication in Radio Networks with Large Labels. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:512-524 [Conf]
  4. Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis
    Composing Equipotent Teams. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:98-108 [Conf]
  5. Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
    Server Placements, Roman Domination and other Dominating Set Variants. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:280-291 [Conf]
  6. Christos Nomikos, Aris Pagourtzis, Stathis Zachos
    Minimizing Request Blocking in All-Optical Rings. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  7. Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer
    Flexible Train Rostering. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:615-624 [Conf]
  8. Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
    On the Complexity of Train Assignment Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:390-402 [Conf]
  9. Aris Pagourtzis, Stathis Zachos
    The Complexity of Counting Functions with Easy Decision Version. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:741-752 [Conf]
  10. Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
    Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2004, pp:150-161 [Conf]
  11. Stratis Ioannidis, Christos Nomikos, Aris Pagourtzis, Stathis Zachos
    Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Panhellenic Conference on Informatics, 2005, pp:57-67 [Conf]
  12. Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos
    Acceptor-Definable Counting Classes. [Citation Graph (0, 0)][DBLP]
    Panhellenic Conference on Informatics, 2001, pp:453-463 [Conf]
  13. Aris Pagourtzis, Igor Potapov, Wojciech Rytter
    PVM Computation of the Transitive Closure: The Dependency Graph Approach. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2001, pp:249-256 [Conf]
  14. Aris Pagourtzis, Igor Potapov, Wojciech Rytter
    Observations on Parallel Computation of Transitive and Max-Closure Problems. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2002, pp:217-225 [Conf]
  15. Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos
    Computing Frequent Itemsets in Parallel Using Partial Support Trees. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2005, pp:28-37 [Conf]
  16. Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos
    Resource Allocation Problems in Multifiber WDM Tree Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:218-229 [Conf]
  17. Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter
    Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2003, v:46, n:4, pp:391-400 [Journal]
  18. Christos Nomikos, Aris Pagourtzis, Katerina Potika, Stathis Zachos
    Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2006, v:50, n:1, pp:1-14 [Journal]
  19. Christos Nomikos, Aris Pagourtzis, Stathis Zachos
    Satisfying a maximum number of pre-routed requests in all-optical rings. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2003, v:42, n:1, pp:55-63 [Journal]
  20. Christos Nomikos, Aris Pagourtzis, Stathis Zachos
    Routing and path multicoloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:5, pp:249-256 [Journal]
  21. Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos, Panayotis Tsanakas
    Computing frequent itemsets in parallel using partial support trees. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2006, v:79, n:12, pp:1735-1743 [Journal]
  22. Christos Nomikos, Aris Pagourtzis, Stathis Zachos
    Randomized and Approximation Algorithms for Blue-Red Matching. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:715-725 [Conf]
  23. Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik
    Deterministic Communication in Radio Networks with Large Labels. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:1, pp:97-117 [Journal]
  24. Aris Pagourtzis, Katerina Potika, Stathis Zachos
    Path multicoloring with fewer colors in spiders and caterpillars. [Citation Graph (0, 0)][DBLP]
    Computing, 2007, v:80, n:3, pp:255-274 [Journal]

  25. Selfish Routing and Path Coloring in All-Optical Networks. [Citation Graph (, )][DBLP]


  26. A fast parallel algorithm for frequent itemsets mining. [Citation Graph (, )][DBLP]


  27. On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks. [Citation Graph (, )][DBLP]


  28. Brief announcement: k-shot distributed broadcasting in radio networks. [Citation Graph (, )][DBLP]


  29. On the Connection between Interval Size Functions and Path Counting. [Citation Graph (, )][DBLP]


  30. Periodic Metro Scheduling. [Citation Graph (, )][DBLP]


  31. Maximum Profit Wavelength Assignment in WDM Rings. [Citation Graph (, )][DBLP]


  32. Colored Resource Allocation Games. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002