319 citations
- D. Schaile8 profiles59 · h 87
- S. Malik3 profiles58 · h 96
- K. M. Chan2 profiles55
- B. Åsman8 profiles50 · h 98
- C. Bélanger-Champagne2 profiles50
- R. W. Moore50
- S. Strandberg3 profiles50 · h 88
- A. Quadt10 profiles49 · h 86
- A. Sopczak2 profiles49 · h 83
- G. Borissov3 profiles49 · h 100
- H. Fox4 profiles49 · h 51
- P. Lebrun9 profiles49 · h 54
- University of MichiganUS61 papers
- Centre National de la Recherche ScientifiqueFR60 papers
- Fermi National Accelerator LaboratoryUS60 papers
- Joint Institute for Nuclear ResearchRU59 papers
- McGill UniversityCA59 papers
- Michigan State UniversityUS59 papers
- Northwestern UniversityUS59 papers
- University of RochesterUS59 papers
- Laboratoire de Physique Nucléaire et de Hautes ÉnergiesFR58 papers
- Sorbonne UniversitéFR58 papers
- Sungkyunkwan UniversityKR57 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR56 papers
32 papers · 1 filter
The excluded minor structure theorem with planarly embedded wall
Bojan Mohar
A graph is nearly embedded in a surface if it consists of graph that is embedded in the surface, together with a bounded number of vortices having no large transactions. It i…
Existence and construction of randomization defining contrast subspaces for regular factorial designs
Pritam Ranjan, Derek R. Bingham, Angela M. Dean
Regular factorial designs with randomization restrictions are widely used in practice. This paper provides a unified approach to the construction of such designs using randomizatio…
Splitting fields and periods of Fibonacci sequences modulo primes
Sanjai Gupta, Parousia Rockstroh, Francis Edward Su
What is the period of the Fibonacci sequence modulo a prime? The purpose of our brief expository paper is to illustrate an accessible, motivated treatment of this classical topic u…
Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms
Arash Rafiey, Pavol Hell
Min-Max orderings correspond to conservative lattice polymorphisms. Digraphs with Min-Max orderings have polynomial time solvable minimum cost homomorphism problems. They can also…
An Augmented Lagrangian Approach for Sparse Principal Component Analysis
Zhaosong Lu, Yong Zhang
Principal component analysis (PCA) is a widely used technique for data analysis and dimension reduction with numerous applications in science and engineering. However, the standard…
Domination number of cubic graphs with large girth
Daniel Kral, Petr Skoda, Jan Volec
We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n/g)<3n/10+O(n/g).