Leonidas Palios

Algorithms, June, 2023

Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks.

[BibT_eX]

[DOI]

J. Comput. Secur., 2023

Adding an Edge in a P4-sparse Graph.

[BibT_eX]

[DOI]

CoRR, 2023

2022

The Rectilinear Steiner Forest Arborescence problem.

[BibT_eX]

[DOI]

Lukasz Mielewczyk

Alejandra Martínez-Moraian

Pawel Zylinski

CoRR, 2022

2021

Optimizing generalized kernels of polygons.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

Illuminating the x-Axis by α-Floodlights.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Capturing Points with a Rotating Polygon (and a 3D Extension).

[BibT_eX]

[DOI]

Carlos Alegría-Galicia

Theory Comput. Syst., 2019

2018

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

[BibT_eX]

[DOI]

Maria Chroni

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Generalized kernels of polygons under rotation.

[BibT_eX]

[DOI]

CoRR, 2018

2016

Realizing Farthest-Point Voronoi Diagrams.

[BibT_eX]

Therese Biedl

Carsten Grimm

Jonathan Richard Shewchuk

Sander Verdonschot

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

An Output-Sensitive Algorithm for Computing the s-Kernel.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 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

Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227].

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Minimum r-Star Cover of Class-3 Orthogonal Polygons.

[BibT_eX]

[DOI]

Petros Tzimas

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

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

[BibT_eX]

[DOI]

Evaggelos Lappas

Eur. J. Comb., 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

2011

Counting Spanning Trees in Graphs Using Modular Decomposition.

[BibT_eX]

[DOI]

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

2010

Computing the Newton Polygon of the Implicit Equation.

[BibT_eX]

[DOI]

Ioannis Z. Emiris

Christos Konaxis

Math. Comput. Sci., 2010

2009

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

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Editorial.

[BibT_eX]

[DOI]

Ioannis Z. Emiris

Comput. Geom., 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

2007

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Detecting Holes and Antiholes in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2007

Detecting features from sliced point clouds.

[BibT_eX]

Ioannis Kyriazis

Ioannis Fudos

Proceedings of the GRAPP 2007, 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

Recognizing HH-free, HHD-free, and Welsh-Powell Opposition 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]

Vassilios V. Dimakopoulos

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

2005

On the hamiltonicity of the cartesian product.

[BibT_eX]

[DOI]

Athanasios S. Poulakidas

Inf. Process. Lett., 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

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 P4-comparability graphs.

[BibT_eX]

[DOI]

J. Algorithms, 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

Recognizing Bipolarizable and P 4-Simplicial Graphs.

[BibT_eX]

[DOI]

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

2002

An efficient shape-based approach to image retrieval.

[BibT_eX]

[DOI]

Ioannis Fudos

Pattern Recognit. Lett., 2002

On the Recognition of P4-Comparability Graphs.

[BibT_eX]

[DOI]

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

Geometric-Similarity Retrieval in Large Image Bases.

[BibT_eX]

[DOI]

Ioannis Fudos

Evaggelia Pitoura

Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

2001

Recognition and Orientation Algorithms for P4-Comparability Graphs.

[BibT_eX]

[DOI]

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

2000

A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

1997

Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Decomposing the Boundary of a Nonconvex Polyhedron.

[BibT_eX]

[DOI]

Bernard Chazelle

Algorithmica, 1997

1996

Optimal Tetrahedralization of the 3D-region "between" a Convex Polyhedron and a Convex Polygon.

[BibT_eX]

[DOI]

Comput. Geom., 1996

1994

Diagnostic expert system inference engine based on the certainty factors model.

[BibT_eX]

[DOI]

Spyros G. Tzafestas

F. Cholin

Knowl. Based Syst., 1994

Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

On the Number of Extrema of a Polyhedron.

[BibT_eX]

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1990

Triangulating a Nonconvex Polytope.

[BibT_eX]

[DOI]

Bernard Chazelle

Discret. Comput. Geom., 1990

1989

Triangulating a Non-Convex Polytype.

[BibT_eX]

[DOI]

Bernard Chazelle