The SCEAS System
Navigation Menu

Search the dblp DataBase


János Barát: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. János Barát, Péter Hajnal
    The Arc-Width of a Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  2. János Barát, Leo Storme
    Multiple Blocking Sets in PG(n, q), n>3. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:1, pp:5-21 [Journal]
  3. János Barát, Alberto Del Fra, Stefano Innamorati, Leo Storme
    Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:1, pp:15-26 [Journal]
  4. G. Ambrus, János Barát
    A contribution to queens graphs: A substitution method. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1105-1114 [Journal]
  5. János Barát
    Directed Path-width and Monotonicity in Digraph Searching. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:2, pp:161-172 [Journal]
  6. János Barát, Carsten Thomassen
    Claw-decompositions and tutte-orientations. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:135-146 [Journal]

  7. On square-free edge colorings of graphs. [Citation Graph (, )][DBLP]

  8. Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. [Citation Graph (, )][DBLP]

  9. What is on his mind? [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002