The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jirí Fiala: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
    Online and Offline Distance Constrained Labeling of Disk Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:464-475 [Conf]
  2. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
    Geometric Systems of Disjoint Representatives. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:110-117 [Conf]
  3. Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
    Distance Constrained Labelings of Graphs of Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:360-372 [Conf]
  4. Jirí Fiala, Daniël Paulusma
    The Computational Complexity of the Role Assignment Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:817-828 [Conf]
  5. Jirí Fiala, Jan Kratochvíl
    On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:228-236 [Conf]
  6. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
    Distance Constrained Labeling of Precolored Trees. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:285-292 [Conf]
  7. Jochen Alber, Jirí Fiala
    Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:26-37 [Conf]
  8. Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella
    Scheduling of Independent Dedicated Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:391-402 [Conf]
  9. Jirí Fiala, Jan Kratochvíl
    Complexity of Partial Covers of Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:537-549 [Conf]
  10. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
    Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:340-351 [Conf]
  11. Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
    Elegant Distance Constrained Labelings of Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:58-67 [Conf]
  12. Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
    Generalized H-Coloring and H-Covering of Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:198-210 [Conf]
  13. Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
    Graph Subcolorings: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:154-165 [Conf]
  14. Jirí Fiala, Jan Kratochvíl
    Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:15-26 [Conf]
  15. Jirí Fiala, Ton Kloks, Jan Kratochvíl
    Fixed-Parameter Complexity of lambda-Labelings. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:350-363 [Conf]
  16. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
    Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:115-126 [Conf]
  17. Thomas Erlebach, Jirí Fiala
    On-line coloring of geometric intersection graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:243-255 [Journal]
  18. Jirí Fiala, Ton Kloks, Jan Kratochvíl
    Fixed-parameter complexity of lambda-labelings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:1, pp:59-72 [Journal]
  19. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
    Systems of distant representatives. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:306-316 [Journal]
  20. Jirí Fiala, Riste Skrekovski
    Generalized list T-colorings of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:148, n:1, pp:13-25 [Journal]
  21. Jan Kratochvíl, Josep Díaz, Jirí Fiala
    Editorial. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:79-80 [Journal]
  22. Jirí Fiala
    Computational complexity of covering cyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:87-94 [Journal]
  23. Jirí Fiala, Jana Maxová
    Cantor-Bernstein type theorem for locally constrained graph homomorphisms. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1111-1116 [Journal]
  24. Jochen Alber, Jirí Fiala
    Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:2, pp:134-151 [Journal]
  25. Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
    Generalized H-coloring and H-covering of Trees. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:3, pp:206-223 [Journal]
  26. Jirí Fiala, Daniel Král, Riste Skrekovski
    A Brooks-Type Theorem for the Generalized List T-Coloring. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:588-609 [Journal]
  27. Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
    On distance constrained labeling of disk graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:261-292 [Journal]
  28. Jirí Fiala, Daniël Paulusma
    A complete complexity classification of the role assignment problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:67-81 [Journal]

  29. Comparing Universal Covers in Polynomial Time. [Citation Graph (, )][DBLP]


  30. Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). [Citation Graph (, )][DBLP]


  31. The k-in-a-path Problem for Claw-free Graphs. [Citation Graph (, )][DBLP]


  32. Distance Constrained Labelings of Trees. [Citation Graph (, )][DBLP]


  33. Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. [Citation Graph (, )][DBLP]


  34. Complexity of the Packing Coloring Problem for Trees. [Citation Graph (, )][DBLP]


  35. The k-in-a-path problem for claw-free graphs [Citation Graph (, )][DBLP]


  36. The packing chromatic number of the square lattice is at least 12 [Citation Graph (, )][DBLP]


  37. On the computational complexity of partial covers of Theta graphs. [Citation Graph (, )][DBLP]


  38. Complexity of the packing coloring problem for trees. [Citation Graph (, )][DBLP]


  39. Locally constrained graph homomorphisms and equitable partitions. [Citation Graph (, )][DBLP]


  40. Block transitivity and degree matrices. [Citation Graph (, )][DBLP]


  41. The packing chromatic number of infinite product graphs. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002