default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Huck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j17]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:
Deutsche Bahn Schedules Train Rotations Using Hypergraph Optimization. INFORMS J. Appl. Anal. 51(1): 42-62 (2021)- 2008
- [j16]Armin Fügenschuh, Henning Homfeld, Andreas Huck, Alexander Martin, Zhi Yuan:
Scheduling Locomotives and Car Transfers in Freight Transport. Transp. Sci. 42(4): 478-491 (2008) - 2002
- [j15]Andreas Huck, Eberhard Triesch:
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. Comb. 22(3): 409-416 (2002) - [j14]Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman:
Forbidden subgraphs that imply hamiltonian-connectedness. J. Graph Theory 40(2): 104-119 (2002) - 2001
- [j13]Andreas Huck:
On cycle-double covers of graphs of small oddness. Discret. Math. 229(1-3): 125-165 (2001) - 2000
- [j12]Andreas Huck:
Reducible Configurations for the Cycle Double Cover Conjecture. Discret. Appl. Math. 99(1-3): 71-90 (2000) - [j11]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
- [j10]Andreas Huck:
Independent branchings in acyclic diagraphs. Discret. Math. 199(1-3): 245-249 (1999) - [j9]Andreas Huck:
Independent Trees in Planar Graphs Independent trees. Graphs Comb. 15(1): 29-77 (1999) - [j8]Andreas Huck:
Independent Trees and Branchings in Planar Multigraphs. Graphs Comb. 15(2): 211-220 (1999) - 1995
- [j7]Andreas Huck, Martin Kochol:
Five Cycle Double Covers of Some Cubic Graphs. J. Comb. Theory B 64(1): 119-125 (1995) - [j6]Andreas Huck:
Disproof of a conjecture about independent branchings in k-connected directed graphs. J. Graph Theory 20(2): 235-239 (1995) - 1994
- [j5]Andreas Huck:
Independent trees in graphs. Graphs Comb. 10(1): 29-45 (1994) - [j4]Andreas Huck, Frank Niedermeyer, Saharon Shelah:
Large k-preserving sets in infinite graphs. J. Graph Theory 18(4): 413-426 (1994) - 1992
- [j3]Andreas Huck, Haruko Okamura:
Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs. Graphs Comb. 8(3): 253-258 (1992) - [j2]Andreas Huck:
Edge-disjoint paths and cycles in n-edge-connected graphs. J. Graph Theory 16(6): 571-589 (1992) - 1991
- [j1]Andreas Huck:
A sufficient condition for graphs to be weaklyk-linked. Graphs Comb. 7(4): 323-351 (1991)
Conference and Workshop Papers
- 2021
- [c4]Sheir Yarkoni, Andreas Huck, Hanno Schülldorf, Benjamin Speitkamp, Marc Shakory Tabrizi, Martin Leib, Thomas Bäck, Florian Neukart:
Solving the Shipment Rerouting Problem with Quantum Optimization Techniques. ICCL 2021: 502-517 - 2006
- [c3]Armin Fügenschuh, Henning Homfeld, Andreas Huck, Alexander Martin:
Locomotive and Wagon Scheduling in Freight Transport. ATMOS 2006 - 1998
- [c2]Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra:
Degree-Preserving Forests. MFCS 1998: 713-721 - 1991
- [c1]Andreas Huck:
Edge-disjoint cycles in n-edge-connected graphs. Graph Structure Theory 1991: 279-293
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
