Titlebook: ;

群居動物

https://doi.org/10.1007/978-3-658-04031-4ure quality in terms of keeping adjacent regions close (cartogram quality) and using similar positions for a region between the different data values (stability). Our method guarantees ability to connect most lost adjacencies with minimal leaders. Experiments show our method yields good quality and stability.

Myofibrils

樸素

Sara Fürstenau,Mechtild Gomollaval graphs. Further, we extend earlier results about special bipartite graph classes to the notion of strict outerconfluency, show that SOC graphs have cop number two, and establish that tree-like (.-)SOC graphs have bounded cliquewidth.

使習(xí)慣于

modish

Computing Stable Demers Cartogramsure quality in terms of keeping adjacent regions close (cartogram quality) and using similar positions for a region between the different data values (stability). Our method guarantees ability to connect most lost adjacencies with minimal leaders. Experiments show our method yields good quality and stability.

拾落穗

outskirts

On Strict (Outer-)Confluent Graphsval graphs. Further, we extend earlier results about special bipartite graph classes to the notion of strict outerconfluency, show that SOC graphs have cop number two, and establish that tree-like (.-)SOC graphs have bounded cliquewidth.

破裂

Bundled Crossings Revisitedinimization: A graph is given and the goal is to find a bundled drawing with at most . bundled crossings. We show that the problem is NP-hard when we require a simple drawing. Our main result is an FPT algorithm (in .) when we require a simple circular layout. These results make use of the connection between bundled crossings and graph genus.