Publication

Graph Drawing

Related publications (33)

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.

Symmetries and optical transitions of hexagonal quantum dots in GaAs/AlGaAs nanowires

Marc-André Dupertuis

We investigate the properties of electronic states and optical transitions in hexagonal GaAs quantum dots within Al0.3Ga0.7As nanowires, grown in axial direction [111]. Such dots are particularly interesting due to their high degree of symmetry. A streamli ...

Amer Physical Soc2015

Saturated simple and k-simple topological graphs

János Pach, Jan Kyncl

A simple topological graph G is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. G is called saturated if no further edge can be added without violating this condition. ...

Elsevier Science Bv2015

Spin-resolved optical conductivity of two-dimensional group-VIB transition-metal dichalcogenides

Nicola Marzari, Marco Gibertini

We present an ab initio study of the spin-resolved optical conductivity of two-dimensional (2D) group-VIB transition-metal dichalcogenides (TMDs). We carry out fully relativistic density-functional-theory calculations combined with maximally localized Wann ...

Amer Physical Soc2014

Lagrangian Based Mathematical Modeling and Experimental Validation of a Planar Stabilized Platform for Mobile Systems

Mehmet Hasan Mutlu

Typical operating conditions for mobile sensor systems, and in particular mobile robots, exhibit a wide range of mechanical disturbances due their ego-motion. Sensor systems mounted on these mobile platforms often suffer to varying degrees from these distu ...

Elsevier2014

The Range of a Random Walk on a Comb

János Pach, Gábor Tardos

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of the neighbors of ...

Electronic Journal Of Combinatorics2013

Palladium-Catalyzed Decarboxylative Vinylation of Potassium Nitrophenyl Acetate: Application to the Total Synthesis of (±)-Goniomitine

Qian Wang, Jieping Zhu, Zhengren Xu

Merge and divert. (±)-goniomitine was synthesized featuring two key steps: a) fragment coupling to functionalized cyclopentene by a novel palladium-catalyzed decarboxylative vinylation reaction and b) an unprecedented one-pot integrated oxidation/reduction ...

Wiley-Blackwell2013

THE NUMBER OF EDGES IN k-QUASI-PLANAR GRAPHS

János Pach

A graph drawn in the plane is called k-quasi-planar if it does not contain k pair-wise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is O(n). The best k ...

Siam Publications2013

We study some variants of Conway’s thrackle conjecture. A tangle is a graph drawn in the plane such that its edges are represented by continuous arcs, and any two edges share precisely one point, which is either a common endpoint or an interior point at wh ...

Springer Berlin Heidelberg2013

Real-time management of berth allocation with stochastic arrival and handling times

Michel Bierlaire, Nitish Umang

In this research we study the berth allocation problem (BAP) in real time as disruptions occur. In practice, the actual arrival times and handling times of the vessels deviate from their expected or estimated values, which can disrupt the original berthing ...

2013

Tangled Thrackles

János Pach

A tangle is a graph drawn in the plane so that any pair of edges have precisely one point in common, and this point is either an endpoint or a point of tangency. If we allow a third option: the common point may be a proper crossing between the two edges, t ...

Springer Berlin Heidelberg2012