default search action
Kevin G. Milans
Person information
- affiliation: West Virginia University, Morgantown, WV, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j24]John P. Bright, Kevin G. Milans, Jackson Porter:
Turán numbers of ordered tight hyperpaths. Eur. J. Comb. 124: 104070 (2025) - 2023
- [j23]James A. Long Jr., Kevin G. Milans, Andrea Munaro
:
Non-Empty Intersection of Longest Paths in $H$-Free Graphs. Electron. J. Comb. 30(1) (2023) - [i3]James A. Long Jr., Kevin G. Milans, Andrea Munaro:
Non-empty intersection of longest paths in H-free graphs. CoRR abs/2302.07110 (2023) - 2022
- [j22]Adam S. Jobson, André E. Kézdy
Systems of Overlap Representation for Families of Intervals. Graphs Comb. 38(2): 36 (2022) - 2021
- [j21]James A. Long Jr., Kevin G. Milans
Sublinear Longest Path Transversals. SIAM J. Discret. Math. 35(3): 1673-1677 (2021) - 2020
- [j20]Kevin G. Milans
Online Coloring a Token Graph. Graphs Comb. 36(1): 153-165 (2020) - [j19]Kevin G. Milans
A Dichotomy Theorem for First-Fit Chain Partitions. SIAM J. Discret. Math. 34(1): 586-596 (2020) - [i2]James A. Long Jr., Kevin G. Milans, Andrea Munaro:
Sublinear Longest Path Transversals and Gallai Families. CoRR abs/2005.02716 (2020)
2010 – 2019
- 2019
- [j18]Jordan Almeter, Samet Demircan, Andrew Kallmeyer, Kevin G. Milans
Graph 2-rankings. Graphs Comb. 35(1): 91-102 (2019) - 2016
- [j17]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak
Tree-width and dimension. Comb. 36(4): 431-450 (2016) - 2015
- [j16]Linyuan Lu
Set families with forbidden subposets. J. Comb. Theory A 136: 126-142 (2015) - [j15]J. Travis Johnston
Boolean algebras and Lubell functions. J. Comb. Theory A 136: 174-183 (2015) - 2014
- [j14]Paul Horn, Kevin G. Milans, Vojtech Rödl:
Degree Ramsey Numbers of Closed Blowups of Trees. Electron. J. Comb. 21(2): 2 (2014) - [j13]Jeong-Ok Choi, Kevin G. Milans, Douglas B. West:
Linear Discrepancy of Chain Products and Posets with Bounded Degree. Order 31(3): 291-305 (2014) - 2013
- [j12]Tao Jiang, Kevin G. Milans, Douglas B. West:
Degree Ramsey numbers for cycles and blowups of trees. Eur. J. Comb. 34(2): 414-423 (2013) - [i1]Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-Width and Dimension. CoRR abs/1301.5271 (2013) - 2012
- [j11]William B. Kinnersley, Kevin G. Milans, Douglas B. West:
Degree Ramsey Numbers of Graphs. Comb. Probab. Comput. 21(1-2): 229-253 (2012) - [j10]Kevin G. Milans, Florian Pfender
Cycle spectra of Hamiltonian graphs. J. Comb. Theory B 102(4): 869-874 (2012) - [j9]Daniel W. Cranston
Overlap number of graphs. J. Graph Theory 70(1): 10-28 (2012) - [j8]Michael Ferrara, Michael S. Jacobson, Kevin G. Milans, Craig Tennenhouse
Saturation numbers for families of graph subdivisions. J. Graph Theory 71(4): 416-434 (2012) - 2011
- [j7]Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans:
Binary subtrees with few labeled paths. Comb. 31(3): 285-303 (2011) - [j6]Jane Butterfield, Tracy Grauman, William B. Kinnersley, Kevin G. Milans, Christopher J. Stocker, Douglas B. West:
On-line Ramsey Theory for Bounded Degree Graphs. Electron. J. Comb. 18(1) (2011) - [j5]Kevin G. Milans, Daniel H. Schreiber, Douglas B. West:
Acyclic Sets in k-Majority Tournaments. Electron. J. Comb. 18(1) (2011) - [j4]Gwenaël Joret, Kevin G. Milans:
First-Fit is Linear on Posets Excluding Two Long Incomparable Chains. Order 28(3): 455-464 (2011)
2000 – 2009
- 2008
- [j3]David P. Bunde, Kevin G. Milans, Douglas B. West, Hehui Wu:
Optimal strong parity edge-coloring of complete graphs. Comb. 28(6): 625-632 (2008) - [j2]David P. Bunde, Erin W. Chambers
Pebbling and optimal pebbling in graphs. J. Graph Theory 57(3): 215-238 (2008) - 2006
- [j1]Kevin G. Milans, Bryan Clark:
The Complexity of Graph Pebbling. SIAM J. Discret. Math. 20(3): 769-798 (2006)
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-11-04 20:40 CET 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: