dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Andreas Huck Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArmin 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArmin Fügenschuh, Henning Homfeld, Andreas Huck, Alexander Martin: Locomotive and Wagon Scheduling in Freight Transport. ATMOS 2006
2002
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck, Eberhard Triesch: Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. Combinatorica 22(3): 409-416 (2002)
2001
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck: On cycle-double covers of graphs of small oddness. Discrete Mathematics 229(1-3): 125-165 (2001)
2000
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck: Reducible Configurations for the Cycle Double Cover Conjecture. Discrete Applied Mathematics 99(1-3): 71-90 (2000)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck: Independent branchings in acyclic diagraphs. Discrete Mathematics 199(1-3): 245-249 (1999)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck: Independent Trees in Planar Graphs Independent trees. Graphs and Combinatorics 15(1): 29-77 (1999)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck: Independent Trees and Branchings in Planar Multigraphs. Graphs and Combinatorics 15(2): 211-220 (1999)
1998
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721
1995
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck, Martin Kochol: Five Cycle Double Covers of Some Cubic Graphs. J. Comb. Theory, Ser. B 64(1): 119-125 (1995)
1994
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck: Independent trees in graphs. Graphs and Combinatorics 10(1): 29-45 (1994)
1992
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas 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
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck: Edge-disjoint cycles in n-edge-connected graphs. Graph Structure Theory 1991: 279-294
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Huck: A sufficient condition for graphs to be weaklyk-linked. Graphs and Combinatorics 7(4): 323-351 (1991)

Coauthor Index

1Hajo Broersma (H. J. Broersma) [6] [10]
2Armin Fügenschuh [14] [15]
3Henning Homfeld [14] [15]
4Ton Kloks (Antonius J. J. Kloks) [6] [10]
5Martin Kochol [5]
6Otto R. Koppius [6] [10]
7Dieter Kratsch [6] [10]
8Alexander Martin [14] [15]
9Haiko Müller [6] [10]
10Haruko Okamura [3]
11Eberhard Triesch [13]
12Hilde Tuinstra [6] [10]
13Zhi Yuan [15]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page