@phdthesis(2013_avanzini,
 author       = {M. Avanzini},
 year         = {2013},
 title        = {{Verifying Polytime Computability Automatically}},
 school       = {Universit{\"a}t Innsbruck, Austria},
)
@inproceedings(ADM:2015,
 author       = {M. Avanzini and U. Dal Lago and G. Moser},
 year         = {2015},
 title        = {Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order},
 booktitle    = {Proc.\ 20th ICFP},
 publisher    = {ACM},
 pages        = {152--164},
 doi          = {10.1145/2784731.2784753},
)
@article(AM:16,
 author       = {M. Avanzini and G. Moser},
 year         = {2016},
 title        = {A Combination Framework for Complexity},
 journal      = {IC},
 volume       = {248},
 pages        = {22--55},
 doi          = {10.1016/j.ic.2015.12.007},
)
@inproceedings(AM:2016,
 author       = {M. Avanzini and G. Moser},
 year         = {2016},
 title        = {Complexity of Acyclic Term Graph Rewriting},
 booktitle    = {Proc.\ 1st FSCD},
 series       = {LIPIcs},
 note         = {To appear},
)
@inproceedings(AMS:16,
 author       = {M. Avanzini and G. Moser and M. Schaper},
 year         = {2016},
 title        = {{TcT}: {T}yrolean Complexity Tool},
 booktitle    = {Proc.\ of\ 22nd TACAS},
 series       = {LNCS},
 pages        = {407--423},
 doi          = {10.1007/978-3-662-49674-9\_24},
)
@inproceedings(1987_barendregt_et_al,
 author       = {H. P. Barendregt and M. v. Eekelen and J. R. W. Glauert and J. R. Kennaway and M. J. Plasmeijer and M. R. Sleep},
 year         = {1987},
 title        = {{Term Graph Rewriting}},
 booktitle    = {PARLE (2)},
 series       = {LNCS},
 volume       = {259},
 pages        = {141--158},
 doi          = {10.1007/3-540-17945-3\_8},
)
@incollection(TeReSeC13,
 author       = {E. Barendsen},
 year         = {2003},
 title        = {{Term Graph Rewriting}},
 booktitle    = {{Term Rewriting Systems}},
 chapter      = {13},
 series       = {CTTCS},
 volume       = {55},
 publisher    = {Cambridge University Press},
 pages        = {712--743},
)
@inproceedings(2013_bonfante_et_al,
 author       = {G. Bonfante and B. Guillaume},
 year         = {2013},
 title        = {{Non-simplifying Graph Rewriting Termination}},
 booktitle    = {Proc. 7th TERMGRAPH},
 series       = {EPTCS},
 pages        = {4--16},
 doi          = {10.4204/EPTCS.110.3},
)
@inproceedings(BMOG12,
 author       = {M. Brockschmidt and R. Musiol and C. Otto and J. Giesl},
 year         = {2012},
 title        = {Automated Termination Proofs for Java Programs with Cyclic Data},
 booktitle    = {Proc.\ 24th CAV},
 series       = {LNCS},
 volume       = {7358},
 pages        = {105--122},
 doi          = {10.1007/978-3-642-31424-7\_13},
)
@inproceedings(2015_bruggink_et_al,
 author       = {H. J. S. Bruggink and B. K{\"o}nig and D. Nolte and H. Zantema},
 year         = {2015},
 title        = {Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings},
 booktitle    = {Proc. 8th ICGT},
 series       = {LNCS},
 volume       = {9151},
 pages        = {52--68},
 doi          = {10.1007/978-3-319-21145-9\_4},
)
@inproceedings(BKZ:14,
 author       = {H. J. S. Bruggink and B. K{\"{o}}nig and H. Zantema},
 year         = {2014},
 title        = {Termination Analysis for Graph Transformation Systems},
 booktitle    = {Proc.\ of 8th IFIP TC 1/WG 2.2},
 series       = {LNCS},
 volume       = {8705},
 pages        = {179--194},
 doi          = {10.1007/978-3-662-44602-7\_15},
)
@article(1982_dershowitz,
 author       = {N. Dershowitz},
 year         = {1982},
 title        = {Orderings for Term-Rewriting Systems},
 journal      = {TCS},
 volume       = {17},
 pages        = {279--301},
 doi          = {10.1016/0304-3975(82)90026-3},
)
@inproceedings(GBEFFOPSSST14,
 author       = {J. Giesl and M. Brockschmidt and F. Emmes and F. Frohn and C. Fuhs and C. Otto and M. Pl{\"{u}}cker and Schneider{-}Kamp, P. and T. Str{\"{o}}der and S. Swiderski and R. Thiemann},
 year         = {2014},
 title        = {Proving Termination of Programs Automatically with AProVE},
 booktitle    = {Proc.\ 7th IJCAR},
 series       = {LNCS},
 volume       = {8562},
 pages        = {184--191},
 doi          = {10.1007/978-3-319-08587-6\_13},
)
@article(GRSST:11,
 author       = {J. Giesl and M. Raffelsieper and Schneider-Kamp, P. and S. Swiderski and R. Thiemann},
 year         = {2011},
 title        = {{Automated Termination Proofs for {Haskell} by Term Rewriting}},
 journal      = {TOPLAS},
 volume       = {33},
 number       = {2},
 pages        = {7:1--7:39},
 doi          = {10.1145/1890028.1890030},
)
@article(1952_higman,
 author       = {G. Higman},
 year         = {1952},
 title        = {{Ordering by Divisibility in Abstract Algebras}},
 journal      = {Proc. London Mathematical Society},
 volume       = {3},
 number       = {2},
 pages        = {326--336},
 doi          = {10.1112/plms/s3-2.1.326},
)
@article(1960_kruskal,
 author       = {J. B. Kruskal},
 year         = {1960},
 title        = {{Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture}},
 journal      = {Trans. of the AMS},
 volume       = {95},
 number       = {2},
 pages        = {210--225},
 doi          = {10.2307/1993287},
)
@article(1997_middeldorp_et_al,
 author       = {A. Middeldorp and H. Zantema},
 year         = {1997},
 title        = {{Simple Termination of Rewrite Systems}},
 journal      = {TCS},
 volume       = {175},
 pages        = {127--158},
 doi          = {10.1016/S0304-3975(96)00172-7},
)
@article(1963_nash-williams,
 author       = {Nash-Williams, C. St. J. A.},
 year         = {1963},
 title        = {{On Well-Quasi-Ordering Finite Trees}},
 journal      = {Proc. Cambridge Philosophical Society},
 volume       = {59},
 pages        = {833--835},
 doi          = {10.1017/S0305004100003844},
)
@inproceedings(1997_plump,
 author       = {D. Plump},
 year         = {1997},
 title        = {{Simplification Orders for Term Graph Rewriting}},
 booktitle    = {MFCS},
 pages        = {458--467},
 doi          = {10.1007/BFb0029989},
)
@incollection(1998_plump,
 author       = {D. Plump},
 year         = {1999},
 title        = {Term Graph Rewriting},
 booktitle    = {Handbook of Graph Grammars and Computing by Graph Transformation},
 chapter      = {1},
 volume       = {2},
 publisher    = {World Scientific},
 pages        = {3--61},
 doi          = {10.1142/9789812815149\_0001},
)
@inproceedings(SGBFFHS14,
 author       = {T. Str{\"{o}}der and J. Giesl and M. Brockschmidt and F. Frohn and C. Fuhs and J. Hensel and Schneider{-}Kamp, P.},
 year         = {2014},
 title        = {Proving Termination and Memory Safety for Programs with Pointer Arithmetic},
 booktitle    = {Proc.\ 7th IJCAR},
 series       = {LNCS},
 volume       = {8562},
 pages        = {208--223},
 doi          = {10.1007/978-3-662-46681-0\_32},
)