◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Schulz

31 papers hereh-index 15688 citations75 works total

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

author position
  • sole author1
  • middle author12
  • last author16

Across the 29 of 31 papers where every author was matched, so the position is known.

fields
  • cs.CG21
  • math.CO8
  • cs.DM1
  • cs.DS1
same name
  • A. Schulz — 140 papers, h 65
  • A. Schulz — 14 papers, h 16
  • A. Schulz — 13 papers
  • A. Schulz — 5 papers, h 4
  • A. Schulz — 5 papers, h 6
  • A. Schulz — 5 papers, h 8

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092026
most citedBounds on the maximum multiplicity of some common geometric graphs

37 citations · 170 across the 24 of their papers we have counts for

collaborators
Showing 2015Show all

4 papers · 1 filter

cs.DS2015★ 15 cited

On Minimizing Crossings in Storyline Visualizations

Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk +2

In a storyline visualization, we visualize a collection of interacting characters (e.g., in a movie, play, etc.) by x-monotone curves that converge for each interaction, and dive…

cs.CG2015★ 3 cited

On Monotone Drawings of Trees

Philipp Kindermann, André Schulz, Joachim Spoerhase +1

A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a mon…

cs.CG2015★ 1 cited

Saturated simple and 2-simple topological graphs with few edges

Péter Hajnal, Alexander Igamberdiev, Günter Rote +1

A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally,…

cs.CG2015★ 6 cited

Contact Representations of Sparse Planar Graphs

Md. Jawaherul Alam, David Eppstein, Michael Kaufmann +4

We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is…

◍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.