idUS
Depósito de Investigación
Universidad de Sevilla
| | | |
  • Español
Login | Contact | Help | Biblioteca US |
  • Español
 
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of idUSCommunities and CollectionsBy Issue DateAuthorsTitlesSubjectsFunding agenciesAward-winning thesesAuthor profiles USThis CollectionBy Issue DateAuthorsTitlesSubjectsFunding agencies

Services

My AccountLoginDeposit your workApplication to deposit in idUSRequest the deposit to the LibraryMore info

Discover

Author
Wolff, Alexander (3)
Asano, Tetsuo (1)Benkert, Marc (1)Berg, Mark de (1)Cheong, Otfried (1)Daescu, Ovidiu (1)Everett, Hazel (1)Haverkort, Herman (1)Katoh, Naoki (1)Mi, Ningfang (1)... View MoreDate Issued2004 (3)Has file(s)Yes (3)

Policies

Institutional statementBerlin DeclarationidUS Policies

Gatherers

RecolectaOpenAIRE
HispanaEuropeana
Google AcadémicoBase
OAIsterCORE
DART-Europe E-theses PortalLA Referencia

Links of interest

Sherpa/RomeoDulcinea
OpenDOARCreative Commons

Share

 
Search 
  •   idUS
  • Jornadas y Congresos US
  • Matemáticas
  • European Workshop on Computational Geometry (20th. 2004. Sevilla)
  • Search
  •   idUS
  • Jornadas y Congresos US
  • Matemáticas
  • European Workshop on Computational Geometry (20th. 2004. Sevilla)
  • Search

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-3 of 3

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Presentation
Icon

Farthest-point queries with geometric and combinatorial constraints 

Daescu, Ovidiu; Mi, Ningfang; Shin, Chan-Su; Wolff, Alexander (2004)
Presentation
Icon

The minimum Manhattan network problem approximations and exact solutions 

Benkert, Marc; Shirabe, Takeshi; Wolff, Alexander (2004)
A Manhattan p–q path is a geodesic in the Manhattan (or L1-) metric that connects p and q, i.e. a staircase path between p and q. Given a set of points P in the plane, a Manhattan network is a set of axis-parallel line ...
Presentation
Icon

Optimal spanners for axis-aligned rectangles 

Asano, Tetsuo; Berg, Mark de; Cheong, Otfried; Everett, Hazel; Haverkort, Herman; Katoh, Naoki; Wolff, Alexander (2004)
  • About idUS
  • Deposit your work
  • Services
  • Distribution License
  • FAQS
  • idUS in figures
Universidad de Sevilla
  • idUS is a DSpace implementation and is managed by Biblioteca de la Universidad de Sevilla.
  • Last update: 20 April 2022.
Contact  |  Help
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional License.
Creative Commons LicenseLevel AA conformance, W3C WAI Web Content Accessibility Guidelines 2.0Logo Crue
Copyright © 2015. idUS. Depósito de Investigación de la Universidad de Sevilla.
     

     

    This website only uses cookies for technical purposes, it does not receive or transfer personal data from users without their consent.  More information.

    Accept