The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Petr Hlinený: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Petr Hlinený
    Crossing-Critical Graphs and Path-Width. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:102-114 [Conf]
  2. Petr Hlinený
    Contact Graphs of Curves. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:312-323 [Conf]
  3. Petr Hlinený
    Touching Graphs of Unit Balls. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:350-358 [Conf]
  4. Petr Hlinený, Gelasio Salazar
    On the Crossing Number of Almost Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:162-173 [Conf]
  5. Petr Hlinený, Detlef Seese
    On Decidability of MSO Theories of Representable Matroids. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:96-107 [Conf]
  6. Petr Hlinený
    On Matroid Properties Definable in the MSO Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:470-479 [Conf]
  7. Petr Hlinený
    Crossing Number Is Hard for Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:772-782 [Conf]
  8. Petr Hlinený
    On Matroid Representability and Minor Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:505-516 [Conf]
  9. Petr Hlinený
    Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:319-330 [Conf]
  10. Omer Giménez, Petr Hlinený, Marc Noy
    Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:59-68 [Conf]
  11. Petr Hlinený, Jan Kratochvíl
    Computational Complexity of the Krausz Dimension of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:214-228 [Conf]
  12. Petr Hlinený
    On the Excluded Minors for Matroids of Branch-Width Three. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  13. Petr Hlinený
    The Maximal Clique and Colourability of Curve Contact Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:59-68 [Journal]
  14. Petr Hlinený
    Equivalence-free exhaustive generation of matroid representations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:8, pp:1210-1222 [Journal]
  15. Petr Hlinený
    An Addition to Art Galleries with Interior Walls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:2, pp:311-334 [Journal]
  16. Petr Hlinený
    Contact graphs of line segments are NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:95-106 [Journal]
  17. Petr Hlinený, Jan Kratochvíl
    Representing graphs by disks and balls (a survey of recognition-complexity results). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:101-124 [Journal]
  18. Petr Hlinený, Geoff Whittle
    Matroid tree-width. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1117-1128 [Journal]
  19. Petr Hlinený
    Crossing-number critical graphs have bounded path-width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:347-367 [Journal]
  20. Petr Hlinený
    Classes and Recognition of Curve Contact Graphs, . [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:87-103 [Journal]
  21. Petr Hlinený
    Crossing number is hard for cubic graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:455-471 [Journal]
  22. Petr Hlinený
    Branch-width, parse trees, and monadic second-order logic for matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:325-351 [Journal]
  23. Petr Hlinený
    A Parametrized Algorithm for Matroid Branch-Width. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:259-277 [Journal]
  24. James F. Geelen, Petr Hlinený, Geoffrey P. Whittle
    Bridging Separations in Matroids. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:638-646 [Journal]
  25. Petr Hlinený, Detlef Seese
    Trees, grids, and MSO decidability: From graphs to matroids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:372-393 [Journal]
  26. Petr Hlinený, Robin Thomas
    On possible counterexamples to Negami's planar cover conjecture. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:183-206 [Journal]
  27. Petr Hlinený, Sang-il Oum
    Finding Branch-Decompositions and Rank-Decompositions. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:163-174 [Conf]

  28. Approximating the Crossing Number of Apex Graphs. [Citation Graph (, )][DBLP]


  29. Approximating the Crossing Number of Toroidal Graphs. [Citation Graph (, )][DBLP]


  30. On Digraph Width Measures in Parameterized Algorithmics. [Citation Graph (, )][DBLP]


  31. Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. [Citation Graph (, )][DBLP]


  32. New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. [Citation Graph (, )][DBLP]


  33. Better Polynomial Algorithms on Graphs of Bounded Rank-Width. [Citation Graph (, )][DBLP]


  34. Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). [Citation Graph (, )][DBLP]


  35. Width Parameters Beyond Tree-width and their Applications. [Citation Graph (, )][DBLP]


  36. Are there any good digraph width measures? [Citation Graph (, )][DBLP]


  37. Better algorithms for satisfiability problems for formulas of bounded rank-width [Citation Graph (, )][DBLP]


  38. Balanced Signings and the Chromatic Number of Oriented Matroids. [Citation Graph (, )][DBLP]


  39. The Tutte Polynomial for Matroids of Bounded Branch-Width. [Citation Graph (, )][DBLP]


  40. On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. [Citation Graph (, )][DBLP]


  41. Addendum to matroid tree-width. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002