☰

Douglas Bauer - Publications

Affiliations: 
Mathematics Stevens Institute of Technology 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

40 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2017 Bauer D, Nevo A, Schmeichel EF. Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor Graphs and Combinatorics. 33: 1231-1248. DOI: 10.1007/S00373-017-1840-1  0.564
2016 Bauer D, Nevo A, Schmeichel E. Vertex Arboricity and Vertex Degrees Graphs and Combinatorics. 1-7. DOI: 10.1007/S00373-016-1697-8  0.615
2015 Bauer D, Nevo A, Schmeichel E, Woodall DR, Yatauro M. Best monotone degree conditions for binding number and cycle structure Discrete Applied Mathematics. 195: 8-17. DOI: 10.1016/J.Dam.2013.12.014  0.742
2015 Bauer D, Broersma HJ, van den Heuvel J, Kahl N, Nevo A, Schmeichel E, Woodall DR, Yatauro M. Best Monotone Degree Conditions for Graph Properties: A Survey Graphs and Combinatorics. 31: 1-22. DOI: 10.1007/S00373-014-1465-6  0.727
2014 Bauer D, Kahl N, Schmeichel E, Woodall DR, Yatauro M. Toughness and binding number Discrete Applied Mathematics. 165: 60-68. DOI: 10.1016/J.Dam.2012.08.007  0.72
2013 Bauer D, Broersma HJ, Heuvel Jvd, Kahl N, Schmeichel E. Toughness and Vertex Degrees Journal of Graph Theory. 72: 209-219. DOI: 10.1002/Jgt.21639  0.495
2013 Bauer D. Understanding descriptions of visual scenes using graph grammars Proceedings of the 27th Aaai Conference On Artificial Intelligence, Aaai 2013. 1656-1657.  0.32
2012 Bauer D, Broersma HJ, Heuvel Jvd, Kahl N, Schmeichel E. Degree Sequences and the Existence of k -Factors Graphs and Combinatorics. 28: 149-166. DOI: 10.1007/S00373-011-1044-Z  0.303
2012 Bauer D, Schmeichel E. Binding Number, Minimum Degree, and Cycle Structure in Graphs Journal of Graph Theory. 71: 219-228. DOI: 10.1002/Jgt.21633  0.605
2011 Bauer D, Yatauro M, Kahl N, Schmeichel E. Best monotone degree conditions for binding number Discrete Mathematics. 311: 2037-2043. DOI: 10.1016/J.Disc.2011.04.034  0.751
2007 Bauer D, Broersma HJ, Kahl N, Morgana A, Schmeichel E, Surowiec T. Tutte sets in graphs II: The complexity of finding maximum Tutte sets Discrete Applied Mathematics. 155: 1336-1343. DOI: 10.1016/J.Dam.2007.02.002  0.534
2007 Bauer D, Broersma HJ, Morgana A, Schmeichel E. Tutte sets in graphs I: Maximal tutte sets and D-graphs Journal of Graph Theory. 55: 343-358. DOI: 10.1002/Jgt.V55:4  0.551
2006 Bauer D, Broersma HJ, Schmeichel E. Toughness in graphs - A survey Graphs and Combinatorics. 22: 1-35. DOI: 10.1007/S00373-006-0649-0  0.45
2004 Bauer D, Niessen T, Schmeichel E. Toughness, minimum degree, and spanning cubic subgraphs Journal of Graph Theory. 45: 119-141. DOI: 10.1002/Jgt.V45:2  0.547
2002 Bauer D, Broersma H, Schmeichel EF. More progress on tough graphs - The Y2K report Electronic Notes in Discrete Mathematics. 11: 63-80. DOI: 10.1016/S1571-0653(04)00055-1  0.551
2002 Bauer D, Broersma HJ, Morgana A, Schmeichel E. Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion Discrete Applied Mathematics. 120: 13-23. DOI: 10.1016/S0166-218X(01)00276-1  0.528
2000 Bauer D, Katona GY, Kratsch D, Veldman HJ. Chrodality and 2-factors in tough graphs Discrete Applied Mathematics. 99: 323-329. DOI: 10.1016/S0166-218X(99)00142-0  0.555
2000 Bauer D, Broersma HJ, Veldman HJ. Not every 2-tough graph is Hamiltonian Discrete Applied Mathematics. 99: 317-321. DOI: 10.1016/S0166-218X(99)00141-9  0.489
2000 Bauer D, McGuire L, Trommel H, Veldman HJ. Long cycles in 3-cyclable graphs Discrete Mathematics. 218: 1-8. DOI: 10.1016/S0012-365X(99)00331-3  0.5
1997 Bauer D, Heuvel Jvd, Morgana A, Schmeichel E. The complexity of recognizing tough cubic graphs Discrete Applied Mathematics. 79: 35-44. DOI: 10.1016/S0166-218X(97)00030-9  0.505
1996 Bauer D, Schmeichel E, Veldman HJ. A note on dominating cycles in 2-connected graphs Discrete Mathematics. 155: 13-18. DOI: 10.1016/0012-365X(94)00364-O  0.532
1996 Bauer D, Heuvel Jvd, Schmeichel E. 2-factors in triangle-free graphs Journal of Graph Theory. 21: 405-412. DOI: 10.1002/(Sici)1097-0118(199604)21:4<405::Aid-Jgt6>3.0.Co;2-T  0.502
1995 Bauer D, Broersma HJ, Heuvel Jvd, Veldman HJ. Long cycles in graphs with prescribed toughness and minimum degree Discrete Mathematics. 141: 1-10. DOI: 10.1016/0012-365X(93)E0204-H  0.452
1995 Bauer D, Vandenheuvel J, Schmeichel E. Toughness and Triangle-Free Graphs Journal of Combinatorial Theory, Series B. 65: 208-221. DOI: 10.1006/Jctb.1995.1051  0.445
1994 Bauer D, Morgana A, Schmeichel E. On the complexity of recognizing tough graphs Discrete Mathematics. 124: 13-17. DOI: 10.1016/0012-365X(92)00047-U  0.486
1994 Bauer D, Broersma HJ, Heuvel Jvd, Veldman HJ. On Hamiltonian properties of 2-tough graphs Journal of Graph Theory. 18: 539-543. DOI: 10.1002/Jgt.3190180602  0.563
1994 Bauer D, Schmeichel E. Toughness, minimum degree, and the existence of 2-factors Journal of Graph Theory. 18: 241-256. DOI: 10.1002/Jgt.3190180304  0.448
1993 Bauer D, Schmeichel E. Toughness and the Cycle Structure of Graphs Annals of Discrete Mathematics. 55: 145-151. DOI: 10.1016/S0167-5060(08)70383-2  0.473
1991 Bauer D, Fan G, Veldman HJ. Hamiltonian properties of graphs with large neighborhood unions Discrete Mathematics. 96: 33-49. DOI: 10.1016/0012-365X(91)90468-H  0.471
1990 Bauer D, Hakimi SL, Schmeichel E. Recognizing tough graphs is NP-hard Discrete Applied Mathematics. 28: 191-195. DOI: 10.1016/0166-218X(90)90001-S  0.455
1990 Bauer D, Schmeichel E. Hamiltonian degree conditions which imply a graph is pancyclic Journal of Combinatorial Theory, Series B. 48: 111-116. DOI: 10.1016/0095-8956(90)90133-K  0.559
1990 Bauer D, Veldman HJ, Morgana A, Schmeichel EF. Long cycles in graphs with large degree sums Discrete Mathematics. 79: 69-70. DOI: 10.1016/0012-365X(90)90055-M  0.467
1990 Bauer D, Morgana A, Schmeichel EF. A simple proof of a theorem of Jung Discrete Mathematics. 79: 147-152. DOI: 10.1016/0012-365X(90)90029-H  0.489
1985 Bauer D, Boesch F, Suffel CL, Tindell R. Combinatorial optimization problems in the analysis and design of probabilistic networks Networks. 15: 257-271. DOI: 10.1002/Net.3230150210  0.458
1983 Bauer D. Regular Kn-free graphs Journal of Combinatorial Theory, Series B. 35: 193-200. DOI: 10.1016/0095-8956(83)90071-0  0.431
1983 Bauer D, Harary F, Nieminen J, Suffel CL. Domination alteration sets in graphs Discrete Mathematics. 47: 153-161. DOI: 10.1016/0012-365X(83)90085-7  0.468
1982 Bauer D, Tindell R. Graphs isomorphic to subgraphs of their line-graphs Discrete Mathematics. 41: 1-6. DOI: 10.1016/0012-365X(82)90075-9  0.571
1982 Bauer D, Tindell R. The connectivities of line and total graphs Journal of Graph Theory. 6: 197-203. DOI: 10.1002/Jgt.3190060214  0.525
1979 Bauer D. On regular line graphs Annals of the New York Academy of Sciences. 30-31. DOI: 10.1111/J.1749-6632.1979.Tb17765.X  0.481
1979 Bauer D, Tindell R. Graphs with prescribed connectivity and line graph connectivity Journal of Graph Theory. 3: 393-395. DOI: 10.1002/Jgt.3190030410  0.481
Show low-probability matches.