Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Dimitrios M. Thilikos

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 Nicolas Nisse

> Home > Persons > Dimitrios M. Thilikos

Publications

2019
[j116]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/AngelopoulosNT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AngelopoulosNT19
Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on Theory and Applications of Graph Searching. Theor. Comput. Sci. 794: 1-2 (2019)
2016
[j92]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/FominFNT16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/FominFNT16
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. 655: 1 (2016)
2012
[j73]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/BarriereFFFNST12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BarriereFFFNST12
Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos:
Connected graph searching. Inf. Comput. 219: 1-16 (2012)

a service of

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.