| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 53 |       | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma: Distance three labelings of trees. Discrete Applied Mathematics 160(6): 764-779 (2012) |
| 52 | | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. 412(23): 2513-2523 (2011) |
| 48 | | Jirí Fiala, Petr A. Golovach: Complexity of the packing coloring problem for trees. Discrete Applied Mathematics 158(7): 771-778 (2010) |
| 45 | | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230 |
| 41 | | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) 2008: 294-305 |
| 40 | | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Trees. TAMC 2008: 125-135 |
| 39 | | Jirí Fiala, Petr A. Golovach: Complexity of the Packing Coloring Problem for Trees. WG 2008: 134-145 |
| 30 | | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP 2005: 360-372 |
| 20 | | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl: Elegant Distance Constrained Labelings of Trees. WG 2004: 58-67 |
Selection of 9 from 54 records - Jirí Fiala has 33 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page