- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j5 |      | Petr Skoda: Computability of width of submodular partition functions. Eur. J. Comb. 34(3): 660-665 (2013) |
| 2012 | ||
| j4 | | Bojan Mohar, Petr Skoda: Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph. J. Graph Algorithms Appl. 16(2): 225-241 (2012) |
| j3 | | Daniel Král', Petr Skoda, Jan Volec: Domination number of cubic graphs with large girth. Journal of Graph Theory 69(2): 131-142 (2012) |
| c3 | | Petr Skoda, Svatopluk Sperka, Pavel Smrz: Extracting Information from Scientific Papers in the Cloud. CISIS 2012: 775-780 |
| 2011 | ||
| c2 | | Bojan Mohar, Petr Skoda: On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. IWOCA 2011: 300-309 |
| 2010 | ||
| j2 | | Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski: An improved linear bound on the number of perfect matchings in cubic graphs. Eur. J. Comb. 31(5): 1316-1334 (2010) |
| 2009 | ||
| c1 | | |
| 2008 | ||
| j1 | | Daniel Král, Petr Skoda: Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. SIAM J. Discrete Math. 22(4): 1559-1569 (2008) |
| 1 | Louis Esperet | |
| 2 | Daniel Král (Daniel Král') | |
| 3 | Bojan Mohar | |
| 4 | Riste Skrekovski | |
| 5 | Pavel Smrz | |
| 6 | Svatopluk Sperka | |
| 7 | Jan Volec |
Colors in the list of coauthors
Last update Mon May 20 15:20:24 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page