VLDB 2026 Research / reviewers in the wild / expert

Nathan Kahl

dblp:91/3948 · DBLP profile ↗
← Back
10ranked-venue papers
5as first author
4since 2021 · last 2026
0009-0004-0121-4884ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 5 first-author · 3 since 2021Computer networks · 2 · 1 since 2021
YearPublicationVenuePosition
2026 On topological indices, graph compression, and threshold graphs
Nathan Kahl, Kristi Luttrell
 Discret. Appl. Math.1
2023 On maximum graphs in Tutte polynomial posets
Nathan Kahl, Kristi Luttrell
 Discret. Appl. Math.1
2022 Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
abstract
Abstract Dr. Charles L. Suffel (1941–2021) was an influential mathematics educator and scholar at Stevens Institute of Technology for more than half a century. The Managing Editor of Networks for 20 years, Suffel's reach extended far beyond the Stevens campus. He coauthored dozens of graph theory papers and mentored more than a dozen Ph.D. thesis students. In this article, we discuss his contributions to the field of network reliability theory and his legacy as a teacher and mentor.
Daniel Gross, Nathan Kahl, Kristi Luttrell, John T. Saccoman
 Networks2
2021 Graph vulnerability parameters, compression, and threshold graphs
Nathan Kahl
 Discret. Appl. Math.1
2019 Graph vulnerability parameters, compression, and quasi-threshold graphs
Nathan Kahl
 Discret. Appl. Math.1
2016 On constructing rational spanning tree edge densities
Nathan Kahl
 Discret. Appl. Math.1
2014 Toughness and binding number
Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
 Discret. Appl. Math.2
2009 Sufficient degree conditions for k-edge-connectedness of a graph
abstract
Abstract One of Frank Boesch's best known papers is ‘The strongest monotone degree condition for n‐connectedness of a graph’ (Boesch, J Combinatorial Theory Ser B 16 (1974), 162–165.). In this article, we give a simple sufficient degree condition for a graph to be k‐edge‐connected, and also give the strongest monotone condition for a graph to be 2‐edge‐connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009
Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel
 Networks3
2007 Tutte sets in graphs II: The complexity of finding maximum Tutte sets
Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec
 Discret. Appl. Math.3
2007 Generalizing D-graphs
Arthur H. Busch, Michael Ferrara, Nathan Kahl
 Discret. Appl. Math.3