Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

George B. Mertzios

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 Daniël Paulusma

> Home > Persons > George B. Mertzios

Publications

2021
[c44]
- view
  authority control:
- export record
  dblp key:
  - conf/bcc/DabrowskiGG0MP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bcc/DabrowskiGG0MP21
Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Preface. BCC 2021: vii-viii
[e1]
- view
  - table of contents in dblp
  - no references & citations available
- export record
  dblp key:
  - conf/bcc/2021
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bcc/2021
Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. Cambridge University Press 2021, ISBN 978-1-009-01888-3 [contents]
2019
[j39]
- view
  - electronic edition @ eatcs.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eatcs/JohnsonMMP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/JohnsonMMP19
Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma:
Report on BCTCS & AlgoUK 2019. Bull. EATCS 128 (2019)

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.