◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Giuseppe Di Battista

7 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author5

Across the 6 of 7 papers where every author was matched, so the position is known.

fields
  • cs.CG4
  • cs.DS2
  • quant-ph1
ORCID 0000-0003-4224-1550

identity via Semantic Scholar / OpenAlex

activity
20132025
most citedStrip Planarity Testing of Embedded Planar Graphs

1 citations · 1 across the 7 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2024

Grandchildren-weight-balanced binary search trees

Vincent Jugé

We revisit weight-balanced trees, also known as trees of bounded balance. This class of binary search trees was invented by Nievergelt and Reingold in 1972. Such trees are obtained…

cs.DS2020

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +2

Given a bipartite graph G=(Vb​,Vr​,E), the 2-Level Quasi-Planarity problem asks for the existence of a drawing of G in the plane such that the vertices in Vb​ and in Vr​…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.