Ioan Todinca

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Christophe Crespelle

> Home > Persons > Ioan Todinca

Publications

2019
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/Crespelle0T19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Crespelle0T19
Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n2) time algorithm for the minimal permutation completion problem. Discret. Appl. Math. 254: 80-95 (2019)
2015
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/CrespellePT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/CrespellePT15
Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. WG 2015: 103-115
2013
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/CrespelleT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CrespelleT13
Christophe Crespelle, Ioan Todinca:
An O(n²)O(n2)-time algorithm for the minimal interval completion problem. Theor. Comput. Sci. 494: 75-85 (2013)
2010
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/tamc/CrespelleT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/CrespelleT10
Christophe Crespelle, Ioan Todinca:
An O(n²){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. TAMC 2010: 175-186

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.