#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2010

2018

- This year (3)
- Last 5 years (23)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Steven Chaplick, Radoslav Fulek, Pavel Klavík
- Graph Drawing
- 2013

The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial… (More)

- Pavel Klavík, Jan Kratochvíl, +4 authors Tomás Vyskocil
- Algorithmica
- 2016

The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can be… (More)

- Pavel Klavík, Dusan Knop, Peter Zeman
- ArXiv
- 2016

The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs G and H, it asks whether they are the same up to a relabeling. In 1981, Lubiw… (More)

- Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela
- ICALP
- 2014

A graph G covers a graphH if there exists a locally bijective homomorphism from G to H. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a… (More)

Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0, 1] and are known to be exactly the complements of comparability graphs. As such they… (More)

- Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil
- TAMC
- 2011

- Pavel Klavík, Peter Zeman
- STACS
- 2015

Interval graphs are intersection graphs of closed intervals and circle graphs are intersection graphs of chords of a circle. We study automorphism groups of these graphs. We show that interval graphs… (More)

- Pavel Klavík, A. Cristiano I. Malossi, Constantine Bekas, Alessandro Curioni
- Philosophical transactions. Series A…
- 2014

Power awareness is fast becoming immensely important in computing, ranging from the traditional high-performance computing applications to the new generation of data centric workloads. In this work,… (More)

- Pavel Klavík, Peter Zeman
- ArXiv
- 2015

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension dim(X) of a… (More)

By Frucht’s Theorem, every abstract finite group is isomorphic to the automorphism group of some graph. In 1975, Babai characterized which of these abstract groups can be realized as the automorphism… (More)