Andreas Huck

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Deutsche Bahn Schedules Train Rotations Using Hypergraph Optimization.
INFORMS J. Appl. Anal., 2021

Solving the Shipment Rerouting Problem with Quantum Optimization Techniques.
Proceedings of the Computational Logistics - 12th International Conference, 2021

2008
Scheduling Locomotives and Car Transfers in Freight Transport.
Transp. Sci., 2008

2006
Locomotive and Wagon Scheduling in Freight Transport.
Proceedings of the ATMOS 2006, 2006

2002
Forbidden subgraphs that imply hamiltonian-connectedness.
J. Graph Theory, 2002

Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.
Comb., 2002

2001
On cycle-double covers of graphs of small oddness.
Discret. Math., 2001

2000
Degree-preserving trees.
Networks, 2000

Reducible Configurations for the Cycle Double Cover Conjecture.
Discret. Appl. Math., 2000

1999
Independent Trees and Branchings in Planar Multigraphs.
Graphs Comb., 1999

Independent Trees in Planar Graphs Independent trees.
Graphs Comb., 1999

Independent branchings in acyclic diagraphs.
Discret. Math., 1999

1998
Degree-Preserving Forests.
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.
J. Graph Theory, 1995

Five Cycle Double Covers of Some Cubic Graphs.
J. Comb. Theory B, 1995

1994
Large <i>k</i>-preserving sets in infinite graphs.
J. Graph Theory, 1994

Independent trees in graphs.
Graphs Comb., 1994

1992
Edge-disjoint paths and cycles in <i>n</i>-edge-connected graphs.
J. Graph Theory, 1992

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

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

Edge-disjoint cycles in n-edge-connected graphs.
Proceedings of the Graph Structure Theory, 1991


  Loading...