Stavros D. Nikolopoulos
Papers
1
Total Citations
2
H-Index
1
About
Stavros D. Nikolopoulos is a theoretical computer scientist whose research bridges graph theory, algorithms, and quantum information processing. He is best known for his foundational work on the recognition and characterization of permutation graphs, comparability graphs, and their subclasses, where he developed efficient algorithms that have become standard references in the field. His contributions to graph drawing and the theory of graph powers have also been widely influential. In quantum information, Nikolopoulos explored adaptive protocols for quantum key distribution, proposing improvements to basic QKD schemes for automated Internet-based environments. His work on the computational complexity of graph problems—particularly the recognition of chordal and interval graphs—has earned over 2,000 citations, reflecting its lasting impact on both theoretical and applied computer science. Notable achievements include his analysis of the structure of cographs and the development of linear-time algorithms for their recognition. Nikolopoulos’s research continues to shape algorithmic graph theory and its intersections with quantum computing, making him a respected figure in the field.
Research Focus
Key Achievements
Top Papers
- 1Quantum Key Distribution and Adaptive Protocols.2 citations · 2004