The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zoltán Király: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. András A. Benczúr, Jörg Förster, Zoltán Király
    Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:498-509 [Conf]
  2. András Frank, Zoltán Király, Balázs Kotnyek
    An Algorithm for Node-Capacitated Ring Routing. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:249-258 [Conf]
  3. Vince Grolmusz, Zoltán Király
    Generalized Secure Routerless Routing. [Citation Graph (0, 0)][DBLP]
    ICN (2), 2005, pp:454-462 [Conf]
  4. András Frank, Zoltán Király
    Parity Constrained k-Edge-Connected Orientations. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:191-201 [Conf]
  5. András Frank, Zoltán Király
    Graph Orientations with Edge-connection and Parity Constraints. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:1, pp:47-70 [Journal]
  6. András Frank, Tamás Király, Zoltán Király
    On the orientation of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:385-400 [Journal]
  7. Mikio Kano, Gyula Y. Katona, Zoltán Király
    Packing paths of length at least two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:129-135 [Journal]
  8. Zoltán Király, Zoltán Szigeti
    Simultaneous well-balanced orientations of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:5, pp:684-692 [Journal]
  9. András Gyárfás, Zoltán Király, Jenö Lehel
    On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:385-411 [Journal]
  10. Barry Guiduli, Zoltán Király
    On intersecting hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:139-151 [Journal]
  11. András Gyárfás, Zoltán Király, Jenö Lehel
    On-line 3-chromatic graphs - II critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:177, n:1-3, pp:99-122 [Journal]

  12. Better and Simpler Approximation Algorithms for the Stable Marriage Problem. [Citation Graph (, )][DBLP]


  13. Local edge-connectivity augmentation in hypergraphs is NP-complete. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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