The SCEAS System
Navigation Menu

Search the dblp DataBase


Andreas Huck: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Huck
    Edge-disjoint cycles in n-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:279-294 [Conf]
  2. Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
    Degree-Preserving Forests. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:713-721 [Conf]
  3. Andreas Huck, Eberhard Triesch
    Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:3, pp:409-416 [Journal]
  4. Andreas Huck
    Reducible Configurations for the Cycle Double Cover Conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:71-90 [Journal]
  5. Andreas Huck
    On cycle-double covers of graphs of small oddness. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:229, n:1-3, pp:125-165 [Journal]
  6. Andreas Huck, Martin Kochol
    Five Cycle Double Covers of Some Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:1, pp:119-125 [Journal]
  7. Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
    Degree-preserving trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:1, pp:26-39 [Journal]
  8. Andreas Huck
    Independent branchings in acyclic diagraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:245-249 [Journal]

  9. Locomotive and Wagon Scheduling in Freight Transport. [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