Publications associées à Icosaèdre

Dimitri Nestor Alice Van De Ville, Elvira Pirondini, Cyprien Alban Félicien Rivier

The present relates to a method for generating a graph representing a virtually lesioned connectome of a patient after a stroke comprising:- providing structural data of the brain of the patient after the stroke;- segmenting said structural data to delinea ...

2024

Excitonic absorption and defect-related emission in three-dimensional MoS2 pyramids

Anna Fontcuberta i Morral, Luca Francaviglia, Marco Negri

MoS2 micro-pyramids have demonstrated interesting properties in the fields of photonics and non-linear optics. In this work, we show the excitonic absorption and cathodoluminescence (CL) emission of MoS2 micro-pyramids grown by chemical vapor deposition (C ...

ROYAL SOC CHEMISTRY2021

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Mikhail Kapralov, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakab Tardos

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

ASSOC COMPUTING MACHINERY2020

Thrackles: An improved upper bound

János Pach, Radoslav Fulek

A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, ex ...

ELSEVIER SCIENCE BV2019

On 2-Level Polytopes Arising In Combinatorial Settings

Yuri Faenza, Manuel Francesco Aprile, Alfonso Bolívar Cevallos Manzano

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arisi ...

SIAM PUBLICATIONS2018

Real-Time Distributed Algorithms for Nonconvex Optimal Power Flow

Colin Neil Jones, Yuejiang Liu, Georgios Stathopoulos, Jean-Hubert Hours

The optimal power flow (OPF) problem, a fundamental problem in power systems, is generally nonconvex and computationally challenging for networks with an increasing number of smart devices and real-time control requirements. In this paper, we first investi ...

2017

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

New Moduli For Banach Spaces

Grigory Ivanov

Modifying the moduli of supporting convexity and supporting smoothness, we introduce new moduli for Banach spaces which occur, for example, as lengths of catheti of right-angled triangles (defined via so-called quasiorthogonality). These triangles have two ...

Tusi Mathematical Research Group2017

On Simplices in Diameter Graphs in R-4

Andrei Kupavskii

A graph G is a diameter graph in R-d if its vertex set is a finite subset in R-d of diameter 1 and edges join pairs of vertices a unit distance apart. It is shown that if a diameter graph G in R-4 contains the complete subgraph K on five vertices, then any ...

Maik Nauka/Interperiodica/Springer2017

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Icosaèdre

Post stroke recovery prediction

Excitonic absorption and defect-related emission in three-dimensional MoS2 pyramids

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Thrackles: An improved upper bound

On some problems related to 2-level polytopes

On 2-Level Polytopes Arising In Combinatorial Settings

Real-Time Distributed Algorithms for Nonconvex Optimal Power Flow

Extension complexity of stable set polytopes of bipartite graphs

New Moduli For Banach Spaces

On Simplices in Diameter Graphs in R-4

Graph Chatbot

Chattez avec Graph Search

Post stroke recovery prediction

Excitonic absorption and defect-related emission in three-dimensional MoS2 pyramids

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

New Moduli For Banach Spaces

Extension complexity of stable set polytopes of bipartite graphs

On some problems related to 2-level polytopes

Thrackles: An improved upper bound

On 2-Level Polytopes Arising In Combinatorial Settings

On Simplices in Diameter Graphs in R-4

Real-Time Distributed Algorithms for Nonconvex Optimal Power Flow