 | 2009 |
|---|
| 59 |       | Stavros D. Nikolopoulos,
Charis Papadopoulos:
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs.
CTW 2009: 23-27 |
| 58 | | Evaggelos Lappas,
Stavros D. Nikolopoulos,
Leonidas Palios:
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs.
IWOCA 2009: 368-379 |
| 57 | | Kyriaki Ioannidou,
George B. Mertzios,
Stavros D. Nikolopoulos:
The Longest Path Problem Is Polynomial on Interval Graphs.
MFCS 2009: 403-414 |
| 56 | | Kyriaki Ioannidou,
Stavros D. Nikolopoulos:
Colinear Coloring on Graphs.
WALCOM 2009: 117-128 |
| 2008 |
|---|
| 55 | | Katerina Asdre,
Stavros D. Nikolopoulos:
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs.
FAW 2008: 208-220 |
| 54 | | Dimitrios Koukopoulos,
Stavros D. Nikolopoulos,
Leonidas Palios,
Paul G. Spirakis:
Optimal Algorithms for Detecting Network Stability.
WALCOM 2008: 188-199 |
| 53 | | Katerina Asdre,
Stavros D. Nikolopoulos:
The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph
CoRR abs/0806.4372: (2008) |
| 52 | | Kyriaki Ioannidou,
Stavros D. Nikolopoulos:
Linear Coloring and Linear Graphs
CoRR abs/0807.4234: (2008) |
| 2007 |
|---|
| 51 | | Stavros D. Nikolopoulos,
Leonidas Palios:
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs.
FAW 2007: 281-292 |
| 50 | | Maria Chroni,
Dimitrios Koukopoulos,
Stavros D. Nikolopoulos:
An Experimental Study of Stability in Heterogeneous Networks.
WEA 2007: 189-202 |
| 49 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Detecting Holes and Antiholes in Graphs.
Algorithmica 47(2): 119-138 (2007) |
| 48 | | Stavros D. Nikolopoulos,
Leonidas Palios:
On the parallel computation of the biconnected and strongly connected co-components of graphs.
Discrete Applied Mathematics 155(14): 1858-1877 (2007) |
| 47 | | Katerina Asdre,
Kyriaki Ioannidou,
Stavros D. Nikolopoulos:
The harmonious coloring problem is NP-complete for interval and permutation graphs.
Discrete Applied Mathematics 155(17): 2377-2382 (2007) |
| 46 | | Katerina Asdre,
Stavros D. Nikolopoulos,
Charis Papadopoulos:
An optimal parallel solution for the path cover problem on P4-sparse graphs.
J. Parallel Distrib. Comput. 67(1): 63-76 (2007) |
| 45 | | Katerina Asdre,
Stavros D. Nikolopoulos:
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs.
Networks 50(4): 231-240 (2007) |
| 44 | | Katerina Asdre,
Stavros D. Nikolopoulos:
NP-completeness results for some problems on subclasses of bipartite and chordal graphs.
Theor. Comput. Sci. 381(1-3): 248-259 (2007) |
| 2006 |
|---|
| 43 | | Dimitrios Koukopoulos,
Stavros D. Nikolopoulos:
Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates.
CIAC 2006: 93-104 |
| 42 | | Stavros D. Nikolopoulos,
Leonidas Palios,
Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs.
WG 2006: 256-268 |
| 41 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Minimal separators in P4-sparse graphs.
Discrete Mathematics 306(3): 381-392 (2006) |
| 40 | | Stavros D. Nikolopoulos,
Charis Papadopoulos:
On the number of spanning trees of Knm±G graphs.
Discrete Mathematics & Theoretical Computer Science 8(1): 235-248 (2006) |
| 39 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs.
Discrete Mathematics & Theoretical Computer Science 8(1): 65-82 (2006) |
| 38 | | Katerina Asdre,
Stavros D. Nikolopoulos:
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations.
J. Comput. Sci. Technol. 21(1): 19-26 (2006) |
| 2005 |
|---|
| 37 | | Paraskevi Fragopoulou,
Stavros D. Nikolopoulos,
Leonidas Palios:
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics.
ISAAC 2005: 1080-1089 |
| 36 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.
Panhellenic Conference on Informatics 2005: 68-79 |
| 35 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Adding an Edge in a Cograph.
WG 2005: 214-226 |
| 34 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognizing HHDS-Free Graphs.
WG 2005: 456-467 |
| 33 | | Katerina Asdre,
Stavros D. Nikolopoulos:
P-tree structures and event horizon: efficient event-set implementations.
Winter Simulation Conference 2005: 2700-2709 |
| 32 | | Stavros D. Nikolopoulos,
Charis Papadopoulos:
The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs
CoRR abs/cs/0502038: (2005) |
| 31 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Efficient parallel recognition of cographs.
Discrete Applied Mathematics 150(1-3): 182-215 (2005) |
| 30 | | Stavros D. Nikolopoulos,
Leonidas Palios:
On the Recognition of Bipolarizable and P4-simplicial Graphs.
Discrete Mathematics & Theoretical Computer Science 7(1): 231-254 (2005) |
| 2004 |
|---|
| 29 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Hole and antihole detection in graphs.
SODA 2004: 850-859 |
| 28 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognizing HHD-free and Welsh-Powell Opposition Graphs.
WG 2004: 105-116 |
| 27 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation.
Algorithmica 39(2): 95-126 (2004) |
| 26 | | Stavros D. Nikolopoulos,
Leonidas Palios:
On the Strongly Connected and Biconnected Components of the Complement of Graphs.
Electronic Notes in Discrete Mathematics 17: 229-235 (2004) |
| 25 | | Stavros D. Nikolopoulos,
Charis Papadopoulos:
The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.
Graphs and Combinatorics 20(3): 383-397 (2004) |
| 24 | | Stavros D. Nikolopoulos,
Christos Nomikos,
Panos Rondogiannis:
A limit characterization for the number of spanning trees of graphs.
Inf. Process. Lett. 90(6): 307-313 (2004) |
| 23 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Parallel algorithms for P4-comparability graphs.
J. Algorithms 51(1): 77-104 (2004) |
| 22 | | Stavros D. Nikolopoulos:
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs.
J. Parallel Distrib. Comput. 64(1): 48-67 (2004) |
| 21 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs.
Parallel Processing Letters 14(1): 119-129 (2004) |
| 20 | | Ka Wong Chong,
Stavros D. Nikolopoulos,
Leonidas Palios:
An Optimal Parallel Co-Connectivity Algorithm.
Theory Comput. Syst. 37(4): 527-546 (2004) |
| 2003 |
|---|
| 19 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognizing Bipolarizable and P 4-Simplicial Graphs.
WG 2003: 358-369 |
| 18 | | Stavros D. Nikolopoulos,
Charis Papadopoulos:
Counting Spanning Trees in Cographs.
Electronic Notes in Discrete Mathematics 13: 84-92 (2003) |
| 2002 |
|---|
| 17 | | Stavros D. Nikolopoulos,
Leonidas Palios:
On the Recognition of P4-Comparability Graphs.
WG 2002: 355-366 |
| 16 |  | Stavros D. Nikolopoulos:
Coloring permutation graphs in parallel.
Discrete Applied Mathematics 120(1-3): 165-195 (2002) |
| 2001 |
|---|
| 15 | | Stavros D. Nikolopoulos,
Leonidas Palios:
Recognition and Orientation Algorithms for P4-Comparability Graphs.
ISAAC 2001: 320-331 |
| 14 | | Stavros D. Nikolopoulos:
Hamiltonian Cycles in Quasi-threshold Graphs.
Electronic Notes in Discrete Mathematics 8: 67 (2001) |
| 13 | | Stavros D. Nikolopoulos:
Optimal Gray-code labeling and recognition algorithms for hypercubes.
Inf. Sci. 137(1-4): 189-210 (2001) |
| 2000 |
|---|
| 12 | | Stavros D. Nikolopoulos:
Recognizing cographs and threshold graphs through a classification of their edges.
Inf. Process. Lett. 74(3-4): 129-139 (2000) |
| 11 | | Stavros D. Nikolopoulos,
Charis Papadopoulos:
On the performance of the first-fit coloring algorithm on permutation graphs.
Inf. Process. Lett. 75(6): 265-273 (2000) |
| 1999 |
|---|
| 10 | | Stavros D. Nikolopoulos:
Coloring permutation graphs in parallel.
Electronic Notes in Discrete Mathematics 3: 146-152 (1999) |
| 9 | | Maria I. Andreou,
Stavros D. Nikolopoulos:
NC Coloring Algorithms for Permutation Graphs.
Nord. J. Comput. 6(4): 422-445 (1999) |
| 1998 |
|---|
| 8 | | Stavros D. Nikolopoulos,
Panos Rondogiannis:
On the Number of Spanning Trees of Multi-Star Related Graphs.
Inf. Process. Lett. 65(4): 183-188 (1998) |
| 1997 |
|---|
| 7 | | Stavros D. Nikolopoulos,
Andreas Pitsillides,
David Tipper:
Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph.
INFOCOM 1997: 370-377 |
| 6 | | Stavros D. Nikolopoulos,
George Samaras:
Sub-optimal solutions to track detection problem using graph theoretic concepts.
Journal of Systems Architecture 42(9-10): 743-760 (1997) |
| 1996 |
|---|
| 5 | | Stavros D. Nikolopoulos:
Parallel Block-finding Using Distance Matrices.
Parallel Algorithms Appl. 9(1-2): 1-13 (1996) |
| 1995 |
|---|
| 4 | | Stavros D. Nikolopoulos:
Constant-Time Parallel Recognition of Split Graphs.
Inf. Process. Lett. 54(1): 1-8 (1995) |
| 1994 |
|---|
| 3 | | Stavros D. Nikolopoulos:
Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices.
CONPAR 1994: 349-358 |
| 2 | | Stavros D. Nikolopoulos,
Stylianos D. Danielopoulos:
Odd-even, compare-exchange parallel sorting.
Microprocessing and Microprogramming 40(7): 487-497 (1994) |
| 1 | | Stavros D. Nikolopoulos,
Stylianos D. Danielopoulos:
Fast Parallel Algorithms for Finding Cutpoints and Bridges of Undirected Graphs.
Parallel Algorithms Appl. 3(1-2): 45-55 (1994) |
