Остановите войну!
for scientists:
default search action
Stavros D. Nikolopoulos
Publications
- 2023
- [j58]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Adding a Tail in Classes of Perfect Graphs. Algorithms 16(6): 289 (2023) - [j57]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. J. Comput. Secur. 31(2): 107-128 (2023) - [i17]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Adding an Edge in a P4-sparse Graph. CoRR abs/2302.00112 (2023) - [i16]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Adding a Tail in Classes of Perfect Graphs. CoRR abs/2302.00657 (2023) - 2018
- [j52]Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios:
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. Discret. Appl. Math. 250: 145-164 (2018) - [i12]Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios:
Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks. CoRR abs/1812.11080 (2018) - 2017
- [i11]Maria Chroni, Stavros D. Nikolopoulos, Leonidas Palios:
Encoding Watermark Numbers as Reducible Permutation Graphs using Self-inverting Permutations. CoRR abs/1712.08482 (2017) - 2014
- [j48]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. Theory Comput. Syst. 55(2): 347-379 (2014) - [j47]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting spanning trees using modular decomposition. Theor. Comput. Sci. 526: 41-57 (2014) - 2013
- [j45]Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios:
An O(n)-time algorithm for the paired domination problem on permutation graphs. Eur. J. Comb. 34(3): 593-608 (2013) - 2012
- [j44]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A fully dynamic algorithm for the recognition of P4-sparse graphs. Theor. Comput. Sci. 439: 41-57 (2012) - [j43]Stavros D. Nikolopoulos, Leonidas Palios:
An O(nm)-time certifying algorithm for recognizing HHD-free graphs. Theor. Comput. Sci. 452: 117-131 (2012) - 2011
- [c28]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. CSR 2011: 195-208 - [c27]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM 2011: 202-213 - 2010
- [i4]Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios:
Join-Reachability Problems in Directed Graphs. CoRR abs/1012.4938 (2010) - 2009
- [j37]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. Discret. Math. 309(10): 3049-3060 (2009) - [c22]Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios:
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. IWOCA 2009: 368-379 - 2008
- [c18]Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis:
Optimal Algorithms for Detecting Network Stability. WALCOM 2008: 188-199 - 2007
- [j36]Stavros D. Nikolopoulos, Leonidas Palios:
Detecting Holes and Antiholes in Graphs. Algorithmica 47(2): 119-138 (2007) - [j35]Stavros D. Nikolopoulos, Leonidas Palios:
On the parallel computation of the biconnected and strongly connected co-components of graphs. Discret. Appl. Math. 155(14): 1858-1877 (2007) - [c17]Stavros D. Nikolopoulos, Leonidas Palios:
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. FAW 2007: 281-292 - 2006
- [j30]Stavros D. Nikolopoulos, Leonidas Palios:
Minimal separators in P4-sparse graphs. Discret. Math. 306(3): 381-392 (2006) - [j29]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discret. Math. Theor. Comput. Sci. 8(1): 65-82 (2006) - [c14]Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. WG 2006: 256-268 - 2005
- [j26]Stavros D. Nikolopoulos, Leonidas Palios:
Efficient parallel recognition of cographs. Discret. Appl. Math. 150(1-3): 182-215 (2005) - [j25]Stavros D. Nikolopoulos, Leonidas Palios:
On the Recognition of Bipolarizable and P4-simplicial Graphs. Discret. Math. Theor. Comput. Sci. 7(1): 231-254 (2005) - [c13]Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios:
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. ISAAC 2005: 1080-1089 - [c12]Stavros D. Nikolopoulos, Leonidas Palios:
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. Panhellenic Conference on Informatics 2005: 68-79 - [c11]Stavros D. Nikolopoulos, Leonidas Palios:
Adding an Edge in a Cograph. WG 2005: 214-226 - [c10]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HHDS-Free Graphs. WG 2005: 456-467 - 2004
- [j24]Stavros D. Nikolopoulos, Leonidas Palios:
Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation. Algorithmica 39(2): 95-126 (2004) - [j23]Stavros D. Nikolopoulos, Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs. Electron. Notes Discret. Math. 17: 229-235 (2004) - [j20]Stavros D. Nikolopoulos, Leonidas Palios:
Parallel algorithms for P4-comparability graphs. J. Algorithms 51(1): 77-104 (2004) - [j18]Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm. Theory Comput. Syst. 37(4): 527-546 (2004) - [j17]Stavros D. Nikolopoulos, Leonidas Palios:
Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs. Parallel Process. Lett. 14(1): 119-129 (2004) - [c8]Stavros D. Nikolopoulos, Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs. CTW 2004: 201-206 - [c7]Stavros D. Nikolopoulos, Leonidas Palios:
Hole and antihole detection in graphs. SODA 2004: 850-859 - [c6]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HHD-free and Welsh-Powell Opposition Graphs. WG 2004: 105-116 - 2003
- [c5]Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing Bipolarizable and P 4-Simplicial Graphs. WG 2003: 358-369 - 2002
- [c4]Stavros D. Nikolopoulos, Leonidas Palios:
On the Recognition of P4-Comparability Graphs. WG 2002: 355-366 - 2001
- [c3]Stavros D. Nikolopoulos, Leonidas Palios:
Recognition and Orientation Algorithms for P4-Comparability Graphs. ISAAC 2001: 320-331
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint