We prove that every n-vertex planar graph G with no triangle sharing an
...
We present a novel generative method for the creation of city-scale road...
This paper proposes a method for automatic generation of textures for 3D...
We introduce Seamless Satellite-image Synthesis (SSS), a novel neural
ar...
A collection of graphs is nearly disjoint if every pair of them
intersec...
The world faces two interlinked crises: climate change and loss of
biodi...
This paper provides a survey of methods, results, and open problems on g...
Computer-aided design (CAD) is the most widely used modeling approach fo...
Effect handlers have been gathering momentum as a mechanism for modular
...
We propose a new generative model for layout generation. We generate lay...
OCaml is an industrial-strength, multi-paradigm programming language, wi...
In 1998, Reed conjectured that every graph G satisfies χ(G) ≤1/2(Δ(G) + ...
A graph G is k-critical if χ(G) = k and every proper
subgraph of G is (k...
We investigate fractional colorings of graphs in which the amount of col...
Our ability to understand data has always lagged behind our ability to
c...
Coarse building mass models are now routinely generated at scales rangin...
A graph is k-degenerate if every subgraph has minimum degree at most k.
...