◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Bogdan-Ioan Popa

1 paper hereh-index 320 citations10 works total

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

author position
  • first author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.DC1

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

cs.DC2025

Parallel Algorithms for the One Sided Crossing Minimization Problem

Bogdan-Ioan Popa, Adrian-Marius Dumitran, Livia Magureanu

The One Sided Crossing Minimization (OSCM) problem is an optimization problem in graph drawing that aims to minimize the number of edge crossings in bipartite graph layouts. It has…

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