• français
    • English
    • español
    •  Login
    • fr
    • en
    • esp
+ Advanced search
    • Submit
    • Submission help
+ Advanced search
Search 
  •   DSpace Home
  • Oskar-Bordeaux
  • Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800
  • Search
  •   DSpace Home
  • Oskar-Bordeaux
  • Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 31-40 of 63

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Date Asc
  • Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
  • Single search:
  • 63CSV Dublin core
  • 63Excel
  • 63CSV simplified
  • 63BibTeX
  • 63RIS
  • 63XML
  • Create a basket
  • Basket:
  • 63Add
  • 0See the basket
  • Clear
  • Single search mode
  • Selective Export
  • Help
  • Global styles
  • APA
  • MLA
  • Vancouver
  • Turabian
  • Nature
  • IEEE
  • Harvard
  • Help
  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Date Asc
  • Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
  • Dissemination of Information in Optical Networks 

    BANDYOPADHYAY, Subir; KLASING, Ralf
    (Springer-Verlag, 2008)
    Ouvrage
  • Constructing Incremental Sequences in Graphs 

    KLASING, Ralf; LAFOREST, Christian; PETERS, Joseph G. ...
    (Algorithmic Operations Research. vol. 1, n° 2, pp. 1--7, 2006)
    Article de revue
  • On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality 

    BÖCKENHAUER, Hans-Joachim; BONGARTZ, Dirk; HROMKOVIC, Juraj ...
    Communication dans un congrès
  • On k-Connectivity Problems with Sharpened Triangle Inequality 

    BÖCKENHAUER, Hans-Joachim; BONGARTZ, Dirk; HROMKOVIC, Juraj ...
    (Journal of Discrete Algorithms. vol. 6, n° 4, pp. 605--617, 2008)
    Article de revue
  • On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality 

    BÖCKENHAUER, Hans-Joachim; BONGARTZ, Dirk; HROMKOVIC, Juraj ...
    (Theoretical Computer Science. vol. 326, n° 1--3, pp. 137--153, 2004-10)
    Article de revue
  • On k-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract) 

    BÖCKENHAUER, Hans-Joachim; BONGARTZ, Dirk; HROMKOVIC, Juraj ...
    Communication dans un congrès
  • Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem 

    BÖCKENHAUER, Hans-Joachim; HROMKOVIC, Juraj; KLASING, Ralf ...
    (Theoretical Computer Science. vol. 285, n° 1, pp. 3--24, 2002-08)
    Article de revue
  • Tightening the upper bound for the Minimum Energy Broadcasting 

    FLAMMINI, Michele; KLASING, Ralf; NAVARRA, Alfredo ...
    (Wireless Networks. vol. 14, n° 5, pp. 659--669, 2008)
    Article de revue
  • Improved approximation results for the Minimum Energy Broadcasting problem in Wireless Ad Hoc Networks 

    FLAMMINI, Michele; KLASING, Ralf; NAVARRA, Alfredo ...
    (Algorithmica. vol. 49, n° 4, pp. 318--336, 2007-12)
    Article de revue
  • Improved approximation results for the Minimum Energy Broadcasting Problem 

    FLAMMINI, Michele; KLASING, Ralf; NAVARRA, Alfredo ...
    Communication dans un congrès

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7

Browse

All of OskarCollectionsAuthorsTitlesInstitutionsSubjectsDateThis CollectionAuthorsTitlesInstitutionsSubjectsDate

My Account

Login

Discover

Has File(s)No (63)Author
KLASING, Ralf (63)
NAVARRA, Alfredo (16)KOSOWSKI, Adrian (14)PÉRENNES, Stéphane (10)RADZIK, Tomasz (9)... View MorePublication date2010 - 2014 (19)2002 - 2009 (44)Document typeCommunication dans un congrès (29)Article de revue (24)Ouvrage (3)Chapitre d'ouvrage (2)Document de travail - Pré-publication (2)... View MoreStructureLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 (63)InstitutionBordeaux INP (63)CNRS (63)Université de Bordeaux (63)HAL DomainInformatique [cs]/Autre [cs.OH] (37)Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] (16)Informatique [cs]/Algorithme et structure de données [cs.DS] (15)Informatique [cs]/Mathématique discrète [cs.DM] (6)Informatique [cs]/Réseaux et télécommunications [cs.NI] (2)... View More

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
  • about
  • general terms and conditions
  • legal terms
  • contact
 
The cookies we create do not store information for personal identification but store information about browsing. Show more…

Export search results

The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

A logged-in user can export up to 15000 items. If you're not logged in, you can export no more than 500 items.

To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.

Export citations

Export the current results of the search query as a citation list. Select one of the available citation styles, or add a new one using the "Citations format" option present in the "My account" section.

The list of citations that can be exported is limited to 50 items.

Export citations

Export the current item as a citation. Select one of the available citation styles, or add a new one using the "Citations format" option present in the "My account" section.

Export Citations