 | 2008 |
| 15 |  | Armin Fügenschuh,
Henning Homfeld,
Andreas Huck,
Alexander Martin,
Zhi Yuan:
Scheduling Locomotives and Car Transfers in Freight Transport.
Transportation Science 42(4): 478-491 (2008) |
| 2006 |
| 14 |  | Armin Fügenschuh,
Henning Homfeld,
Andreas Huck,
Alexander Martin:
Locomotive and Wagon Scheduling in Freight Transport.
ATMOS 2006 |
| 2002 |
| 13 |  | Andreas Huck,
Eberhard Triesch:
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.
Combinatorica 22(3): 409-416 (2002) |
| 2001 |
| 12 |  | Andreas Huck:
On cycle-double covers of graphs of small oddness.
Discrete Mathematics 229(1-3): 125-165 (2001) |
| 2000 |
| 11 |  | Andreas Huck:
Reducible Configurations for the Cycle Double Cover Conjecture.
Discrete Applied Mathematics 99(1-3): 71-90 (2000) |
| 10 |  | Hajo Broersma,
Otto R. Koppius,
Hilde Tuinstra,
Andreas Huck,
Ton Kloks,
Dieter Kratsch,
Haiko Müller:
Degree-preserving trees.
Networks 35(1): 26-39 (2000) |
| 1999 |
| 9 |  | Andreas Huck:
Independent branchings in acyclic diagraphs.
Discrete Mathematics 199(1-3): 245-249 (1999) |
| 8 |  | Andreas Huck:
Independent Trees in Planar Graphs Independent trees.
Graphs and Combinatorics 15(1): 29-77 (1999) |
| 7 |  | Andreas Huck:
Independent Trees and Branchings in Planar Multigraphs.
Graphs and Combinatorics 15(2): 211-220 (1999) |
| 1998 |
| 6 |  | Hajo Broersma,
Andreas Huck,
Ton Kloks,
Otto R. Koppius,
Dieter Kratsch,
Haiko Müller,
Hilde Tuinstra:
Degree-Preserving Forests.
MFCS 1998: 713-721 |
| 1995 |
| 5 |  | Andreas Huck,
Martin Kochol:
Five Cycle Double Covers of Some Cubic Graphs.
J. Comb. Theory, Ser. B 64(1): 119-125 (1995) |
| 1994 |
| 4 |  | Andreas Huck:
Independent trees in graphs.
Graphs and Combinatorics 10(1): 29-45 (1994) |
| 1992 |
| 3 |  | Andreas Huck,
Haruko Okamura:
Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs.
Graphs and Combinatorics 8(3): 253-258 (1992) |
| 1991 |
| 2 |  | Andreas Huck:
Edge-disjoint cycles in n-edge-connected graphs.
Graph Structure Theory 1991: 279-294 |
| 1 |  | Andreas Huck:
A sufficient condition for graphs to be weaklyk-linked.
Graphs and Combinatorics 7(4): 323-351 (1991) |