Chroni, Maria; Nikolopoulos, Stavros D.; Palios, Leonidas Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. (English) Zbl 1398.05099 Discrete Appl. Math. 250, 145-164 (2018). MSC: 05C21 05C69 68R10 PDFBibTeX XMLCite \textit{M. Chroni} et al., Discrete Appl. Math. 250, 145--164 (2018; Zbl 1398.05099) Full Text: DOI arXiv
Konstantinidis, Athanasios L.; Nikolopoulos, Stavros D.; Papadopoulos, Charis Strong triadic closure in cographs and graphs of low maximum degree. (English) Zbl 1395.68212 Theor. Comput. Sci. 740, 76-84 (2018). MSC: 68R10 05C76 05C85 68Q17 PDFBibTeX XMLCite \textit{A. L. Konstantinidis} et al., Theor. Comput. Sci. 740, 76--84 (2018; Zbl 1395.68212) Full Text: DOI
Konstantinidis, Athanasios L.; Nikolopoulos, Stavros D.; Papadopoulos, Charis Strong triadic closure in cographs and graphs of low maximum degree. (English) Zbl 1434.68363 Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 346-358 (2017). MSC: 68R10 05C69 05C78 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. L. Konstantinidis} et al., Lect. Notes Comput. Sci. 10392, 346--358 (2017; Zbl 1434.68363) Full Text: DOI
Georgiadis, Loukas; Nikolopoulos, Stavros D.; Palios, Leonidas Join-reachability problems in directed graphs. (English) Zbl 1306.05077 Theory Comput. Syst. 55, No. 2, 347-379 (2014). MSC: 05C20 05C85 05C38 68R10 68P05 68Q17 PDFBibTeX XMLCite \textit{L. Georgiadis} et al., Theory Comput. Syst. 55, No. 2, 347--379 (2014; Zbl 1306.05077) Full Text: DOI arXiv
Nikolopoulos, Stavros D.; Palios, Leonidas; Papadopoulos, Charis Counting spanning trees using modular decomposition. (English) Zbl 1283.05134 Theor. Comput. Sci. 526, 41-57 (2014). MSC: 05C30 05C05 05C85 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} et al., Theor. Comput. Sci. 526, 41--57 (2014; Zbl 1283.05134) Full Text: DOI
Ioannidou, Kyriaki; Nikolopoulos, Stavros D. The longest path problem is polynomial on cocomparability graphs. (English) Zbl 1259.68094 Algorithmica 65, No. 1, 177-205 (2013). MSC: 68Q25 05C45 05C85 PDFBibTeX XMLCite \textit{K. Ioannidou} and \textit{S. D. Nikolopoulos}, Algorithmica 65, No. 1, 177--205 (2013; Zbl 1259.68094) Full Text: DOI
Lappas, Evaggelos; Nikolopoulos, Stavros D.; Palios, Leonidas An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs. (English) Zbl 1257.05118 Eur. J. Comb. 34, No. 3, 593-608 (2013). MSC: 05C69 05C85 05C10 05C60 05A05 PDFBibTeX XMLCite \textit{E. Lappas} et al., Eur. J. Comb. 34, No. 3, 593--608 (2013; Zbl 1257.05118) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs. (English) Zbl 1251.05173 Theor. Comput. Sci. 452, 117-131 (2012). MSC: 05C99 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Theor. Comput. Sci. 452, 117--131 (2012; Zbl 1251.05173) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas; Papadopoulos, Charis A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs. (English) Zbl 1246.05152 Theor. Comput. Sci. 439, 41-57 (2012). MSC: 05C85 05C42 05C62 05C05 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} et al., Theor. Comput. Sci. 439, 41--57 (2012; Zbl 1246.05152) Full Text: DOI
Nikolopoulos, Stavros D.; Papadopoulos, Charis A simple linear-time recognition algorithm for weakly quasi-threshold graphs. (English) Zbl 1235.05142 Graphs Comb. 27, No. 4, 557-565 (2011). MSC: 05C85 05C50 05C75 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{C. Papadopoulos}, Graphs Comb. 27, No. 4, 557--565 (2011; Zbl 1235.05142) Full Text: DOI
Ioannidou, Kyriaki; Mertzios, George B.; Nikolopoulos, Stavros D. The longest path problem has a polynomial solution on interval graphs. (English) Zbl 1236.05114 Algorithmica 61, No. 2, 320-341 (2011). Reviewer: Ortrud R. Oellermann (Winnipeg) MSC: 05C38 05C45 05C85 90C39 PDFBibTeX XMLCite \textit{K. Ioannidou} et al., Algorithmica 61, No. 2, 320--341 (2011; Zbl 1236.05114) Full Text: DOI Link
Nikolopoulos, Stavros D.; Palios, Leonidas; Papadopoulos, Charis Counting spanning trees in graphs using modular decomposition. (English) Zbl 1318.05082 Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18–20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 202-213 (2011). MSC: 05C85 05C05 05C30 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} et al., Lect. Notes Comput. Sci. 6552, 202--213 (2011; Zbl 1318.05082) Full Text: DOI
Ioannidou, Kyriaki; Nikolopoulos, Stavros D. The longest path problem is polynomial on cocomparability graphs. (English) Zbl 1308.68065 Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 27-38 (2010). MSC: 68Q25 05C38 05C85 PDFBibTeX XMLCite \textit{K. Ioannidou} and \textit{S. D. Nikolopoulos}, Lect. Notes Comput. Sci. 6410, 27--38 (2010; Zbl 1308.68065) Full Text: DOI
Asdre, Katerina; Nikolopoulos, Stavros D. The 1-fixed-endpoint path cover problem is Polynomial on interval graphs. (English) Zbl 1200.05212 Algorithmica 58, No. 3, 679-710 (2010). MSC: 05C85 05C70 05C38 PDFBibTeX XMLCite \textit{K. Asdre} and \textit{S. D. Nikolopoulos}, Algorithmica 58, No. 3, 679--710 (2010; Zbl 1200.05212) Full Text: DOI Link
Asdre, Katerina; Nikolopoulos, Stavros D. A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs. (English) Zbl 1222.05117 Theor. Comput. Sci. 411, No. 7-9, 967-975 (2010). MSC: 05C38 05C85 PDFBibTeX XMLCite \textit{K. Asdre} and \textit{S. D. Nikolopoulos}, Theor. Comput. Sci. 411, No. 7--9, 967--975 (2010; Zbl 1222.05117) Full Text: DOI
Ioannidou, Kyriaki; Nikolopoulos, Stavros D. Harmonious coloring on subclasses of colinear graphs. (English) Zbl 1274.05163 Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10–12, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11439-7/pbk). Lecture Notes in Computer Science 5942, 136-148 (2010). MSC: 05C15 05C85 68Q17 PDFBibTeX XMLCite \textit{K. Ioannidou} and \textit{S. D. Nikolopoulos}, Lect. Notes Comput. Sci. 5942, 136--148 (2010; Zbl 1274.05163) Full Text: DOI
Nikolopoulos, Stavros D.; Papadopoulos, Charis Counting spanning trees in cographs: an algorithmic approach. (English) Zbl 1224.05240 Ars Comb. 90, 257-274 (2009). MSC: 05C30 05C05 05C85 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{C. Papadopoulos}, Ars Comb. 90, 257--274 (2009; Zbl 1224.05240)
Lappas, Evaggelos; Nikolopoulos, Stavros D.; Palios, Leonidas An \(O(n)\)-time algorithm for the paired-domination problem on permutation graphs. (English) Zbl 1267.05267 Fiala, Jiří (ed.) et al., Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). Lecture Notes in Computer Science 5874, 368-379 (2009). MSC: 05C85 05C69 PDFBibTeX XMLCite \textit{E. Lappas} et al., Lect. Notes Comput. Sci. 5874, 368--379 (2009; Zbl 1267.05267) Full Text: DOI
Ioannidou, Kyriaki; Mertzios, George B.; Nikolopoulos, Stavros D. The longest path problem is polynomial on interval graphs. (English) Zbl 1250.68128 Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 403-414 (2009). MSC: 68Q25 05C38 05C85 PDFBibTeX XMLCite \textit{K. Ioannidou} et al., Lect. Notes Comput. Sci. 5734, 403--414 (2009; Zbl 1250.68128) Full Text: DOI Link
Ioannidou, Kyriaki; Nikolopoulos, Stavros D. Colinear coloring on graphs. (English) Zbl 1211.05041 Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 117-128 (2009). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{K. Ioannidou} and \textit{S. D. Nikolopoulos}, Lect. Notes Comput. Sci. 5431, 117--128 (2009; Zbl 1211.05041) Full Text: DOI
Asdre, Katerina; Nikolopoulos, Stavros D. The 2-terminal-set path cover problem and its polynomial solution on cographs. (English) Zbl 1143.68499 Preparata, Franco P. (ed.) et al., Frontiers in algorithmics. Second annual international workshop, FAW 2008, Changsha, China, June 19–21, 2008. Proceeedings. Berlin: Springer (ISBN 978-3-540-69310-9/pbk). Lecture Notes in Computer Science 5059, 208-220 (2008). MSC: 68R10 05C85 68W05 PDFBibTeX XMLCite \textit{K. Asdre} and \textit{S. D. Nikolopoulos}, Lect. Notes Comput. Sci. 5059, 208--220 (2008; Zbl 1143.68499) Full Text: DOI
Koukopoulos, Dimitrios; Nikolopoulos, Stavros D.; Palios, Leonidas; Spirakis, Paul G. Optimal algorithms for detecting network stability. (English) Zbl 1132.90311 Nakano, Shin-ichi (ed.) et al., WALCOM: Algorithms and computation. Second international workshop, WALCOM 2008, Dhaka, Bangladesh, February 7–8, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77890-5/pbk). Lecture Notes in Computer Science 4921, 188-199 (2008). MSC: 90B18 90B22 68W05 PDFBibTeX XMLCite \textit{D. Koukopoulos} et al., Lect. Notes Comput. Sci. 4921, 188--199 (2008; Zbl 1132.90311) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs. (English) Zbl 1214.05164 Preparata, Franco P. (ed.) et al., Frontiers in algorithmics. First annual international workshop, FAW 2007, Lanzhou, China, August 1–3, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73813-8). Lecture Notes in Computer Science 4613, 281-292 (2007). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Lect. Notes Comput. Sci. 4613, 281--292 (2007; Zbl 1214.05164) Full Text: DOI
Asdre, Katerina; Nikolopoulos, Stavros D. A linear-time algorithm for the \(k\)-fixed-endpoint path cover problem on cographs. (English) Zbl 1135.68502 Networks 50, No. 4, 231-240 (2007). MSC: 68R10 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{K. Asdre} and \textit{S. D. Nikolopoulos}, Networks 50, No. 4, 231--240 (2007; Zbl 1135.68502) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas On the parallel computation of the biconnected and strongly connected co-components of graphs. (English) Zbl 1123.05086 Discrete Appl. Math. 155, No. 14, 1858-1877 (2007). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Discrete Appl. Math. 155, No. 14, 1858--1877 (2007; Zbl 1123.05086) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas Detecting holes and antiholes in graphs. (English) Zbl 1108.68090 Algorithmica 47, No. 2, 119-138 (2007). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Algorithmica 47, No. 2, 119--138 (2007; Zbl 1108.68090) Full Text: DOI
Asdre, Katerina; Nikolopoulos, Stavros D.; Papadopoulos, Charis An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs. (English) Zbl 1109.68131 J. Parallel Distrib. Comput. 67, No. 1, 63-76 (2007). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{K. Asdre} et al., J. Parallel Distrib. Comput. 67, No. 1, 63--76 (2007; Zbl 1109.68131) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas; Papadopoulos, Charis A fully dynamic algorithm for the recognition of \(P_{4}\)-sparse graphs. (English) Zbl 1167.05337 Fomin, Fedor V. (ed.), Graph-theoretic concepts in computer science. 32nd international workshop, WG 2006, Bergen, Norway, June 22–24, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-48381-6/pbk). Lecture Notes in Computer Science 4271, 256-268 (2006). MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} et al., Lect. Notes Comput. Sci. 4271, 256--268 (2006; Zbl 1167.05337) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs. (English) Zbl 1153.05331 Discrete Math. Theor. Comput. Sci. 8, No. 1, 65-82 (2006). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Discrete Math. Theor. Comput. Sci. 8, No. 1, 65--82 (2006; Zbl 1153.05331) Full Text: EuDML Link
Nikolopoulos, Stavros D.; Palios, Leonidas Minimal separators in \(P_4\)-sparse graphs. (English) Zbl 1087.05055 Discrete Math. 306, No. 3, 381-392 (2006). MSC: 05C85 68R10 05C17 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Discrete Math. 306, No. 3, 381--392 (2006; Zbl 1087.05055) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas On the recognition of bipolarizable and \(P_4\)-simplicial graphs. (English) Zbl 1153.05330 Discrete Math. Theor. Comput. Sci. 7, No. 1, 231-254 (2005). MSC: 05C85 05C75 68W40 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Discrete Math. Theor. Comput. Sci. 7, No. 1, 231--254 (2005; Zbl 1153.05330) Full Text: EuDML Link
Fragopoulou, Paraskevi; Nikolopoulos, Stavros D.; Palios, Leonidas Multi-source trees: Algorithms for minimizing eccentricity cost metrics. (English) Zbl 1175.05126 Deng, Xiaotie (ed.) et al., Algorithms and computation. 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19–21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30935-7/pbk). Lecture Notes in Computer Science 3827, 1080-1089 (2005). MSC: 05C85 05C12 68Q25 90B18 PDFBibTeX XMLCite \textit{P. Fragopoulou} et al., Lect. Notes Comput. Sci. 3827, 1080--1089 (2005; Zbl 1175.05126) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas Recognizing HHDS-free graphs. (English) Zbl 1123.68096 Kratsch, Dieter (ed.), Graph-theoretic concepts in computer science. 31st international workshop, WG 2005, Metz, France, June 23–25, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-31000-2/pbk). Lecture Notes in Computer Science 3787, 456-467 (2005). MSC: 68R10 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Lect. Notes Comput. Sci. 3787, 456--467 (2005; Zbl 1123.68096) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas Adding an edge in a cograph. (English) Zbl 1171.68635 Kratsch, Dieter (ed.), Graph-theoretic concepts in computer science. 31st international workshop, WG 2005, Metz, France, June 23–25, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-31000-2/pbk). Lecture Notes in Computer Science 3787, 214-226 (2005). MSC: 68R10 05C40 68Q25 90C35 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Lect. Notes Comput. Sci. 3787, 214--226 (2005; Zbl 1171.68635) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas Efficient parallel recognition of cographs. (English) Zbl 1101.68108 Discrete Appl. Math. 150, No. 1-3, 182-215 (2005). MSC: 68W10 05C85 05C17 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Discrete Appl. Math. 150, No. 1--3, 182--215 (2005; Zbl 1101.68108) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas Hole and antihole detection in graphs. (English) Zbl 1318.05081 Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 850-859 (2004). MSC: 05C85 05C40 68Q25 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, in: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11--13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 850--859 (2004; Zbl 1318.05081)
Nikolopoulos, Stavros D.; Palios, Leonidas Recognizing HHD-free and Welsh-Powell opposition graphs. (English) Zbl 1112.68428 Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21–23, 2004. Revised papers. Berlin: Springer (ISBN 3-540-24132-9/pbk). Lecture Notes in Computer Science 3353, 105-116 (2004). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Lect. Notes Comput. Sci. 3353, 105--116 (2004; Zbl 1112.68428) Full Text: DOI
Nikolopoulos, Stavros D.; Papadopoulos, Charis The number of spanning trees in \(P_4\)-reducible graphs. (English) Zbl 1060.05089 Drmota, Michael (ed.) et al., Mathematics and computer science III. Algorithms, trees, combinatorics and probabilities. Proceedings of the international colloquium of mathematics and computer sciences, Vienna, September 13–17, 2004. Basel: Birkhäuser (ISBN 3-7643-7128-5/hbk). Trends in Mathematics, 141-143 (2004). Reviewer: Hans L. Bodlaender (Utrecht) MSC: 05C85 05C30 05C05 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{C. Papadopoulos}, in: Mathematics and computer science III. Algorithms, trees, combinatorics and probabilities. Proceedings of the international colloquium of mathematics and computer sciences, Vienna, September 13--17, 2004. Basel: Birkhäuser. 141--143 (2004; Zbl 1060.05089)
Nikolopoulos, Stavros D.; Palios, Leonidas Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation. (English) Zbl 1064.68073 Algorithmica 39, No. 2, 95-126 (2004). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Algorithmica 39, No. 2, 95--126 (2004; Zbl 1064.68073) Full Text: DOI
Chong, Ka Wong; Nikolopoulos, Stavros D.; Palios, Leonidas An optimal parallel co-connectivity algorithm. (English) Zbl 1088.68671 Theory Comput. Syst. 37, No. 4, 527-546 (2004). MSC: 68R10 05C85 68W05 68W10 PDFBibTeX XMLCite \textit{K. W. Chong} et al., Theory Comput. Syst. 37, No. 4, 527--546 (2004; Zbl 1088.68671) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas Parallel algorithms for \(P_{4}\)-comparability graphs. (English) Zbl 1066.68159 J. Algorithms 51, No. 1, 77-104 (2004). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, J. Algorithms 51, No. 1, 77--104 (2004; Zbl 1066.68159) Full Text: DOI
Nikolopoulos, Stavros D. Parallel algorithms for Hamiltonian problems on quasi-threshold graphs. (English) Zbl 1072.68124 J. Parallel Distrib. Comput. 64, No. 1, 48-67 (2004). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos}, J. Parallel Distrib. Comput. 64, No. 1, 48--67 (2004; Zbl 1072.68124) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas Recognizing bipolarizable and \(P _{4}\)-simplicial graphs. (English) Zbl 1255.05189 Bodlaender, Hans L. (ed.), Graph-theoretic concepts in computer science. 29th international workshop, WG 2003, Elspeet, The Netherlands, June 19–21, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20452-0/pbk). Lect. Notes Comput. Sci. 2880, 358-369 (2003). MSC: 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Lect. Notes Comput. Sci. 2880, 358--369 (2003; Zbl 1255.05189) Full Text: DOI
Nikolopoulos, Stavros D.; Palios, Leonidas On the recognition of \(P_4\)-comparability graphs. (English) Zbl 1022.68602 Kučera, Luděk (ed.), Graph-theoretic concepts in computer science. 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2573, 355-366 (2002). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Lect. Notes Comput. Sci. 2573, 355--366 (2002; Zbl 1022.68602) Full Text: Link
Nikolopoulos, Stavros D.; Palios, Leonidas Recognition and orientation algorithms for \(P_4\)-comparability graphs. (English) Zbl 1077.05514 Eades, Peter (ed.) et al., Algorithms and computation. 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19–21, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42985-9). Lect. Notes Comput. Sci. 2223, 320-331 (2001). MSC: 05C85 68P05 68R10 68W05 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{L. Palios}, Lect. Notes Comput. Sci. 2223, 320--331 (2001; Zbl 1077.05514) Full Text: Link
Nikolopoulos, Stavros D.; Papadopoulos, Charis On the performance of the first-fit coloring algorithm on permutation graphs. (English) Zbl 1339.68320 Inf. Process. Lett. 75, No. 6, 265-273 (2000). MSC: 68W27 05C15 05C17 05C85 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{C. Papadopoulos}, Inf. Process. Lett. 75, No. 6, 265--273 (2000; Zbl 1339.68320) Full Text: DOI Link
Nikolopoulos, Stavros D. Recognizing cographs and threshold graphs through a classification of their edges. (English) Zbl 1339.05400 Inf. Process. Lett. 74, No. 3-4, 129-139 (2000). MSC: 05C85 05C75 68Q25 68W10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos}, Inf. Process. Lett. 74, No. 3--4, 129--139 (2000; Zbl 1339.05400) Full Text: DOI Link
Nikolopoulos, Stavros D. Coloring permutation graphs in parallel. (English) Zbl 1072.05576 Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999). MSC: 05C85 05C15 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos}, Electron. Notes Discrete Math. 3, no pag. (1999; Zbl 1072.05576) Full Text: Link
Andreou, Maria; Nikolopoulos, Stavros D. NC coloring algorithms for permutation graphs. (English) Zbl 0942.68146 Nord. J. Comput. 6, No. 4, 422-445 (1999). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{M. Andreou} and \textit{S. D. Nikolopoulos}, Nord. J. Comput. 6, No. 4, 422--445 (1999; Zbl 0942.68146)
Nikolopoulos, Stavros D. Constant-time parallel recognition of split graphs. (English) Zbl 0875.68684 Inf. Process. Lett. 54, No. 1, 1-8 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos}, Inf. Process. Lett. 54, No. 1, 1--8 (1995; Zbl 0875.68684) Full Text: DOI
Nikolopoulos, S. D.; Danielopoulos, S. D. Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs. (English) Zbl 0815.68059 Comput. Math. Appl. 29, No. 6, 47-57 (1995). MSC: 68W15 05C75 05C85 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{S. D. Danielopoulos}, Comput. Math. Appl. 29, No. 6, 47--57 (1995; Zbl 0815.68059) Full Text: DOI
Nikolopoulos, Stavros D.; Danielopoulos, Stylianos D. Fast parallel algorithms for finding cutpoints and bridges of undirected graphs. (English) Zbl 1049.68922 Parallel Algorithms Appl. 3, No. 1-2, 45-56 (1994). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} and \textit{S. D. Danielopoulos}, Parallel Algorithms Appl. 3, No. 1--2, 45--56 (1994; Zbl 1049.68922) Full Text: DOI