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.
The formation of extended two-dimensional metal organic coordination networks (2D-MOCNs) showing high adaptability to surface step edges and structural defects is revealed by scanning tunneling microscopy. Rod-like 4,4'-di-(1,4-buta-1,3-diynyl)-benzoic aci ...
Micro/nano robots have the potential to revolutionize many aspects of medicine. These untethered, wirelessly controlled and powered devices will make existing therapeutic and diagnostic procedures less invasive and will enable new procedures never before p ...
This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle is a graph drawn in the plane such that every pair of edges meet exactly once: either at a common endpoint or in a proper crossi ...
Critical infrastructures are receiving a great deal of attention, due, on the one hand, to the major malfunctions to which they are subject and their potential as targets of malicious intent on the other. Economic and political impacts are studied; increas ...
In this paper we study the page number of upward planar directed acyclic graphs. We prove that: (I) the page number of any n-vertex upward planar triangulation G whose every maximal 4-connected component has page number k is at most min {O(k log n), O(2(k) ...
This chapter discusses the work carried out to establish the link between climate and atmospheric composition over the last million years, a period over which archives from different media offer precious information with a high degree of detail and accurac ...
The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...
We report on a new single-photon avalanche diode (SPAD) fabricated in a 130 nm CMOS imaging process. A novel circular structure combining shallow trench isolation (STI) and a passivation implant creates an effective guard ring against premature edge breakd ...
We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice. ...
Object of this work 1) Explore the feasibility of an LTCC microreactor • Chemical stability: compatible with HCl, NaOH, ... • Thermal stability to >100°C 2) Achieve a high degree of integration • Temperature measurement • Reactant flow measurement • Temper ...