Related publications (20)

A Crossing Lemma for Multigraphs

János Pach

Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross and any pair of independent edges cross at most once. According to the celebrated Crossing Lemma of Ajtai, Chvatal, Newborn, Szemeredi and Leighton, the nu ...
SPRINGER2020

Local Well-Posedness And Blow-Up For The Half Ginzburg-Landau-Kuramoto Equation With Rough Coefficients And Potential

Luigi Forcella

We study the Cauchy problem for the half Ginzburg- Landau-Kuramoto (hGLK) equation with the second order elliptic operator having rough coecients and potential type perturbation. The blow-up of solutions for hGLK equation with non-positive nonlinearity is ...
2019

Bose-Einstein correlations in $pp, p\mathrm{Pb}$, and PbPb collisions at $\sqrt{{s}_{NN}}=0.9-7$ TeV

Multiplicity and rapidity dependence of strange hadron production in pp, pPb, and PbPb collisions at the LHC

Compilation Techniques for Incremental Collection Processing

Daniel Lupei

Many map-reduce frameworks as well as NoSQL systems rely on collection programming as their interface of choice due to its rich semantics along with an easily parallelizable set of primitives. Unfortunately, the potential of collection programming is not ...
EPFL2017

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.