Jirí Fiala 0001

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 Pavel Klavík

> Home > Persons > Jirí Fiala 0001

Publications

2018
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/ejc/FialaKKN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/FialaKKN18
Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
3-connected reduction for regular graph covers. Eur. J. Comb. 73: 170-210 (2018)
2016
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/FialaKKN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/FialaKKN16
Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers. CoRR abs/1609.03013 (2016)
2014
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/FialaKKN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/FialaKKN14
Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. ICALP (1) 2014: 489-501
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/FialaKKN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/FialaKKN14
Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. CoRR abs/1402.3774 (2014)

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.