default search action
David M. Howard 0002
Person information
- affiliation: Colgate University, Mathematics Department, Hamilton, NY, USA
- affiliation: Georgia Institute of Technology, School of Mathematics, Atlanta, GA, USA
Other persons with the same name
- David M. Howard 0001 — Royal Holloway University of London, UK (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j17]Dwight Duffus, David M. Howard, Imre Leader:
The width of downsets. Eur. J. Comb. 79: 46-59 (2019) - [j16]Ron Aharoni, Eli Berger, Maria Chudnovsky, David M. Howard, Paul D. Seymour:
Large rainbow matchings in general graphs. Eur. J. Comb. 79: 222-227 (2019) - [j15]David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Dimension of posets with planar cover graphs excluding two long incomparable chains. J. Comb. Theory A 164: 1-23 (2019) - 2017
- [j14]Ron Aharoni, David M. Howard:
A Rainbow r-Partite Version of the Erdős-Ko-Rado Theorem. Comb. Probab. Comput. 26(3): 321-337 (2017) - [j13]Ron Aharoni, David M. Howard:
Cross-intersecting pairs of hypergraphs. J. Comb. Theory A 148: 15-26 (2017) - 2016
- [i2]David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang:
The dimension of posets with planar cover graphs excluding two long incomparable chains. CoRR abs/1608.08843 (2016) - 2015
- [j12]Ron Aharoni, Ron Holzman, David M. Howard, Philipp Sprüssel:
Cooperative Colorings and Independent Systems of Representatives. Electron. J. Comb. 22(2): 2 (2015) - [j11]Ron Aharoni, Pierre Charbit, David M. Howard:
On a Generalization of the Ryser-Brualdi-Stein Conjecture. J. Graph Theory 78(2): 143-156 (2015) - 2014
- [j10]David M. Howard:
Determining membership with 2 simultaneous queries. Theor. Comput. Sci. 543: 112-119 (2014) - 2013
- [i1]Ron Aharoni, Pierre Charbit, David M. Howard:
On a Generalization of the Ryser-Brualdi-Stein Conjecture. CoRR abs/1305.6164 (2013) - 2012
- [j9]David M. Howard, Clifford D. Smyth:
Revolutionaries and Spies. Discret. Math. 312(22): 3384-3391 (2012) - 2011
- [j8]David M. Howard, Stephen J. Young:
When linear and weak discrepancy are equal. Discret. Math. 311(4): 252-257 (2011) - 2010
- [b1]David M. Howard:
A study of discrepancy results in partially ordered sets. Georgia Institute of Technology, Atlanta, GA, USA, 2010 - [j7]David M. Howard, Ann N. Trenk:
The t-discrepancy of a poset. Discret. Appl. Math. 158(16): 1789-1798 (2010) - [j6]David M. Howard, Randy Shull, Noah Streib, Ann N. Trenk:
The total linear discrepancy of an ordered set. Discret. Math. 310(5): 1022-1025 (2010) - [j5]David M. Howard, William T. Trotter:
On the size of maximal antichains and the number of pairwise disjoint maximal chains. Discret. Math. 310(21): 2890-2894 (2010) - [j4]Csaba Biró, David M. Howard, Mitchel T. Keller, William T. Trotter, Stephen J. Young:
Interval partitions and Stanley depth. J. Comb. Theory A 117(4): 475-482 (2010)
2000 – 2009
- 2009
- [j3]Csaba Biró, David M. Howard:
The First Three Levels of an Order Preserving Hamiltonian Path in the Subset Lattice. Order 26(2): 101-107 (2009) - 2008
- [j2]David M. Howard, Gab-Byung Chae, Minseok Cheong, Sang-Mok Kim:
Irreducible Width 2 Posets of Linear Discrepancy 3. Order 25(2): 105-119 (2008) - 2007
- [j1]David M. Howard, Mitchel T. Keller, Stephen J. Young:
A Characterization of Partially Ordered Sets with Linear Discrepancy Equal to 2. Order 24(3): 139-153 (2007)
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 2025-01-09 12:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint