ERD

Maximum Rectilinear Convex Subsets

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Spectra and eigenspaces of arbitrary lifts of graphs

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Graph Stories in Small Area

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Simultaneous Embeddings with Few Bends and Crossings

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Computing the k-resilience of a synchronized multi-robot system

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Upward Book Embeddings of st-Graphs

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Computing melodic templates in flamenco singing

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

The uncovering-resilience of a synchronized multi-robot system

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Morphing Contact Representations of Graphs

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Matching points with disks with a common intersection

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Optimal coverage of a tree with multiple robots

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

On the Triangle Vector

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Sufficient conditions for a digraph to admit a (1,≤ l)-identifying code

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

A new general family of mixed graphs

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Every Collinear Set in a Planar Graph Is Free

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

NP-Completeness of Max-Cut for Segment Intersection Graphs

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Resolving dominating partitions in graphs

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

A survey on the missing Moore graph

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Upward Planar Morphs

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Cellular morphogenesis of three-dimensional tensegrity structures

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Characterizing identifying codes from the spectrum of a graph or digraph

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regula...

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Drawing planar graphs with many collinear vertices

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Packing Plane Spanning Trees into a Point Set

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

An improved upper bound for the order of mixed graphs

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

General bounds on limited broadcast domination

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Graphs, friends and acquaintances

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Generation of planar tensegrity structures through cellular multiplication

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Locating domination in bipartite graphs and their complements

Project: CONNECT

Updated at: 28-04-2024

Show more information

Project acronym CONNECT

Resources

Selected filters:

Maximum Rectilinear Convex Subsets

Spectra and eigenspaces of arbitrary lifts of graphs

Graph Stories in Small Area

Simultaneous Embeddings with Few Bends and Crossings

Computing the k-resilience of a synchronized multi-robot system

Upward Book Embeddings of st-Graphs

Computing melodic templates in flamenco singing

The uncovering-resilience of a synchronized multi-robot system

Morphing Contact Representations of Graphs

Matching points with disks with a common intersection

Optimal coverage of a tree with multiple robots

On the Triangle Vector

Sufficient conditions for a digraph to admit a (1,≤ l)-identifying code

A new general family of mixed graphs

Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction

Every Collinear Set in a Planar Graph Is Free

NP-Completeness of Max-Cut for Segment Intersection Graphs

Resolving dominating partitions in graphs

A survey on the missing Moore graph

Upward Planar Morphs

Cellular morphogenesis of three-dimensional tensegrity structures

Characterizing identifying codes from the spectrum of a graph or digraph

The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regula...

Drawing planar graphs with many collinear vertices

Packing Plane Spanning Trees into a Point Set

An improved upper bound for the order of mixed graphs

General bounds on limited broadcast domination

Graphs, friends and acquaintances

Generation of planar tensegrity structures through cellular multiplication

Locating domination in bipartite graphs and their complements