skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Editors contains: "Mavronicolas, Marios"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, Springer)
    Mavronicolas, Marios (Ed.)
    Accepted Manuscript Full Text Available
  2. ; ; ; (, Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023)
    Mavronicolas, Marios (Ed.)
    Let {\$$}{\$$}E={\backslash}{\{}e{\_}1,{\backslash}ldots ,e{\_}n{\backslash}{\}}{\$$}{\$$}be a set of C-oriented disjoint segments in the plane, where C is a given finite set of orientations that spans the plane, and let s and t be two points. We seek a minimum-link C-oriented tour of E, that is, a polygonal path {\$$}{\$$}{\backslash}pi {\$$}{\$$}from s to t that visits the segments of E in order, such that, the orientations of its edges are in C and their number is minimum. We present an algorithm for computing such a tour in {\$$}{\$$}O(|C|^2 {\backslash}cdot n^2){\$$}{\$$}time. This problem already captures most of the difficulties occurring in the study of the more general problem, in which E is a set of not-necessarily-disjoint C-oriented polygons. 
    more » « less
    Full Text Available