Stavros D. Nikolopoulos

J. Comput. Secur., 2021

A Stochastic Graph-based Model for the Simulation of SARS-CoV-2 Transmission.

[BibT_eX]

[DOI]

Christos Chondros

Christos Georgiou-Mousses

CoRR, 2021

SARiSsa - A Mobile Application for the Proactive Control of SARS-CoV-2 Spread.

[BibT_eX]

[DOI]

Christos Chondros

Vasileios Vouronikos

CoRR, 2021

Detection and Classification of Malicious Software based on Regional Matching of Temporal Graphs.

[BibT_eX]

[DOI]

Helen-Maria Dounavi

Proceedings of the CompSysTech '21: International Conference on Computer Systems and Technologies '21, 2021

2020

An Algorithmic Framework for Malicious Software Detection Exploring Structural Characteristics of Behavioral Graphs.

[BibT_eX]

[DOI]

Alvaro Chysi

Proceedings of the International Conference on Computer Systems and Technologies 2020, 2020

2019

Malicious Software Detection utilizing Temporal-Graphs.

[BibT_eX]

[DOI]

Athanasios L. Konstantinidis

Proceedings of the 20th International Conference on Computer Systems and Technologies, 2019

2018

Strong triadic closure in cographs and graphs of low maximum degree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Encoding watermark numbers as reducible permutation graphs using self-inverting permutations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks.

[BibT_eX]

[DOI]

CoRR, 2018

Malicious Software Detection and Classification utilizing Temporal-Graphs of System-call Group Relations.

[BibT_eX]

[DOI]

CoRR, 2018

A Graph-based Model for Malicious Software Detection Exploiting Domination Relations between System-call Groups.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Computer Systems and Technologies, 2018

2017

A graph-based model for malware detection and classification using system-call groups.

[BibT_eX]

[DOI]

J. Comput. Virol. Hacking Tech., 2017

Preventing malware pandemics in mobile devices by establishing response-time bounds.

[BibT_eX]

[DOI]

J. Inf. Secur. Appl., 2017

Experimental Study of the Resilience of a Graph-based Watermarking System under Edge Modifications.

[BibT_eX]

[DOI]

Maria Rini

Proceedings of the 21st Pan-Hellenic Conference on Informatics, 2017

Defending Hardware-based Attacks on Trusted Computing using a Hardware-Integrity Attestation Protocol.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Computer Systems and Technologies, 2017

2016

Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of Self-inverting Permutations.

[BibT_eX]

[DOI]

CoRR, 2016

Graph-structured Watermarking using Bitonic Sequences of Self-inverting Permutations.

[BibT_eX]

[DOI]

Proceedings of the 20th Pan-Hellenic Conference on Informatics, 2016

A Model for Establishing Response-time Bounds to Prevent Malware Pandemics in Mobile Devices.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Computer Systems and Technologies, 2016

2015

Watermarking PDF Documents using Various Representations of Self-inverting Permutations.

[BibT_eX]

[DOI]

Proceedings of the WEBIST 2015, 2015

Malicious software classification based on relations of system-call groups.

[BibT_eX]

[DOI]

Proceedings of the 19th Panhellenic Conference on Informatics, 2015

Encoding numbers into reducible permutation graphs using heap-ordered trees.

[BibT_eX]

[DOI]

Proceedings of the 19th Panhellenic Conference on Informatics, 2015

A graph-based model for malicious code detection exploiting dependencies of system-call groups.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Computer Systems and Technologies, 2015

2014

Counting spanning trees using modular decomposition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Join-Reachability Problems in Directed Graphs.

[BibT_eX]

[DOI]

Loukas Georgiadis

Theory Comput. Syst., 2014

Detecting Malicious Code by Exploiting Dependencies of System-call Groups.

[BibT_eX]

[DOI]

CoRR, 2014

WaterRPG: A Graph-based Dynamic Watermarking Model for Software Protection.

[BibT_eX]

[DOI]

CoRR, 2014

From Image to Audio Watermarking Using Self-Inverting Permutations.

[BibT_eX]

[DOI]

Proceedings of the WEBIST 2014, 2014

2013

An O(n)-time algorithm for the paired domination problem on permutation graphs.

[BibT_eX]

[DOI]

Evaggelos Lappas

Eur. J. Comb., 2013

The Longest Path Problem Is Polynomial on Cocomparability Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2013

Watermarking Digital Images in the Frequency Domain: Performance and Attack Issues.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems and Technologies - 9th International Conference, 2013

Watermarking Images in the Frequency Domain by Exploiting Self-inverting Permutations.

[BibT_eX]

Proceedings of the WEBIST 2013, 2013

A Dynamic Watermarking Model for Embedding Reducible Permutation Graphs into Software.

[BibT_eX]

[DOI]

Proceedings of the SECRYPT 2013, 2013

Evaluating the WaterRpg software watermarking model on Java application programs.

[BibT_eX]

[DOI]

Proceedings of the 17th Panhellenic Conference on Informatics, 2013

Design and Evaluation of a Graph Codec System for Software Watermarking.

[BibT_eX]

Proceedings of the DATA 2013 - Proceedings of the 2nd International Conference on Data Technologies and Applications, Reykjavík, Iceland, 29, 2013

Watermarking Java application programs using the WaterRpg dynamic model.

[BibT_eX]

[DOI]

Proceedings of the Computer Systems and Technologies, 2013

2012

A fully dynamic algorithm for the recognition of P4-sparse graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

An O(nm)-time certifying algorithm for recognizing HHD-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Watermarking Images using 2D Representations of Self-inverting Permutations.

[BibT_eX]

Proceedings of the WEBIST 2012 - Proceedings of the 8th International Conference on Web Information Systems and Technologies, Porto, Portugal, 18, 2012

A watermarking system for teaching intellectual property rights: Implementation and performance.

[BibT_eX]

[DOI]

Proceedings of the 2012 International Conference on Information Technology Based Higher Education and Training, 2012

An Embedding Graph-based Model for Software Watermarking.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2012

A Watermarking System for Teaching Students to Respect Intellectual Property Rights.

[BibT_eX]

Proceedings of the CSEDU 2012, 2012

Multiple encoding of a watermark number into reducible permutation graphs using cotrees.

[BibT_eX]

[DOI]

Proceedings of the 2012 Conference on Computer Systems and Technologies, 2012

An Efficient Graph Codec System for Software Watermarking.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual IEEE Computer Software and Applications Conference Workshops, 2012

2011

A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Efficient Encoding of Watermark Numbers as Reducible Permutation Graphs

[BibT_eX]

[DOI]

CoRR, 2011

The Longest Path Problem has a Polynomial Solution on Interval Graphs.

[BibT_eX]

[DOI]

George B. Mertzios

Algorithmica, 2011

Counting Spanning Trees in Graphs Using Modular Decomposition.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Encoding watermark numbers as cographs using self-inverting permutations.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Computer Systems and Technologies, 2011

2010

A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2010

Harmonious Coloring on Subclasses of Colinear Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Encoding watermark integers as self-inverting permutations.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, 2010

2009

Maximizing the number of spanning trees in Kn-complements of asteroidal graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Counting Spanning Trees in Cographs: An Algorithmic Approach.

[BibT_eX]

Ars Comb., 2009

Colinear Coloring on Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

The Longest Path Problem Is Polynomial on Interval Graphs.

[BibT_eX]

[DOI]

George B. Mertzios

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Linear Coloring and Linear Graphs

[BibT_eX]

[DOI]

CoRR, 2008

The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph

[BibT_eX]

[DOI]

CoRR, 2008

Optimal Algorithms for Detecting Network Stability.

[BibT_eX]

[DOI]

Dimitrios Koukopoulos

Paul G. Spirakis

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

NP-completeness results for some problems on subclasses of bipartite and chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs.

[BibT_eX]

[DOI]

Networks, 2007

An optimal parallel solution for the path cover problem on P4-sparse graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

On the parallel computation of the biconnected and strongly connected co-components of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

The harmonious coloring problem is NP-complete for interval and permutation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Detecting Holes and Antiholes in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2007

An Experimental Study of Stability in Heterogeneous Networks.

[BibT_eX]

[DOI]

Dimitrios Koukopoulos

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

2006

P-Tree Structures and Event Horizon: Efficient Event-Set Implementations.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2006

Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

On the number of spanning trees of Knm±G graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

Minimal separators in P4-sparse graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates.

[BibT_eX]

[DOI]

Dimitrios Koukopoulos

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

On the Recognition of Bipolarizable and P4-simplicial Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2005

Efficient parallel recognition of cographs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs

[BibT_eX]

[DOI]

CoRR, 2005

Recognizing HHDS-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Adding an Edge in a Cograph.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.

[BibT_eX]

[DOI]

Proceedings of the Advances in Informatics, 2005

Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics.

[BibT_eX]

[DOI]

Paraskevi Fragopoulou

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Parallel Algorithms For Recognizing P5-Free And P5-Free Weakly Chordal Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2004

An Optimal Parallel Co-Connectivity Algorithm.

[BibT_eX]

[DOI]

Ka Wong Chong

Theory Comput. Syst., 2004

Parallel algorithms for Hamiltonian problems on quasi-threshold graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

Parallel algorithms for P4-comparability graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2004

A limit characterization for the number of spanning trees of graphs.

[BibT_eX]

[DOI]

Christos Nomikos

Panos Rondogiannis

Inf. Process. Lett., 2004

The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

On the Strongly Connected and Biconnected Components of the Complement of Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation.

[BibT_eX]

[DOI]

Algorithmica, 2004

Recognizing HHD-free and Welsh-Powell Opposition Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Hole and antihole detection in graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Counting Spanning Trees in Cographs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Recognizing Bipolarizable and P 4-Simplicial Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002

Coloring permutation graphs in parallel.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

On the Recognition of P4-Comparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

Optimal Gray-code labeling and recognition algorithms for hypercubes.

[BibT_eX]

[DOI]

Inf. Sci., 2001

Hamiltonian Cycles in Quasi-threshold Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Recognition and Orientation Algorithms for P4-Comparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

On the performance of the first-fit coloring algorithm on permutation graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Recognizing cographs and threshold graphs through a classification of their edges.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

1999

NC Coloring Algorithms for Permutation Graphs.

[BibT_eX]

Maria I. Andreou

Nord. J. Comput., 1999

1998

On the Number of Spanning Trees of Multi-Star Related Graphs.

[BibT_eX]

[DOI]

Panos Rondogiannis

Inf. Process. Lett., 1998

1997

Sub-optimal solutions to track detection problem using graph theoretic concepts.

[BibT_eX]

[DOI]

George Samaras

J. Syst. Archit., 1997

On complete systems of invariants for small graphs.

[BibT_eX]

[DOI]

Frank Harary

Int. J. Comput. Math., 1997

Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph.

[BibT_eX]

[DOI]

Andreas Pitsillides

David Tipper

Proceedings of the Proceedings IEEE INFOCOM '97, 1997

1996

Parallel Block-finding Using Distance Matrices.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 1996

1995

Constant-Time Parallel Recognition of Split Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

1994

Fast Parallel Algorithms for Finding Cutpoints and Bridges of Undirected Graphs.

[BibT_eX]

[DOI]

Stylianos D. Danielopoulos

Parallel Algorithms Appl., 1994

Odd-even, compare-exchange parallel sorting.

[BibT_eX]

[DOI]

Stylianos D. Danielopoulos

Microprocess. Microprogramming, 1994

Parallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing: CONPAR 94, 1994

1993

An experimental analysis of event set algorithms for discrete event simulation.

[BibT_eX]

[DOI]