775 citations
- Eindhoven University of TechnologyNL24 papers
- Centrum Wiskunde & InformaticaNL23 papers
- University of AmsterdamNL14 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- University College LondonGB9 papers
- Maastricht UniversityNL8 papers
- Delft University of TechnologyNL7 papers
- UCLouvainBE7 papers
- Universitat Politècnica de CatalunyaES7 papers
- University of AntwerpBE7 papers
- University of GroningenNL7 papers
- Georgia Institute of TechnologyUS6 papers
16 papers · 1 filter
On bounding the bandwidth of graphs with symmetry
Edwin R. van Dam, Renata Sotirov
We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum…
Spectral characterizations of almost complete graphs
Marc Cámara, Willem H. Haemers
We investigate when a complete graph with some edges deleted is determined by its adjacency spectrum. It is shown to be the case if the deleted edges form a matching, a compl…
Estimation of extreme risk regions under multivariate regular variation
Juan-Juan Cai, John H. J. Einmahl, Laurens de Haan
When considering d possibly dependent random variables, one is often interested in extreme risk regions, with very small probability p. We consider risk regions of the form ${\math…
One-Step R-Estimation in Linear Models with Stable Errors
Marc Hallin, Yvik Swan, Thomas Verdebout +1
Classical estimation techniques for linear models either are inconsistent, or perform rather poorly, under -stable error densities; most of them are not even rate-optimal. In th…
Book drawings of complete bipartite graphs
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
A "book" with k pages consists of a straight line (the "spine") and k half-planes (the "pages"), such that the boundary of each page is the spine. If a graph is drawn on a book wit…
Regular graphs with maximal energy per vertex
Edwin R. van Dam, Willem H. Haemers, Jack H. Koolen
We study the energy per vertex in regular graphs. For every k, we give an upper bound for the energy per vertex of a k-regular graph, and show that a graph attains the upper bound…