Andreas Huck

According to our database, Andreas Huck authored at least 21 papers between 1991 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Deutsche Bahn Schedules Train Rotations Using Hypergraph Optimization.

Ralf Borndörfer, Thomas Eßer, Patrick Frankenberger, Andreas Huck, Christoph Jobmann, Boris Krostitz, Karsten Kuchenbecker, Kai Mohrhagen, Philipp Nagl, Michael Peterson, Markus Reuther, Thilo Schang, Michael Schoch, Hanno Schülldorf, Peter Schütz, Tobias Therolf, Kerstin Waas, Steffen Weider

INFORMS J. Appl. Anal., 2021

Solving the Shipment Rerouting Problem with Quantum Optimization Techniques.

Sheir Yarkoni, Andreas Huck, Hanno Schülldorf, Benjamin Speitkamp, Marc Shakory Tabrizi, Martin Leib, Thomas Bäck, Florian Neukart

Proceedings of the Computational Logistics - 12th International Conference, 2021

2008

Scheduling Locomotives and Car Transfers in Freight Transport.

Armin Fügenschuh, Henning Homfeld, Andreas Huck, Alexander Martin, Zhi Yuan

Transp. Sci., 2008

2006

Locomotive and Wagon Scheduling in Freight Transport.

Armin Fügenschuh, Henning Homfeld, Andreas Huck, Alexander Martin

Proceedings of the ATMOS 2006, 2006

2002

Forbidden subgraphs that imply hamiltonian-connectedness.

Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman

J. Graph Theory, 2002

Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.

Andreas Huck, Eberhard Triesch

Comb., 2002

2001

On cycle-double covers of graphs of small oddness.

Andreas Huck

Discret. Math., 2001

2000

Degree-preserving trees.

Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller

Networks, 2000

Reducible Configurations for the Cycle Double Cover Conjecture.

Andreas Huck

Discret. Appl. Math., 2000

1999

Independent Trees and Branchings in Planar Multigraphs.

Andreas Huck

Graphs Comb., 1999

Independent Trees in Planar Graphs Independent trees.

Andreas Huck

Graphs Comb., 1999

Independent branchings in acyclic diagraphs.

Andreas Huck

Discret. Math., 1999

1998

Degree-Preserving Forests.

Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1995

Disproof of a conjecture about independent branchings in <i>k</i>-connected directed graphs.

Andreas Huck

J. Graph Theory, 1995

Five Cycle Double Covers of Some Cubic Graphs.

Andreas Huck, Martin Kochol

J. Comb. Theory B, 1995

1994

Large <i>k</i>-preserving sets in infinite graphs.

Andreas Huck, Frank Niedermeyer, Saharon Shelah

J. Graph Theory, 1994

Independent trees in graphs.

Andreas Huck

Graphs Comb., 1994

1992

Edge-disjoint paths and cycles in <i>n</i>-edge-connected graphs.

Andreas Huck

J. Graph Theory, 1992

Counterexamples to a conjecture of mader about cycles through specified vertices in<i>n</i>-edge-connected graphs.

Andreas Huck, Haruko Okamura

Graphs Comb., 1992

1991

A sufficient condition for graphs to be weakly<i>k</i>-linked.

Andreas Huck

Graphs Comb., 1991

Edge-disjoint cycles in n-edge-connected graphs.

Andreas Huck

Proceedings of the Graph Structure Theory, 1991