Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Leonidas Palios"'
Publikováno v:
Algorithms, Vol 16, Iss 6, p 289 (2023)
Consider a graph G which belongs to a graph class C. We are interested in connecting a node w∉V(G) to G by a single edge uw where u∈V(G); we call such an edge a tail. As the graph resulting from G after the addition of the tail, denoted G+uw, nee
Externí odkaz:
https://doaj.org/article/4b9e67c5081e4aaab564832af2f66953
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 8, Iss 1 (2006)
In this paper, we consider the recognition problem on three classes of perfectly orderable graphs, namely, the HH-free, the HHD-free, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion
Externí odkaz:
https://doaj.org/article/4a4fb90d18954eb29694e3eac3200c9c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 7, Iss 1 (2005)
The classes of Raspail (also known as Bipolarizable) and P 4-simplicial graphs were introduced by Hoàng and Reed who showed that both classes are perfectly orderable and admit polynomial-time recognition algorithms HR1. In this paper, we consider th
Externí odkaz:
https://doaj.org/article/dfab5002c8d54fbeb91b0ebd5c1bd64b
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 7 (2005)
The classes of Raspail (also known as Bipolarizable) and P_4-simplicial graphs were introduced by Hoàng and Reed who showed that both classes are perfectly orderable and admit polynomial-time recognition algorithms HR1. In this paper, we consider th
Externí odkaz:
https://doaj.org/article/c2c5d6048f0f41f2a61d0c4b6e2f73ba
Publikováno v:
Journal of Computer Security. 31:107-128
Software watermarking is a defense technique used to prevent or discourage software piracy by embedding a signature in the code. In (Discrete Applied Mathematics 250 (2018) 145–164), a software watermarking system is presented which encodes an inte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb7039f5e669382e4c1549900f1ba170
https://doi.org/10.3233/jcs-210048
https://doi.org/10.3233/jcs-210048
Publikováno v:
Journal of Global Optimization
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Let $\mathcal{O}$ be a set of $k$ orientations in the plane, and let $P$ be a simple polygon in the plane. Given two points $p,q$ inside $P$, we say that $p$ $\mathcal{O}$-\emph{sees} $q$ if there is an $\mathcal{O}$-\emph{staircase} contained in $P$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07b5f48b8fc5f62b1f9ae4cb06977647
Publikováno v:
Discrete Applied Mathematics. 250:145-164
Several graph theoretic watermark methods have been proposed to encode numbers as graph structures in software watermarking environments. In this paper, we propose an efficient and easily implementable codec system for encoding watermark numbers as r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d65c95d7e0909e9ab7fc33a9aa29399
https://doi.org/10.1016/j.dam.2018.04.021
https://doi.org/10.1016/j.dam.2018.04.021
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Theory of Computing Systems
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Theory of Computing Systems
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a line, or a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe76c4efa78295c4d8587a0063bd10cc
http://arxiv.org/abs/1805.02570
http://arxiv.org/abs/1805.02570
Publikováno v:
Information Processing Letters. 114:646-654
Recently, a gap in Step 4 of Algorithm Sweep3 (and thus in Step 4 of Algorithm Minimum-Guard-Cover) presented in our paper entitled ''Note on covering monotone orthogonal polygons with star-shaped polygons'', which appeared in Information Processing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbc4b8c1f2bc2eda87ab7d76731f9cd7
https://doi.org/10.1016/j.ipl.2014.03.016
https://doi.org/10.1016/j.ipl.2014.03.016
Publikováno v:
Theoretical Computer Science. 526:41-57
In this paper we present an algorithm for determining the number of spanning trees of a graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by contracting the modular decomposition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::692f4ec588af8e93394580906308f309
https://doi.org/10.1016/j.tcs.2014.01.012
https://doi.org/10.1016/j.tcs.2014.01.012