Abstracts - Listed by Speaker
A
- B
- C
- D
- E
- F
- G
- H
- J
- K
- L
- M
- N
- O
- P
- R
- S
- T
- U
- V
- W
- X
- Y
- Z
- Abdi, Ahmad - Integer flows in binary matroids
- Abrams, Lowell - A Family of Nim-Like Arrays: The Locator Theorem
- Alekseyev, Max - Integral points on biquadratic curves and near-multiples of squares in Lucas sequences
- Alekseyev, Max - Genome rearrangements: when intuition fails
- Alekseyev, Max - Unlabeled Motzkin numbers
- Altay, Sirma Cagil - Broadcasting on Kn{\"o}del graphs and minimum average broadcast graphs
- Anjos, Miguel - Conic Optimization: Relaxing at the Cutting Edge
- Anstee, Richard - Forbidden Families of Configurations
- Aouchiche, Mustapha - Two Laplacians for the Distance Matrix of a Graph
- Armstrong, Drew - Maximal Chains of Parabolic Subgroups
- Bahmanian, Amin - 2-edge-connected fair detachments of $(\leq 3)$-graphs
- Bailey, Robert - Generalized packing designs with block size 5
- Bal, Deepak - Packing Tree Factors in Random and Pseudo-Random Graphs
- Barnetson, Kathleen - Searching for Class Uniformly Resolvable Partial Coverings
- Barrus, Michael - Realization polytopes for the degree sequence of a graph
- Beeler, Katy - Deterministic walks, fairness, and choice
- Behsaz, Bahar - Turing Universality of DNA Self-Assembly Models at Temperature 1
- Bhabak, Puspal - Broadcast Problem in k-paths Connected at Two Junctions
- Bohman, Tom - Self-correcting estimates for the triangle free process
- Boothby, Tom - Topological Metrics on Permutations
- Bosch, Robert - Opt Art
- Bouvel, Mathilde - Operators of equivalent sorting power and related Wilf-equivalences
- Braun, Michael - $q$-Analog of Packing Designs
- Brewster, Rick - Broadcast domination and its dual multipackings
- Broer, Abraham - Algorithms of making linebundles on cotangent bundles of complete homogeneous spaces more positive.
- Brown, Jason - Colourful problems in combinatorics
- Bruen, Aiden - Unimbeddable nets of small deficiency
- Bruen, Aiden - Dickson's theorem: applications and generalizations
- Bruner, Marie-Louise - Parking in trees
- Bryant, Darryn - Repacking in cycle decompositions.
- Bulatov, Andrei - Counting CSPs and Datalog fixed points
- Bultena, Bette - Minimum Area Polyomino Venn Diagrams
- Buratti, Marco - Cycle decompositions and their automorphism groups
- Burgess, Andrea - Orthogonally resolvable cycle decompositions
- Burrill, Sophie - Using generating trees to construct Skolem sequences
- Butler, Steve - Unrolling residues to avoid progressions
- Cameron, Kathie - Same-Degree Trees and Intermediate Trees
- Carmesin, Johannes - Canonical tree decomposition into highly connected pieces
- Carraher, James - Finding compatible circuits in eulerian digraphs.
- Celaya, Marcel - Morphic Words and Nested Recurrence Relations
- Chaplick, Steven - Max Point-Tolerance Graphs
- Churchley, Ross - Algorithms and obstructions for tree-transverse matchings
- Clarke, Nancy - Oriented Injective Colouring
- Clement, Julien - A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
- Coja-Oghlan, Amin - Chasing the k-SAT threshold
- Condon, Anne - Programming Molecules
- Corneil, Derek - Graph searches and cocomparability graphs
- Cox, Danielle - All Terminal Reliability and Optimality
- Crump, Iain - Forbidden minors and Feynman graphs
- Currie, James - Abelian powers and patterns in words: problems and perspectives
- Czygrinow, Andrzej - Loose cycles in 3-uniform hypergraphs
- Danziger, Peter - Bipartite 2-factorisations of complete multipartite graphs
- De Beule, Jan - Constructing Cameron-Liebler line classes with large parameter
- De Boeck, Maarten - The Erd\H{o}s-Ko-Rado problem for geometries
- de Mendez, Patrice Ossona - A first Intermediate class with limit object
- DeLaVina, Ermelinda - Graffiti.pc on Independence
- Deza, Antoine - Combinatorial, computational, and geometric approaches to the colourful simplicial depth
- Diestel, Reinhard - From pretty pictures to infinite matroids via graph homology: a surprising connection
- Dudek, Andrzej - On generalized Ramsey numbers of Erd\H{o}s and Rogers
- Duffy, Chris - Game Show Scheduling and Orderings of Elements of a Product
- Dukes, Peter - Designs of high dimension
- Dyer, Danny - Graceful Labellings of Triangular Cacti
- Edwards, Michelle - Independent Domination Bicritical Graphs
- Egri, Laszlo - List H-Coloring a Graph by Removing Few Vertices
- Ekim, Tınaz - Defective Cocolorings
- Elizalde, Sergi - Bijections for lattice paths between two boundaries
- Ellingham, Mark - Hamiltonicity of 3-connected planar graphs with a forbidden minor
- Enright, Jessica - On List Colouring and List Homomorphism of Permutation and Interval Graphs
- Epple, Dennis D.A. - Young diagrams for $(k,l)$-colourings
- Erey, Aysel - Chromatic Polynomials
- Erickson, Alejandro - Domino tatami cover is NP-complete
- Ernzerhof, Matthias - The zero-voltage conductance of nano-graphenes: Simple rules and
- Eschen, Elaine - Colored Graph Completion
- Evans, Patricia - Finding RNA structure motifs
- Falcón, Raúl - Concurrence designs based on partial Latin rectangles autotopisms
- Féray, Valentin - Multi-parameter hook formula for labelled trees
- Ferreri, Susanna - ACYCLIC 5-CHOOSABLILITY OF PLANAR GRAPH WITHOUT ADJACENT SHORT CYCLES
- Finbow, Art - On Well-Covered Planar Triangulations
- Finbow, Stephen - Equality in the Domination Chain in Planar Triangulisations
- Fitzpatrick, Shannon - Grundy Number and the Strong Product
- Foniok, Jan - Right adjoints of Pultr functors
- Fowler, Patrick W - Conjugated circuits, currents in benzenoids and equiaromaticity
- Francetic, Nevena - Relation between optimal group divisible packing and covering designs
- Franek, Frantisek - On the singularities of extremal periodic strings
- Funk, Daryl - Unique graph representations of bias matroids
- Galvin, David - Colouring regular bipartite graphs, cubes and grids
- Gao, Pu - Change of limiting distributions of the number of large matchings
- Gao, Zhihan - An LP-based 3/2-approximation algorithm for the graphic s-t path TSP
- Garaschuk, Kseniya - Fractional decompositions of dense graphs
- Gardy, Daniele - Some problems related to the enumeration of lambda-terms
- Gaskill, Patrick - The Independence Number Project: Difficult Graphs and Conjectures
- Giesbrecht, Mark - Decomposition of additive polynomials and matrix similarity classes
- Gittenberger, Bernhard - Associative and commutative tree representations for Boolean functions
- Goc, Daniel - Automatic Theorem-Proving in Automatic Sequences
- Goedgebeur, Jan - House of Graphs: a database of interesting graphs
- Goldwasser, John - Maximum density of exact copies of a subgraph of the d-cube in the n-cube
- Gopaladesikan, Mohan - Building Random Trees from Blocks
- Gosselin, Shonda - Algebraic hypergraph decompositions
- Gosselin, Shonda - Cyclic decompositions of complete and complete multipartite uniform hypergraphs
- Graver, Jack E - The Fries Structures of a fullerene
- Guenda, Kenza - The equivalency problem for cyclic combinatorial objects
- Guo, Krystal - Simple eigenvalues of vertex-transitive graphs and digraphs
- Haas, Ruth - The k-dominating graph
- Haghshenas, Sadegheh - Spectrum of Packing and Covering of the Complete Graph with Stars
- Hamoon, Mousavi Haji Seyyed - Repetition Avoidance in Circular Factors
- Harant, Jochen - Packing of isomorphic induced independent subgraphs
- Hariharan, Aneesh - n-Graceful Blocks
- Hartnell, Bert - Eternal Domination with Independent Guards
- Hartung, Elizabeth - The Clar Structures of a Fullerene
- Harutyunyan, Hovhannes - Diametral Broadcast Graphs
- Hatami, Hamed - The entropy of random-free graphons and properties
- Haxell, Penny - Extremal hypergraphs for packing and covering
- Haymaker, Kathryn - Write once memory codes from finite geometries
- He, Jing - A new class of almost perfect sequences and a new family of Zero Correlation Zone sequences
- Hell, Pavol - Matrix partitions
- Hendel, Russell - Ruskey's Open Problem on Hofstadter's $Q$ Function
- Herke, Sarada - Perfect 1-factorisations of circulant graphs of degree 4
- Horsley, Daniel - Decomposing complete bipartite graphs into short cycles and related results
- Horsley, Daniel - Embeddings of partial Steiner triple systems with few triples
- Hou, Xiang-dong - A Class of Permutation Binomials over Finite Fields
- Hutchinson, Joan - A variation on Heawood-list-coloring for graphs on surfaces
- Janse van Rensburg, E. J. - Some results on inhomogeneous percolation
- Jordon, Heather - Cycle Decompositions of Complete Graphs and Circulants
- Katz, Daniel - Weil Sums of Binomials with Three-Valued Spectra
- Khan, Imdadullah - Perfect matchings in uniform hypergraph with large vertex degree
- Kharaghani, Hadi - Biangular lines in $\mathbb{R}^n$
- Kinnersley, Bill - How long does it take to catch a robber?
- Kiwi, Marcos - Towards the distribution of the size of the largest non-crossing matchings in random bipartite graphs
- Klein, Douglas J - Substitution-reaction posets in chemistry
- Kothari, Nishad - Characterizing prism-free planar bricks.
- Krenn, Daniel - The Width of ``Canonical'' Trees and of Acyclic Digraphs
- Kriesell, Matthias - On the Structure of Graphs of Minimum Degree at least Four
- Krislock, Nathan - BiqCrunch: a semidefinite-based solver for binary quadratic problems
- Laekhanukit, Bundit - Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
- Larson, Craig - The Independence Number Project
- Larson, Craig E - Eigenvalues of Saturated Hydrocarbons
- Lee, Joon Yop - Eulerian and Stirling numbers over multisets
- Lehner, Florian - Automorphism breaking in locally finite graphs
- Lenz, John - Hypergraph Quasirandomness
- Li, Nana - Union Closed Conjecture
- Liers, Frauke - Geometry of Network Design with Certain and Uncertain Demands
- Lisonek, Petr - Construction X for quantum error-correcting codes
- Lisonek, Petr - Quantum codes from generalized quadrangles
- Loiselle, Mathieu - Design's Inspired by the Erdös-Ko-Rado Theorem
- Lubiw, Anna - Morphing Planar Graph Drawings
- MacGillivray, Gary - Locally injective homomorphisms
- Maenhaut, Barbara - Cycle decompositions of complete multigraphs
- Mamakani, Khalegh - Simple symmetric Venn diagrams with 11 and 13 curves
- Marcotte, Odile - On the maximum orders of an induced forest, an induced tree, and a stable set
- McCormick, Tom - A parametric min cut approximation algorithm for network inhibition
- McKee, Terry - Requiring Pairwise Nonadjacent Chords in Cycles
- Meagher, Karen - Minimum number of distinct eigenvalues of a graph
- Meagher, Karen - Covering arrays on graphs
- Melczer, Stephen - Enumerating Lattice Walks in the Quarter Plane
- Messinger, Margaret-Ellen - The Cop Number and Tree Decompositions
- Mishna, Marni - A combinatorial approach to lattice path asymptotics
- Mohammadi Nevisi, Mayssam - Counting Partitions of Graphs
- Mohar, Bojan - On median eigenvalues of graphs
- Mol, Lucas - On the uniformity dimension of hypergraphs
- Molloy, Mike - Clusters of solutions to random linear equations
- Morales, Alejandro - Counting matrices over finite fields with zeroes on Rothe diagrams
- Morris, Joy - Generalised $n$-gons with symmetry conditions
- Mulder, Henry Martyn - Location functions on graphs: why is anonymity an issue?
- Myrvold, Wendy - Models of Current Density Maps of Benzenoids
- Nebel, Markus - The Combinatorics of RNA in the Polymere Zeta Model
- Nesetril, Jaroslav - Tree-depth primer
- Noel, Jonathan - Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond
- Norin, Sergey - Forcing multidimensional graphons
- Oellermann, Ortrud - Domination and Digital Convexity Parameters
- Orellana, Rosa - The quasi-partition algebra
- Owczarek, Aleks - Exact solution of two friendly walks above a sticky wall with single and double interactions
- Ozkan, Sibel - On the Hamilton-Waterloo Problem with uniform cycle sizes
- Panholzer, Alois - Occurrences of exactly solvable PDEs in combinatorial problems
- Pelayo, Ignacio M - Nordhaus-Gaddum-type results for locating domination
- Pepper, Ryan - Recent Results on k-independence in graphs
- Pickup, Barry T - Effects of Pauli blockade on single-molecule conduction
- Pike, David - Cycle Extensions in PBD Block-Intersection Graphs
- Plummer, Michael D. - A Problem On Well-covered Graphs
- Postle, Luke - Linear Isoperimetric Bounds in Graph Coloring
- Praeger, Cheryl - Local transitivity properties of graphs and pairwise transitive designs
- Prodinger, Helmut - Generating functions in the analysis of $m$-versions of approximate counting, binary search trees and other structures
- Raaphorst, Sebastian - The Lovasz Local Lemma and Variable Strength Covering Arrays
- Radziszowski, Stanisław - New Computational Bounds for Ramsey Numbers $R(3,K_k-e)$
- Rahman, Mustazee - Nested Recursions, Simultaneous Parameters and Tree Superpositions
- Rall, Doug - On Maximal Independent Sets in Cartesian Products
- Rampersad, Narad - Extremal words in the shift orbit closure of a morphic sequence
- Reed, Bruce - Variants of the Erdos-Sos Conjecture
- Reiner, Victor - Catalan numbers, parking functions, and invariant theory
- Rhoades, Brendon - Extending the parking space
- Richter, David - Combinatorial gluings of outerplanar graphs
- Rottey, Sara - The automorphism group of linear representations
- Ruskey, Frank - An undecidable nested recurrence relation
- Saba, Sahand - Non-Trivial Decidable Nested Recurrence Relations
- Sagan, Bruce - A factorization theorem for $m$-rook placements
- Sajna, Mateja - On the directed Oberwolfach Problem with equal cycle length
- Sajna, Mateja - Eulerian-type properties of hypergraphs
- Sali, Attila - A note on binary Armstrong codes
- Samal, Robert - Hedetniemi conjecture for strict vector chromatic number
- Šámal, Robert - Cycle-continuous mappings -- order structure
- Sanaei, Asiyeh - Three-colourability of planar graphs without 5-cycles and triangular 3- and 6-cycles
- Sands, Bill - Covering with intervals in distributive lattices
- Sankoff, David - Fractionation, rearrangement, consolidation and reconstruction
- Santos, José Plínio - Further Applications of the two-line array for representing partitions
- Sato, Cristiane M. - On the robustness of random k-cores
- Savage, Carla - Generalized Inversion Sequences
- Sawada, Joe - An overview of Combinatorial Generation
- Schacht, Mathias - Sharp threshold vor van der Waerden's theorem
- Schaefer, Marcus - Toward a Theory of Planarity: An algorithm for simultaneous planarity?
- Schaeffer, Luke - Abelian powers in automatic sequences are not always automatic
- Schluchter, Steven - Ordinary voltage graphs, pseudosurfaces, and derived cellular homology.
- Sciriha, Irene - Molecular Graphs with Analogous Conducting Connections
- Seager, Suzanne - Locating a Robber on a Caterpillar
- Seamone, Ben - Some results on strong edge colourings
- Seamone, Ben - Bounding a graph's weight choosability number
- Sedgewick, Robert - "If You Can Specify It, You Can Analyze It" ---The Lasting Legacy of Philippe Flajolet
- Shalaby, Nabil - Skolem labelled graphs, old and new results
- Shallit, Jeff - Automata and nested recurrences
- Shallit, Jeffrey - Decidability in Automatic Sequences
- Shen, Xi Sisi - A "Hot Potato" transposition Gray code for permutations
- Shepherd, Bruce - Almost-tight Bounds for Online Vector Bin Packing
- Silvesan, Daniela - Cyclic, Simple and Indecomposable Three-Fold Triple Systems
- Simonyi, Gábor - Comparing the local chromatic number of a digraph and its underlying undirected graph
- Soteros, Chris - Combinatorics of the entanglement complexity of stretched polygons in a lattice tube
- Sritharan, R. - Hendry's conjecture holds for spider intersection graphs
- Stacho, Juraj - Stable-$\Pi$ partitions of graphs
- Staton, William - Independence Polynomials of k-Trees
- Stevens, Brett - Linear feedback shift registers and covering arrays
- Stinson, Douglas - Combinatorial Aspects of Key Distribution for Sensor Networks
- Stones, Doug - Enumeration and symmetries of partial Latin rectangles
- Sudakov, Benny - Induced Matchings, Arithmetic Progressions and Communication
- Szafron, Michael - Using self-avoiding polygons to study DNA-Enzyme Interactions
- Sziklai, Peter - The direction problem: old and new results
- Tang, Jijun - Binary Encoding and Genome Rearrangement Analysis
- Tankus, David - Weighted Well-Covered Graphs without Cycles of Lengths 4, 5, and 6
- Tanny, Steve - An Invitation to Nested Recurrence Relations
- Tehrani, Hediyeh Mashhadi Avaz - Edge-choosability of Planar Graphs
- Thomas, Hugh - A reflection group perspective on c-vectors
- Thomson, David - On a conjecture of Golomb and Moreno
- Tóth, Ágnes - The asymptotic value of the independence ratio for the direct graph power
- Tsuji, Katie - Finding Monotone Path Systems in Regions with Holes
- Ueckerdt, Torsten - Various Applications of L
- Uehara, Ryuhei - On generation of graphs with geometric representations
- Uehara, Ryuhei - The graph isomorphism problem on graphs with geometric representations
- Vallee, Brigitte - Typical depth of a digital search tree built on a general source
- van Bommel, Christopher Martin - An Extension of Parity Vertex Colourings
- Van Cleemput, Nico - Spherical Tilings by Congruent Quadrangles
- Verstraete, Jacques - Random Independent Sets in Hypergraphs
- Vieira, Manuel - Extracting information of unsatisfiable formulas using Semidefinite certificates of infeasibility
- Viola, Alfredo - Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields
- Vosoughpour, Hamideh - Cops and Robbers in a Polygon
- Wagon, Stan - Computational Hamiltonianism
- Wanless, Ian - Non-extendible latin cubes
- Ward, Mark Daniel - Recent Directions in Tries, Pattern Matching, Suffix Trees, and Subword Complexity
- Wassermann, Alfred - Construction of $q$-analogs of Steiner systems
- Wenger, Paul - Saturated Subgraphs of Multipartite Graphs
- Whittington, Stuart - Partially directed walks and polymer adsorption on striped surfaces
- Williams, Aaron - Iterative Gray Codes
- Wodlinger, Jane - Structural properties of Costas arrays
- Wolkowicz, Henry - Taking advantage of Degeneracy and Special Structure in Linear Cone Optimization
- Xiang, Qing - Constructions of difference sets and strongly regular graphs using cyclotomic classes
- Yeats, Karen - Using combinatorics to understand Dyson-Schwinger equations
- Yepremyan, Liana - Sparse halves in dense triangle-free graphs
- Zeng, Fanxuan - On the minimum distance of q-ary nonlinear codes
- Zhou, Yue - Planar functions over finite fields with characteristic two