Stephen Hartke
#128,336
Most Influential Person Now
American composer and music pedagogue
Stephen Hartke's AcademicInfluence.com Rankings
Download Badge
Communications
Stephen Hartke's Degrees
- Doctorate Composition University of Southern California
- Masters Composition University of Southern California
- Bachelors Composition University of Southern California
Why Is Stephen Hartke Influential?
(Suggest an Edit or Addition)According to Wikipedia, Stephen Paul Hartke is an American composer. Hartke is best known as the composer of Meanwhile – Incidental Music to Imaginary Puppet Plays, winner of the Grammy Award for Best Contemporary Classical Composition in 2013.
Stephen Hartke's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Fire containment in grids of dimension three and higher (2004) (70)
- McKay ’ s Canonical Graph Labeling Algorithm (2008) (42)
- The hub number of a graph (2008) (40)
- Edge-disjoint rainbow spanning trees in complete graphs (2016) (36)
- Packing of graphic n‐tuples (2012) (35)
- New Results on Degree Sequences of Uniform Hypergraphs (2013) (33)
- The chromatic number of the square of subcubic planar graphs (2016) (24)
- Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps (2012) (22)
- Distinguishing Chromatic Number of Cartesian Products of Graphs (2010) (21)
- Attempting to Narrow the Integrality Gap for the Firefighter Problem on Trees (2004) (21)
- Further Results on Bar k-Visibility Graphs (2007) (18)
- On the First-Fit Chromatic Number of Graphs (2008) (17)
- Graph classes characterized both by forbidden subgraphs and degree sequences (2008) (17)
- Minimum Degree Growth of the Iterated Line Graph (1999) (16)
- On the hardness of recognizing triangular line graphs (2010) (15)
- On the Strong Chromatic Index of Sparse Graphs (2015) (15)
- CIRCULAR (5;2)-COLORING OF SPARSE GRAPHS (2008) (15)
- An Algorithm for Generating All Connected Subgraphs with k Vertices of a Graph (2013) (13)
- Uniquely Kr-Saturated Graphs (2012) (12)
- Graph Realizations Constrained by Skeleton Graphs (2015) (11)
- Random partitions and edge-disjoint Hamiltonian cycles (2013) (11)
- Extremal Graphs With a Given Number of Perfect Matchings (2013) (11)
- On the independence ratio of distance graphs (2014) (9)
- On a question of Sós about 3‐uniform friendship hypergraphs (2008) (9)
- GRAPH-THEORETIC MODELS OF SPREAD AND COMPETITION (2004) (9)
- Stable Matchings in the Couples Problem (2001) (8)
- A linear programming approach to the Manickam-Miklós-Singhi conjecture (2014) (8)
- Relating minimum degree and the existence of a k-factor (2010) (8)
- A Degree Sequence Variant of Graph Ramsey Numbers (2014) (7)
- List distinguishing parameters of trees (2011) (7)
- Automorphism Groups of a Graph and a Vertex-Deleted Subgraph (2009) (7)
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three (2017) (6)
- Extending precolorings to distinguish group actions (2014) (6)
- Binary De Bruijn cycles under different equivalence relations (2000) (6)
- A General Notion of Visibility Graphs (2003) (6)
- Graphic Sequences Have Realizations Containing Bisections of Large Degree (2012) (6)
- The structure and existence of 2-factors in iterated line graphs (2007) (6)
- A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture (2013) (6)
- The nonexistence of a (K6‐e)‐decomposition of the complete graph K29 (2009) (5)
- Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs (2013) (5)
- On the degree of local permutation polynomials (2004) (5)
- Non-minimal Degree-Sequence-Forcing Triples (2015) (4)
- K-ordered Hamiltonicity of Iterated Line Graphs (2009) (4)
- The Elimination Procedure for the Phylogeny Number (2005) (4)
- The Nonexistence of a ( K 6 − e )-Decomposition of the Complete Graph K 29 (2009) (3)
- A Survey of Free Math Fonts for TEX and L A TEX ∗ (2006) (3)
- The alpha problem & line count configurations (2013) (3)
- ( 5 , 2 )-Coloring of Sparse Graphs (2007) (3)
- Minimal forbidden sets for degree sequence characterizations (2013) (3)
- RAMSEY-TYPE NUMBERS FOR DEGREE SEQUENCES (2010) (3)
- A Distributed Search for Strongly Regular Graphs (2009) (2)
- The elimination procedure for the competition number is not optimal (2006) (2)
- Signatures of Strings (2013) (2)
- Reconstructing a Graph from its Arc Incidence Graph (2012) (2)
- Potential Bisections of Large Degree (2010) (1)
- Uniquely $K^{(k)}_r$-saturated Hypergraphs (2017) (1)
- Manickam-Mikl os-Singhi Conjecture (2013) (1)
- A Note on Divisibility of the Number of Matchings of a Family of Graphs (2009) (1)
- On coloring of fractional powers of graphs (2012) (1)
- On a Question of S ´ os About 3-Uniform (2008) (1)
- A Survey of Free Math Fonts for T E X and L A T E X (2006) (0)
- Non-minimal Degree-Sequence-Forcing Triples (2014) (0)
- Reconstructing a Graph from its Arc Incidence Graph (2011) (0)
- Relation between the correspondence chromatic number and the Alon–Tarsi number (2022) (0)
- Uniquely Kr(k)-Saturated Hypergraphs (2018) (0)
- Square of Planar Graphs of Max Degree Four without Five Cycles (2022) (0)
- Signatures of Strings (2012) (0)
- A Degree Sequence Variant of Graph Ramsey Numbers (2013) (0)
- Packing of Graphic Sequences (2009) (0)
- Navigating between packings of graphic sequences (2017) (0)
- 2 An Analogue of the Sauer-Spencer Theorem (2011) (0)
- Arev Sans for TEX and LTEX (2006) (0)
- The Voter Model with Confidence Levels by (2009) (0)
- A Classification of Hyperfocused 12-Arcs (2021) (0)
- A general notion of visiblity graphs (2002) (0)
This paper list is powered by the following services:
Other Resources About Stephen Hartke
What Schools Are Affiliated With Stephen Hartke?
Stephen Hartke is affiliated with the following schools:
