Abstracts - Listed by Speaker

A  - B  - C  - D  - E  - F  - G  - H  - I  - J  - K  - L  - M  - N  - O  - P  - R  - S  - T  - U  - V  - W  - Y

• Abueida, Atif - The spectrum of non-polychromatic equitable edge colored Steiner Triple Systems
• Addario-Berry, Louigi - The second eigenvalue of random lifts
• Ahmady, Azhvan Sheikh - Eigenvalues of graphs with many vertices of large degree
• Akelbek, Mahmud - Various bounds on the scrambling index and the generalized scrambling index
• Alderson, Tim - Constructions of multiple wavelength codes ideal auto-correlation
• Anstee, Richard - Forbidden Configurations: Progress towards a Conjecture
• Archdeacon, Dan - The edge-ratio of geometric embeddings
• Arikatla, Satyanarayana Reddy - Relationships among some graph algebras on some graph classes
  
  
• Bailey, Robert - A matrix method for resolving sets in Johnson graphs
• Bailey, Robert - Generalized covering designs as hypergraph covers
• Bang-Jensen, Jorgen - Finding an induced subdivision of a digraph
• Bazdell, Gary - Evaluating Single Approach Constructions for Arbitrary Strength 2 Covering Arrays
• Beame, Paul - Making Branching Programs Oblivious Requires Superlogarithmic Overhead
• Bergeron, Anne - The combinatorial beauty of genome evolution
• Bergeron, Nantel - An Hopf Monoid of supercharacter
• Beveridge, Andrew - Directed Visibility Number for Planar Digraphs and Tournaments
• Bhattacharya, Binay - Application of computational geometry to network location problems
• Billey, Sara - An introduction to $k$-Schur functions and QSYM
• Blecher, Aubrey - Compositions of positive integers n viewed as alternating sequences of increasing/decreasing partitions.
• Borodin, Allan - When is it good to be greedy (in algorithm design)
• Borradaile, Glencora - Finding all min st-cuts in planar graphs
• Brewster, Richard - Lexicographic products with high reconstruction number
• Britz, Thomas - Duality theorems for graphs, codes, and matroids.
• Bruen, Aiden - Information sets and linear algebra
• Burger, Alewyn - An infinite family of Planar Hypohamiltonian Oriented Graphs
• Burgess, Andrea - Generalized packing designs and hypergraph packings
• Butler, Steve - Forming graphs which are cospectral for the normalized Laplacian
  
  
• Cáceres, José - Metric dimension in infinite but locally finite graphs
• Camacho, Stephan Matos - Stars in Minimum Rainbow Subgraphs
• Cameron, Kathie - Rainbow Matchings in Bipartite Graphs
• Campbell, Russell - Reflexive Injective Oriented Colouring
• Chaplick, Steven - The Vertex Leafage of Chordal Graphs
• Chauve, Cedric - Mapping ancestral genomes with massive gene loss: a matrix sandwich problem
• Chekuri, Chandra - Submodular set function maximization via the multilinear relaxation and dependent randomized rounding
• Cheng, Ching-Shui - Optimal Block Designs and Graphs
• Churchley, Ross - Partitioning graphs via edge-coloured homomorphisms
• Cioaba, Sebastian - Eigenvalues and the structure of graphs.
• Clarke, Nancy - Characterizations of $k$-copwin graphs
• Cockburn, Sally - Permutations and Geometric Realizations of $K_{2,n}$
• Cohen, Myra - GUI Interaction Testing: Using Covering Arrays to Provide Context in Software Testing
• Collins, Karen L. - Bounds on the distinguishing chromatic number of a graph
• Corbella, Irene Márquez - Matroid decomposition and minimal codewords II
• Costello, Kevin - On Randomizing Derandomized Greedy Algorithms
• Cox, Danielle - Roots of Graph Polynomials
• Craigen, Robert - Some Circulant Generalized Weighing matrices
• Czygrinow, Andrzej - Tiling in Bipartite Graphs
  
  
• Dean, Alice - Posets of Geometric Graphs
• Demasi, Lino - Domination in Plane Triangulations
• DeVos, M. - Edge Expansion
• Dinitz, Jeff - Constructions for Retransmission Permutation Arrays
• Dourado, Mitre - Complexity aspects of graph convexity
• Duffy, Christopher - The Firefighter Problem - Weights and Sets
• Dukes, Peter - Injection Codes
• Dyer, Danny - Fast searching graphs with few searchers
  
  
• Ellingham, Mark - Hamilton cycle embeddings of complete tripartite graphs
• Enright, Jessica - Set Representation Graph Games
• Epple, Dennis D.A. - Covering lexicographic products of graphs with independent sets and cliques
• Erickson, Alejandro - Enumerating Tatami Tilings
• Eschen, Elaine - On deciding whether the distinguishing chromatic number of a graph is at most two
  
  
• Faridi, Sara - Resolutions of monomial ideals
• Farr, Graham - Transforms, minors, binary functions and generalised Tutte polynomials
• Felsner, Stefan - Graphs and Rectangle Dissections
• Finbow, Stephen - Efficiency of Watchmen's Walks
• Fitzpatrick, Shannon - Copwin Edge Critical Graphs
• Foissy, Loic - Systems of Dyson-Schwinger equations
• Fowler, Patrick - Currents in molecules
• Fox, Jacob - Graph regularity and removal lemmas
• Fox, Jacob - Intersection Graphs, Drawings, Posets, and Separators
• Francetic, Nevena - Covering Arrays with Row Limit
• Francis, Mathew - Intersection dimensions of graphs
• Francis, Matthew - On Segment graphs
• Funk, Daryl - On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
  
  
• Garsia, Adriano - Combinatorial properties of Parking Functions and Diagonal Harmonics
• Garvin, Brady - Side Constraints and Covering Array Generation by Simulated Annealing
• Ghorpade, Sudhir - Coprime polynomial pairs, Hankel matrices, and splitting subspaces
• Gimbel, John - Defective chromatic and cochromatic numbers
• Godbole, Anant - Improving covering array bounds using alternative probability models
• Goddyn, Luis - Edge List Colouring of Planar Cubic Graphs
• Golovin, Dan - Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
• Gonçalves, Daniel - Planar Graphs as Contact or Intersection Graphs of Homothetic Triangles
• Gordon, Gary - Generalizations of matroid duality
• Gosselin, Shonda - Paley uniform hypergraphs
• Gosselin, Shonda - Regular or vertex-transitive q-complementary hypergraphs
• Grigoryan, Hayk - On graphs with diametral broadcast time
  
  
• Haas, Ruth - The Canonical Coloring Graph
• Hahn, Geňa - Cops-and-robbers revisited
• Hare, Donovan - A Note on the Hardness of Graph Diameter Augmentation Problems
• Hartnell, Bert - Decycling in the Cartesian Product
• Hartung, Elizabeth J. - Fullerene Parameters: A Colorful Approach
• Harutyunyan, Ararat - Gallai's Theorem for List Coloring of Digraphs
• Hedayaty, Amir - On the complexity of approximate counting of CSPs
• Hefetz, Dan - Fast embedding of spanning trees in biased Maker-Breaker games
• Herscovici, David - Optimal Pebbling in Hypercubes using Error-correcting codes
• Hicks, Angela - Parking Function Properties Suggested by the Haglund-Morse-Zabrocki Conjecture
• Hoffman, Dan - The Influence of Parameter Values in the Practical Application of Combinatorial Test Generation
• Huang, Jing - Chronological interval digraphs
• Hutchinson, Joan - List-coloring extension results for planar graphs, Part I
  
  
• Ilie, Lucian - Fast combinatorial computation of good seeds for genome alignment
  
  
• Johnson, Samuel and Steve Melczer - Asymptotic analysis of walks with small steps in the quarter plane.
• Jurrius, Relinde - Truncation formulas for invariant polynomials of matroids and geometric lattices.
  
  
• Kahn, Jeff - Thresholds and expectation thresholds
• Kaiser, Tomas - Covering a graph by forests and a matching
• Kang, Ross J. - Subset Glauber dynamics mixes rapidly on graphs of bounded tree-width.
• Kapron, Bruce - Co-induction and Computational Semantics for Public-key Encryption with Key Cycles
• Katz, Daniel - Cross-Correlations of $p$-ary Maximal-Length Sequences: the Few and the Rational
• Kayll, Mark - Uniquely $D$-colourable digraphs with large girth
• Keller, Mitchel T. - Linear Extension Diameter and Reversal Ratio
• Kennedy, William Sean - Finding a smallest odd hole in a claw-free graph using global structure
• Keranen, Melissa - GDDs with two groups and block size 6 with fixed block configuration
• Kharaghani, Hadi - The Gramian of mutually unbiased Hadamard matrices
• Kharaghani, Hadi - Mutually unbiased complex weighing matrices
• King, Andrew - Bounding the chromatic index: Exploiting and sidestepping structure
• King, Andrew D. - Proving the Lovász-Plummer Conjecture
• King, Valerie - Scalable Distributed Computing Using Averaging Samplers and Bit-fixing Random Sources
• Kirkpatrick, David - Polygonal paths of bounded curvature
• Kirkpatrick, David - Finding treasure in trees
• Kohl, Anja - Investigating the $b$-chromatic number of bipartite graphs by using the bicomplement
• Kostochka, A. - Packing hypergraphs with few edges
• Kratochvil, Jan - Intersection graphs of homothetic polygons
• Kurt, Oguz - The rule trees and the cubic root bound on the chromatic index
  
  
• Laferrière, David - Asymptotics of Decomposable Combinatorial Structures with Components of Alg-Log Type
• Lakhnech, Yassine - Computational Indistinguishability Logic
• Lam, Clement - A computer search for Projective Hjelmslev Planes of order 9
• Lamken, Esther - Existence results for Howell cubes
• Larson, Craig - Conjecturing with GrInvIn
• Lastrina, Michelle - List-coloring extension results for planar graphs, Part II
• Lidicky, Bernard - List coloring and crossings
• Lisonek, Petr - On the equivalence of quantum codes
• Loh, Po-Shen - Rainbow Hamilton cycles in random graphs
• Lozin, Vadim - Vertex 3-colorability of claw-free graphs
• Lubiw, Anna - Simultaneous Graph Representations
• Lunney, Scott - Broadcasts and Domination in Trees
• Luoto, Kurt - Quasisymmetric and noncommutative Schur functions
  
  
• Ma, Bin - Algorithms for Protein/Peptide Sequencing with Mass Spectrometry
• MacGillivray, Gary - A characterization of infinite cop-win graphs
• Maltais, Elizabeth - Covering arrays avoiding forbidden edges
• Mamakani, Khalegh - Generating All Simple Convexly-Drawable Polar-Symmetric 6-Venn Diagrams
• Manning, Joseph - Linear-Time Canonical Encoding of Plane Graphs
• Márquez, Alberto - Some question about metric dimension of some families of graphs
• McCormick, Tom - A Combinatorial Polynomial Algorithm for Weighted Abstract Cut
• McDonald, Jessica - Kempe equivalence of edge colourings in (sub)cubic graphs
• McGuinness, Sean - Degree constrained subgraphs in a graph
• McKee, Terry - Graphs that have clique (partial) 2-trees
• McMahon, Elizabeth - Derangements of the facets of the $n$-cube
• Medvedev, Paul - Paired de Bruijn Graphs: a Novel Approach for Incorporating Mate Pair Information into Genome Assemblers
• Mehrabian, Abbas - On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game
• Melczer, Steve and Samuel Johnson - Asymptotic analysis of walks with small steps in the quarter plane.
• Merouane, Hocine Boumediene - The dominator partition in hypercubes
• Mertzios, George - Geometric intersection models on the plane and the 3D-space
• Michel, Bode - Good edge labelings of graphs of average degree at most 3
• Mohar, Bojan - Spectrally degenerate graphs
• Mora, Mercè - Geodetic and hull numbers in strong product graphs
• Moro, Edgar Martínez - Matroid decomposition and minimal codewords
• Moura, Lucia - Covering arrays and generalizations
• Mubayi, D. - Lower bounds for the independence number of hypergraphs
• Mulder, Henry Martyn - Axiomatic characterization of location functions
• Müller, Tobias - The smallest grid needed to represent a geometric intersection graph
• Myrvold, Wendy - Independent Sets of Fullerenes
  
  
• Nadeau, Philippe - Combinatorics of Fully Packed Loop configurations
• Nasserasr, Shahla - Totally Positive Shapes and TP$_k$-completable Patterns
• Naves, Guyslain - Mader-Mengerian graphs (joint work with Vincent Jost, École Polytechnique, France).
• Nevries, Ragnar - Recognizing polar and monopolar graphs
• Nielsen, Morten - Helly theorems for convex sets in graphs
• Nikiforov, Vlado - The Ky Fan norms of graphs and matrices
• Nixon, Tony - Combinatorial Rigidity on Surfaces
• Nowakowski, Richard - Cops and Robber with different edges sets
  
  
• Oellermann, Ortrud R - Separation Properties for 3-Steiner and 3-Monophonic Convexity in Graphs
• Oppen, Johan - Connected sequences
  
  
• Panario, Daniel - Combinatorial Applications of Finite Fields
• Panholzer, Alois - Some new results for deriving hook-length formulas for trees
• Patterson, Murray - The Gapped Consecutive-Ones Property
• Pelayo, Ignacio M - Dominating location in graphs
• Pike, David - Hamilton cycles in restricted block-intersection graphs
• Pikhurko, O. - Turan function of even cycles
  
  
• Raaphorst, Sebastian - Variable Strength Covering Arrays
• Raggi, Miguel - Genetic Algorithms in Forbidden Configurations
• Randic, Milan - Graph Theoretical Models of Ring Currents in Conjugated Hydrocarbons
• Rao, Anup - Towards Coding for Maximum Errors in Interactive Communication
• Reed, Bruce - Bounding $\chi$ as a convex combination of $\omega$ and $\Delta +1$
• Reid, K. B. - Landau's Theorem Revisited Again
• Richter, David - How to draw a 4-edge-colored graph
• Rosa, Alex - Circulants as signatures of cyclic Steiner triple systems
• Ross, Elissa - Finite motions from periodic frameworks with additional symmetry
• Roy, Aidan - Generalized Hadamard matrices and quantum measurements
  
  
• Safavi-Naini, Rei - cryptographic keys from noisy channels
• Sajna, Mateja - Regular self-complementary uniform hypergraphs
• Salem, Khaled - A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs
• Šámal, Robert - Highly arc transitive digraphs
• Sanaei, Asiyeh - Constructions of 3-existentially closed graphs using graph operations
• Sankey, Alyssa - Type-II matrices associated with 2-graphs and weighted strongly regular graphs
• Santos, Jose Plinio - Bijections between lattice paths and plane partitions
• Sarvepalli, Pradeep - Quantum codes and symplectic matroids
• Sato, Cristiane M. - Asymptotic enumeration of sparse 2-connected graphs
• Scedrov, Andre - Bounded memory Dolev-Yao adversaries
• Schaefer, Marcus - Removing Monotone Crossings
• Scheide, Diego - Acyclic list edge-colourings of degenerate graphs
• Schiermeyer, Ingo - Graphs with rainbow connection number two
• Schmidt, Kai-Uwe - Sets of symmetric matrices over finite fields
• Schurch, Mark - On Graphs with Depression Three
• Sciriha, Irene - Interlacing and Omni-Conduction in Single Molecules
• Seager, Suzanne - Locating a Robber on a Graph
• Seamone, Ben - Variations of the 1,2,3-Conjecture
• Sehgal, Nidhi - $6$-cycle system of the cartesian product $K_x \times K_y$ covering $2$-paths in $K_{x,y}$
• Seneviratne, Padmapani - Codes from multipartite graphs and permutation decoding
• Seyffarth, Karen - The Dominating Graph
• Shepherd, Bruce - Maximum Edge Disjoint Paths
• Shiromoto, Keisuke - Codes over rings and matroids.
• Silverberg, Alice - Counting points on elliptic curves, from Gauss to the present
• Soteros, Chris - Entanglement Complexity for Polygons in a Lattice Tube
• Srinivasan, Venkatesh - Rewriting of Visibly Pushdown Languages for XML Data Integration
• Sritharan, R. - Largest induced matching: computation and min-max relations
• Stacho, Juraj - Unique perfect phylogeny is NP-hard
• Stacho, Ladislav - Problems on Geometric Graphs
• Stephen, Tamon - A short proof that 4-prismatoids have width at most 4.
• Stevens, Brett - Covering designs and Matroids
• Stevens, Brett - finite field constructions of an imperfect design
• Stinson, Doug - A Unified Approach to Combinatorial Key Predistribution Schemes for Sensor Networks
• Stufken, John - Some combinatorial structures useful in design of experiments
• Swarts, Jacobus - The $C_k$-extended Graft Construction
  
  
• Tang, Boxin - Optimal Fractions of Two-level Factorials under a Baseline Parametrization
• Tesar, Marek - Locally injective homomorphism to the simple Weight graphs
• Thomasse, Stephan - Applications of VC-dimension for Graphs and Hypergraphs
• Thomson, David - Sets of mutually orthogonal Latin hypercubes
  
  
• Ueckerdt, Torsten - Edge-Intersection Graphs of Grid Paths - the Bend Number
  
  
• Vadlamudi, China Venkaiah - Sequentially Perfect 1-Factorization and Cycle Structure of Patterned Factorization of $K_{2^{n}}$
• Van Cleemput, Nico - CaGe - A Chemical and Abstract Graph Environment
• van Rees, John - 3-Uniform Friendship Hypergraphs
• Verstraete, J. - Recent progress on bipartite Turan numbers
  
  
• Wang, Caoan - A note on Hamiltonian tetrahedralizations
• Wang, Qiang - Ambiguity and Deficiency of Permutations
• Whitesides, Sue - Approaches to Hard (and Potentially Deep and Wet) Problems in Computational Geometry
• Whitesides, Sue - On Upward Topological Book Embeddings of Upward Planar Digraphs
• Whittington, Stu - Directed walk models of polymers
• Williams, Aaron - New Constructions for Universal Cycles and de Bruijn Cycles
• Wojda, A. Pawel - Cyclic partitions of complete hypergraphs
• Wong, Weng Kee - Algorithms for Generating Minimax Optimal Experimental Designs
  
  
• Ye, Dong - Resonance in Fullerenes
• Ye, Jane - Minimizing the condition number to construct design points for polynomial regression models
• Yeats, Karen - Spanning forest polynomials and Feynman graph denominators
• Young, Kailyn - 2-dipath k-colourings
• Young, Michael - Disjoint Homometric Sets in Graphs
• Young, Stephen J. - Braess's Paradox in Sparse Random Graphs