Stefan S. Dantchev

◀ ▶ joint publications with Matthew Johnson 0002

> Home > Persons > Stefan S. Dantchev

Publications

2010
[j8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/BroersmaDJS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BroersmaDJS10
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 8(2): 101 (2010)
2009
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/BroersmaDJS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BroersmaDJS09
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 7(2): 147 (2009)
2008
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/BroersmaDJS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/BroersmaDJS08
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Preface. J. Discrete Algorithms 6(4): 539 (2008)
2006
[e1]
- view
  - table of contents in dblp
  - no references & citations available
- export record
  dblp key:
  - conf/acid/2006
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acid/2006
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Texts in Algorithmics 7, King's College, London 2006, ISBN 1-904987-38-9 [contents]

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.