The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stavros D. Nikolopoulos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dimitrios Koukopoulos, Stavros D. Nikolopoulos
    Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:93-104 [Conf]
  2. Stavros D. Nikolopoulos
    Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1994, pp:349-358 [Conf]
  3. Stavros D. Nikolopoulos, Andreas Pitsillides, David Tipper
    Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:370-377 [Conf]
  4. Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios
    Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:1080-1089 [Conf]
  5. Stavros D. Nikolopoulos, Leonidas Palios
    Recognition and Orientation Algorithms for P4-Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:320-331 [Conf]
  6. Stavros D. Nikolopoulos, Leonidas Palios
    Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. [Citation Graph (0, 0)][DBLP]
    Panhellenic Conference on Informatics, 2005, pp:68-79 [Conf]
  7. Stavros D. Nikolopoulos, Leonidas Palios
    Hole and antihole detection in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:850-859 [Conf]
  8. Stavros D. Nikolopoulos, Leonidas Palios
    On the Recognition of P4-Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:355-366 [Conf]
  9. Stavros D. Nikolopoulos, Leonidas Palios
    Recognizing Bipolarizable and P 4-Simplicial Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:358-369 [Conf]
  10. Stavros D. Nikolopoulos, Leonidas Palios
    Recognizing HHD-free and Welsh-Powell Opposition Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:105-116 [Conf]
  11. Stavros D. Nikolopoulos, Leonidas Palios
    Adding an Edge in a Cograph. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:214-226 [Conf]
  12. Stavros D. Nikolopoulos, Leonidas Palios
    Recognizing HHDS-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:456-467 [Conf]
  13. Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
    A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:256-268 [Conf]
  14. Katerina Asdre, Stavros D. Nikolopoulos
    P-tree structures and event horizon: efficient event-set implementations. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2005, pp:2700-2709 [Conf]
  15. Stavros D. Nikolopoulos, Leonidas Palios
    Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:2, pp:95-126 [Journal]
  16. Stavros D. Nikolopoulos
    Coloring permutation graphs in parallel. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:165-195 [Journal]
  17. Stavros D. Nikolopoulos, Leonidas Palios
    Efficient parallel recognition of cographs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:182-215 [Journal]
  18. Stavros D. Nikolopoulos, Leonidas Palios
    Minimal separators in P4-sparse graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:381-392 [Journal]
  19. Stavros D. Nikolopoulos, Charis Papadopoulos
    The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:3, pp:383-397 [Journal]
  20. Stavros D. Nikolopoulos
    Recognizing cographs and threshold graphs through a classification of their edges. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:3-4, pp:129-139 [Journal]
  21. Stavros D. Nikolopoulos
    Constant-Time Parallel Recognition of Split Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:1, pp:1-8 [Journal]
  22. Stavros D. Nikolopoulos, Christos Nomikos, Panos Rondogiannis
    A limit characterization for the number of spanning trees of graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:6, pp:307-313 [Journal]
  23. Stavros D. Nikolopoulos, Charis Papadopoulos
    On the performance of the first-fit coloring algorithm on permutation graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:6, pp:265-273 [Journal]
  24. Stavros D. Nikolopoulos, Panos Rondogiannis
    On the Number of Spanning Trees of Multi-Star Related Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:4, pp:183-188 [Journal]
  25. Stavros D. Nikolopoulos
    Optimal Gray-code labeling and recognition algorithms for hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:137, n:1-4, pp:189-210 [Journal]
  26. Stavros D. Nikolopoulos, Leonidas Palios
    Parallel algorithms for P4-comparability graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:51, n:1, pp:77-104 [Journal]
  27. Katerina Asdre, Stavros D. Nikolopoulos
    P-Tree Structures and Event Horizon: Efficient Event-Set Implementations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Sci. Technol., 2006, v:21, n:1, pp:19-26 [Journal]
  28. Stavros D. Nikolopoulos
    Parallel algorithms for Hamiltonian problems on quasi-threshold graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:1, pp:48-67 [Journal]
  29. Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
    An optimal parallel solution for the path cover problem on P4-sparse graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:1, pp:63-76 [Journal]
  30. Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios
    An Optimal Parallel Co-Connectivity Algorithm. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:4, pp:527-546 [Journal]
  31. Maria I. Andreou, Stavros D. Nikolopoulos
    NC Coloring Algorithms for Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:4, pp:422-445 [Journal]
  32. Stavros D. Nikolopoulos, Leonidas Palios
    Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:1, pp:119-129 [Journal]
  33. Maria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos
    An Experimental Study of Stability in Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:189-202 [Conf]
  34. Stavros D. Nikolopoulos, Leonidas Palios
    An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:281-292 [Conf]
  35. Stavros D. Nikolopoulos, Leonidas Palios
    Detecting Holes and Antiholes in Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:2, pp:119-138 [Journal]
  36. Stavros D. Nikolopoulos, Charis Papadopoulos
    The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  37. Katerina Asdre, Kyriaki Ioannidou, Stavros D. Nikolopoulos
    The harmonious coloring problem is NP-complete for interval and permutation graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:17, pp:2377-2382 [Journal]
  38. Stavros D. Nikolopoulos, Leonidas Palios
    On the parallel computation of the biconnected and strongly connected co-components of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:14, pp:1858-1877 [Journal]
  39. Stavros D. Nikolopoulos, Leonidas Palios
    On the Recognition of Bipolarizable and P4-simplicial Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:231-254 [Journal]
  40. Stavros D. Nikolopoulos, Leonidas Palios
    Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:65-82 [Journal]
  41. Stavros D. Nikolopoulos, Charis Papadopoulos
    On the number of spanning trees of Knm±G graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:235-248 [Journal]
  42. Katerina Asdre, Stavros D. Nikolopoulos
    NP-completeness results for some problems on subclasses of bipartite and chordal graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:248-259 [Journal]

  43. The Longest Path Problem Is Polynomial on Interval Graphs. [Citation Graph (, )][DBLP]


  44. Harmonious Coloring on Subclasses of Colinear Graphs. [Citation Graph (, )][DBLP]


  45. Colinear Coloring on Graphs. [Citation Graph (, )][DBLP]


  46. Optimal Algorithms for Detecting Network Stability. [Citation Graph (, )][DBLP]


  47. The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs. [Citation Graph (, )][DBLP]


  48. A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. [Citation Graph (, )][DBLP]


  49. An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. [Citation Graph (, )][DBLP]


  50. The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph [Citation Graph (, )][DBLP]


  51. Linear Coloring and Linear Graphs [Citation Graph (, )][DBLP]


  52. Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
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